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/heapseparator/speedup-poc-dd-1-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1c58c86 [2019-05-15 10:28:10,037 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-05-15 10:28:10,039 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-05-15 10:28:10,051 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-05-15 10:28:10,051 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-05-15 10:28:10,052 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-05-15 10:28:10,054 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-05-15 10:28:10,055 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-05-15 10:28:10,057 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-05-15 10:28:10,058 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-05-15 10:28:10,059 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-05-15 10:28:10,059 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-05-15 10:28:10,060 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-05-15 10:28:10,061 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-05-15 10:28:10,062 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-05-15 10:28:10,063 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-05-15 10:28:10,064 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-05-15 10:28:10,066 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-05-15 10:28:10,068 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-05-15 10:28:10,070 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-05-15 10:28:10,071 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-05-15 10:28:10,072 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-05-15 10:28:10,075 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-05-15 10:28:10,075 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-05-15 10:28:10,075 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-05-15 10:28:10,076 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-05-15 10:28:10,077 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-05-15 10:28:10,078 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-05-15 10:28:10,078 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-05-15 10:28:10,079 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-05-15 10:28:10,080 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-05-15 10:28:10,081 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-05-15 10:28:10,082 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-05-15 10:28:10,082 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-05-15 10:28:10,083 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-05-15 10:28:10,083 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-05-15 10:28:10,083 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-05-15 10:28:10,084 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-05-15 10:28:10,085 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:28:10,115 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-05-15 10:28:10,130 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-05-15 10:28:10,136 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-05-15 10:28:10,138 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-05-15 10:28:10,139 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-05-15 10:28:10,140 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-1-unlimited.bpl [2019-05-15 10:28:10,140 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-1-unlimited.bpl' [2019-05-15 10:28:10,187 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-05-15 10:28:10,189 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-05-15 10:28:10,190 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-05-15 10:28:10,190 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-05-15 10:28:10,190 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-05-15 10:28:10,209 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-1-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:28:10" (1/1) ... [2019-05-15 10:28:10,224 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-1-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:28:10" (1/1) ... [2019-05-15 10:28:10,248 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-05-15 10:28:10,249 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-05-15 10:28:10,249 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-05-15 10:28:10,249 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-05-15 10:28:10,260 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-1-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:28:10" (1/1) ... [2019-05-15 10:28:10,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-1-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:28:10" (1/1) ... [2019-05-15 10:28:10,261 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-1-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:28:10" (1/1) ... [2019-05-15 10:28:10,262 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-1-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:28:10" (1/1) ... [2019-05-15 10:28:10,265 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-1-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:28:10" (1/1) ... [2019-05-15 10:28:10,270 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-1-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:28:10" (1/1) ... [2019-05-15 10:28:10,271 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-1-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:28:10" (1/1) ... [2019-05-15 10:28:10,272 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-05-15 10:28:10,273 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-05-15 10:28:10,273 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-05-15 10:28:10,273 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-05-15 10:28:10,274 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-1-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:28:10" (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:28:10,351 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-05-15 10:28:10,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-05-15 10:28:10,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-05-15 10:28:10,567 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-05-15 10:28:10,567 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-05-15 10:28:10,568 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-1-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:28:10 BoogieIcfgContainer [2019-05-15 10:28:10,569 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-05-15 10:28:10,570 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-05-15 10:28:10,571 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-05-15 10:28:10,574 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-05-15 10:28:10,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-1-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:28:10" (1/2) ... [2019-05-15 10:28:10,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dff94d0 and model type speedup-poc-dd-1-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.05 10:28:10, skipping insertion in model container [2019-05-15 10:28:10,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-1-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:28:10" (2/2) ... [2019-05-15 10:28:10,577 INFO L109 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-1-unlimited.bpl [2019-05-15 10:28:10,587 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-05-15 10:28:10,595 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-05-15 10:28:10,611 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-05-15 10:28:10,637 INFO L127 ementStrategyFactory]: Using default assertion order modulation [2019-05-15 10:28:10,638 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-05-15 10:28:10,638 INFO L378 AbstractCegarLoop]: Hoare is false [2019-05-15 10:28:10,638 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-05-15 10:28:10,638 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-05-15 10:28:10,639 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-05-15 10:28:10,639 INFO L382 AbstractCegarLoop]: Difference is false [2019-05-15 10:28:10,639 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-05-15 10:28:10,639 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-05-15 10:28:10,653 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-05-15 10:28:10,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-05-15 10:28:10,662 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:10,663 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-05-15 10:28:10,665 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:10,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:10,671 INFO L82 PathProgramCache]: Analyzing trace with hash 924552, now seen corresponding path program 1 times [2019-05-15 10:28:10,724 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:10,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:10,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2019-05-15 10:28:10,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:10,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:10,942 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:10,943 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:10,981 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:10,981 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:10,982 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:10,985 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:10,985 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_7|]. (= |#memory_int| (store |v_#memory_int_7| ULTIMATE.start_main_p1 0)) [2019-05-15 10:28:10,986 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:11,043 INFO L273 TraceCheckUtils]: 0: Hoare triple {10#true} havoc main_p1; {10#true} is VALID [2019-05-15 10:28:11,047 INFO L273 TraceCheckUtils]: 1: Hoare triple {10#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {10#true} is VALID [2019-05-15 10:28:11,054 INFO L273 TraceCheckUtils]: 2: Hoare triple {10#true} #memory_int := #memory_int[main_p1 := 0]; {21#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:11,056 INFO L273 TraceCheckUtils]: 3: Hoare triple {21#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {11#false} is VALID [2019-05-15 10:28:11,058 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:28:11,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-15 10:28:11,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-05-15 10:28:11,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-05-15 10:28:11,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:11,069 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-05-15 10:28:11,089 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:28:11,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-05-15 10:28:11,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-05-15 10:28:11,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-05-15 10:28:11,100 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-05-15 10:28:11,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:11,190 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-05-15 10:28:11,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-05-15 10:28:11,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-05-15 10:28:11,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:11,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-05-15 10:28:11,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2019-05-15 10:28:11,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-05-15 10:28:11,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2019-05-15 10:28:11,200 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 11 transitions. [2019-05-15 10:28:11,239 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:11,251 INFO L225 Difference]: With dead ends: 10 [2019-05-15 10:28:11,252 INFO L226 Difference]: Without dead ends: 6 [2019-05-15 10:28:11,255 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-05-15 10:28:11,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-05-15 10:28:11,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-05-15 10:28:11,286 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:11,287 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6 states. Second operand 6 states. [2019-05-15 10:28:11,287 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2019-05-15 10:28:11,288 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2019-05-15 10:28:11,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:11,289 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-05-15 10:28:11,291 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-05-15 10:28:11,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:11,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:11,291 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2019-05-15 10:28:11,292 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2019-05-15 10:28:11,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:11,295 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-05-15 10:28:11,295 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-05-15 10:28:11,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:11,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:11,296 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:11,296 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:11,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-05-15 10:28:11,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-05-15 10:28:11,301 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-05-15 10:28:11,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:11,301 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-05-15 10:28:11,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-05-15 10:28:11,303 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-05-15 10:28:11,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-05-15 10:28:11,304 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:11,304 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-05-15 10:28:11,304 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:11,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:11,306 INFO L82 PathProgramCache]: Analyzing trace with hash 28661058, now seen corresponding path program 1 times [2019-05-15 10:28:11,308 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:11,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:11,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 3 conjunts are in the unsatisfiable core [2019-05-15 10:28:11,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:11,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:11,412 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:11,412 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:11,448 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:11,448 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:11,449 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:11,451 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:11,451 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_8|]. (= |#memory_int| (store |v_#memory_int_8| ULTIMATE.start_main_p1 0)) [2019-05-15 10:28:11,452 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:11,575 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:11,581 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:11,589 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:11,589 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:11,590 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:11,596 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:11,597 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_9|]. (let ((.cse0 (select |v_#memory_int_9| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_9| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 0))) [2019-05-15 10:28:11,597 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:11,673 INFO L273 TraceCheckUtils]: 0: Hoare triple {52#true} havoc main_p1; {52#true} is VALID [2019-05-15 10:28:11,673 INFO L273 TraceCheckUtils]: 1: Hoare triple {52#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {52#true} is VALID [2019-05-15 10:28:11,682 INFO L273 TraceCheckUtils]: 2: Hoare triple {52#true} #memory_int := #memory_int[main_p1 := 0]; {63#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:11,696 INFO L273 TraceCheckUtils]: 3: Hoare triple {63#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {67#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:11,709 INFO L273 TraceCheckUtils]: 4: Hoare triple {67#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} assume !(#memory_int[main_p1] >= 0); {53#false} is VALID [2019-05-15 10:28:11,709 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:28:11,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:11,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-05-15 10:28:11,712 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-05-15 10:28:11,712 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:11,712 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-05-15 10:28:11,779 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:11,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-05-15 10:28:11,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-05-15 10:28:11,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-05-15 10:28:11,780 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 4 states. [2019-05-15 10:28:11,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:11,923 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-05-15 10:28:11,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-05-15 10:28:11,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-05-15 10:28:11,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:11,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-05-15 10:28:11,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2019-05-15 10:28:11,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-05-15 10:28:11,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2019-05-15 10:28:11,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 8 transitions. [2019-05-15 10:28:11,944 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:28:11,945 INFO L225 Difference]: With dead ends: 7 [2019-05-15 10:28:11,945 INFO L226 Difference]: Without dead ends: 7 [2019-05-15 10:28:11,946 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:28:11,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-05-15 10:28:11,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-05-15 10:28:11,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:11,948 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second operand 7 states. [2019-05-15 10:28:11,948 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-05-15 10:28:11,948 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-05-15 10:28:11,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:11,949 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-05-15 10:28:11,950 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-05-15 10:28:11,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:11,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:11,950 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-05-15 10:28:11,950 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-05-15 10:28:11,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:11,952 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-05-15 10:28:11,952 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-05-15 10:28:11,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:11,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:11,952 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:11,953 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:11,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-05-15 10:28:11,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-05-15 10:28:11,954 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-05-15 10:28:11,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:11,954 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-05-15 10:28:11,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-05-15 10:28:11,954 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-05-15 10:28:11,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-05-15 10:28:11,955 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:11,955 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-05-15 10:28:11,955 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:11,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:11,956 INFO L82 PathProgramCache]: Analyzing trace with hash 888492744, now seen corresponding path program 2 times [2019-05-15 10:28:11,957 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:11,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:11,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-05-15 10:28:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:11,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:11,993 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:11,994 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:11,999 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:11,999 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,000 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:12,003 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:12,003 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_10|]. (= (store |v_#memory_int_10| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:28:12,003 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:12,049 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:12,050 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:12,079 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:12,080 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,080 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:12,094 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:12,094 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_11|]. (let ((.cse0 (select |v_#memory_int_11| ULTIMATE.start_main_p1))) (and (= .cse0 0) (= |#memory_int| (store |v_#memory_int_11| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:12,094 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:12,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 16 treesize of output 11 [2019-05-15 10:28:12,186 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:12,188 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:12,188 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,188 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:12,194 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:12,194 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_12|]. (let ((.cse0 (select |v_#memory_int_12| ULTIMATE.start_main_p1))) (and (= .cse0 1) (= (store |v_#memory_int_12| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:12,195 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:12,219 INFO L273 TraceCheckUtils]: 0: Hoare triple {98#true} havoc main_p1; {98#true} is VALID [2019-05-15 10:28:12,220 INFO L273 TraceCheckUtils]: 1: Hoare triple {98#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {98#true} is VALID [2019-05-15 10:28:12,223 INFO L273 TraceCheckUtils]: 2: Hoare triple {98#true} #memory_int := #memory_int[main_p1 := 0]; {109#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:12,224 INFO L273 TraceCheckUtils]: 3: Hoare triple {109#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {113#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:12,226 INFO L273 TraceCheckUtils]: 4: Hoare triple {113#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {117#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:12,226 INFO L273 TraceCheckUtils]: 5: Hoare triple {117#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} assume !(#memory_int[main_p1] >= 0); {99#false} is VALID [2019-05-15 10:28:12,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:12,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:12,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-05-15 10:28:12,228 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-05-15 10:28:12,228 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:12,229 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2019-05-15 10:28:12,251 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:28:12,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-05-15 10:28:12,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-05-15 10:28:12,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-05-15 10:28:12,252 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 5 states. [2019-05-15 10:28:12,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:12,361 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-05-15 10:28:12,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-05-15 10:28:12,361 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-05-15 10:28:12,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:12,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-05-15 10:28:12,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 9 transitions. [2019-05-15 10:28:12,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-05-15 10:28:12,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 9 transitions. [2019-05-15 10:28:12,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 9 transitions. [2019-05-15 10:28:12,447 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:12,448 INFO L225 Difference]: With dead ends: 8 [2019-05-15 10:28:12,448 INFO L226 Difference]: Without dead ends: 8 [2019-05-15 10:28:12,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-05-15 10:28:12,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-05-15 10:28:12,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-05-15 10:28:12,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:12,451 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand 8 states. [2019-05-15 10:28:12,451 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2019-05-15 10:28:12,451 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2019-05-15 10:28:12,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:12,452 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-05-15 10:28:12,452 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-05-15 10:28:12,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:12,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:12,453 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2019-05-15 10:28:12,453 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2019-05-15 10:28:12,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:12,454 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-05-15 10:28:12,454 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-05-15 10:28:12,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:12,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:12,455 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:12,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:12,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-05-15 10:28:12,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-05-15 10:28:12,456 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-05-15 10:28:12,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:12,457 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-05-15 10:28:12,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-05-15 10:28:12,457 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-05-15 10:28:12,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-05-15 10:28:12,457 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:12,457 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1] [2019-05-15 10:28:12,458 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:12,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:12,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1773471234, now seen corresponding path program 3 times [2019-05-15 10:28:12,459 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:12,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:12,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2019-05-15 10:28:12,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:12,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:12,495 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,495 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:12,499 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:12,499 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,499 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:12,501 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:12,501 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_13|]. (= (store |v_#memory_int_13| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:28:12,501 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:12,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 16 treesize of output 11 [2019-05-15 10:28:12,545 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:12,549 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:12,549 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,549 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:12,556 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:12,556 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_14|]. (let ((.cse0 (select |v_#memory_int_14| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_14| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 0 .cse0))) [2019-05-15 10:28:12,556 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:12,705 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:12,722 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:12,765 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:12,766 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,766 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:12,783 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:12,784 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_15|]. (let ((.cse0 (select |v_#memory_int_15| ULTIMATE.start_main_p1))) (and (= 1 .cse0) (= |#memory_int| (store |v_#memory_int_15| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:12,784 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:12,930 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:12,947 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:12,962 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:12,962 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,963 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:12,969 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:12,969 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_16|]. (let ((.cse0 (select |v_#memory_int_16| ULTIMATE.start_main_p1))) (and (= 2 .cse0) (= |#memory_int| (store |v_#memory_int_16| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:12,970 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:28:12,987 INFO L273 TraceCheckUtils]: 0: Hoare triple {152#true} havoc main_p1; {152#true} is VALID [2019-05-15 10:28:12,988 INFO L273 TraceCheckUtils]: 1: Hoare triple {152#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {152#true} is VALID [2019-05-15 10:28:12,988 INFO L273 TraceCheckUtils]: 2: Hoare triple {152#true} #memory_int := #memory_int[main_p1 := 0]; {163#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:12,989 INFO L273 TraceCheckUtils]: 3: Hoare triple {163#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {167#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:12,990 INFO L273 TraceCheckUtils]: 4: Hoare triple {167#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {171#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:12,991 INFO L273 TraceCheckUtils]: 5: Hoare triple {171#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {175#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:28:12,991 INFO L273 TraceCheckUtils]: 6: Hoare triple {175#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} assume !(#memory_int[main_p1] >= 0); {153#false} is VALID [2019-05-15 10:28:12,992 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:12,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:12,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-05-15 10:28:12,993 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-05-15 10:28:12,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:12,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-05-15 10:28:13,007 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:13,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-05-15 10:28:13,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-05-15 10:28:13,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-05-15 10:28:13,008 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 6 states. [2019-05-15 10:28:13,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:13,138 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-05-15 10:28:13,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-05-15 10:28:13,139 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-05-15 10:28:13,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:13,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-05-15 10:28:13,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2019-05-15 10:28:13,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-05-15 10:28:13,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2019-05-15 10:28:13,143 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 10 transitions. [2019-05-15 10:28:13,155 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:13,156 INFO L225 Difference]: With dead ends: 9 [2019-05-15 10:28:13,156 INFO L226 Difference]: Without dead ends: 9 [2019-05-15 10:28:13,157 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-05-15 10:28:13,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-05-15 10:28:13,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-05-15 10:28:13,159 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:13,159 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand 9 states. [2019-05-15 10:28:13,159 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2019-05-15 10:28:13,159 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2019-05-15 10:28:13,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:13,160 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-05-15 10:28:13,160 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-05-15 10:28:13,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:13,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:13,161 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2019-05-15 10:28:13,161 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2019-05-15 10:28:13,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:13,162 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-05-15 10:28:13,162 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-05-15 10:28:13,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:13,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:13,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:13,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:13,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-05-15 10:28:13,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-05-15 10:28:13,164 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-05-15 10:28:13,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:13,165 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-05-15 10:28:13,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-05-15 10:28:13,165 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-05-15 10:28:13,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-05-15 10:28:13,166 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:13,166 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1] [2019-05-15 10:28:13,166 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:13,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:13,166 INFO L82 PathProgramCache]: Analyzing trace with hash -856966648, now seen corresponding path program 4 times [2019-05-15 10:28:13,167 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:13,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:13,180 WARN L254 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 6 conjunts are in the unsatisfiable core [2019-05-15 10:28:13,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:13,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:13,206 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:13,206 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,211 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:13,211 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,211 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:13,213 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:13,213 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_17|]. (= (store |v_#memory_int_17| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:28:13,213 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:13,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 16 treesize of output 11 [2019-05-15 10:28:13,274 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,277 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:13,278 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,278 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:13,286 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:13,286 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_18|]. (let ((.cse0 (select |v_#memory_int_18| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_18| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 0))) [2019-05-15 10:28:13,286 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:13,309 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:13,310 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,315 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:13,315 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,316 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:13,322 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:13,322 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_19|]. (let ((.cse0 (select |v_#memory_int_19| ULTIMATE.start_main_p1))) (and (= .cse0 1) (= (store |v_#memory_int_19| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:13,323 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:13,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:13,365 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,369 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:13,369 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,369 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:13,376 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:13,377 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_20|]. (let ((.cse0 (select |v_#memory_int_20| ULTIMATE.start_main_p1))) (and (= 2 .cse0) (= (store |v_#memory_int_20| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:13,377 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:28:13,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 16 treesize of output 11 [2019-05-15 10:28:13,433 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,437 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:13,437 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,438 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:13,445 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:13,445 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_21|]. (let ((.cse0 (select |v_#memory_int_21| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_21| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 3))) [2019-05-15 10:28:13,445 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:28:13,454 INFO L273 TraceCheckUtils]: 0: Hoare triple {214#true} havoc main_p1; {214#true} is VALID [2019-05-15 10:28:13,454 INFO L273 TraceCheckUtils]: 1: Hoare triple {214#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {214#true} is VALID [2019-05-15 10:28:13,455 INFO L273 TraceCheckUtils]: 2: Hoare triple {214#true} #memory_int := #memory_int[main_p1 := 0]; {225#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:13,456 INFO L273 TraceCheckUtils]: 3: Hoare triple {225#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {229#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:13,457 INFO L273 TraceCheckUtils]: 4: Hoare triple {229#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {233#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:13,457 INFO L273 TraceCheckUtils]: 5: Hoare triple {233#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {237#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:28:13,458 INFO L273 TraceCheckUtils]: 6: Hoare triple {237#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {241#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:28:13,461 INFO L273 TraceCheckUtils]: 7: Hoare triple {241#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} assume !(#memory_int[main_p1] >= 0); {215#false} is VALID [2019-05-15 10:28:13,462 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:13,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:13,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-05-15 10:28:13,462 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-05-15 10:28:13,463 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:13,463 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2019-05-15 10:28:13,477 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:28:13,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-05-15 10:28:13,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-05-15 10:28:13,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-05-15 10:28:13,478 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 7 states. [2019-05-15 10:28:13,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:13,611 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-05-15 10:28:13,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-05-15 10:28:13,611 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-05-15 10:28:13,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:13,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-05-15 10:28:13,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 11 transitions. [2019-05-15 10:28:13,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-05-15 10:28:13,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 11 transitions. [2019-05-15 10:28:13,615 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 11 transitions. [2019-05-15 10:28:13,625 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:13,626 INFO L225 Difference]: With dead ends: 10 [2019-05-15 10:28:13,626 INFO L226 Difference]: Without dead ends: 10 [2019-05-15 10:28:13,627 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-05-15 10:28:13,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-05-15 10:28:13,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-05-15 10:28:13,628 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:13,629 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states. Second operand 10 states. [2019-05-15 10:28:13,629 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 10 states. [2019-05-15 10:28:13,629 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 10 states. [2019-05-15 10:28:13,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:13,630 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-05-15 10:28:13,630 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-05-15 10:28:13,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:13,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:13,631 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 10 states. [2019-05-15 10:28:13,631 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 10 states. [2019-05-15 10:28:13,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:13,632 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-05-15 10:28:13,632 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-05-15 10:28:13,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:13,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:13,632 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:13,633 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:13,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-05-15 10:28:13,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-05-15 10:28:13,633 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-05-15 10:28:13,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:13,634 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-05-15 10:28:13,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-05-15 10:28:13,634 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-05-15 10:28:13,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-05-15 10:28:13,634 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:13,635 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1] [2019-05-15 10:28:13,635 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:13,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:13,635 INFO L82 PathProgramCache]: Analyzing trace with hash -796162366, now seen corresponding path program 5 times [2019-05-15 10:28:13,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:13,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:13,650 WARN L254 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 7 conjunts are in the unsatisfiable core [2019-05-15 10:28:13,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:13,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:13,683 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:13,683 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,691 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:13,691 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,691 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:13,694 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:13,694 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_22|]. (= (store |v_#memory_int_22| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:28:13,694 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:13,723 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:13,729 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,745 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:13,745 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,746 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:13,753 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:13,753 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_23|]. (let ((.cse0 (select |v_#memory_int_23| ULTIMATE.start_main_p1))) (and (= .cse0 0) (= |#memory_int| (store |v_#memory_int_23| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:13,753 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:13,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:13,786 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,788 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:13,789 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,789 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:13,796 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:13,796 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_24|]. (let ((.cse0 (select |v_#memory_int_24| ULTIMATE.start_main_p1))) (and (= 1 .cse0) (= (store |v_#memory_int_24| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:13,796 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:13,816 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:13,817 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,823 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:13,823 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,823 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:13,830 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:13,831 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_25|]. (let ((.cse0 (select |v_#memory_int_25| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_25| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 2 .cse0))) [2019-05-15 10:28:13,831 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:28:13,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 16 treesize of output 11 [2019-05-15 10:28:13,852 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,854 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:13,854 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,854 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:13,860 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:13,860 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_26|]. (let ((.cse0 (select |v_#memory_int_26| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_26| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 3 .cse0))) [2019-05-15 10:28:13,860 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:28:13,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 16 treesize of output 11 [2019-05-15 10:28:13,914 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,917 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:13,917 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,917 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:13,923 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:13,923 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_27|]. (let ((.cse0 (select |v_#memory_int_27| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_27| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 4))) [2019-05-15 10:28:13,924 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:28:13,933 INFO L273 TraceCheckUtils]: 0: Hoare triple {284#true} havoc main_p1; {284#true} is VALID [2019-05-15 10:28:13,933 INFO L273 TraceCheckUtils]: 1: Hoare triple {284#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {284#true} is VALID [2019-05-15 10:28:13,934 INFO L273 TraceCheckUtils]: 2: Hoare triple {284#true} #memory_int := #memory_int[main_p1 := 0]; {295#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:13,935 INFO L273 TraceCheckUtils]: 3: Hoare triple {295#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {299#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:13,936 INFO L273 TraceCheckUtils]: 4: Hoare triple {299#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {303#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:13,936 INFO L273 TraceCheckUtils]: 5: Hoare triple {303#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {307#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:28:13,937 INFO L273 TraceCheckUtils]: 6: Hoare triple {307#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {311#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:28:13,938 INFO L273 TraceCheckUtils]: 7: Hoare triple {311#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {315#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:28:13,938 INFO L273 TraceCheckUtils]: 8: Hoare triple {315#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} assume !(#memory_int[main_p1] >= 0); {285#false} is VALID [2019-05-15 10:28:13,939 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:13,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:13,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-05-15 10:28:13,940 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-05-15 10:28:13,940 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:13,940 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2019-05-15 10:28:13,952 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:13,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-05-15 10:28:13,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-05-15 10:28:13,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-05-15 10:28:13,953 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 8 states. [2019-05-15 10:28:14,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:14,124 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-05-15 10:28:14,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-05-15 10:28:14,125 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-05-15 10:28:14,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:14,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-05-15 10:28:14,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2019-05-15 10:28:14,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-05-15 10:28:14,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2019-05-15 10:28:14,128 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 12 transitions. [2019-05-15 10:28:14,140 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:14,141 INFO L225 Difference]: With dead ends: 11 [2019-05-15 10:28:14,141 INFO L226 Difference]: Without dead ends: 11 [2019-05-15 10:28:14,142 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-05-15 10:28:14,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-05-15 10:28:14,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-05-15 10:28:14,143 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:14,143 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand 11 states. [2019-05-15 10:28:14,143 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2019-05-15 10:28:14,143 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2019-05-15 10:28:14,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:14,144 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-05-15 10:28:14,144 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-05-15 10:28:14,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:14,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:14,145 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2019-05-15 10:28:14,145 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2019-05-15 10:28:14,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:14,146 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-05-15 10:28:14,146 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-05-15 10:28:14,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:14,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:14,147 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:14,147 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:14,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-05-15 10:28:14,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-05-15 10:28:14,148 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-05-15 10:28:14,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:14,148 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-05-15 10:28:14,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-05-15 10:28:14,148 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-05-15 10:28:14,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-05-15 10:28:14,149 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:14,149 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1] [2019-05-15 10:28:14,149 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:14,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:14,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1088770376, now seen corresponding path program 6 times [2019-05-15 10:28:14,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:14,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:14,167 WARN L254 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 8 conjunts are in the unsatisfiable core [2019-05-15 10:28:14,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:14,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:14,222 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:14,222 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:14,225 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:14,225 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:14,225 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:14,227 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:14,228 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_28|]. (= (store |v_#memory_int_28| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:28:14,228 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:14,244 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:14,246 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:14,248 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:14,248 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:14,249 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:14,256 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:14,256 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_29|]. (let ((.cse0 (select |v_#memory_int_29| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_29| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 0))) [2019-05-15 10:28:14,256 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:14,280 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:14,281 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:14,284 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:14,284 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:14,284 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:14,290 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:14,290 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_30|]. (let ((.cse0 (select |v_#memory_int_30| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_30| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 1))) [2019-05-15 10:28:14,290 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:14,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 16 treesize of output 11 [2019-05-15 10:28:14,307 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:14,310 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:14,310 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:14,310 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:14,319 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:14,319 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_31|]. (let ((.cse0 (select |v_#memory_int_31| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_31| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 2))) [2019-05-15 10:28:14,319 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:28:14,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 16 treesize of output 11 [2019-05-15 10:28:14,340 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:14,346 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:14,346 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:14,346 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:14,354 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:14,354 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_32|]. (let ((.cse0 (select |v_#memory_int_32| ULTIMATE.start_main_p1))) (and (= .cse0 3) (= (store |v_#memory_int_32| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:14,354 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:28:14,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:14,380 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:14,383 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:14,383 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:14,383 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:14,390 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:14,390 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_33|]. (let ((.cse0 (select |v_#memory_int_33| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_33| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 4))) [2019-05-15 10:28:14,390 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:28:14,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:14,430 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:14,435 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:14,435 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:14,435 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:14,443 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:14,443 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_34|]. (let ((.cse0 (select |v_#memory_int_34| ULTIMATE.start_main_p1))) (and (= .cse0 5) (= (store |v_#memory_int_34| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:14,443 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:28:14,454 INFO L273 TraceCheckUtils]: 0: Hoare triple {362#true} havoc main_p1; {362#true} is VALID [2019-05-15 10:28:14,455 INFO L273 TraceCheckUtils]: 1: Hoare triple {362#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {362#true} is VALID [2019-05-15 10:28:14,456 INFO L273 TraceCheckUtils]: 2: Hoare triple {362#true} #memory_int := #memory_int[main_p1 := 0]; {373#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:14,465 INFO L273 TraceCheckUtils]: 3: Hoare triple {373#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {377#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:14,467 INFO L273 TraceCheckUtils]: 4: Hoare triple {377#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {381#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:14,467 INFO L273 TraceCheckUtils]: 5: Hoare triple {381#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {385#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:28:14,468 INFO L273 TraceCheckUtils]: 6: Hoare triple {385#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {389#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:28:14,469 INFO L273 TraceCheckUtils]: 7: Hoare triple {389#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {393#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:28:14,470 INFO L273 TraceCheckUtils]: 8: Hoare triple {393#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {397#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:28:14,471 INFO L273 TraceCheckUtils]: 9: Hoare triple {397#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} assume !(#memory_int[main_p1] >= 0); {363#false} is VALID [2019-05-15 10:28:14,472 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:14,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:14,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-05-15 10:28:14,473 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2019-05-15 10:28:14,473 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:14,474 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2019-05-15 10:28:14,494 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:14,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-05-15 10:28:14,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-05-15 10:28:14,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-05-15 10:28:14,495 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 9 states. [2019-05-15 10:28:14,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:14,686 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-05-15 10:28:14,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-05-15 10:28:14,687 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2019-05-15 10:28:14,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:14,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-05-15 10:28:14,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2019-05-15 10:28:14,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-05-15 10:28:14,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2019-05-15 10:28:14,689 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 13 transitions. [2019-05-15 10:28:14,700 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:28:14,701 INFO L225 Difference]: With dead ends: 12 [2019-05-15 10:28:14,701 INFO L226 Difference]: Without dead ends: 12 [2019-05-15 10:28:14,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-05-15 10:28:14,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-05-15 10:28:14,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-05-15 10:28:14,704 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:14,704 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2019-05-15 10:28:14,705 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2019-05-15 10:28:14,705 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2019-05-15 10:28:14,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:14,706 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-05-15 10:28:14,706 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-05-15 10:28:14,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:14,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:14,706 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2019-05-15 10:28:14,706 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2019-05-15 10:28:14,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:14,707 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-05-15 10:28:14,708 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-05-15 10:28:14,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:14,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:14,708 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:14,708 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:14,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-05-15 10:28:14,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-05-15 10:28:14,709 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-05-15 10:28:14,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:14,710 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-05-15 10:28:14,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-05-15 10:28:14,710 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-05-15 10:28:14,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-05-15 10:28:14,710 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:14,710 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1] [2019-05-15 10:28:14,711 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:14,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:14,711 INFO L82 PathProgramCache]: Analyzing trace with hash -607856766, now seen corresponding path program 7 times [2019-05-15 10:28:14,712 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:14,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:14,725 WARN L254 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 9 conjunts are in the unsatisfiable core [2019-05-15 10:28:14,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:14,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:14,758 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:14,758 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:14,765 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:14,765 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:14,765 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:14,767 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:14,767 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_35|]. (= (store |v_#memory_int_35| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:28:14,767 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:14,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 16 treesize of output 11 [2019-05-15 10:28:14,798 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:14,801 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:14,802 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:14,802 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:14,808 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:14,808 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_36|]. (let ((.cse0 (select |v_#memory_int_36| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_36| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 0))) [2019-05-15 10:28:14,808 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:14,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 16 treesize of output 11 [2019-05-15 10:28:14,825 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:14,828 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:14,828 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:14,829 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:14,835 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:14,835 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_37|]. (let ((.cse0 (select |v_#memory_int_37| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_37| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 1))) [2019-05-15 10:28:14,836 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:14,857 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:14,859 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:14,863 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:14,863 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:14,864 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:14,872 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:14,872 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_38|]. (let ((.cse0 (select |v_#memory_int_38| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_38| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 2 .cse0))) [2019-05-15 10:28:14,872 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:28:14,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 16 treesize of output 11 [2019-05-15 10:28:14,937 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:14,946 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:14,947 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:14,947 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:14,953 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:14,953 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_39|]. (let ((.cse0 (select |v_#memory_int_39| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_39| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 3))) [2019-05-15 10:28:14,953 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:28:14,972 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:14,974 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:14,978 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:14,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:14,979 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:14,985 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:14,986 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_40|]. (let ((.cse0 (select |v_#memory_int_40| ULTIMATE.start_main_p1))) (and (= .cse0 4) (= (store |v_#memory_int_40| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:14,986 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:28:15,007 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:15,009 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:15,011 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:15,011 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,011 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:15,018 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:15,018 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_41|]. (let ((.cse0 (select |v_#memory_int_41| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_41| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 5))) [2019-05-15 10:28:15,018 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:28:15,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:15,045 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:15,046 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:15,047 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,047 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:15,052 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:15,052 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_42|]. (let ((.cse0 (select |v_#memory_int_42| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_42| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 6))) [2019-05-15 10:28:15,052 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:28:15,061 INFO L273 TraceCheckUtils]: 0: Hoare triple {448#true} havoc main_p1; {448#true} is VALID [2019-05-15 10:28:15,062 INFO L273 TraceCheckUtils]: 1: Hoare triple {448#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {448#true} is VALID [2019-05-15 10:28:15,062 INFO L273 TraceCheckUtils]: 2: Hoare triple {448#true} #memory_int := #memory_int[main_p1 := 0]; {459#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:15,067 INFO L273 TraceCheckUtils]: 3: Hoare triple {459#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {463#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:15,067 INFO L273 TraceCheckUtils]: 4: Hoare triple {463#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {467#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:15,068 INFO L273 TraceCheckUtils]: 5: Hoare triple {467#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {471#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:28:15,069 INFO L273 TraceCheckUtils]: 6: Hoare triple {471#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {475#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:28:15,069 INFO L273 TraceCheckUtils]: 7: Hoare triple {475#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {479#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:28:15,070 INFO L273 TraceCheckUtils]: 8: Hoare triple {479#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {483#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:28:15,071 INFO L273 TraceCheckUtils]: 9: Hoare triple {483#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {487#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:28:15,072 INFO L273 TraceCheckUtils]: 10: Hoare triple {487#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} assume !(#memory_int[main_p1] >= 0); {449#false} is VALID [2019-05-15 10:28:15,073 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:15,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:15,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-05-15 10:28:15,074 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2019-05-15 10:28:15,074 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:15,075 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2019-05-15 10:28:15,095 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:15,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-05-15 10:28:15,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-05-15 10:28:15,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-05-15 10:28:15,096 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 10 states. [2019-05-15 10:28:15,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:15,331 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-05-15 10:28:15,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-05-15 10:28:15,331 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2019-05-15 10:28:15,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:15,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-05-15 10:28:15,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2019-05-15 10:28:15,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-05-15 10:28:15,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2019-05-15 10:28:15,334 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 14 transitions. [2019-05-15 10:28:15,349 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:15,350 INFO L225 Difference]: With dead ends: 13 [2019-05-15 10:28:15,350 INFO L226 Difference]: Without dead ends: 13 [2019-05-15 10:28:15,350 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-05-15 10:28:15,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-05-15 10:28:15,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-05-15 10:28:15,352 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:15,352 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2019-05-15 10:28:15,352 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2019-05-15 10:28:15,352 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2019-05-15 10:28:15,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:15,353 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-05-15 10:28:15,353 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-05-15 10:28:15,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:15,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:15,354 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2019-05-15 10:28:15,354 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2019-05-15 10:28:15,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:15,355 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-05-15 10:28:15,355 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-05-15 10:28:15,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:15,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:15,356 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:15,356 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:15,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-05-15 10:28:15,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-05-15 10:28:15,357 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-05-15 10:28:15,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:15,357 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-05-15 10:28:15,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-05-15 10:28:15,357 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-05-15 10:28:15,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-05-15 10:28:15,358 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:15,358 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1] [2019-05-15 10:28:15,358 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:15,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:15,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1663690616, now seen corresponding path program 8 times [2019-05-15 10:28:15,359 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:15,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:15,372 WARN L254 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 10 conjunts are in the unsatisfiable core [2019-05-15 10:28:15,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:15,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:15,391 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,391 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:15,401 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:15,401 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,401 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:15,403 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:15,403 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_43|]. (= (store |v_#memory_int_43| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:28:15,403 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:15,429 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:15,430 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:15,432 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:15,433 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,433 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:15,440 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:15,440 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_44|]. (let ((.cse0 (select |v_#memory_int_44| ULTIMATE.start_main_p1))) (and (= .cse0 0) (= |#memory_int| (store |v_#memory_int_44| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:15,441 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:15,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 16 treesize of output 11 [2019-05-15 10:28:15,469 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:15,471 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:15,472 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,472 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:15,480 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:15,480 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_45|]. (let ((.cse0 (select |v_#memory_int_45| ULTIMATE.start_main_p1))) (and (= .cse0 1) (= (store |v_#memory_int_45| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:15,480 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:15,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 16 treesize of output 11 [2019-05-15 10:28:15,497 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:15,498 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:15,498 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,498 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:15,505 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:15,505 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_46|]. (let ((.cse0 (select |v_#memory_int_46| ULTIMATE.start_main_p1))) (and (= 2 .cse0) (= (store |v_#memory_int_46| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:15,505 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:28:15,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 16 treesize of output 11 [2019-05-15 10:28:15,527 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:15,530 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:15,530 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,530 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:15,539 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:15,540 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_47|]. (let ((.cse0 (select |v_#memory_int_47| ULTIMATE.start_main_p1))) (and (= .cse0 3) (= (store |v_#memory_int_47| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:15,540 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:28:15,557 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:15,558 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:15,561 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:15,561 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,561 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:15,567 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:15,567 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_48|]. (let ((.cse0 (select |v_#memory_int_48| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_48| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 4 .cse0))) [2019-05-15 10:28:15,567 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:28:15,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:15,587 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:15,590 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:15,590 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,590 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:15,596 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:15,596 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_49|]. (let ((.cse0 (select |v_#memory_int_49| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_49| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 5 .cse0))) [2019-05-15 10:28:15,596 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:28:15,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 16 treesize of output 11 [2019-05-15 10:28:15,622 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:15,624 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:15,624 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,624 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:15,631 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:15,631 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_50|]. (let ((.cse0 (select |v_#memory_int_50| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_50| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 6 .cse0))) [2019-05-15 10:28:15,631 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:28:15,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 16 treesize of output 11 [2019-05-15 10:28:15,655 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:15,657 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:15,657 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,657 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:15,663 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:15,663 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_51|]. (let ((.cse0 (select |v_#memory_int_51| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_51| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 7))) [2019-05-15 10:28:15,663 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:28:15,674 INFO L273 TraceCheckUtils]: 0: Hoare triple {542#true} havoc main_p1; {542#true} is VALID [2019-05-15 10:28:15,675 INFO L273 TraceCheckUtils]: 1: Hoare triple {542#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {542#true} is VALID [2019-05-15 10:28:15,677 INFO L273 TraceCheckUtils]: 2: Hoare triple {542#true} #memory_int := #memory_int[main_p1 := 0]; {553#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:15,679 INFO L273 TraceCheckUtils]: 3: Hoare triple {553#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {557#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:15,680 INFO L273 TraceCheckUtils]: 4: Hoare triple {557#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {561#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:15,681 INFO L273 TraceCheckUtils]: 5: Hoare triple {561#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {565#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:28:15,681 INFO L273 TraceCheckUtils]: 6: Hoare triple {565#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {569#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:28:15,682 INFO L273 TraceCheckUtils]: 7: Hoare triple {569#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {573#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:28:15,683 INFO L273 TraceCheckUtils]: 8: Hoare triple {573#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {577#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:28:15,684 INFO L273 TraceCheckUtils]: 9: Hoare triple {577#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {581#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:28:15,685 INFO L273 TraceCheckUtils]: 10: Hoare triple {581#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {585#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:28:15,685 INFO L273 TraceCheckUtils]: 11: Hoare triple {585#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} assume !(#memory_int[main_p1] >= 0); {543#false} is VALID [2019-05-15 10:28:15,686 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:15,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:15,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-05-15 10:28:15,687 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 12 [2019-05-15 10:28:15,687 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:15,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2019-05-15 10:28:15,706 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:15,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-05-15 10:28:15,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-05-15 10:28:15,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-05-15 10:28:15,707 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 11 states. [2019-05-15 10:28:16,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:16,009 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-05-15 10:28:16,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-05-15 10:28:16,009 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 12 [2019-05-15 10:28:16,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:16,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-05-15 10:28:16,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2019-05-15 10:28:16,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-05-15 10:28:16,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2019-05-15 10:28:16,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 15 transitions. [2019-05-15 10:28:16,024 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:16,025 INFO L225 Difference]: With dead ends: 14 [2019-05-15 10:28:16,025 INFO L226 Difference]: Without dead ends: 14 [2019-05-15 10:28:16,025 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-05-15 10:28:16,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-05-15 10:28:16,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-05-15 10:28:16,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:16,027 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2019-05-15 10:28:16,027 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2019-05-15 10:28:16,028 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2019-05-15 10:28:16,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:16,029 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-05-15 10:28:16,029 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-05-15 10:28:16,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:16,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:16,029 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2019-05-15 10:28:16,029 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2019-05-15 10:28:16,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:16,030 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-05-15 10:28:16,030 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-05-15 10:28:16,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:16,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:16,031 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:16,031 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:16,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-05-15 10:28:16,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-05-15 10:28:16,032 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-05-15 10:28:16,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:16,032 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-05-15 10:28:16,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-05-15 10:28:16,032 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-05-15 10:28:16,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-05-15 10:28:16,033 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:16,033 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1] [2019-05-15 10:28:16,033 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:16,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:16,033 INFO L82 PathProgramCache]: Analyzing trace with hash -34801598, now seen corresponding path program 9 times [2019-05-15 10:28:16,034 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:16,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:16,051 WARN L254 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 11 conjunts are in the unsatisfiable core [2019-05-15 10:28:16,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:16,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:16,090 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:16,090 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:16,092 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:16,093 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:16,093 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:16,098 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:16,098 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_52|]. (= (store |v_#memory_int_52| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:28:16,098 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:16,119 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:16,119 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:16,129 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:16,129 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:16,129 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:16,135 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:16,135 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_53|]. (let ((.cse0 (select |v_#memory_int_53| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_53| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 0))) [2019-05-15 10:28:16,136 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:16,149 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:16,150 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:16,152 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:16,152 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:16,153 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:16,158 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:16,159 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_54|]. (let ((.cse0 (select |v_#memory_int_54| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_54| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 1))) [2019-05-15 10:28:16,159 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:16,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:16,174 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:16,176 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:16,176 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:16,177 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:16,184 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:16,184 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_55|]. (let ((.cse0 (select |v_#memory_int_55| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_55| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 2 .cse0))) [2019-05-15 10:28:16,184 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:28:16,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 16 treesize of output 11 [2019-05-15 10:28:16,203 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:16,205 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:16,205 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:16,205 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:16,212 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:16,213 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_56|]. (let ((.cse0 (select |v_#memory_int_56| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_56| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 3))) [2019-05-15 10:28:16,213 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:28:16,242 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:16,250 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:16,252 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:16,252 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:16,252 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:16,259 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:16,260 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_57|]. (let ((.cse0 (select |v_#memory_int_57| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_57| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 4 .cse0))) [2019-05-15 10:28:16,260 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:28:16,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 16 treesize of output 11 [2019-05-15 10:28:16,282 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:16,283 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:16,284 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:16,284 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:16,290 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:16,291 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_58|]. (let ((.cse0 (select |v_#memory_int_58| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_58| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 5))) [2019-05-15 10:28:16,291 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:28:16,309 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:16,314 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:16,318 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:16,318 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:16,318 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:16,325 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:16,325 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_59|]. (let ((.cse0 (select |v_#memory_int_59| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_59| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 6 .cse0))) [2019-05-15 10:28:16,325 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:28:16,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 16 treesize of output 11 [2019-05-15 10:28:16,344 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:16,346 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:16,346 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:16,346 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:16,354 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:16,354 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_60|]. (let ((.cse0 (select |v_#memory_int_60| ULTIMATE.start_main_p1))) (and (= 7 .cse0) (= (store |v_#memory_int_60| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:16,354 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:28:16,564 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:16,565 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:16,567 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:16,567 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:16,567 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:16,574 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:16,575 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_61|]. (let ((.cse0 (select |v_#memory_int_61| ULTIMATE.start_main_p1))) (and (= 8 .cse0) (= (store |v_#memory_int_61| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:16,575 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:28:16,587 INFO L273 TraceCheckUtils]: 0: Hoare triple {644#true} havoc main_p1; {644#true} is VALID [2019-05-15 10:28:16,587 INFO L273 TraceCheckUtils]: 1: Hoare triple {644#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {644#true} is VALID [2019-05-15 10:28:16,589 INFO L273 TraceCheckUtils]: 2: Hoare triple {644#true} #memory_int := #memory_int[main_p1 := 0]; {655#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:16,589 INFO L273 TraceCheckUtils]: 3: Hoare triple {655#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {659#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:16,591 INFO L273 TraceCheckUtils]: 4: Hoare triple {659#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {663#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:16,592 INFO L273 TraceCheckUtils]: 5: Hoare triple {663#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {667#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:28:16,593 INFO L273 TraceCheckUtils]: 6: Hoare triple {667#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {671#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:28:16,593 INFO L273 TraceCheckUtils]: 7: Hoare triple {671#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {675#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:28:16,595 INFO L273 TraceCheckUtils]: 8: Hoare triple {675#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {679#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:28:16,597 INFO L273 TraceCheckUtils]: 9: Hoare triple {679#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {683#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:28:16,598 INFO L273 TraceCheckUtils]: 10: Hoare triple {683#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {687#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:28:16,599 INFO L273 TraceCheckUtils]: 11: Hoare triple {687#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {691#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:28:16,599 INFO L273 TraceCheckUtils]: 12: Hoare triple {691#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} assume !(#memory_int[main_p1] >= 0); {645#false} is VALID [2019-05-15 10:28:16,600 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:16,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:16,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-05-15 10:28:16,600 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 13 [2019-05-15 10:28:16,600 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:16,600 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2019-05-15 10:28:16,618 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:28:16,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-05-15 10:28:16,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-05-15 10:28:16,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-05-15 10:28:16,619 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 12 states. [2019-05-15 10:28:17,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:17,123 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-05-15 10:28:17,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-05-15 10:28:17,123 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 13 [2019-05-15 10:28:17,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:17,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-05-15 10:28:17,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-05-15 10:28:17,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-05-15 10:28:17,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-05-15 10:28:17,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 16 transitions. [2019-05-15 10:28:17,151 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:17,152 INFO L225 Difference]: With dead ends: 15 [2019-05-15 10:28:17,152 INFO L226 Difference]: Without dead ends: 15 [2019-05-15 10:28:17,153 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-05-15 10:28:17,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-05-15 10:28:17,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-05-15 10:28:17,155 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:17,155 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2019-05-15 10:28:17,156 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2019-05-15 10:28:17,156 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2019-05-15 10:28:17,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:17,157 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-05-15 10:28:17,157 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-05-15 10:28:17,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:17,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:17,158 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2019-05-15 10:28:17,158 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2019-05-15 10:28:17,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:17,159 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-05-15 10:28:17,159 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-05-15 10:28:17,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:17,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:17,160 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:17,160 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:17,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-05-15 10:28:17,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-05-15 10:28:17,161 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-05-15 10:28:17,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:17,161 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-05-15 10:28:17,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-05-15 10:28:17,161 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-05-15 10:28:17,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-05-15 10:28:17,162 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:17,162 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1] [2019-05-15 10:28:17,162 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:17,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:17,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1078849592, now seen corresponding path program 10 times [2019-05-15 10:28:17,163 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:17,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:17,183 WARN L254 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 12 conjunts are in the unsatisfiable core [2019-05-15 10:28:17,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:17,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:17,229 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:17,230 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:17,236 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:17,236 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:17,236 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:17,238 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:17,238 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_62|]. (= (store |v_#memory_int_62| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:28:17,238 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:17,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 16 treesize of output 11 [2019-05-15 10:28:17,261 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:17,266 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:17,266 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:17,266 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:17,272 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:17,272 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_63|]. (let ((.cse0 (select |v_#memory_int_63| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_63| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 0))) [2019-05-15 10:28:17,272 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:17,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:17,286 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:17,289 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:17,289 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:17,289 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:17,298 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:17,298 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_64|]. (let ((.cse0 (select |v_#memory_int_64| ULTIMATE.start_main_p1))) (and (= .cse0 1) (= (store |v_#memory_int_64| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:17,298 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:17,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 16 treesize of output 11 [2019-05-15 10:28:17,354 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:17,377 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:17,377 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:17,377 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:17,383 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:17,383 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_65|]. (let ((.cse0 (select |v_#memory_int_65| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_65| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 2))) [2019-05-15 10:28:17,383 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:28:17,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:17,417 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:17,421 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:17,421 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:17,421 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:17,427 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:17,428 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_66|]. (let ((.cse0 (select |v_#memory_int_66| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_66| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 3))) [2019-05-15 10:28:17,428 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:28:17,442 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:17,443 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:17,446 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:17,446 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:17,446 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:17,453 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:17,453 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_67|]. (let ((.cse0 (select |v_#memory_int_67| ULTIMATE.start_main_p1))) (and (= 4 .cse0) (= (store |v_#memory_int_67| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:17,453 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:28:17,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:17,509 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:17,511 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:17,512 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:17,512 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:17,520 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:17,520 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_68|]. (let ((.cse0 (select |v_#memory_int_68| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_68| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 5))) [2019-05-15 10:28:17,520 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:28:17,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 16 treesize of output 11 [2019-05-15 10:28:17,540 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:17,543 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:17,543 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:17,543 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:17,552 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:17,552 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_69|]. (let ((.cse0 (select |v_#memory_int_69| ULTIMATE.start_main_p1))) (and (= .cse0 6) (= (store |v_#memory_int_69| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:17,552 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:28:17,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 16 treesize of output 11 [2019-05-15 10:28:17,583 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:17,584 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:17,585 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:17,585 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:17,591 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:17,591 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_70|]. (let ((.cse0 (select |v_#memory_int_70| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_70| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 7 .cse0))) [2019-05-15 10:28:17,591 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:28:17,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:17,620 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:17,662 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:17,662 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:17,663 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:17,669 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:17,669 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_71|]. (let ((.cse0 (select |v_#memory_int_71| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_71| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 8 .cse0))) [2019-05-15 10:28:17,669 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:28:17,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 16 treesize of output 11 [2019-05-15 10:28:17,695 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:17,697 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:17,697 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:17,697 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:17,703 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:17,703 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_72|]. (let ((.cse0 (select |v_#memory_int_72| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_72| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 9 .cse0))) [2019-05-15 10:28:17,703 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:28:17,715 INFO L273 TraceCheckUtils]: 0: Hoare triple {754#true} havoc main_p1; {754#true} is VALID [2019-05-15 10:28:17,715 INFO L273 TraceCheckUtils]: 1: Hoare triple {754#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {754#true} is VALID [2019-05-15 10:28:17,716 INFO L273 TraceCheckUtils]: 2: Hoare triple {754#true} #memory_int := #memory_int[main_p1 := 0]; {765#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:17,717 INFO L273 TraceCheckUtils]: 3: Hoare triple {765#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {769#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:17,718 INFO L273 TraceCheckUtils]: 4: Hoare triple {769#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {773#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:17,718 INFO L273 TraceCheckUtils]: 5: Hoare triple {773#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {777#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:28:17,719 INFO L273 TraceCheckUtils]: 6: Hoare triple {777#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {781#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:28:17,720 INFO L273 TraceCheckUtils]: 7: Hoare triple {781#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {785#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:28:17,720 INFO L273 TraceCheckUtils]: 8: Hoare triple {785#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {789#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:28:17,721 INFO L273 TraceCheckUtils]: 9: Hoare triple {789#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {793#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:28:17,722 INFO L273 TraceCheckUtils]: 10: Hoare triple {793#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {797#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:28:17,723 INFO L273 TraceCheckUtils]: 11: Hoare triple {797#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {801#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:28:17,724 INFO L273 TraceCheckUtils]: 12: Hoare triple {801#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {805#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:28:17,725 INFO L273 TraceCheckUtils]: 13: Hoare triple {805#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} assume !(#memory_int[main_p1] >= 0); {755#false} is VALID [2019-05-15 10:28:17,726 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:17,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:17,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-05-15 10:28:17,727 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2019-05-15 10:28:17,727 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:17,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2019-05-15 10:28:17,743 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:17,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-05-15 10:28:17,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-05-15 10:28:17,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-05-15 10:28:17,744 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 13 states. [2019-05-15 10:28:18,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:18,106 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-05-15 10:28:18,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-05-15 10:28:18,107 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2019-05-15 10:28:18,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:18,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-05-15 10:28:18,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-05-15 10:28:18,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-05-15 10:28:18,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-05-15 10:28:18,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 17 transitions. [2019-05-15 10:28:18,125 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:18,126 INFO L225 Difference]: With dead ends: 16 [2019-05-15 10:28:18,126 INFO L226 Difference]: Without dead ends: 16 [2019-05-15 10:28:18,127 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-05-15 10:28:18,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-05-15 10:28:18,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-05-15 10:28:18,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:18,129 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2019-05-15 10:28:18,129 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2019-05-15 10:28:18,129 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2019-05-15 10:28:18,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:18,130 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-05-15 10:28:18,130 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-05-15 10:28:18,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:18,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:18,131 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2019-05-15 10:28:18,131 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2019-05-15 10:28:18,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:18,132 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-05-15 10:28:18,132 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-05-15 10:28:18,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:18,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:18,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:18,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:18,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-05-15 10:28:18,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-05-15 10:28:18,133 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-05-15 10:28:18,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:18,134 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-05-15 10:28:18,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-05-15 10:28:18,134 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-05-15 10:28:18,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-05-15 10:28:18,134 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:18,134 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1] [2019-05-15 10:28:18,135 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:18,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:18,135 INFO L82 PathProgramCache]: Analyzing trace with hash 915400962, now seen corresponding path program 11 times [2019-05-15 10:28:18,136 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:18,152 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 13 conjunts are in the unsatisfiable core [2019-05-15 10:28:18,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:18,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:18,184 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:18,185 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:18,188 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:18,188 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:18,188 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:18,191 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:18,191 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_73|]. (= (store |v_#memory_int_73| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:28:18,191 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:18,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 16 treesize of output 11 [2019-05-15 10:28:18,206 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:18,210 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:18,210 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:18,210 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:18,227 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:18,228 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_74|]. (let ((.cse0 (select |v_#memory_int_74| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_74| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 0))) [2019-05-15 10:28:18,228 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:18,277 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:18,278 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:18,280 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:18,281 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:18,281 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:18,288 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:18,288 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_75|]. (let ((.cse0 (select |v_#memory_int_75| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_75| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 1))) [2019-05-15 10:28:18,288 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28: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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:18,309 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:18,311 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:18,311 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:18,311 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:18,318 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:18,319 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_76|]. (let ((.cse0 (select |v_#memory_int_76| ULTIMATE.start_main_p1))) (and (= .cse0 2) (= |#memory_int| (store |v_#memory_int_76| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:18,319 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:28:18,333 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:18,336 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:18,340 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:18,340 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:18,340 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:18,347 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:18,347 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_77|]. (let ((.cse0 (select |v_#memory_int_77| ULTIMATE.start_main_p1))) (and (= .cse0 3) (= (store |v_#memory_int_77| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:18,347 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:28:18,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 16 treesize of output 11 [2019-05-15 10:28:18,379 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:18,382 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:18,382 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:18,382 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:18,389 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:18,390 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_78|]. (let ((.cse0 (select |v_#memory_int_78| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_78| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 4))) [2019-05-15 10:28:18,390 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:28:18,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 16 treesize of output 11 [2019-05-15 10:28:18,407 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:18,410 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:18,410 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:18,410 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:18,418 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:18,418 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_79|]. (let ((.cse0 (select |v_#memory_int_79| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_79| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 5))) [2019-05-15 10:28:18,418 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:28:18,436 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:18,453 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:18,490 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:18,490 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:18,491 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:18,504 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:18,505 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_80|]. (let ((.cse0 (select |v_#memory_int_80| ULTIMATE.start_main_p1))) (and (= 6 .cse0) (= (store |v_#memory_int_80| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:18,505 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:28:18,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 16 treesize of output 11 [2019-05-15 10:28:18,597 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:18,599 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:18,600 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:18,600 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:18,607 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:18,607 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_81|]. (let ((.cse0 (select |v_#memory_int_81| ULTIMATE.start_main_p1))) (and (= .cse0 7) (= (store |v_#memory_int_81| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:18,608 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:28:18,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 16 treesize of output 11 [2019-05-15 10:28:18,634 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:18,636 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:18,636 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:18,636 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:18,643 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:18,643 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_82|]. (let ((.cse0 (select |v_#memory_int_82| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_82| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 8 .cse0))) [2019-05-15 10:28:18,643 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:28:18,678 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:18,679 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:18,681 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:18,681 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:18,681 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:18,688 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:18,689 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_83|]. (let ((.cse0 (select |v_#memory_int_83| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_83| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 9 .cse0))) [2019-05-15 10:28:18,689 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:28:18,710 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:18,712 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:18,714 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:18,714 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:18,714 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:18,722 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:18,722 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_84|]. (let ((.cse0 (select |v_#memory_int_84| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_84| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 10))) [2019-05-15 10:28:18,722 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:28:18,738 INFO L273 TraceCheckUtils]: 0: Hoare triple {872#true} havoc main_p1; {872#true} is VALID [2019-05-15 10:28:18,738 INFO L273 TraceCheckUtils]: 1: Hoare triple {872#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {872#true} is VALID [2019-05-15 10:28:18,739 INFO L273 TraceCheckUtils]: 2: Hoare triple {872#true} #memory_int := #memory_int[main_p1 := 0]; {883#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:18,740 INFO L273 TraceCheckUtils]: 3: Hoare triple {883#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {887#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:18,741 INFO L273 TraceCheckUtils]: 4: Hoare triple {887#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {891#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:18,742 INFO L273 TraceCheckUtils]: 5: Hoare triple {891#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {895#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:28:18,743 INFO L273 TraceCheckUtils]: 6: Hoare triple {895#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {899#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:28:18,744 INFO L273 TraceCheckUtils]: 7: Hoare triple {899#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {903#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:28:18,750 INFO L273 TraceCheckUtils]: 8: Hoare triple {903#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {907#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:28:18,751 INFO L273 TraceCheckUtils]: 9: Hoare triple {907#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {911#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:28:18,752 INFO L273 TraceCheckUtils]: 10: Hoare triple {911#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {915#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:28:18,753 INFO L273 TraceCheckUtils]: 11: Hoare triple {915#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {919#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:28:18,754 INFO L273 TraceCheckUtils]: 12: Hoare triple {919#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {923#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:28:18,755 INFO L273 TraceCheckUtils]: 13: Hoare triple {923#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {927#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:28:18,756 INFO L273 TraceCheckUtils]: 14: Hoare triple {927#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} assume !(#memory_int[main_p1] >= 0); {873#false} is VALID [2019-05-15 10:28:18,757 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:18,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:18,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-05-15 10:28:18,758 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 15 [2019-05-15 10:28:18,759 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:18,759 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2019-05-15 10:28:18,772 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:18,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-05-15 10:28:18,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-05-15 10:28:18,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-05-15 10:28:18,774 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 14 states. [2019-05-15 10:28:19,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:19,246 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-05-15 10:28:19,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-05-15 10:28:19,247 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 15 [2019-05-15 10:28:19,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:19,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-05-15 10:28:19,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2019-05-15 10:28:19,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-05-15 10:28:19,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2019-05-15 10:28:19,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 18 transitions. [2019-05-15 10:28:19,268 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:19,269 INFO L225 Difference]: With dead ends: 17 [2019-05-15 10:28:19,269 INFO L226 Difference]: Without dead ends: 17 [2019-05-15 10:28:19,270 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 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:19,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-05-15 10:28:19,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-05-15 10:28:19,272 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:19,272 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2019-05-15 10:28:19,272 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2019-05-15 10:28:19,272 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2019-05-15 10:28:19,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:19,273 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-05-15 10:28:19,273 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-05-15 10:28:19,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:19,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:19,274 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2019-05-15 10:28:19,274 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2019-05-15 10:28:19,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:19,275 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-05-15 10:28:19,275 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-05-15 10:28:19,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:19,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:19,276 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:19,276 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:19,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-05-15 10:28:19,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-05-15 10:28:19,277 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-05-15 10:28:19,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:19,277 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-05-15 10:28:19,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-05-15 10:28:19,277 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-05-15 10:28:19,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-05-15 10:28:19,278 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:19,278 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1] [2019-05-15 10:28:19,278 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:19,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:19,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1687341304, now seen corresponding path program 12 times [2019-05-15 10:28:19,279 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:19,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:19,294 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 14 conjunts are in the unsatisfiable core [2019-05-15 10:28:19,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:19,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:19,328 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:19,328 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,337 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:19,337 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,337 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:19,339 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:19,339 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_85|]. (= (store |v_#memory_int_85| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:28:19,339 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:19,357 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:19,358 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,361 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:19,361 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,361 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:19,368 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:19,368 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_86|]. (let ((.cse0 (select |v_#memory_int_86| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_86| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 0))) [2019-05-15 10:28:19,368 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:19,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:19,396 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,398 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:19,398 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,398 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:19,404 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:19,405 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_87|]. (let ((.cse0 (select |v_#memory_int_87| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_87| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 1 .cse0))) [2019-05-15 10:28:19,405 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:19,422 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:19,423 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,426 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:19,426 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,426 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:19,434 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:19,435 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_88|]. (let ((.cse0 (select |v_#memory_int_88| ULTIMATE.start_main_p1))) (and (= .cse0 2) (= (store |v_#memory_int_88| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:19,435 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:28:19,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 16 treesize of output 11 [2019-05-15 10:28:19,450 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,452 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:19,453 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,453 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:19,459 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:19,460 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_89|]. (let ((.cse0 (select |v_#memory_int_89| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_89| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 3))) [2019-05-15 10:28:19,460 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:28:19,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 16 treesize of output 11 [2019-05-15 10:28:19,476 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,478 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:19,479 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,479 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:19,487 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:19,487 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_90|]. (let ((.cse0 (select |v_#memory_int_90| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_90| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 4))) [2019-05-15 10:28:19,487 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:28:19,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 16 treesize of output 11 [2019-05-15 10:28:19,506 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,509 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:19,509 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,509 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:19,517 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:19,518 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_91|]. (let ((.cse0 (select |v_#memory_int_91| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_91| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 5))) [2019-05-15 10:28:19,518 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:28:19,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 16 treesize of output 11 [2019-05-15 10:28:19,543 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,545 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:19,545 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,545 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:19,551 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:19,552 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_92|]. (let ((.cse0 (select |v_#memory_int_92| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_92| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 6))) [2019-05-15 10:28:19,552 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:28:19,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 16 treesize of output 11 [2019-05-15 10:28:19,570 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,573 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:19,573 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,574 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:19,580 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:19,580 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_93|]. (let ((.cse0 (select |v_#memory_int_93| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_93| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 7))) [2019-05-15 10:28:19,581 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:28:19,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 16 treesize of output 11 [2019-05-15 10:28:19,598 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,601 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:19,601 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,601 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:19,608 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:19,608 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_94|]. (let ((.cse0 (select |v_#memory_int_94| ULTIMATE.start_main_p1))) (and (= .cse0 8) (= |#memory_int| (store |v_#memory_int_94| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:19,608 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:28:19,632 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:19,633 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,634 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:19,634 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,635 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:19,643 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:19,643 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_95|]. (let ((.cse0 (select |v_#memory_int_95| ULTIMATE.start_main_p1))) (and (= 9 .cse0) (= (store |v_#memory_int_95| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:19,643 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:28:19,668 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:19,669 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,676 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:19,676 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,676 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:19,682 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:19,682 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_96|]. (let ((.cse0 (select |v_#memory_int_96| ULTIMATE.start_main_p1))) (and (= 10 .cse0) (= (store |v_#memory_int_96| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:19,682 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:28:19,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 16 treesize of output 11 [2019-05-15 10:28:19,760 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,762 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:19,763 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,763 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:19,769 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:19,769 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_97|]. (let ((.cse0 (select |v_#memory_int_97| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_97| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 11 .cse0))) [2019-05-15 10:28:19,770 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:28:19,783 INFO L273 TraceCheckUtils]: 0: Hoare triple {998#true} havoc main_p1; {998#true} is VALID [2019-05-15 10:28:19,783 INFO L273 TraceCheckUtils]: 1: Hoare triple {998#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {998#true} is VALID [2019-05-15 10:28:19,785 INFO L273 TraceCheckUtils]: 2: Hoare triple {998#true} #memory_int := #memory_int[main_p1 := 0]; {1009#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:19,786 INFO L273 TraceCheckUtils]: 3: Hoare triple {1009#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1013#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:19,787 INFO L273 TraceCheckUtils]: 4: Hoare triple {1013#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1017#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:19,788 INFO L273 TraceCheckUtils]: 5: Hoare triple {1017#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1021#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:28:19,789 INFO L273 TraceCheckUtils]: 6: Hoare triple {1021#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1025#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:28:19,790 INFO L273 TraceCheckUtils]: 7: Hoare triple {1025#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1029#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:28:19,805 INFO L273 TraceCheckUtils]: 8: Hoare triple {1029#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1033#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:28:19,806 INFO L273 TraceCheckUtils]: 9: Hoare triple {1033#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1037#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:28:19,806 INFO L273 TraceCheckUtils]: 10: Hoare triple {1037#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1041#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:28:19,807 INFO L273 TraceCheckUtils]: 11: Hoare triple {1041#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1045#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:28:19,808 INFO L273 TraceCheckUtils]: 12: Hoare triple {1045#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1049#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:28:19,808 INFO L273 TraceCheckUtils]: 13: Hoare triple {1049#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1053#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:28:19,813 INFO L273 TraceCheckUtils]: 14: Hoare triple {1053#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1057#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:28:19,814 INFO L273 TraceCheckUtils]: 15: Hoare triple {1057#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} assume !(#memory_int[main_p1] >= 0); {999#false} is VALID [2019-05-15 10:28:19,815 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:19,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:19,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-05-15 10:28:19,815 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2019-05-15 10:28:19,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:19,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2019-05-15 10:28:19,829 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:19,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-05-15 10:28:19,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-05-15 10:28:19,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-05-15 10:28:19,831 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 15 states. [2019-05-15 10:28:20,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:20,354 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-05-15 10:28:20,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-05-15 10:28:20,354 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2019-05-15 10:28:20,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:20,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-05-15 10:28:20,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2019-05-15 10:28:20,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-05-15 10:28:20,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2019-05-15 10:28:20,357 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 19 transitions. [2019-05-15 10:28:20,373 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:20,374 INFO L225 Difference]: With dead ends: 18 [2019-05-15 10:28:20,374 INFO L226 Difference]: Without dead ends: 18 [2019-05-15 10:28:20,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-05-15 10:28:20,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-05-15 10:28:20,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-05-15 10:28:20,376 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:20,376 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2019-05-15 10:28:20,377 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2019-05-15 10:28:20,377 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2019-05-15 10:28:20,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:20,377 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-05-15 10:28:20,378 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-05-15 10:28:20,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:20,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:20,378 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2019-05-15 10:28:20,378 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2019-05-15 10:28:20,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:20,379 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-05-15 10:28:20,379 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-05-15 10:28:20,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:20,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:20,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:20,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:20,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-05-15 10:28:20,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-05-15 10:28:20,381 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-05-15 10:28:20,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:20,381 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-05-15 10:28:20,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-05-15 10:28:20,381 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-05-15 10:28:20,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-05-15 10:28:20,381 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:20,382 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1] [2019-05-15 10:28:20,382 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:20,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:20,382 INFO L82 PathProgramCache]: Analyzing trace with hash -767972926, now seen corresponding path program 13 times [2019-05-15 10:28:20,383 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:20,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:20,400 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 15 conjunts are in the unsatisfiable core [2019-05-15 10:28:20,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:20,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:20,428 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,428 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,433 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:20,433 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,433 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:20,435 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:20,435 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_98|]. (= (store |v_#memory_int_98| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:28:20,435 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:20,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 16 treesize of output 11 [2019-05-15 10:28:20,461 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,463 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:20,463 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,463 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:20,471 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:20,471 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_99|]. (let ((.cse0 (select |v_#memory_int_99| ULTIMATE.start_main_p1))) (and (= 0 .cse0) (= (store |v_#memory_int_99| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:20,471 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:20,485 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:20,486 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,489 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:20,489 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,490 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:20,498 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:20,498 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_100|]. (let ((.cse0 (select |v_#memory_int_100| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_100| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 1))) [2019-05-15 10:28:20,498 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:20,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:20,514 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,516 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:20,516 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,516 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:20,523 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:20,524 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_101|]. (let ((.cse0 (select |v_#memory_int_101| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_101| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 2 .cse0))) [2019-05-15 10:28:20,524 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:28:20,554 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:20,555 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,557 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:20,557 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,558 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:20,575 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:20,576 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_102|]. (let ((.cse0 (select |v_#memory_int_102| ULTIMATE.start_main_p1))) (and (= 3 .cse0) (= |#memory_int| (store |v_#memory_int_102| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:20,576 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:28:20,599 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:20,600 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,602 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:20,603 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,603 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:20,610 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:20,611 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_103|]. (let ((.cse0 (select |v_#memory_int_103| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_103| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 4 .cse0))) [2019-05-15 10:28:20,611 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:28:20,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:20,626 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,628 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:20,629 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,629 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:20,637 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:20,637 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_104|]. (let ((.cse0 (select |v_#memory_int_104| ULTIMATE.start_main_p1))) (and (= 5 .cse0) (= |#memory_int| (store |v_#memory_int_104| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:20,637 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:28:20,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 16 treesize of output 11 [2019-05-15 10:28:20,656 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,658 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:20,658 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,659 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:20,665 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:20,665 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_105|]. (let ((.cse0 (select |v_#memory_int_105| ULTIMATE.start_main_p1))) (and (= .cse0 6) (= |#memory_int| (store |v_#memory_int_105| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:20,665 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:28:20,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 16 treesize of output 11 [2019-05-15 10:28:20,698 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,700 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:20,700 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,700 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:20,706 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:20,706 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_106|]. (let ((.cse0 (select |v_#memory_int_106| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_106| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 7 .cse0))) [2019-05-15 10:28:20,706 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:28:20,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 16 treesize of output 11 [2019-05-15 10:28:20,725 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,728 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:20,728 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,728 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:20,736 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:20,737 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_107|]. (let ((.cse0 (select |v_#memory_int_107| ULTIMATE.start_main_p1))) (and (= 8 .cse0) (= |#memory_int| (store |v_#memory_int_107| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:20,737 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:28:20,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:20,756 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,758 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:20,759 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,759 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:20,766 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:20,766 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_108|]. (let ((.cse0 (select |v_#memory_int_108| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_108| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 9 .cse0))) [2019-05-15 10:28:20,766 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:28: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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:20,790 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,791 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:20,792 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,792 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:20,798 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:20,798 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_109|]. (let ((.cse0 (select |v_#memory_int_109| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_109| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 10 .cse0))) [2019-05-15 10:28:20,798 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:28:20,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 16 treesize of output 11 [2019-05-15 10:28:20,824 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,827 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:20,827 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,827 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:20,835 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:20,836 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_110|]. (let ((.cse0 (select |v_#memory_int_110| ULTIMATE.start_main_p1))) (and (= .cse0 11) (= (store |v_#memory_int_110| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:20,836 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:28:20,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 16 treesize of output 11 [2019-05-15 10:28:20,862 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,864 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:20,864 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,864 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:20,871 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:20,871 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_111|]. (let ((.cse0 (select |v_#memory_int_111| ULTIMATE.start_main_p1))) (and (= .cse0 12) (= (store |v_#memory_int_111| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:20,871 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:28:20,888 INFO L273 TraceCheckUtils]: 0: Hoare triple {1132#true} havoc main_p1; {1132#true} is VALID [2019-05-15 10:28:20,888 INFO L273 TraceCheckUtils]: 1: Hoare triple {1132#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {1132#true} is VALID [2019-05-15 10:28:20,889 INFO L273 TraceCheckUtils]: 2: Hoare triple {1132#true} #memory_int := #memory_int[main_p1 := 0]; {1143#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:20,890 INFO L273 TraceCheckUtils]: 3: Hoare triple {1143#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1147#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:20,891 INFO L273 TraceCheckUtils]: 4: Hoare triple {1147#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1151#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:20,892 INFO L273 TraceCheckUtils]: 5: Hoare triple {1151#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1155#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:28:20,893 INFO L273 TraceCheckUtils]: 6: Hoare triple {1155#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1159#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:28:20,894 INFO L273 TraceCheckUtils]: 7: Hoare triple {1159#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1163#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:28:20,894 INFO L273 TraceCheckUtils]: 8: Hoare triple {1163#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1167#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:28:20,895 INFO L273 TraceCheckUtils]: 9: Hoare triple {1167#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1171#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:28:20,896 INFO L273 TraceCheckUtils]: 10: Hoare triple {1171#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1175#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:28:20,897 INFO L273 TraceCheckUtils]: 11: Hoare triple {1175#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1179#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:28:20,898 INFO L273 TraceCheckUtils]: 12: Hoare triple {1179#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1183#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:28:20,899 INFO L273 TraceCheckUtils]: 13: Hoare triple {1183#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1187#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:28:20,900 INFO L273 TraceCheckUtils]: 14: Hoare triple {1187#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1191#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:28:20,901 INFO L273 TraceCheckUtils]: 15: Hoare triple {1191#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1195#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:28:20,902 INFO L273 TraceCheckUtils]: 16: Hoare triple {1195#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} assume !(#memory_int[main_p1] >= 0); {1133#false} is VALID [2019-05-15 10:28:20,903 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:20,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:20,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-05-15 10:28:20,904 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2019-05-15 10:28:20,904 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:20,904 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2019-05-15 10:28:20,919 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:20,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-05-15 10:28:20,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-05-15 10:28:20,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-05-15 10:28:20,921 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 16 states. [2019-05-15 10:28:21,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:21,492 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-05-15 10:28:21,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-05-15 10:28:21,492 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2019-05-15 10:28:21,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:21,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-05-15 10:28:21,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2019-05-15 10:28:21,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-05-15 10:28:21,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2019-05-15 10:28:21,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 20 transitions. [2019-05-15 10:28:21,513 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:21,514 INFO L225 Difference]: With dead ends: 19 [2019-05-15 10:28:21,514 INFO L226 Difference]: Without dead ends: 19 [2019-05-15 10:28:21,515 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-05-15 10:28:21,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-05-15 10:28:21,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-05-15 10:28:21,517 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:21,517 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2019-05-15 10:28:21,517 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2019-05-15 10:28:21,517 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2019-05-15 10:28:21,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:21,518 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-05-15 10:28:21,518 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-05-15 10:28:21,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:21,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:21,519 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2019-05-15 10:28:21,519 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2019-05-15 10:28:21,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:21,520 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-05-15 10:28:21,520 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-05-15 10:28:21,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:21,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:21,520 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:21,520 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:21,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-05-15 10:28:21,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-05-15 10:28:21,521 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-05-15 10:28:21,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:21,521 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-05-15 10:28:21,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-05-15 10:28:21,522 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-05-15 10:28:21,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-05-15 10:28:21,522 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:21,522 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1] [2019-05-15 10:28:21,522 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:21,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:21,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1962643016, now seen corresponding path program 14 times [2019-05-15 10:28:21,524 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:21,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:21,541 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 16 conjunts are in the unsatisfiable core [2019-05-15 10:28:21,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:21,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:21,569 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:21,569 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:21,571 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:21,571 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:21,571 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:21,573 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:21,573 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_112|]. (= (store |v_#memory_int_112| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:28:21,574 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:21,588 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:21,589 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:21,591 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:21,592 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:21,592 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:21,600 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:21,601 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_113|]. (let ((.cse0 (select |v_#memory_int_113| ULTIMATE.start_main_p1))) (and (= .cse0 0) (= |#memory_int| (store |v_#memory_int_113| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:21,601 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:21,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 16 treesize of output 11 [2019-05-15 10:28:21,618 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:21,620 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:21,620 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:21,621 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:21,629 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:21,629 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_114|]. (let ((.cse0 (select |v_#memory_int_114| ULTIMATE.start_main_p1))) (and (= .cse0 1) (= (store |v_#memory_int_114| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:21,629 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:21,643 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:21,644 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:21,647 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:21,647 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:21,647 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:21,656 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:21,656 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_115|]. (let ((.cse0 (select |v_#memory_int_115| ULTIMATE.start_main_p1))) (and (= 2 .cse0) (= (store |v_#memory_int_115| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:21,656 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:28:21,682 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:21,683 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:21,688 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:21,688 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:21,688 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:21,694 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:21,694 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_116|]. (let ((.cse0 (select |v_#memory_int_116| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_116| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 3 .cse0))) [2019-05-15 10:28:21,694 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:28:21,739 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:21,741 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:21,745 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:21,745 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:21,745 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:21,751 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:21,751 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_117|]. (let ((.cse0 (select |v_#memory_int_117| ULTIMATE.start_main_p1))) (and (= 4 .cse0) (= |#memory_int| (store |v_#memory_int_117| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:21,752 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:28:21,798 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:21,799 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:21,801 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:21,801 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:21,802 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:21,810 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:21,810 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_118|]. (let ((.cse0 (select |v_#memory_int_118| ULTIMATE.start_main_p1))) (and (= .cse0 5) (= |#memory_int| (store |v_#memory_int_118| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:21,810 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:28:21,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:21,845 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:21,850 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:21,850 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:21,850 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:21,857 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:21,857 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_119|]. (let ((.cse0 (select |v_#memory_int_119| ULTIMATE.start_main_p1))) (and (= 6 .cse0) (= (store |v_#memory_int_119| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:21,857 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:28:21,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 16 treesize of output 11 [2019-05-15 10:28:21,893 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:21,895 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:21,895 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:21,895 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:21,902 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:21,903 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_120|]. (let ((.cse0 (select |v_#memory_int_120| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_120| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 7))) [2019-05-15 10:28:21,903 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:28:21,963 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:21,963 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:21,965 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:21,966 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:21,966 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:21,973 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:21,973 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_121|]. (let ((.cse0 (select |v_#memory_int_121| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_121| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 8))) [2019-05-15 10:28:21,973 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:28:22,006 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:22,007 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:22,012 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:22,012 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:22,012 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:22,019 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:22,019 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_122|]. (let ((.cse0 (select |v_#memory_int_122| ULTIMATE.start_main_p1))) (and (= .cse0 9) (= (store |v_#memory_int_122| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:22,019 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:28:22,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:22,081 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:22,086 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:22,086 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:22,086 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:22,094 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:22,094 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_123|]. (let ((.cse0 (select |v_#memory_int_123| ULTIMATE.start_main_p1))) (and (= .cse0 10) (= |#memory_int| (store |v_#memory_int_123| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:22,094 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:28:22,119 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:22,120 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:22,122 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:22,122 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:22,122 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:22,130 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:22,131 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_124|]. (let ((.cse0 (select |v_#memory_int_124| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_124| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 11 .cse0))) [2019-05-15 10:28:22,131 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:28:22,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 16 treesize of output 11 [2019-05-15 10:28:22,156 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:22,158 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:22,159 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:22,159 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:22,166 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:22,166 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_125|]. (let ((.cse0 (select |v_#memory_int_125| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_125| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 12))) [2019-05-15 10:28:22,166 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:28:22,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 16 treesize of output 11 [2019-05-15 10:28:22,191 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:22,199 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:22,200 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:22,200 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:22,206 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:22,206 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_126|]. (let ((.cse0 (select |v_#memory_int_126| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_126| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 13))) [2019-05-15 10:28:22,206 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:28:22,224 INFO L273 TraceCheckUtils]: 0: Hoare triple {1274#true} havoc main_p1; {1274#true} is VALID [2019-05-15 10:28:22,225 INFO L273 TraceCheckUtils]: 1: Hoare triple {1274#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {1274#true} is VALID [2019-05-15 10:28:22,225 INFO L273 TraceCheckUtils]: 2: Hoare triple {1274#true} #memory_int := #memory_int[main_p1 := 0]; {1285#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:22,226 INFO L273 TraceCheckUtils]: 3: Hoare triple {1285#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1289#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:22,227 INFO L273 TraceCheckUtils]: 4: Hoare triple {1289#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1293#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:22,227 INFO L273 TraceCheckUtils]: 5: Hoare triple {1293#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1297#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:28:22,228 INFO L273 TraceCheckUtils]: 6: Hoare triple {1297#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1301#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:28:22,228 INFO L273 TraceCheckUtils]: 7: Hoare triple {1301#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1305#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:28:22,229 INFO L273 TraceCheckUtils]: 8: Hoare triple {1305#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1309#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:28:22,230 INFO L273 TraceCheckUtils]: 9: Hoare triple {1309#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1313#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:28:22,231 INFO L273 TraceCheckUtils]: 10: Hoare triple {1313#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1317#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:28:22,232 INFO L273 TraceCheckUtils]: 11: Hoare triple {1317#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1321#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:28:22,233 INFO L273 TraceCheckUtils]: 12: Hoare triple {1321#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1325#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:28:22,234 INFO L273 TraceCheckUtils]: 13: Hoare triple {1325#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1329#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:28:22,235 INFO L273 TraceCheckUtils]: 14: Hoare triple {1329#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1333#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:28:22,236 INFO L273 TraceCheckUtils]: 15: Hoare triple {1333#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1337#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:28:22,237 INFO L273 TraceCheckUtils]: 16: Hoare triple {1337#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1341#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:28:22,238 INFO L273 TraceCheckUtils]: 17: Hoare triple {1341#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} assume !(#memory_int[main_p1] >= 0); {1275#false} is VALID [2019-05-15 10:28:22,240 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:22,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:22,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-05-15 10:28:22,241 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2019-05-15 10:28:22,241 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:22,241 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2019-05-15 10:28:22,261 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:22,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-05-15 10:28:22,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-05-15 10:28:22,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-05-15 10:28:22,262 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 17 states. [2019-05-15 10:28:22,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:22,868 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-05-15 10:28:22,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-05-15 10:28:22,868 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2019-05-15 10:28:22,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:22,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-05-15 10:28:22,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-05-15 10:28:22,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-05-15 10:28:22,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-05-15 10:28:22,870 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 21 transitions. [2019-05-15 10:28:22,893 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:22,894 INFO L225 Difference]: With dead ends: 20 [2019-05-15 10:28:22,894 INFO L226 Difference]: Without dead ends: 20 [2019-05-15 10:28:22,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-05-15 10:28:22,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-05-15 10:28:22,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-05-15 10:28:22,897 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:22,897 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2019-05-15 10:28:22,897 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2019-05-15 10:28:22,897 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2019-05-15 10:28:22,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:22,898 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-05-15 10:28:22,898 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-05-15 10:28:22,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:22,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:22,899 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2019-05-15 10:28:22,899 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2019-05-15 10:28:22,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:22,900 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-05-15 10:28:22,900 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-05-15 10:28:22,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:22,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:22,900 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:22,900 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:22,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-05-15 10:28:22,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-05-15 10:28:22,901 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-05-15 10:28:22,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:22,901 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-05-15 10:28:22,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-05-15 10:28:22,902 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-05-15 10:28:22,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-05-15 10:28:22,902 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:22,902 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1] [2019-05-15 10:28:22,902 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:22,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:22,903 INFO L82 PathProgramCache]: Analyzing trace with hash 712391298, now seen corresponding path program 15 times [2019-05-15 10:28:22,903 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:22,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:22,919 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 17 conjunts are in the unsatisfiable core [2019-05-15 10:28:22,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:22,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:23,074 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:23,075 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,109 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:23,109 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,110 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:23,124 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:23,124 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_127|]. (= |#memory_int| (store |v_#memory_int_127| ULTIMATE.start_main_p1 0)) [2019-05-15 10:28:23,125 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:23,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 16 treesize of output 11 [2019-05-15 10:28:23,288 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,289 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:23,289 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,289 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:23,295 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:23,295 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_128|]. (let ((.cse0 (select |v_#memory_int_128| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_128| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 0))) [2019-05-15 10:28:23,295 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:23,309 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:23,310 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,312 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:23,313 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,313 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:23,331 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:23,331 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_129|]. (let ((.cse0 (select |v_#memory_int_129| ULTIMATE.start_main_p1))) (and (= .cse0 1) (= (store |v_#memory_int_129| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:23,331 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:23,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 16 treesize of output 11 [2019-05-15 10:28:23,344 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,345 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:23,346 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,346 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:23,352 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:23,352 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_130|]. (let ((.cse0 (select |v_#memory_int_130| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_130| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 2 .cse0))) [2019-05-15 10:28:23,352 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:28:23,375 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:23,376 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,378 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:23,378 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,378 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:23,384 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:23,385 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_131|]. (let ((.cse0 (select |v_#memory_int_131| ULTIMATE.start_main_p1))) (and (= .cse0 3) (= (store |v_#memory_int_131| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:23,385 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:28:23,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 16 treesize of output 11 [2019-05-15 10:28:23,401 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,402 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:23,402 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,402 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:23,410 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:23,410 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_132|]. (let ((.cse0 (select |v_#memory_int_132| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_132| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 4))) [2019-05-15 10:28:23,410 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:28:23,425 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:23,426 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,429 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:23,429 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,429 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:23,436 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:23,436 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_133|]. (let ((.cse0 (select |v_#memory_int_133| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_133| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 5))) [2019-05-15 10:28:23,436 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:28:23,464 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:23,467 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,474 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:23,474 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,474 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:23,481 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:23,482 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_134|]. (let ((.cse0 (select |v_#memory_int_134| ULTIMATE.start_main_p1))) (and (= 6 .cse0) (= |#memory_int| (store |v_#memory_int_134| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:23,482 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:28:23,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 16 treesize of output 11 [2019-05-15 10:28:23,509 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,510 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:23,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:23,511 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:23,516 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:23,517 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_135|]. (let ((.cse0 (select |v_#memory_int_135| ULTIMATE.start_main_p1))) (and (= .cse0 7) (= (store |v_#memory_int_135| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:23,517 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:28:23,533 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:23,534 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,536 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:23,537 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,537 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:23,544 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:23,544 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_136|]. (let ((.cse0 (select |v_#memory_int_136| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_136| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 8))) [2019-05-15 10:28:23,544 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:28:23,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:23,562 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,568 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:23,569 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,569 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:23,574 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:23,575 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_137|]. (let ((.cse0 (select |v_#memory_int_137| ULTIMATE.start_main_p1))) (and (= .cse0 9) (= |#memory_int| (store |v_#memory_int_137| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:23,575 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:28:23,593 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:23,594 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,596 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:23,596 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,596 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:23,603 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:23,604 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_138|]. (let ((.cse0 (select |v_#memory_int_138| ULTIMATE.start_main_p1))) (and (= .cse0 10) (= |#memory_int| (store |v_#memory_int_138| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:23,604 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:28:23,621 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:23,622 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,625 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:23,625 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,625 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:23,633 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:23,633 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_139|]. (let ((.cse0 (select |v_#memory_int_139| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_139| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 11))) [2019-05-15 10:28:23,633 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:28:23,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:23,664 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,670 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:23,671 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,671 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:23,677 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:23,677 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_140|]. (let ((.cse0 (select |v_#memory_int_140| ULTIMATE.start_main_p1))) (and (= 12 .cse0) (= |#memory_int| (store |v_#memory_int_140| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:23,677 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:28:23,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 16 treesize of output 11 [2019-05-15 10:28:23,700 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,702 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:23,703 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,703 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:23,711 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:23,711 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_141|]. (let ((.cse0 (select |v_#memory_int_141| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_141| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 13 .cse0))) [2019-05-15 10:28:23,711 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:28:23,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:23,739 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,741 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:23,741 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,741 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:23,747 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:23,747 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_142|]. (let ((.cse0 (select |v_#memory_int_142| ULTIMATE.start_main_p1))) (and (= 14 .cse0) (= (store |v_#memory_int_142| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:23,747 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:28:23,764 INFO L273 TraceCheckUtils]: 0: Hoare triple {1424#true} havoc main_p1; {1424#true} is VALID [2019-05-15 10:28:23,764 INFO L273 TraceCheckUtils]: 1: Hoare triple {1424#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {1424#true} is VALID [2019-05-15 10:28:23,765 INFO L273 TraceCheckUtils]: 2: Hoare triple {1424#true} #memory_int := #memory_int[main_p1 := 0]; {1435#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:23,765 INFO L273 TraceCheckUtils]: 3: Hoare triple {1435#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1439#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:23,766 INFO L273 TraceCheckUtils]: 4: Hoare triple {1439#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1443#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:23,767 INFO L273 TraceCheckUtils]: 5: Hoare triple {1443#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1447#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:28:23,768 INFO L273 TraceCheckUtils]: 6: Hoare triple {1447#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1451#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:28:23,769 INFO L273 TraceCheckUtils]: 7: Hoare triple {1451#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1455#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:28:23,769 INFO L273 TraceCheckUtils]: 8: Hoare triple {1455#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1459#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:28:23,770 INFO L273 TraceCheckUtils]: 9: Hoare triple {1459#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1463#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:28:23,771 INFO L273 TraceCheckUtils]: 10: Hoare triple {1463#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1467#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:28:23,772 INFO L273 TraceCheckUtils]: 11: Hoare triple {1467#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1471#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:28:23,773 INFO L273 TraceCheckUtils]: 12: Hoare triple {1471#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1475#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:28:23,774 INFO L273 TraceCheckUtils]: 13: Hoare triple {1475#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1479#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:28:23,775 INFO L273 TraceCheckUtils]: 14: Hoare triple {1479#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1483#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:28:23,776 INFO L273 TraceCheckUtils]: 15: Hoare triple {1483#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1487#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:28:23,776 INFO L273 TraceCheckUtils]: 16: Hoare triple {1487#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1491#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:28:23,777 INFO L273 TraceCheckUtils]: 17: Hoare triple {1491#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1495#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:28:23,778 INFO L273 TraceCheckUtils]: 18: Hoare triple {1495#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} assume !(#memory_int[main_p1] >= 0); {1425#false} is VALID [2019-05-15 10:28:23,779 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:23,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:23,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-05-15 10:28:23,780 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 19 [2019-05-15 10:28:23,780 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:23,781 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2019-05-15 10:28:23,804 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:23,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-05-15 10:28:23,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-05-15 10:28:23,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-05-15 10:28:23,805 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 18 states. [2019-05-15 10:28:24,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:24,462 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-05-15 10:28:24,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-05-15 10:28:24,462 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 19 [2019-05-15 10:28:24,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:24,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-05-15 10:28:24,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2019-05-15 10:28:24,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-05-15 10:28:24,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2019-05-15 10:28:24,465 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 22 transitions. [2019-05-15 10:28:24,534 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:24,535 INFO L225 Difference]: With dead ends: 21 [2019-05-15 10:28:24,535 INFO L226 Difference]: Without dead ends: 21 [2019-05-15 10:28:24,536 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-05-15 10:28:24,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-05-15 10:28:24,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-05-15 10:28:24,538 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:24,538 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2019-05-15 10:28:24,539 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2019-05-15 10:28:24,539 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2019-05-15 10:28:24,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:24,539 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-05-15 10:28:24,540 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-05-15 10:28:24,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:24,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:24,540 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2019-05-15 10:28:24,540 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2019-05-15 10:28:24,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:24,541 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-05-15 10:28:24,541 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-05-15 10:28:24,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:24,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:24,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:24,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:24,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-05-15 10:28:24,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-05-15 10:28:24,543 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-05-15 10:28:24,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:24,543 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-05-15 10:28:24,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-05-15 10:28:24,543 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-05-15 10:28:24,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-05-15 10:28:24,544 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:24,544 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1] [2019-05-15 10:28:24,544 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:24,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:24,544 INFO L82 PathProgramCache]: Analyzing trace with hash 609293704, now seen corresponding path program 16 times [2019-05-15 10:28:24,545 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:24,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:24,560 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 18 conjunts are in the unsatisfiable core [2019-05-15 10:28:24,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:24,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:24,594 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:24,594 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:24,615 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:24,615 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:24,615 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:24,617 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:24,617 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_143|]. (= |#memory_int| (store |v_#memory_int_143| ULTIMATE.start_main_p1 0)) [2019-05-15 10:28:24,617 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:24,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 16 treesize of output 11 [2019-05-15 10:28:24,635 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:24,638 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:24,638 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:24,638 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:24,647 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:24,647 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_144|]. (let ((.cse0 (select |v_#memory_int_144| ULTIMATE.start_main_p1))) (and (= .cse0 0) (= (store |v_#memory_int_144| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:24,647 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:24,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 16 treesize of output 11 [2019-05-15 10:28:24,673 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:24,677 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:24,677 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:24,677 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:24,683 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:24,684 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_145|]. (let ((.cse0 (select |v_#memory_int_145| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_145| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 1 .cse0))) [2019-05-15 10:28:24,684 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:24,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:24,715 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:24,716 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:24,717 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:24,717 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:24,724 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:24,725 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_146|]. (let ((.cse0 (select |v_#memory_int_146| ULTIMATE.start_main_p1))) (and (= .cse0 2) (= (store |v_#memory_int_146| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:24,725 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:28:24,739 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:24,740 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:24,742 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:24,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:24,743 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:24,751 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:24,751 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_147|]. (let ((.cse0 (select |v_#memory_int_147| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_147| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 3 .cse0))) [2019-05-15 10:28:24,751 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:28:24,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 16 treesize of output 11 [2019-05-15 10:28:24,766 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:24,769 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:24,769 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:24,769 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:24,777 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:24,777 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_148|]. (let ((.cse0 (select |v_#memory_int_148| ULTIMATE.start_main_p1))) (and (= .cse0 4) (= (store |v_#memory_int_148| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:24,777 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:28:24,792 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:24,793 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:24,795 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:24,796 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:24,796 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:24,810 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:24,810 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_149|]. (let ((.cse0 (select |v_#memory_int_149| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_149| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 5 .cse0))) [2019-05-15 10:28:24,811 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:28:24,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:24,828 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:24,830 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:24,830 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:24,830 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:24,838 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:24,838 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_150|]. (let ((.cse0 (select |v_#memory_int_150| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_150| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 6))) [2019-05-15 10:28:24,838 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:28:24,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 16 treesize of output 11 [2019-05-15 10:28:24,860 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:24,862 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:24,862 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:24,862 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:24,869 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:24,869 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_151|]. (let ((.cse0 (select |v_#memory_int_151| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_151| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 7 .cse0))) [2019-05-15 10:28:24,869 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:28:24,886 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:24,887 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:24,889 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:24,889 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:24,890 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:24,897 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:24,898 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_152|]. (let ((.cse0 (select |v_#memory_int_152| ULTIMATE.start_main_p1))) (and (= 8 .cse0) (= |#memory_int| (store |v_#memory_int_152| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:24,898 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:28:24,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:24,919 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:24,920 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:24,921 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:24,921 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:24,926 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:24,927 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_153|]. (let ((.cse0 (select |v_#memory_int_153| ULTIMATE.start_main_p1))) (and (= .cse0 9) (= |#memory_int| (store |v_#memory_int_153| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:24,927 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:28:24,946 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:24,947 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:24,950 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:24,950 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:24,950 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:24,957 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:24,958 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_154|]. (let ((.cse0 (select |v_#memory_int_154| ULTIMATE.start_main_p1))) (and (= 10 .cse0) (= |#memory_int| (store |v_#memory_int_154| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:24,958 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:28:24,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:24,977 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:24,979 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:24,979 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:24,979 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:24,986 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:24,986 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_155|]. (let ((.cse0 (select |v_#memory_int_155| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_155| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 11))) [2019-05-15 10:28:24,986 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:28:25,033 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:25,034 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:25,037 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:25,037 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,037 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:25,043 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:25,044 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_156|]. (let ((.cse0 (select |v_#memory_int_156| ULTIMATE.start_main_p1))) (and (= .cse0 12) (= (store |v_#memory_int_156| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:25,044 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:28:25,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 16 treesize of output 11 [2019-05-15 10:28:25,065 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:25,068 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:25,068 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,068 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:25,075 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:25,076 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_157|]. (let ((.cse0 (select |v_#memory_int_157| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_157| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 13 .cse0))) [2019-05-15 10:28:25,076 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:28:25,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 16 treesize of output 11 [2019-05-15 10:28:25,096 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:25,098 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:25,098 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,098 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:25,106 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:25,106 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_158|]. (let ((.cse0 (select |v_#memory_int_158| ULTIMATE.start_main_p1))) (and (= .cse0 14) (= |#memory_int| (store |v_#memory_int_158| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:25,106 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:28:25,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 16 treesize of output 11 [2019-05-15 10:28:25,144 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:25,146 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:25,146 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,146 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:25,152 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:25,152 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_159|]. (let ((.cse0 (select |v_#memory_int_159| ULTIMATE.start_main_p1))) (and (= 15 .cse0) (= |#memory_int| (store |v_#memory_int_159| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:25,152 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:28:25,168 INFO L273 TraceCheckUtils]: 0: Hoare triple {1582#true} havoc main_p1; {1582#true} is VALID [2019-05-15 10:28:25,168 INFO L273 TraceCheckUtils]: 1: Hoare triple {1582#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {1582#true} is VALID [2019-05-15 10:28:25,169 INFO L273 TraceCheckUtils]: 2: Hoare triple {1582#true} #memory_int := #memory_int[main_p1 := 0]; {1593#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:25,169 INFO L273 TraceCheckUtils]: 3: Hoare triple {1593#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1597#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:25,170 INFO L273 TraceCheckUtils]: 4: Hoare triple {1597#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1601#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:25,171 INFO L273 TraceCheckUtils]: 5: Hoare triple {1601#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1605#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:28:25,172 INFO L273 TraceCheckUtils]: 6: Hoare triple {1605#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1609#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:28:25,173 INFO L273 TraceCheckUtils]: 7: Hoare triple {1609#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1613#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:28:25,175 INFO L273 TraceCheckUtils]: 8: Hoare triple {1613#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1617#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:28:25,176 INFO L273 TraceCheckUtils]: 9: Hoare triple {1617#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1621#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:28:25,177 INFO L273 TraceCheckUtils]: 10: Hoare triple {1621#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1625#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:28:25,178 INFO L273 TraceCheckUtils]: 11: Hoare triple {1625#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1629#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:28:25,178 INFO L273 TraceCheckUtils]: 12: Hoare triple {1629#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1633#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:28:25,179 INFO L273 TraceCheckUtils]: 13: Hoare triple {1633#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1637#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:28:25,179 INFO L273 TraceCheckUtils]: 14: Hoare triple {1637#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1641#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:28:25,180 INFO L273 TraceCheckUtils]: 15: Hoare triple {1641#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1645#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:28:25,180 INFO L273 TraceCheckUtils]: 16: Hoare triple {1645#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1649#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:28:25,181 INFO L273 TraceCheckUtils]: 17: Hoare triple {1649#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1653#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:28:25,182 INFO L273 TraceCheckUtils]: 18: Hoare triple {1653#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1657#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:28:25,183 INFO L273 TraceCheckUtils]: 19: Hoare triple {1657#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} assume !(#memory_int[main_p1] >= 0); {1583#false} is VALID [2019-05-15 10:28:25,184 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:25,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:25,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-05-15 10:28:25,185 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 20 [2019-05-15 10:28:25,185 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:25,185 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2019-05-15 10:28:25,202 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:25,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-05-15 10:28:25,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-05-15 10:28:25,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-05-15 10:28:25,203 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 19 states. [2019-05-15 10:28:25,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:25,924 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-05-15 10:28:25,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-05-15 10:28:25,924 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 20 [2019-05-15 10:28:25,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:25,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-05-15 10:28:25,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2019-05-15 10:28:25,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-05-15 10:28:25,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2019-05-15 10:28:25,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 23 transitions. [2019-05-15 10:28:25,950 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:25,951 INFO L225 Difference]: With dead ends: 22 [2019-05-15 10:28:25,951 INFO L226 Difference]: Without dead ends: 22 [2019-05-15 10:28:25,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-05-15 10:28:25,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-05-15 10:28:25,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-05-15 10:28:25,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:25,953 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2019-05-15 10:28:25,953 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2019-05-15 10:28:25,953 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2019-05-15 10:28:25,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:25,954 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-05-15 10:28:25,954 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-05-15 10:28:25,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:25,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:25,954 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2019-05-15 10:28:25,955 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2019-05-15 10:28:25,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:25,955 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-05-15 10:28:25,955 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-05-15 10:28:25,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:25,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:25,956 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:25,956 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:25,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-05-15 10:28:25,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-05-15 10:28:25,957 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-05-15 10:28:25,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:25,957 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-05-15 10:28:25,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-05-15 10:28:25,957 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-05-15 10:28:25,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-05-15 10:28:25,958 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:25,958 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1] [2019-05-15 10:28:25,958 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:25,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:25,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1708235586, now seen corresponding path program 17 times [2019-05-15 10:28:25,959 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:25,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:25,974 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 19 conjunts are in the unsatisfiable core [2019-05-15 10:28:25,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:25,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:26,022 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:26,022 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,028 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:26,028 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,029 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:26,030 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:26,030 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_160|]. (= (store |v_#memory_int_160| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:28:26,030 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:26,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 16 treesize of output 11 [2019-05-15 10:28:26,047 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,049 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:26,049 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,049 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:26,056 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:26,056 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_161|]. (let ((.cse0 (select |v_#memory_int_161| ULTIMATE.start_main_p1))) (and (= 0 .cse0) (= (store |v_#memory_int_161| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:26,056 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:26,070 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:26,071 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,072 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:26,073 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,073 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:26,080 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:26,081 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_162|]. (let ((.cse0 (select |v_#memory_int_162| ULTIMATE.start_main_p1))) (and (= 1 .cse0) (= (store |v_#memory_int_162| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:26,081 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:26,094 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:26,095 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,097 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:26,097 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,098 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:26,105 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:26,105 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_163|]. (let ((.cse0 (select |v_#memory_int_163| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_163| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 2 .cse0))) [2019-05-15 10:28:26,105 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:28:26,119 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:26,121 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,123 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:26,123 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,123 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:26,129 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:26,129 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_164|]. (let ((.cse0 (select |v_#memory_int_164| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_164| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 3))) [2019-05-15 10:28:26,130 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:28:26,145 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:26,146 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,147 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:26,148 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,148 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:26,155 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:26,155 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_165|]. (let ((.cse0 (select |v_#memory_int_165| ULTIMATE.start_main_p1))) (and (= .cse0 4) (= |#memory_int| (store |v_#memory_int_165| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:26,155 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:28:26,168 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:26,169 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,171 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:26,171 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,171 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:26,180 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:26,180 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_166|]. (let ((.cse0 (select |v_#memory_int_166| ULTIMATE.start_main_p1))) (and (= .cse0 5) (= |#memory_int| (store |v_#memory_int_166| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:26,180 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:28:26,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:26,216 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,218 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:26,218 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,218 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:26,224 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:26,224 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_167|]. (let ((.cse0 (select |v_#memory_int_167| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_167| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 6))) [2019-05-15 10:28:26,224 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:28:26,239 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:26,240 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,243 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:26,243 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,243 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:26,251 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:26,251 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_168|]. (let ((.cse0 (select |v_#memory_int_168| ULTIMATE.start_main_p1))) (and (= .cse0 7) (= (store |v_#memory_int_168| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:26,252 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:28:26,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 16 treesize of output 11 [2019-05-15 10:28:26,325 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,327 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:26,327 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,327 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:26,333 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:26,334 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_169|]. (let ((.cse0 (select |v_#memory_int_169| ULTIMATE.start_main_p1))) (and (= .cse0 8) (= (store |v_#memory_int_169| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:26,334 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:28:26,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:26,357 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,358 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:26,358 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,358 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:26,364 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:26,364 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_170|]. (let ((.cse0 (select |v_#memory_int_170| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_170| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 9))) [2019-05-15 10:28:26,364 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:28:26,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:26,384 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,386 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:26,387 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,387 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:26,393 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:26,393 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_171|]. (let ((.cse0 (select |v_#memory_int_171| ULTIMATE.start_main_p1))) (and (= 10 .cse0) (= (store |v_#memory_int_171| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:26,393 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:28:26,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:26,413 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,416 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:26,416 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,416 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:26,423 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:26,424 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_172|]. (let ((.cse0 (select |v_#memory_int_172| ULTIMATE.start_main_p1))) (and (= 11 .cse0) (= (store |v_#memory_int_172| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:26,424 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:28:26,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:26,444 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,446 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:26,447 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,447 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:26,454 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:26,455 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_173|]. (let ((.cse0 (select |v_#memory_int_173| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_173| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 12 .cse0))) [2019-05-15 10:28:26,455 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:28:26,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 16 treesize of output 11 [2019-05-15 10:28:26,476 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,478 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:26,478 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,479 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:26,486 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:26,487 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_174|]. (let ((.cse0 (select |v_#memory_int_174| ULTIMATE.start_main_p1))) (and (= .cse0 13) (= (store |v_#memory_int_174| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:26,487 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:28:26,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 16 treesize of output 11 [2019-05-15 10:28:26,519 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,520 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:26,521 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,521 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:26,528 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:26,528 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_175|]. (let ((.cse0 (select |v_#memory_int_175| ULTIMATE.start_main_p1))) (and (= 14 .cse0) (= |#memory_int| (store |v_#memory_int_175| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:26,528 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:28:26,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 16 treesize of output 11 [2019-05-15 10:28:26,573 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,588 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:26,588 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,588 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:26,594 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:26,594 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_176|]. (let ((.cse0 (select |v_#memory_int_176| ULTIMATE.start_main_p1))) (and (= 15 .cse0) (= (store |v_#memory_int_176| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:26,594 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:28:26,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 16 treesize of output 11 [2019-05-15 10:28:26,618 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,621 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:26,621 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,621 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:26,628 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:26,629 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_177|]. (let ((.cse0 (select |v_#memory_int_177| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_177| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 16 .cse0))) [2019-05-15 10:28:26,629 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:28:26,652 INFO L273 TraceCheckUtils]: 0: Hoare triple {1748#true} havoc main_p1; {1748#true} is VALID [2019-05-15 10:28:26,653 INFO L273 TraceCheckUtils]: 1: Hoare triple {1748#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {1748#true} is VALID [2019-05-15 10:28:26,660 INFO L273 TraceCheckUtils]: 2: Hoare triple {1748#true} #memory_int := #memory_int[main_p1 := 0]; {1759#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:26,661 INFO L273 TraceCheckUtils]: 3: Hoare triple {1759#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1763#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:26,662 INFO L273 TraceCheckUtils]: 4: Hoare triple {1763#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1767#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:26,662 INFO L273 TraceCheckUtils]: 5: Hoare triple {1767#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1771#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:28:26,663 INFO L273 TraceCheckUtils]: 6: Hoare triple {1771#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1775#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:28:26,664 INFO L273 TraceCheckUtils]: 7: Hoare triple {1775#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1779#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:28:26,665 INFO L273 TraceCheckUtils]: 8: Hoare triple {1779#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1783#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:28:26,666 INFO L273 TraceCheckUtils]: 9: Hoare triple {1783#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1787#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:28:26,667 INFO L273 TraceCheckUtils]: 10: Hoare triple {1787#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1791#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:28:26,668 INFO L273 TraceCheckUtils]: 11: Hoare triple {1791#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1795#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:28:26,669 INFO L273 TraceCheckUtils]: 12: Hoare triple {1795#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1799#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:28:26,670 INFO L273 TraceCheckUtils]: 13: Hoare triple {1799#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1803#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:28:26,671 INFO L273 TraceCheckUtils]: 14: Hoare triple {1803#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1807#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:28:26,672 INFO L273 TraceCheckUtils]: 15: Hoare triple {1807#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1811#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:28:26,672 INFO L273 TraceCheckUtils]: 16: Hoare triple {1811#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1815#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:28:26,673 INFO L273 TraceCheckUtils]: 17: Hoare triple {1815#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1819#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:28:26,674 INFO L273 TraceCheckUtils]: 18: Hoare triple {1819#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1823#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:28:26,675 INFO L273 TraceCheckUtils]: 19: Hoare triple {1823#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1827#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:28:26,676 INFO L273 TraceCheckUtils]: 20: Hoare triple {1827#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} assume !(#memory_int[main_p1] >= 0); {1749#false} is VALID [2019-05-15 10:28:26,677 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:26,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:26,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-05-15 10:28:26,678 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 21 [2019-05-15 10:28:26,679 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:26,679 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2019-05-15 10:28:26,698 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:26,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-05-15 10:28:26,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-05-15 10:28:26,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-05-15 10:28:26,699 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 20 states. [2019-05-15 10:28:27,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:27,605 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-05-15 10:28:27,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-05-15 10:28:27,605 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 21 [2019-05-15 10:28:27,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:27,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-05-15 10:28:27,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-05-15 10:28:27,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-05-15 10:28:27,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-05-15 10:28:27,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 24 transitions. [2019-05-15 10:28:27,632 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:27,633 INFO L225 Difference]: With dead ends: 23 [2019-05-15 10:28:27,633 INFO L226 Difference]: Without dead ends: 23 [2019-05-15 10:28:27,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-05-15 10:28:27,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-05-15 10:28:27,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-05-15 10:28:27,636 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:27,636 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2019-05-15 10:28:27,636 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2019-05-15 10:28:27,636 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2019-05-15 10:28:27,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:27,637 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-05-15 10:28:27,637 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-05-15 10:28:27,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:27,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:27,637 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2019-05-15 10:28:27,638 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2019-05-15 10:28:27,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:27,638 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-05-15 10:28:27,638 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-05-15 10:28:27,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:27,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:27,639 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:27,639 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:27,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-05-15 10:28:27,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-05-15 10:28:27,640 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-05-15 10:28:27,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:27,640 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-05-15 10:28:27,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-05-15 10:28:27,640 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-05-15 10:28:27,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-05-15 10:28:27,641 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:27,641 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1] [2019-05-15 10:28:27,641 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:27,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:27,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1415695560, now seen corresponding path program 18 times [2019-05-15 10:28:27,642 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:27,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:27,655 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 20 conjunts are in the unsatisfiable core [2019-05-15 10:28:27,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:27,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:27,688 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:27,688 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:27,690 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:27,691 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:27,691 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:27,693 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:27,693 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_178|]. (= (store |v_#memory_int_178| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:28:27,694 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:27,705 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:27,707 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:27,709 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:27,710 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:27,710 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:27,717 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:27,717 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_179|]. (let ((.cse0 (select |v_#memory_int_179| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_179| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 0))) [2019-05-15 10:28:27,717 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:27,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 16 treesize of output 11 [2019-05-15 10:28:27,729 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:27,731 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:27,731 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:27,731 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:27,738 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:27,739 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_180|]. (let ((.cse0 (select |v_#memory_int_180| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_180| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 1 .cse0))) [2019-05-15 10:28:27,739 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:27,750 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:27,751 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:27,753 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:27,754 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:27,754 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:27,762 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:27,762 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_181|]. (let ((.cse0 (select |v_#memory_int_181| ULTIMATE.start_main_p1))) (and (= 2 .cse0) (= |#memory_int| (store |v_#memory_int_181| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:27,762 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:28:27,776 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:27,777 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:27,781 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:27,781 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:27,781 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:27,787 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:27,788 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_182|]. (let ((.cse0 (select |v_#memory_int_182| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_182| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 3))) [2019-05-15 10:28:27,788 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:28:27,806 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:27,807 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:27,808 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:27,808 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:27,809 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:27,816 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:27,816 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_183|]. (let ((.cse0 (select |v_#memory_int_183| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_183| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 4 .cse0))) [2019-05-15 10:28:27,816 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:28:27,830 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:27,831 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:27,833 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:27,833 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:27,833 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:27,850 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:27,850 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_184|]. (let ((.cse0 (select |v_#memory_int_184| ULTIMATE.start_main_p1))) (and (= 5 .cse0) (= |#memory_int| (store |v_#memory_int_184| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:27,850 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:28:27,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:27,865 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:27,868 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:27,868 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:27,868 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:27,874 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:27,874 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_185|]. (let ((.cse0 (select |v_#memory_int_185| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_185| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 6))) [2019-05-15 10:28:27,875 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:28:27,890 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:27,891 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:27,894 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:27,894 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:27,894 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:27,902 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:27,902 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_186|]. (let ((.cse0 (select |v_#memory_int_186| ULTIMATE.start_main_p1))) (and (= .cse0 7) (= |#memory_int| (store |v_#memory_int_186| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:27,902 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:28:27,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 16 treesize of output 11 [2019-05-15 10:28:27,919 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:27,922 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:27,922 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:27,922 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:27,928 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:27,929 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_187|]. (let ((.cse0 (select |v_#memory_int_187| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_187| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 8 .cse0))) [2019-05-15 10:28:27,929 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:28:27,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:27,948 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:27,951 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:27,951 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:27,951 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:27,957 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:27,958 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_188|]. (let ((.cse0 (select |v_#memory_int_188| ULTIMATE.start_main_p1))) (and (= 9 .cse0) (= (store |v_#memory_int_188| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:27,958 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:28:27,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:27,979 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:27,981 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:27,981 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:27,982 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:27,989 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:27,990 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_189|]. (let ((.cse0 (select |v_#memory_int_189| ULTIMATE.start_main_p1))) (and (= 10 .cse0) (= |#memory_int| (store |v_#memory_int_189| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:27,990 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:28:28,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 16 treesize of output 11 [2019-05-15 10:28:28,020 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,021 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:28,022 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,022 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:28,029 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:28,029 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_190|]. (let ((.cse0 (select |v_#memory_int_190| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_190| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 11))) [2019-05-15 10:28:28,029 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:28:28,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 16 treesize of output 11 [2019-05-15 10:28:28,049 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,052 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:28,052 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,052 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:28,060 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:28,060 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_191|]. (let ((.cse0 (select |v_#memory_int_191| ULTIMATE.start_main_p1))) (and (= .cse0 12) (= (store |v_#memory_int_191| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:28,060 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:28:28,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 16 treesize of output 11 [2019-05-15 10:28:28,083 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,085 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:28,086 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,086 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:28,092 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:28,092 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_192|]. (let ((.cse0 (select |v_#memory_int_192| ULTIMATE.start_main_p1))) (and (= .cse0 13) (= |#memory_int| (store |v_#memory_int_192| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:28,093 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:28:28,147 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:28,148 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,150 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:28,150 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,150 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:28,158 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:28,158 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_193|]. (let ((.cse0 (select |v_#memory_int_193| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_193| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 14))) [2019-05-15 10:28:28,158 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:28:28,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 16 treesize of output 11 [2019-05-15 10:28:28,183 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,184 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:28,185 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,185 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:28,190 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:28,190 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_194|]. (let ((.cse0 (select |v_#memory_int_194| ULTIMATE.start_main_p1))) (and (= 15 .cse0) (= (store |v_#memory_int_194| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:28,191 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:28:28,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 16 treesize of output 11 [2019-05-15 10:28:28,234 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,236 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:28,236 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,236 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:28,244 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:28,244 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_195|]. (let ((.cse0 (select |v_#memory_int_195| ULTIMATE.start_main_p1))) (and (= 16 .cse0) (= (store |v_#memory_int_195| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:28,244 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:28:28,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 16 treesize of output 11 [2019-05-15 10:28:28,268 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,270 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:28,270 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,270 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:28,278 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:28,278 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_196|]. (let ((.cse0 (select |v_#memory_int_196| ULTIMATE.start_main_p1))) (and (= .cse0 17) (= |#memory_int| (store |v_#memory_int_196| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:28,278 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:28:28,296 INFO L273 TraceCheckUtils]: 0: Hoare triple {1922#true} havoc main_p1; {1922#true} is VALID [2019-05-15 10:28:28,297 INFO L273 TraceCheckUtils]: 1: Hoare triple {1922#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {1922#true} is VALID [2019-05-15 10:28:28,297 INFO L273 TraceCheckUtils]: 2: Hoare triple {1922#true} #memory_int := #memory_int[main_p1 := 0]; {1933#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:28,298 INFO L273 TraceCheckUtils]: 3: Hoare triple {1933#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1937#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:28,298 INFO L273 TraceCheckUtils]: 4: Hoare triple {1937#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1941#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:28,299 INFO L273 TraceCheckUtils]: 5: Hoare triple {1941#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1945#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:28:28,299 INFO L273 TraceCheckUtils]: 6: Hoare triple {1945#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1949#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:28:28,300 INFO L273 TraceCheckUtils]: 7: Hoare triple {1949#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1953#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:28:28,301 INFO L273 TraceCheckUtils]: 8: Hoare triple {1953#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1957#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:28:28,302 INFO L273 TraceCheckUtils]: 9: Hoare triple {1957#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1961#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:28:28,303 INFO L273 TraceCheckUtils]: 10: Hoare triple {1961#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1965#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:28:28,304 INFO L273 TraceCheckUtils]: 11: Hoare triple {1965#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1969#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:28:28,305 INFO L273 TraceCheckUtils]: 12: Hoare triple {1969#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1973#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:28:28,305 INFO L273 TraceCheckUtils]: 13: Hoare triple {1973#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1977#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:28:28,306 INFO L273 TraceCheckUtils]: 14: Hoare triple {1977#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1981#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:28:28,307 INFO L273 TraceCheckUtils]: 15: Hoare triple {1981#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1985#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:28:28,308 INFO L273 TraceCheckUtils]: 16: Hoare triple {1985#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1989#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:28:28,309 INFO L273 TraceCheckUtils]: 17: Hoare triple {1989#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1993#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:28:28,310 INFO L273 TraceCheckUtils]: 18: Hoare triple {1993#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1997#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:28:28,310 INFO L273 TraceCheckUtils]: 19: Hoare triple {1997#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2001#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:28:28,311 INFO L273 TraceCheckUtils]: 20: Hoare triple {2001#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2005#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:28:28,312 INFO L273 TraceCheckUtils]: 21: Hoare triple {2005#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} assume !(#memory_int[main_p1] >= 0); {1923#false} is VALID [2019-05-15 10:28:28,313 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:28,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:28,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-05-15 10:28:28,314 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 22 [2019-05-15 10:28:28,315 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:28,315 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2019-05-15 10:28:28,333 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:28,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-05-15 10:28:28,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-05-15 10:28:28,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-05-15 10:28:28,334 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 21 states. [2019-05-15 10:28:29,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:29,241 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-05-15 10:28:29,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-05-15 10:28:29,241 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 22 [2019-05-15 10:28:29,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:29,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-05-15 10:28:29,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-05-15 10:28:29,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-05-15 10:28:29,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-05-15 10:28:29,244 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 25 transitions. [2019-05-15 10:28:29,268 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:29,269 INFO L225 Difference]: With dead ends: 24 [2019-05-15 10:28:29,269 INFO L226 Difference]: Without dead ends: 24 [2019-05-15 10:28:29,270 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-05-15 10:28:29,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-05-15 10:28:29,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-05-15 10:28:29,272 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:29,272 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2019-05-15 10:28:29,272 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2019-05-15 10:28:29,272 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2019-05-15 10:28:29,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:29,273 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-05-15 10:28:29,273 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-05-15 10:28:29,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:29,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:29,273 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2019-05-15 10:28:29,274 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2019-05-15 10:28:29,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:29,274 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-05-15 10:28:29,274 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-05-15 10:28:29,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:29,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:29,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:29,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:29,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-05-15 10:28:29,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-05-15 10:28:29,275 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-05-15 10:28:29,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:29,275 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-05-15 10:28:29,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-05-15 10:28:29,276 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-05-15 10:28:29,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-05-15 10:28:29,276 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:29,276 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1] [2019-05-15 10:28:29,276 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:29,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:29,277 INFO L82 PathProgramCache]: Analyzing trace with hash 936889346, now seen corresponding path program 19 times [2019-05-15 10:28:29,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:29,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:29,291 WARN L254 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 21 conjunts are in the unsatisfiable core [2019-05-15 10:28:29,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:29,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:29,332 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:29,333 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,339 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:29,339 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,339 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:29,340 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:29,341 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_197|]. (= |#memory_int| (store |v_#memory_int_197| ULTIMATE.start_main_p1 0)) [2019-05-15 10:28:29,341 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:29,372 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:29,379 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,385 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:29,385 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,385 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:29,391 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:29,391 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_198|]. (let ((.cse0 (select |v_#memory_int_198| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_198| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 0))) [2019-05-15 10:28:29,391 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28: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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:29,413 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,416 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:29,416 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,417 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:29,424 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:29,424 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_199|]. (let ((.cse0 (select |v_#memory_int_199| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_199| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 1 .cse0))) [2019-05-15 10:28:29,424 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:29,436 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:29,437 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,439 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:29,439 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,439 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:29,448 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:29,448 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_200|]. (let ((.cse0 (select |v_#memory_int_200| ULTIMATE.start_main_p1))) (and (= .cse0 2) (= |#memory_int| (store |v_#memory_int_200| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:29,448 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:28:29,462 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:29,463 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,465 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:29,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:29,465 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:29,473 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:29,473 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_201|]. (let ((.cse0 (select |v_#memory_int_201| ULTIMATE.start_main_p1))) (and (= 3 .cse0) (= (store |v_#memory_int_201| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:29,474 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:28:29,499 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:29,506 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,508 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:29,508 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,508 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:29,514 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:29,514 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_202|]. (let ((.cse0 (select |v_#memory_int_202| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_202| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 4 .cse0))) [2019-05-15 10:28:29,514 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:28:29,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 16 treesize of output 11 [2019-05-15 10:28:29,532 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,534 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:29,535 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,535 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:29,540 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:29,541 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_203|]. (let ((.cse0 (select |v_#memory_int_203| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_203| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 5))) [2019-05-15 10:28:29,541 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:28:29,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:29,564 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,566 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:29,566 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,566 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:29,572 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:29,573 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_204|]. (let ((.cse0 (select |v_#memory_int_204| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_204| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 6))) [2019-05-15 10:28:29,573 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:28:29,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:29,593 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,595 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:29,595 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,595 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:29,601 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:29,601 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_205|]. (let ((.cse0 (select |v_#memory_int_205| ULTIMATE.start_main_p1))) (and (= 7 .cse0) (= (store |v_#memory_int_205| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:29,601 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:28:29,621 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:29,622 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,624 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:29,624 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,624 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:29,631 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:29,632 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_206|]. (let ((.cse0 (select |v_#memory_int_206| ULTIMATE.start_main_p1))) (and (= 8 .cse0) (= |#memory_int| (store |v_#memory_int_206| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:29,632 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:28:29,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 16 treesize of output 11 [2019-05-15 10:28:29,654 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,657 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:29,658 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,658 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:29,663 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:29,664 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_207|]. (let ((.cse0 (select |v_#memory_int_207| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_207| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 9 .cse0))) [2019-05-15 10:28:29,664 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:28:29,685 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:29,689 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,690 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:29,691 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,691 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:29,697 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:29,698 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_208|]. (let ((.cse0 (select |v_#memory_int_208| ULTIMATE.start_main_p1))) (and (= 10 .cse0) (= (store |v_#memory_int_208| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:29,698 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:28:29,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 16 treesize of output 11 [2019-05-15 10:28:29,719 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,721 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:29,722 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,722 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:29,730 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:29,730 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_209|]. (let ((.cse0 (select |v_#memory_int_209| ULTIMATE.start_main_p1))) (and (= 11 .cse0) (= |#memory_int| (store |v_#memory_int_209| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:29,730 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:28:29,764 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:29,765 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,768 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:29,768 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,768 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:29,775 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:29,776 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_210|]. (let ((.cse0 (select |v_#memory_int_210| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_210| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 12))) [2019-05-15 10:28:29,776 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:28:29,798 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:29,799 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,801 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:29,802 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,802 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:29,810 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:29,810 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_211|]. (let ((.cse0 (select |v_#memory_int_211| ULTIMATE.start_main_p1))) (and (= 13 .cse0) (= |#memory_int| (store |v_#memory_int_211| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:29,810 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:28:29,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:29,830 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,832 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:29,833 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,833 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:29,841 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:29,841 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_212|]. (let ((.cse0 (select |v_#memory_int_212| ULTIMATE.start_main_p1))) (and (= 14 .cse0) (= (store |v_#memory_int_212| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:29,841 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:28:29,863 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:29,864 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,866 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:29,866 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,867 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:29,874 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:29,875 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_213|]. (let ((.cse0 (select |v_#memory_int_213| ULTIMATE.start_main_p1))) (and (= .cse0 15) (= (store |v_#memory_int_213| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:29,875 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:28:29,924 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:29,925 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,927 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:29,927 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,927 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:29,937 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:29,938 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_214|]. (let ((.cse0 (select |v_#memory_int_214| ULTIMATE.start_main_p1))) (and (= 16 .cse0) (= |#memory_int| (store |v_#memory_int_214| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:29,938 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:28:29,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 16 treesize of output 11 [2019-05-15 10:28:29,970 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,972 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:29,972 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,972 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:29,979 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:29,980 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_215|]. (let ((.cse0 (select |v_#memory_int_215| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_215| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 17))) [2019-05-15 10:28:29,980 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:28:30,006 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:30,007 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:30,009 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:30,010 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:30,010 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:30,018 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:30,018 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_216|]. (let ((.cse0 (select |v_#memory_int_216| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_216| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 18))) [2019-05-15 10:28:30,019 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:28:30,040 INFO L273 TraceCheckUtils]: 0: Hoare triple {2104#true} havoc main_p1; {2104#true} is VALID [2019-05-15 10:28:30,040 INFO L273 TraceCheckUtils]: 1: Hoare triple {2104#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {2104#true} is VALID [2019-05-15 10:28:30,041 INFO L273 TraceCheckUtils]: 2: Hoare triple {2104#true} #memory_int := #memory_int[main_p1 := 0]; {2115#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:30,042 INFO L273 TraceCheckUtils]: 3: Hoare triple {2115#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2119#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:30,043 INFO L273 TraceCheckUtils]: 4: Hoare triple {2119#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2123#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:30,043 INFO L273 TraceCheckUtils]: 5: Hoare triple {2123#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2127#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:28:30,044 INFO L273 TraceCheckUtils]: 6: Hoare triple {2127#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2131#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:28:30,046 INFO L273 TraceCheckUtils]: 7: Hoare triple {2131#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2135#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:28:30,047 INFO L273 TraceCheckUtils]: 8: Hoare triple {2135#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2139#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:28:30,049 INFO L273 TraceCheckUtils]: 9: Hoare triple {2139#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2143#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:28:30,050 INFO L273 TraceCheckUtils]: 10: Hoare triple {2143#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2147#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:28:30,051 INFO L273 TraceCheckUtils]: 11: Hoare triple {2147#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2151#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:28:30,052 INFO L273 TraceCheckUtils]: 12: Hoare triple {2151#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2155#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:28:30,053 INFO L273 TraceCheckUtils]: 13: Hoare triple {2155#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2159#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:28:30,054 INFO L273 TraceCheckUtils]: 14: Hoare triple {2159#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2163#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:28:30,054 INFO L273 TraceCheckUtils]: 15: Hoare triple {2163#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2167#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:28:30,055 INFO L273 TraceCheckUtils]: 16: Hoare triple {2167#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2171#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:28:30,056 INFO L273 TraceCheckUtils]: 17: Hoare triple {2171#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2175#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:28:30,057 INFO L273 TraceCheckUtils]: 18: Hoare triple {2175#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2179#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:28:30,058 INFO L273 TraceCheckUtils]: 19: Hoare triple {2179#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2183#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:28:30,059 INFO L273 TraceCheckUtils]: 20: Hoare triple {2183#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2187#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:28:30,060 INFO L273 TraceCheckUtils]: 21: Hoare triple {2187#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2191#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:28:30,060 INFO L273 TraceCheckUtils]: 22: Hoare triple {2191#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} assume !(#memory_int[main_p1] >= 0); {2105#false} is VALID [2019-05-15 10:28:30,062 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:30,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:30,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-05-15 10:28:30,063 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 23 [2019-05-15 10:28:30,063 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:30,064 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2019-05-15 10:28:30,084 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:30,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-05-15 10:28:30,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-05-15 10:28:30,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-05-15 10:28:30,085 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 22 states. [2019-05-15 10:28:31,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:31,069 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-05-15 10:28:31,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-05-15 10:28:31,070 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 23 [2019-05-15 10:28:31,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:31,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-05-15 10:28:31,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-05-15 10:28:31,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-05-15 10:28:31,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-05-15 10:28:31,072 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 26 transitions. [2019-05-15 10:28:31,095 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:31,095 INFO L225 Difference]: With dead ends: 25 [2019-05-15 10:28:31,096 INFO L226 Difference]: Without dead ends: 25 [2019-05-15 10:28:31,096 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-05-15 10:28:31,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-05-15 10:28:31,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-05-15 10:28:31,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:31,098 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2019-05-15 10:28:31,098 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2019-05-15 10:28:31,098 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2019-05-15 10:28:31,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:31,099 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-05-15 10:28:31,099 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-05-15 10:28:31,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:31,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:31,099 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2019-05-15 10:28:31,099 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2019-05-15 10:28:31,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:31,100 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-05-15 10:28:31,100 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-05-15 10:28:31,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:31,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:31,100 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:31,100 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:31,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-05-15 10:28:31,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-05-15 10:28:31,101 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-05-15 10:28:31,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:31,101 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-05-15 10:28:31,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-05-15 10:28:31,101 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-05-15 10:28:31,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-05-15 10:28:31,102 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:31,102 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1] [2019-05-15 10:28:31,102 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:31,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:31,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1021201400, now seen corresponding path program 20 times [2019-05-15 10:28:31,103 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:31,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:31,114 WARN L254 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 22 conjunts are in the unsatisfiable core [2019-05-15 10:28:31,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:31,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:31,149 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:31,150 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,156 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:31,156 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,156 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:31,158 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:31,158 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_217|]. (= (store |v_#memory_int_217| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:28:31,158 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:31,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 16 treesize of output 11 [2019-05-15 10:28:31,172 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,175 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:31,175 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,175 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:31,184 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:31,185 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_218|]. (let ((.cse0 (select |v_#memory_int_218| ULTIMATE.start_main_p1))) (and (= .cse0 0) (= (store |v_#memory_int_218| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:31,185 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:31,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 16 treesize of output 11 [2019-05-15 10:28:31,203 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,204 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:31,204 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,205 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:31,211 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:31,211 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_219|]. (let ((.cse0 (select |v_#memory_int_219| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_219| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 1))) [2019-05-15 10:28:31,212 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:31,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 16 treesize of output 11 [2019-05-15 10:28:31,232 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,234 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:31,234 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,234 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:31,241 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:31,241 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_220|]. (let ((.cse0 (select |v_#memory_int_220| ULTIMATE.start_main_p1))) (and (= 2 .cse0) (= (store |v_#memory_int_220| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:31,241 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:28:31,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 16 treesize of output 11 [2019-05-15 10:28:31,257 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,260 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:31,260 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,260 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:31,266 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:31,266 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_221|]. (let ((.cse0 (select |v_#memory_int_221| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_221| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 3))) [2019-05-15 10:28:31,266 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:28:31,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:31,280 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,282 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:31,282 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,282 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:31,290 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:31,290 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_222|]. (let ((.cse0 (select |v_#memory_int_222| ULTIMATE.start_main_p1))) (and (= .cse0 4) (= (store |v_#memory_int_222| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:31,290 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:28:31,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 16 treesize of output 11 [2019-05-15 10:28:31,305 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,307 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:31,307 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,307 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:31,312 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:31,312 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_223|]. (let ((.cse0 (select |v_#memory_int_223| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_223| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 5 .cse0))) [2019-05-15 10:28:31,313 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:28:31,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 16 treesize of output 11 [2019-05-15 10:28:31,343 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,357 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:31,357 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,357 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:31,363 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:31,363 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_224|]. (let ((.cse0 (select |v_#memory_int_224| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_224| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 6))) [2019-05-15 10:28:31,363 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:28:31,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 16 treesize of output 11 [2019-05-15 10:28:31,382 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,384 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:31,384 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,384 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:31,392 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:31,392 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_225|]. (let ((.cse0 (select |v_#memory_int_225| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_225| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 7 .cse0))) [2019-05-15 10:28:31,392 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:28:31,407 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:31,408 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,411 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:31,411 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,411 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:31,419 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:31,419 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_226|]. (let ((.cse0 (select |v_#memory_int_226| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_226| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 8))) [2019-05-15 10:28:31,419 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:28:31,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:31,439 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:31,441 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,441 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:31,449 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:31,449 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_227|]. (let ((.cse0 (select |v_#memory_int_227| ULTIMATE.start_main_p1))) (and (= .cse0 9) (= |#memory_int| (store |v_#memory_int_227| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:31,449 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:28:31,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:31,486 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,492 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:31,492 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,492 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:31,498 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:31,499 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_228|]. (let ((.cse0 (select |v_#memory_int_228| ULTIMATE.start_main_p1))) (and (= 10 .cse0) (= |#memory_int| (store |v_#memory_int_228| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:31,499 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:28:31,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 16 treesize of output 11 [2019-05-15 10:28:31,523 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,525 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:31,525 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,525 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:31,532 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:31,533 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_229|]. (let ((.cse0 (select |v_#memory_int_229| ULTIMATE.start_main_p1))) (and (= .cse0 11) (= |#memory_int| (store |v_#memory_int_229| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:31,533 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:28:31,554 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:31,555 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,558 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:31,558 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,558 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:31,566 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:31,567 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_230|]. (let ((.cse0 (select |v_#memory_int_230| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_230| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 12 .cse0))) [2019-05-15 10:28:31,567 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:28:31,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:31,592 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,594 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:31,594 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,595 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:31,603 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:31,603 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_231|]. (let ((.cse0 (select |v_#memory_int_231| ULTIMATE.start_main_p1))) (and (= .cse0 13) (= (store |v_#memory_int_231| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:31,603 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:28:31,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:31,625 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,628 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:31,638 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,638 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:31,644 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:31,644 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_232|]. (let ((.cse0 (select |v_#memory_int_232| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_232| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 14))) [2019-05-15 10:28:31,644 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:28:31,668 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:31,669 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,671 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:31,671 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,671 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:31,680 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:31,680 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_233|]. (let ((.cse0 (select |v_#memory_int_233| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_233| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 15 .cse0))) [2019-05-15 10:28:31,680 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:28:31,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 16 treesize of output 11 [2019-05-15 10:28:31,739 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,741 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:31,742 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,742 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:31,748 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:31,748 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_234|]. (let ((.cse0 (select |v_#memory_int_234| ULTIMATE.start_main_p1))) (and (= 16 .cse0) (= |#memory_int| (store |v_#memory_int_234| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:31,748 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:28:31,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 16 treesize of output 11 [2019-05-15 10:28:31,798 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,800 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:31,801 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,801 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:31,807 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:31,807 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_235|]. (let ((.cse0 (select |v_#memory_int_235| ULTIMATE.start_main_p1))) (and (= 17 .cse0) (= (store |v_#memory_int_235| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:31,807 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:28:31,831 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:31,832 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,834 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:31,834 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,835 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:31,843 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:31,843 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_236|]. (let ((.cse0 (select |v_#memory_int_236| ULTIMATE.start_main_p1))) (and (= .cse0 18) (= (store |v_#memory_int_236| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:31,843 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:28:31,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 16 treesize of output 11 [2019-05-15 10:28:31,871 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,873 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:31,874 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,874 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:31,881 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:31,881 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_237|]. (let ((.cse0 (select |v_#memory_int_237| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_237| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 19 .cse0))) [2019-05-15 10:28:31,882 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:28:31,902 INFO L273 TraceCheckUtils]: 0: Hoare triple {2294#true} havoc main_p1; {2294#true} is VALID [2019-05-15 10:28:31,902 INFO L273 TraceCheckUtils]: 1: Hoare triple {2294#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {2294#true} is VALID [2019-05-15 10:28:31,903 INFO L273 TraceCheckUtils]: 2: Hoare triple {2294#true} #memory_int := #memory_int[main_p1 := 0]; {2305#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:31,906 INFO L273 TraceCheckUtils]: 3: Hoare triple {2305#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2309#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:31,907 INFO L273 TraceCheckUtils]: 4: Hoare triple {2309#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2313#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:31,909 INFO L273 TraceCheckUtils]: 5: Hoare triple {2313#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2317#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:28:31,910 INFO L273 TraceCheckUtils]: 6: Hoare triple {2317#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2321#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:28:31,914 INFO L273 TraceCheckUtils]: 7: Hoare triple {2321#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2325#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:28:31,915 INFO L273 TraceCheckUtils]: 8: Hoare triple {2325#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2329#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:28:31,916 INFO L273 TraceCheckUtils]: 9: Hoare triple {2329#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2333#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:28:31,916 INFO L273 TraceCheckUtils]: 10: Hoare triple {2333#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2337#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:28:31,917 INFO L273 TraceCheckUtils]: 11: Hoare triple {2337#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2341#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:28:31,917 INFO L273 TraceCheckUtils]: 12: Hoare triple {2341#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2345#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:28:31,919 INFO L273 TraceCheckUtils]: 13: Hoare triple {2345#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2349#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:28:31,920 INFO L273 TraceCheckUtils]: 14: Hoare triple {2349#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2353#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:28:31,921 INFO L273 TraceCheckUtils]: 15: Hoare triple {2353#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2357#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:28:31,921 INFO L273 TraceCheckUtils]: 16: Hoare triple {2357#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2361#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:28:31,923 INFO L273 TraceCheckUtils]: 17: Hoare triple {2361#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2365#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:28:31,925 INFO L273 TraceCheckUtils]: 18: Hoare triple {2365#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2369#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:28:31,925 INFO L273 TraceCheckUtils]: 19: Hoare triple {2369#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2373#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:28:31,927 INFO L273 TraceCheckUtils]: 20: Hoare triple {2373#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2377#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:28:31,927 INFO L273 TraceCheckUtils]: 21: Hoare triple {2377#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2381#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:28:31,929 INFO L273 TraceCheckUtils]: 22: Hoare triple {2381#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2385#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:28:31,931 INFO L273 TraceCheckUtils]: 23: Hoare triple {2385#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} assume !(#memory_int[main_p1] >= 0); {2295#false} is VALID [2019-05-15 10:28:31,932 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:31,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:31,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-05-15 10:28:31,932 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 24 [2019-05-15 10:28:31,933 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:31,933 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2019-05-15 10:28:31,965 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:31,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-05-15 10:28:31,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-05-15 10:28:31,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-05-15 10:28:31,966 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 23 states. [2019-05-15 10:28:33,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:33,393 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-05-15 10:28:33,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-05-15 10:28:33,393 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 24 [2019-05-15 10:28:33,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:33,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-05-15 10:28:33,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-05-15 10:28:33,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-05-15 10:28:33,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-05-15 10:28:33,395 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 27 transitions. [2019-05-15 10:28:33,417 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:33,418 INFO L225 Difference]: With dead ends: 26 [2019-05-15 10:28:33,418 INFO L226 Difference]: Without dead ends: 26 [2019-05-15 10:28:33,419 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-05-15 10:28:33,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-05-15 10:28:33,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-05-15 10:28:33,421 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:33,421 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2019-05-15 10:28:33,421 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2019-05-15 10:28:33,421 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2019-05-15 10:28:33,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:33,422 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-05-15 10:28:33,422 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-05-15 10:28:33,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:33,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:33,423 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2019-05-15 10:28:33,423 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2019-05-15 10:28:33,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:33,424 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-05-15 10:28:33,424 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-05-15 10:28:33,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:33,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:33,424 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:33,424 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:33,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-05-15 10:28:33,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-05-15 10:28:33,425 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-05-15 10:28:33,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:33,425 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-05-15 10:28:33,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-05-15 10:28:33,426 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-05-15 10:28:33,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-05-15 10:28:33,426 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:33,426 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1] [2019-05-15 10:28:33,426 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:33,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:33,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1592472382, now seen corresponding path program 21 times [2019-05-15 10:28:33,428 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:33,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:33,440 WARN L254 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 23 conjunts are in the unsatisfiable core [2019-05-15 10:28:33,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:33,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:33,620 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:33,621 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:33,655 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:33,656 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:33,656 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:33,669 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:33,669 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_238|]. (= (store |v_#memory_int_238| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:28:33,669 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:33,789 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:33,790 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:33,792 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:33,792 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:33,793 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:33,801 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:33,801 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_239|]. (let ((.cse0 (select |v_#memory_int_239| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_239| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 0 .cse0))) [2019-05-15 10:28:33,801 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:33,813 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:33,814 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:33,816 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:33,816 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:33,816 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:33,824 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:33,824 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_240|]. (let ((.cse0 (select |v_#memory_int_240| ULTIMATE.start_main_p1))) (and (= 1 .cse0) (= (store |v_#memory_int_240| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:33,824 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:33,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 16 treesize of output 11 [2019-05-15 10:28:33,837 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:33,839 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:33,840 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:33,840 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:33,846 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:33,847 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_241|]. (let ((.cse0 (select |v_#memory_int_241| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_241| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 2 .cse0))) [2019-05-15 10:28:33,847 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:28:33,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 16 treesize of output 11 [2019-05-15 10:28:33,861 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:33,863 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:33,863 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:33,864 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:33,872 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:33,872 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_242|]. (let ((.cse0 (select |v_#memory_int_242| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_242| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 3))) [2019-05-15 10:28:33,872 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:28:33,886 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:33,887 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:33,889 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:33,889 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:33,889 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:33,896 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:33,896 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_243|]. (let ((.cse0 (select |v_#memory_int_243| ULTIMATE.start_main_p1))) (and (= .cse0 4) (= |#memory_int| (store |v_#memory_int_243| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:33,896 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:28:33,909 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:33,910 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:33,913 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:33,913 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:33,913 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:33,921 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:33,922 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_244|]. (let ((.cse0 (select |v_#memory_int_244| ULTIMATE.start_main_p1))) (and (= .cse0 5) (= (store |v_#memory_int_244| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:33,922 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:28:33,953 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:33,967 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,008 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:34,008 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,008 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:34,023 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:34,024 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_245|]. (let ((.cse0 (select |v_#memory_int_245| ULTIMATE.start_main_p1))) (and (= 6 .cse0) (= |#memory_int| (store |v_#memory_int_245| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:34,024 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:28:34,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 16 treesize of output 11 [2019-05-15 10:28:34,439 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,477 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 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 1 xjuncts. [2019-05-15 10:28:34,478 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:34,491 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:34,492 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_246|]. (let ((.cse0 (select |v_#memory_int_246| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_246| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 7))) [2019-05-15 10:28:34,492 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:28:34,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:34,607 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,608 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:34,608 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,609 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:34,616 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:34,616 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_247|]. (let ((.cse0 (select |v_#memory_int_247| ULTIMATE.start_main_p1))) (and (= .cse0 8) (= (store |v_#memory_int_247| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:34,617 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:28:34,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 16 treesize of output 11 [2019-05-15 10:28:34,635 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,637 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:34,638 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,638 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:34,644 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:34,644 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_248|]. (let ((.cse0 (select |v_#memory_int_248| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_248| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 9 .cse0))) [2019-05-15 10:28:34,645 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:28:34,662 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:34,663 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,664 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:34,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:34,665 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:34,672 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:34,673 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_249|]. (let ((.cse0 (select |v_#memory_int_249| ULTIMATE.start_main_p1))) (and (= 10 .cse0) (= |#memory_int| (store |v_#memory_int_249| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:34,673 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:28:34,691 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:34,692 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,694 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:34,694 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,695 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:34,702 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:34,703 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_250|]. (let ((.cse0 (select |v_#memory_int_250| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_250| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 11))) [2019-05-15 10:28:34,703 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:28:34,723 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:34,724 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,726 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:34,727 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,727 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:34,735 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:34,735 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_251|]. (let ((.cse0 (select |v_#memory_int_251| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_251| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 12 .cse0))) [2019-05-15 10:28:34,735 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:28:34,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:34,758 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,760 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:34,760 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,761 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:34,768 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:34,769 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_252|]. (let ((.cse0 (select |v_#memory_int_252| ULTIMATE.start_main_p1))) (and (= .cse0 13) (= |#memory_int| (store |v_#memory_int_252| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:34,769 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:28:34,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 16 treesize of output 11 [2019-05-15 10:28:34,825 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,827 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:34,828 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,828 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:34,835 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:34,835 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_253|]. (let ((.cse0 (select |v_#memory_int_253| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_253| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 14))) [2019-05-15 10:28:34,836 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:28:34,863 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:34,864 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,868 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:34,868 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,869 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:34,875 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:34,876 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_254|]. (let ((.cse0 (select |v_#memory_int_254| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_254| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 15))) [2019-05-15 10:28:34,876 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:28:34,946 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:34,947 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,950 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:34,950 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,951 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:34,958 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:34,958 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_255|]. (let ((.cse0 (select |v_#memory_int_255| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_255| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 16 .cse0))) [2019-05-15 10:28:34,958 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:28:34,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 16 treesize of output 11 [2019-05-15 10:28:34,986 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,989 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:34,989 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,989 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:34,996 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:34,996 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_256|]. (let ((.cse0 (select |v_#memory_int_256| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_256| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 17 .cse0))) [2019-05-15 10:28:34,997 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:28:35,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:35,037 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:35,040 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:35,040 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:35,040 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:35,047 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:35,048 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_257|]. (let ((.cse0 (select |v_#memory_int_257| ULTIMATE.start_main_p1))) (and (= .cse0 18) (= (store |v_#memory_int_257| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:35,048 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:28:35,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 16 treesize of output 11 [2019-05-15 10:28:35,077 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:35,079 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:35,079 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:35,080 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:35,086 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:35,086 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_258|]. (let ((.cse0 (select |v_#memory_int_258| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_258| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 19 .cse0))) [2019-05-15 10:28:35,086 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:28:35,129 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:35,130 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:35,131 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:35,131 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:35,132 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:35,139 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:35,139 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_259|]. (let ((.cse0 (select |v_#memory_int_259| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_259| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 20))) [2019-05-15 10:28:35,140 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:28:35,160 INFO L273 TraceCheckUtils]: 0: Hoare triple {2492#true} havoc main_p1; {2492#true} is VALID [2019-05-15 10:28:35,161 INFO L273 TraceCheckUtils]: 1: Hoare triple {2492#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {2492#true} is VALID [2019-05-15 10:28:35,161 INFO L273 TraceCheckUtils]: 2: Hoare triple {2492#true} #memory_int := #memory_int[main_p1 := 0]; {2503#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:35,162 INFO L273 TraceCheckUtils]: 3: Hoare triple {2503#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2507#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:35,162 INFO L273 TraceCheckUtils]: 4: Hoare triple {2507#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2511#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:35,163 INFO L273 TraceCheckUtils]: 5: Hoare triple {2511#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2515#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:28:35,164 INFO L273 TraceCheckUtils]: 6: Hoare triple {2515#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2519#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:28:35,165 INFO L273 TraceCheckUtils]: 7: Hoare triple {2519#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2523#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:28:35,166 INFO L273 TraceCheckUtils]: 8: Hoare triple {2523#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2527#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:28:35,167 INFO L273 TraceCheckUtils]: 9: Hoare triple {2527#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2531#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:28:35,168 INFO L273 TraceCheckUtils]: 10: Hoare triple {2531#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2535#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:28:35,168 INFO L273 TraceCheckUtils]: 11: Hoare triple {2535#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2539#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:28:35,169 INFO L273 TraceCheckUtils]: 12: Hoare triple {2539#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2543#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:28:35,170 INFO L273 TraceCheckUtils]: 13: Hoare triple {2543#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2547#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:28:35,172 INFO L273 TraceCheckUtils]: 14: Hoare triple {2547#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2551#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:28:35,173 INFO L273 TraceCheckUtils]: 15: Hoare triple {2551#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2555#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:28:35,174 INFO L273 TraceCheckUtils]: 16: Hoare triple {2555#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2559#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:28:35,174 INFO L273 TraceCheckUtils]: 17: Hoare triple {2559#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2563#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:28:35,175 INFO L273 TraceCheckUtils]: 18: Hoare triple {2563#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2567#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:28:35,175 INFO L273 TraceCheckUtils]: 19: Hoare triple {2567#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2571#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:28:35,176 INFO L273 TraceCheckUtils]: 20: Hoare triple {2571#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2575#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:28:35,176 INFO L273 TraceCheckUtils]: 21: Hoare triple {2575#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2579#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:28:35,177 INFO L273 TraceCheckUtils]: 22: Hoare triple {2579#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2583#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:28:35,178 INFO L273 TraceCheckUtils]: 23: Hoare triple {2583#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2587#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:28:35,179 INFO L273 TraceCheckUtils]: 24: Hoare triple {2587#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} assume !(#memory_int[main_p1] >= 0); {2493#false} is VALID [2019-05-15 10:28:35,180 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:35,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:35,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-05-15 10:28:35,182 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 25 [2019-05-15 10:28:35,182 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:35,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2019-05-15 10:28:35,207 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:35,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-05-15 10:28:35,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-05-15 10:28:35,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-05-15 10:28:35,208 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 24 states. [2019-05-15 10:28:36,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:36,510 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-05-15 10:28:36,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-05-15 10:28:36,510 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 25 [2019-05-15 10:28:36,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:36,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-05-15 10:28:36,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2019-05-15 10:28:36,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-05-15 10:28:36,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2019-05-15 10:28:36,513 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 28 transitions. [2019-05-15 10:28:36,544 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:36,545 INFO L225 Difference]: With dead ends: 27 [2019-05-15 10:28:36,545 INFO L226 Difference]: Without dead ends: 27 [2019-05-15 10:28:36,546 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-05-15 10:28:36,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-05-15 10:28:36,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-05-15 10:28:36,548 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:36,548 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2019-05-15 10:28:36,548 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2019-05-15 10:28:36,548 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2019-05-15 10:28:36,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:36,549 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-05-15 10:28:36,549 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-05-15 10:28:36,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:36,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:36,549 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2019-05-15 10:28:36,549 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2019-05-15 10:28:36,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:36,550 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-05-15 10:28:36,550 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-05-15 10:28:36,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:36,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:36,551 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:36,551 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:36,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-05-15 10:28:36,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-05-15 10:28:36,552 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-05-15 10:28:36,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:36,552 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-05-15 10:28:36,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-05-15 10:28:36,552 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-05-15 10:28:36,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-05-15 10:28:36,552 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:36,553 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1] [2019-05-15 10:28:36,553 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:36,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:36,553 INFO L82 PathProgramCache]: Analyzing trace with hash -2122003640, now seen corresponding path program 22 times [2019-05-15 10:28:36,554 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:36,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:36,576 WARN L254 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 24 conjunts are in the unsatisfiable core [2019-05-15 10:28:36,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:36,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:36,606 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:36,607 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:36,611 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:36,611 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:36,611 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:36,613 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:36,613 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_260|]. (= |#memory_int| (store |v_#memory_int_260| ULTIMATE.start_main_p1 0)) [2019-05-15 10:28:36,614 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:36,632 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:36,633 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:36,636 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:36,636 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:36,636 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:36,643 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:36,644 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_261|]. (let ((.cse0 (select |v_#memory_int_261| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_261| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 0 .cse0))) [2019-05-15 10:28:36,644 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:36,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:36,672 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:36,677 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:36,677 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:36,677 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:36,683 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:36,684 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_262|]. (let ((.cse0 (select |v_#memory_int_262| ULTIMATE.start_main_p1))) (and (= .cse0 1) (= |#memory_int| (store |v_#memory_int_262| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:36,684 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:36,705 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:36,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:36,709 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:36,709 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:36,709 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:36,716 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:36,716 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_263|]. (let ((.cse0 (select |v_#memory_int_263| ULTIMATE.start_main_p1))) (and (= .cse0 2) (= (store |v_#memory_int_263| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:36,716 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:28:36,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:36,731 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:36,732 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:36,733 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:36,733 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:36,739 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:36,739 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_264|]. (let ((.cse0 (select |v_#memory_int_264| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_264| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 3))) [2019-05-15 10:28:36,739 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:28:36,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 16 treesize of output 11 [2019-05-15 10:28:36,752 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:36,754 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:36,754 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:36,754 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:36,762 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:36,762 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_265|]. (let ((.cse0 (select |v_#memory_int_265| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_265| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 4))) [2019-05-15 10:28:36,762 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:28:36,868 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:36,869 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:36,871 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:36,872 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:36,872 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:36,880 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:36,880 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_266|]. (let ((.cse0 (select |v_#memory_int_266| ULTIMATE.start_main_p1))) (and (= 5 .cse0) (= (store |v_#memory_int_266| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:36,880 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:28:36,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:36,896 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:36,898 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:36,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:36,899 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:36,906 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:36,907 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_267|]. (let ((.cse0 (select |v_#memory_int_267| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_267| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 6))) [2019-05-15 10:28:36,907 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:28:36,923 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:36,924 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:36,926 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:36,926 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:36,927 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:36,934 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:36,934 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_268|]. (let ((.cse0 (select |v_#memory_int_268| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_268| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 7 .cse0))) [2019-05-15 10:28:36,935 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:28:36,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 16 treesize of output 11 [2019-05-15 10:28:36,951 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:36,953 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:36,954 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:36,954 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:36,961 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:36,962 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_269|]. (let ((.cse0 (select |v_#memory_int_269| ULTIMATE.start_main_p1))) (and (= 8 .cse0) (= (store |v_#memory_int_269| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:36,962 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:28:36,980 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:36,981 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:36,983 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:36,983 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:36,983 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:36,991 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:36,991 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_270|]. (let ((.cse0 (select |v_#memory_int_270| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_270| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 9 .cse0))) [2019-05-15 10:28:36,991 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:28:37,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:37,010 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:37,012 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:37,012 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,012 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:37,019 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:37,019 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_271|]. (let ((.cse0 (select |v_#memory_int_271| ULTIMATE.start_main_p1))) (and (= .cse0 10) (= |#memory_int| (store |v_#memory_int_271| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:37,019 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:28:37,077 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:37,078 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:37,080 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:37,080 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,080 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:37,087 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:37,087 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_272|]. (let ((.cse0 (select |v_#memory_int_272| ULTIMATE.start_main_p1))) (and (= 11 .cse0) (= (store |v_#memory_int_272| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:37,087 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:28:37,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 16 treesize of output 11 [2019-05-15 10:28:37,157 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:37,161 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:37,161 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,161 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:37,167 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:37,167 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_273|]. (let ((.cse0 (select |v_#memory_int_273| ULTIMATE.start_main_p1))) (and (= .cse0 12) (= (store |v_#memory_int_273| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:37,167 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:28:37,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 16 treesize of output 11 [2019-05-15 10:28:37,228 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:37,232 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:37,232 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,232 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:37,238 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:37,238 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_274|]. (let ((.cse0 (select |v_#memory_int_274| ULTIMATE.start_main_p1))) (and (= .cse0 13) (= (store |v_#memory_int_274| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:37,238 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:28:37,309 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:37,314 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:37,324 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:37,324 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,324 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:37,331 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:37,332 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_275|]. (let ((.cse0 (select |v_#memory_int_275| ULTIMATE.start_main_p1))) (and (= .cse0 14) (= |#memory_int| (store |v_#memory_int_275| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:37,332 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:28:37,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 16 treesize of output 11 [2019-05-15 10:28:37,429 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:37,434 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:37,434 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,434 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:37,439 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:37,439 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_276|]. (let ((.cse0 (select |v_#memory_int_276| ULTIMATE.start_main_p1))) (and (= 15 .cse0) (= (store |v_#memory_int_276| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:37,440 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:28:37,462 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:37,463 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:37,465 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:37,466 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,466 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:37,473 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:37,474 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_277|]. (let ((.cse0 (select |v_#memory_int_277| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_277| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 16 .cse0))) [2019-05-15 10:28:37,474 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:28:37,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:37,499 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:37,502 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:37,502 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,502 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:37,518 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:37,518 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_278|]. (let ((.cse0 (select |v_#memory_int_278| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_278| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 17))) [2019-05-15 10:28:37,527 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:28:37,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 16 treesize of output 11 [2019-05-15 10:28:37,552 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:37,554 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:37,555 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,555 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:37,562 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:37,562 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_279|]. (let ((.cse0 (select |v_#memory_int_279| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_279| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 18))) [2019-05-15 10:28:37,562 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:28:37,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 16 treesize of output 11 [2019-05-15 10:28:37,588 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:37,591 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:37,591 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,591 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:37,597 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:37,598 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_280|]. (let ((.cse0 (select |v_#memory_int_280| ULTIMATE.start_main_p1))) (and (= 19 .cse0) (= |#memory_int| (store |v_#memory_int_280| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:37,598 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:28:37,622 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:37,623 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:37,626 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:37,626 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,626 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:37,636 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:37,636 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_281|]. (let ((.cse0 (select |v_#memory_int_281| ULTIMATE.start_main_p1))) (and (= .cse0 20) (= |#memory_int| (store |v_#memory_int_281| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:37,637 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:28:37,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:37,664 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:37,667 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:37,667 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,667 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:37,675 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:37,676 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_282|]. (let ((.cse0 (select |v_#memory_int_282| ULTIMATE.start_main_p1))) (and (= .cse0 21) (= (store |v_#memory_int_282| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:37,676 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:28:37,697 INFO L273 TraceCheckUtils]: 0: Hoare triple {2698#true} havoc main_p1; {2698#true} is VALID [2019-05-15 10:28:37,697 INFO L273 TraceCheckUtils]: 1: Hoare triple {2698#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {2698#true} is VALID [2019-05-15 10:28:37,698 INFO L273 TraceCheckUtils]: 2: Hoare triple {2698#true} #memory_int := #memory_int[main_p1 := 0]; {2709#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:37,698 INFO L273 TraceCheckUtils]: 3: Hoare triple {2709#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2713#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:37,699 INFO L273 TraceCheckUtils]: 4: Hoare triple {2713#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2717#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:37,699 INFO L273 TraceCheckUtils]: 5: Hoare triple {2717#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2721#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:28:37,700 INFO L273 TraceCheckUtils]: 6: Hoare triple {2721#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2725#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:28:37,700 INFO L273 TraceCheckUtils]: 7: Hoare triple {2725#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2729#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:28:37,701 INFO L273 TraceCheckUtils]: 8: Hoare triple {2729#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2733#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:28:37,702 INFO L273 TraceCheckUtils]: 9: Hoare triple {2733#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2737#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:28:37,703 INFO L273 TraceCheckUtils]: 10: Hoare triple {2737#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2741#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:28:37,704 INFO L273 TraceCheckUtils]: 11: Hoare triple {2741#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2745#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:28:37,705 INFO L273 TraceCheckUtils]: 12: Hoare triple {2745#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2749#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:28:37,706 INFO L273 TraceCheckUtils]: 13: Hoare triple {2749#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2753#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:28:37,706 INFO L273 TraceCheckUtils]: 14: Hoare triple {2753#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2757#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:28:37,707 INFO L273 TraceCheckUtils]: 15: Hoare triple {2757#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2761#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:28:37,708 INFO L273 TraceCheckUtils]: 16: Hoare triple {2761#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2765#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:28:37,709 INFO L273 TraceCheckUtils]: 17: Hoare triple {2765#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2769#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:28:37,710 INFO L273 TraceCheckUtils]: 18: Hoare triple {2769#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2773#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:28:37,711 INFO L273 TraceCheckUtils]: 19: Hoare triple {2773#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2777#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:28:37,712 INFO L273 TraceCheckUtils]: 20: Hoare triple {2777#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2781#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:28:37,713 INFO L273 TraceCheckUtils]: 21: Hoare triple {2781#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2785#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:28:37,713 INFO L273 TraceCheckUtils]: 22: Hoare triple {2785#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2789#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:28:37,714 INFO L273 TraceCheckUtils]: 23: Hoare triple {2789#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2793#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:28:37,715 INFO L273 TraceCheckUtils]: 24: Hoare triple {2793#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2797#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:28:37,716 INFO L273 TraceCheckUtils]: 25: Hoare triple {2797#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} assume !(#memory_int[main_p1] >= 0); {2699#false} is VALID [2019-05-15 10:28:37,718 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:37,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:37,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-05-15 10:28:37,720 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 26 [2019-05-15 10:28:37,720 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:37,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2019-05-15 10:28:37,770 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:37,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-05-15 10:28:37,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-05-15 10:28:37,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-05-15 10:28:37,771 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 25 states. [2019-05-15 10:28:39,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:39,601 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-05-15 10:28:39,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-05-15 10:28:39,602 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 26 [2019-05-15 10:28:39,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:39,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-05-15 10:28:39,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-05-15 10:28:39,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-05-15 10:28:39,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-05-15 10:28:39,604 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 29 transitions. [2019-05-15 10:28:39,887 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:39,888 INFO L225 Difference]: With dead ends: 28 [2019-05-15 10:28:39,888 INFO L226 Difference]: Without dead ends: 28 [2019-05-15 10:28:39,888 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-05-15 10:28:39,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-05-15 10:28:39,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-05-15 10:28:39,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:39,890 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2019-05-15 10:28:39,890 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2019-05-15 10:28:39,891 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2019-05-15 10:28:39,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:39,892 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-05-15 10:28:39,892 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-05-15 10:28:39,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:39,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:39,892 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2019-05-15 10:28:39,892 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2019-05-15 10:28:39,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:39,893 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-05-15 10:28:39,893 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-05-15 10:28:39,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:39,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:39,894 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:39,894 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:39,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-05-15 10:28:39,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-05-15 10:28:39,895 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-05-15 10:28:39,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:39,895 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-05-15 10:28:39,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-05-15 10:28:39,895 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-05-15 10:28:39,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-05-15 10:28:39,895 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:39,896 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1] [2019-05-15 10:28:39,896 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:39,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:39,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1357603454, now seen corresponding path program 23 times [2019-05-15 10:28:39,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:39,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:39,907 WARN L254 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 25 conjunts are in the unsatisfiable core [2019-05-15 10:28:39,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:39,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:39,933 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:39,933 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:39,936 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:39,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:39,937 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:39,939 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:39,939 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_283|]. (= (store |v_#memory_int_283| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:28:39,939 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:39,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:39,955 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:39,958 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:39,958 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:39,958 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:39,966 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:39,967 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_284|]. (let ((.cse0 (select |v_#memory_int_284| ULTIMATE.start_main_p1))) (and (= 0 .cse0) (= (store |v_#memory_int_284| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:39,967 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:40,070 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:40,071 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,076 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:40,076 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,076 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:40,083 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:40,083 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_285|]. (let ((.cse0 (select |v_#memory_int_285| ULTIMATE.start_main_p1))) (and (= .cse0 1) (= |#memory_int| (store |v_#memory_int_285| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:40,083 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:40,105 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:40,106 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,107 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:40,108 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,108 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:40,115 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:40,116 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_286|]. (let ((.cse0 (select |v_#memory_int_286| ULTIMATE.start_main_p1))) (and (= 2 .cse0) (= (store |v_#memory_int_286| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:40,116 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:28:40,127 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:40,128 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,130 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:40,130 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,131 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:40,148 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:40,149 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_287|]. (let ((.cse0 (select |v_#memory_int_287| ULTIMATE.start_main_p1))) (and (= 3 .cse0) (= |#memory_int| (store |v_#memory_int_287| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:40,149 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:28:40,161 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:40,162 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,164 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:40,165 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,165 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:40,171 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:40,171 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_288|]. (let ((.cse0 (select |v_#memory_int_288| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_288| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 4 .cse0))) [2019-05-15 10:28:40,171 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:28:40,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 16 treesize of output 11 [2019-05-15 10:28:40,185 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,187 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:40,187 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,187 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:40,193 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:40,194 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_289|]. (let ((.cse0 (select |v_#memory_int_289| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_289| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 5 .cse0))) [2019-05-15 10:28:40,194 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:28:40,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 16 treesize of output 11 [2019-05-15 10:28:40,211 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,213 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:40,213 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,214 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:40,222 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:40,222 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_290|]. (let ((.cse0 (select |v_#memory_int_290| ULTIMATE.start_main_p1))) (and (= 6 .cse0) (= |#memory_int| (store |v_#memory_int_290| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:40,222 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:28:40,239 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:40,241 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,243 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:40,243 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,243 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:40,249 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:40,250 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_291|]. (let ((.cse0 (select |v_#memory_int_291| ULTIMATE.start_main_p1))) (and (= .cse0 7) (= |#memory_int| (store |v_#memory_int_291| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:40,250 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:28:40,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 16 treesize of output 11 [2019-05-15 10:28:40,268 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,270 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:40,270 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,271 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:40,279 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:40,279 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_292|]. (let ((.cse0 (select |v_#memory_int_292| ULTIMATE.start_main_p1))) (and (= .cse0 8) (= |#memory_int| (store |v_#memory_int_292| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:40,279 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:28:40,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:40,298 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,301 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:40,301 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,301 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:40,308 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:40,309 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_293|]. (let ((.cse0 (select |v_#memory_int_293| ULTIMATE.start_main_p1))) (and (= .cse0 9) (= (store |v_#memory_int_293| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:40,309 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:28:40,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 16 treesize of output 11 [2019-05-15 10:28:40,329 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,331 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:40,331 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,332 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:40,340 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:40,341 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_294|]. (let ((.cse0 (select |v_#memory_int_294| ULTIMATE.start_main_p1))) (and (= 10 .cse0) (= |#memory_int| (store |v_#memory_int_294| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:40,341 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:28:40,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:40,362 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,364 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:40,364 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,365 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:40,372 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:40,372 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_295|]. (let ((.cse0 (select |v_#memory_int_295| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_295| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 11 .cse0))) [2019-05-15 10:28:40,372 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:28:40,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:40,393 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,396 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:40,396 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,396 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:40,402 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:40,402 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_296|]. (let ((.cse0 (select |v_#memory_int_296| ULTIMATE.start_main_p1))) (and (= .cse0 12) (= |#memory_int| (store |v_#memory_int_296| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:40,403 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:28:40,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 16 treesize of output 11 [2019-05-15 10:28:40,425 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,428 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:40,428 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,428 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:40,436 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:40,436 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_297|]. (let ((.cse0 (select |v_#memory_int_297| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_297| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 13))) [2019-05-15 10:28:40,436 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:28:40,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 16 treesize of output 11 [2019-05-15 10:28:40,459 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,461 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:40,461 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,461 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:40,469 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:40,469 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_298|]. (let ((.cse0 (select |v_#memory_int_298| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_298| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 14 .cse0))) [2019-05-15 10:28:40,469 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:28:40,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:40,493 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,495 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:40,495 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,495 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:40,501 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:40,501 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_299|]. (let ((.cse0 (select |v_#memory_int_299| ULTIMATE.start_main_p1))) (and (= .cse0 15) (= (store |v_#memory_int_299| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:40,501 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:28:40,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:40,525 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,527 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:40,527 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,528 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:40,535 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:40,536 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_300|]. (let ((.cse0 (select |v_#memory_int_300| ULTIMATE.start_main_p1))) (and (= 16 .cse0) (= (store |v_#memory_int_300| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:40,536 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:28:40,564 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:40,576 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,578 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:40,578 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,578 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:40,583 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:40,584 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_301|]. (let ((.cse0 (select |v_#memory_int_301| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_301| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 17 .cse0))) [2019-05-15 10:28:40,584 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:28:40,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 16 treesize of output 11 [2019-05-15 10:28:40,609 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,611 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:40,611 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,612 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:40,619 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:40,620 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_302|]. (let ((.cse0 (select |v_#memory_int_302| ULTIMATE.start_main_p1))) (and (= .cse0 18) (= (store |v_#memory_int_302| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:40,620 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:28:40,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:40,646 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,648 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:40,649 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,649 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:40,656 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:40,656 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_303|]. (let ((.cse0 (select |v_#memory_int_303| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_303| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 19 .cse0))) [2019-05-15 10:28:40,657 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:28:40,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 16 treesize of output 11 [2019-05-15 10:28:40,684 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,686 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:40,686 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,686 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:40,693 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:40,693 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_304|]. (let ((.cse0 (select |v_#memory_int_304| ULTIMATE.start_main_p1))) (and (= 20 .cse0) (= |#memory_int| (store |v_#memory_int_304| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:40,694 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:28:40,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 16 treesize of output 11 [2019-05-15 10:28:40,719 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,722 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:40,722 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,722 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:40,730 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:40,730 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_305|]. (let ((.cse0 (select |v_#memory_int_305| ULTIMATE.start_main_p1))) (and (= 21 .cse0) (= |#memory_int| (store |v_#memory_int_305| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:40,730 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:28:40,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 16 treesize of output 11 [2019-05-15 10:28:40,760 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,762 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:40,762 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,763 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:40,770 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:40,770 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_306|]. (let ((.cse0 (select |v_#memory_int_306| ULTIMATE.start_main_p1))) (and (= .cse0 22) (= |#memory_int| (store |v_#memory_int_306| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:40,770 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:28:40,792 INFO L273 TraceCheckUtils]: 0: Hoare triple {2912#true} havoc main_p1; {2912#true} is VALID [2019-05-15 10:28:40,793 INFO L273 TraceCheckUtils]: 1: Hoare triple {2912#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {2912#true} is VALID [2019-05-15 10:28:40,794 INFO L273 TraceCheckUtils]: 2: Hoare triple {2912#true} #memory_int := #memory_int[main_p1 := 0]; {2923#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:40,794 INFO L273 TraceCheckUtils]: 3: Hoare triple {2923#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2927#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:40,795 INFO L273 TraceCheckUtils]: 4: Hoare triple {2927#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2931#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:40,796 INFO L273 TraceCheckUtils]: 5: Hoare triple {2931#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2935#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:28:40,797 INFO L273 TraceCheckUtils]: 6: Hoare triple {2935#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2939#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:28:40,798 INFO L273 TraceCheckUtils]: 7: Hoare triple {2939#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2943#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:28:40,798 INFO L273 TraceCheckUtils]: 8: Hoare triple {2943#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2947#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:28:40,799 INFO L273 TraceCheckUtils]: 9: Hoare triple {2947#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2951#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:28:40,800 INFO L273 TraceCheckUtils]: 10: Hoare triple {2951#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2955#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:28:40,801 INFO L273 TraceCheckUtils]: 11: Hoare triple {2955#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2959#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:28:40,802 INFO L273 TraceCheckUtils]: 12: Hoare triple {2959#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2963#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:28:40,802 INFO L273 TraceCheckUtils]: 13: Hoare triple {2963#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2967#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:28:40,803 INFO L273 TraceCheckUtils]: 14: Hoare triple {2967#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2971#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:28:40,804 INFO L273 TraceCheckUtils]: 15: Hoare triple {2971#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2975#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:28:40,805 INFO L273 TraceCheckUtils]: 16: Hoare triple {2975#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2979#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:28:40,805 INFO L273 TraceCheckUtils]: 17: Hoare triple {2979#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2983#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:28:40,806 INFO L273 TraceCheckUtils]: 18: Hoare triple {2983#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2987#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:28:40,807 INFO L273 TraceCheckUtils]: 19: Hoare triple {2987#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2991#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:28:40,808 INFO L273 TraceCheckUtils]: 20: Hoare triple {2991#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2995#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:28:40,809 INFO L273 TraceCheckUtils]: 21: Hoare triple {2995#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2999#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:28:40,809 INFO L273 TraceCheckUtils]: 22: Hoare triple {2999#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3003#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:28:40,810 INFO L273 TraceCheckUtils]: 23: Hoare triple {3003#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3007#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:28:40,811 INFO L273 TraceCheckUtils]: 24: Hoare triple {3007#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3011#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:28:40,812 INFO L273 TraceCheckUtils]: 25: Hoare triple {3011#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3015#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:28:40,813 INFO L273 TraceCheckUtils]: 26: Hoare triple {3015#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} assume !(#memory_int[main_p1] >= 0); {2913#false} is VALID [2019-05-15 10:28:40,814 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:40,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:40,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-05-15 10:28:40,815 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 27 [2019-05-15 10:28:40,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:40,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2019-05-15 10:28:40,840 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:40,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-05-15 10:28:40,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-05-15 10:28:40,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-05-15 10:28:40,841 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 26 states. [2019-05-15 10:28:42,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:42,190 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-05-15 10:28:42,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-05-15 10:28:42,190 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 27 [2019-05-15 10:28:42,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:42,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-05-15 10:28:42,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-05-15 10:28:42,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-05-15 10:28:42,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-05-15 10:28:42,192 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 30 transitions. [2019-05-15 10:28:42,237 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:42,238 INFO L225 Difference]: With dead ends: 29 [2019-05-15 10:28:42,238 INFO L226 Difference]: Without dead ends: 29 [2019-05-15 10:28:42,239 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-05-15 10:28:42,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-05-15 10:28:42,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-05-15 10:28:42,241 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:42,241 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2019-05-15 10:28:42,241 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2019-05-15 10:28:42,241 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2019-05-15 10:28:42,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:42,242 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-05-15 10:28:42,242 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-05-15 10:28:42,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:42,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:42,243 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2019-05-15 10:28:42,243 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2019-05-15 10:28:42,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:42,243 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-05-15 10:28:42,243 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-05-15 10:28:42,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:42,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:42,244 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:42,244 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:42,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-05-15 10:28:42,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-05-15 10:28:42,245 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-05-15 10:28:42,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:42,245 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-05-15 10:28:42,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-05-15 10:28:42,245 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-05-15 10:28:42,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-05-15 10:28:42,245 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:42,246 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1] [2019-05-15 10:28:42,246 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:42,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:42,246 INFO L82 PathProgramCache]: Analyzing trace with hash 863965832, now seen corresponding path program 24 times [2019-05-15 10:28:42,247 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:42,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:42,259 WARN L254 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 26 conjunts are in the unsatisfiable core [2019-05-15 10:28:42,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:42,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:42,435 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:42,435 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,472 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:42,473 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,473 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:42,485 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:42,486 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_307|]. (= (store |v_#memory_int_307| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:28:42,486 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:42,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:42,515 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,519 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:42,519 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,520 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:42,526 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:42,527 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_308|]. (let ((.cse0 (select |v_#memory_int_308| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_308| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 0 .cse0))) [2019-05-15 10:28:42,527 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:42,546 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:42,547 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,549 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:42,549 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,549 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:42,557 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:42,557 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_309|]. (let ((.cse0 (select |v_#memory_int_309| ULTIMATE.start_main_p1))) (and (= 1 .cse0) (= |#memory_int| (store |v_#memory_int_309| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:42,557 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:42,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 16 treesize of output 11 [2019-05-15 10:28:42,572 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,573 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:42,574 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,574 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:42,580 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:42,580 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_310|]. (let ((.cse0 (select |v_#memory_int_310| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_310| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 2 .cse0))) [2019-05-15 10:28:42,580 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:28:42,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:42,592 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,594 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:42,594 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,594 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:42,601 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:42,601 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_311|]. (let ((.cse0 (select |v_#memory_int_311| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_311| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 3 .cse0))) [2019-05-15 10:28:42,601 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:28:42,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 16 treesize of output 11 [2019-05-15 10:28:42,615 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,617 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:42,617 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,618 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:42,625 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:42,625 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_312|]. (let ((.cse0 (select |v_#memory_int_312| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_312| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 4))) [2019-05-15 10:28:42,625 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:28:42,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 16 treesize of output 11 [2019-05-15 10:28:42,639 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,641 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:42,642 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,642 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:42,649 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:42,649 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_313|]. (let ((.cse0 (select |v_#memory_int_313| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_313| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 5 .cse0))) [2019-05-15 10:28:42,649 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:28:42,664 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:42,665 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,668 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:42,668 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,668 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:42,676 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:42,676 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_314|]. (let ((.cse0 (select |v_#memory_int_314| ULTIMATE.start_main_p1))) (and (= .cse0 6) (= (store |v_#memory_int_314| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:42,676 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:28:42,690 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:42,691 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,693 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:42,693 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,694 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:42,701 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:42,701 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_315|]. (let ((.cse0 (select |v_#memory_int_315| ULTIMATE.start_main_p1))) (and (= 7 .cse0) (= |#memory_int| (store |v_#memory_int_315| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:42,701 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:28:42,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:42,718 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,720 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:42,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:42,720 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:42,727 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:42,728 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_316|]. (let ((.cse0 (select |v_#memory_int_316| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_316| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 8 .cse0))) [2019-05-15 10:28:42,728 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:28:42,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 16 treesize of output 11 [2019-05-15 10:28:42,745 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,747 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:42,747 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,747 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:42,755 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:42,755 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_317|]. (let ((.cse0 (select |v_#memory_int_317| ULTIMATE.start_main_p1))) (and (= .cse0 9) (= (store |v_#memory_int_317| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:42,755 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:28:42,781 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:42,782 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,784 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:42,784 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,784 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:42,792 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:42,792 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_318|]. (let ((.cse0 (select |v_#memory_int_318| ULTIMATE.start_main_p1))) (and (= 10 .cse0) (= |#memory_int| (store |v_#memory_int_318| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:42,792 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:28:42,810 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:42,811 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,813 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:42,813 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,813 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:42,820 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:42,821 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_319|]. (let ((.cse0 (select |v_#memory_int_319| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_319| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 11 .cse0))) [2019-05-15 10:28:42,821 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:28:42,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:42,901 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,903 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:42,903 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,904 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:42,911 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:42,911 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_320|]. (let ((.cse0 (select |v_#memory_int_320| ULTIMATE.start_main_p1))) (and (= .cse0 12) (= |#memory_int| (store |v_#memory_int_320| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:42,911 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:28:42,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 16 treesize of output 11 [2019-05-15 10:28:42,932 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,934 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:42,934 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,934 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:42,942 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:42,942 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_321|]. (let ((.cse0 (select |v_#memory_int_321| ULTIMATE.start_main_p1))) (and (= 13 .cse0) (= (store |v_#memory_int_321| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:42,942 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:28:42,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 16 treesize of output 11 [2019-05-15 10:28:42,962 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,964 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:42,964 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,965 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:42,972 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:42,973 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_322|]. (let ((.cse0 (select |v_#memory_int_322| ULTIMATE.start_main_p1))) (and (= 14 .cse0) (= |#memory_int| (store |v_#memory_int_322| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:42,973 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:28:43,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 16 treesize of output 11 [2019-05-15 10:28:43,015 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:43,016 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:43,016 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,017 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:43,022 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:43,023 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_323|]. (let ((.cse0 (select |v_#memory_int_323| ULTIMATE.start_main_p1))) (and (= .cse0 15) (= (store |v_#memory_int_323| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:43,023 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:28:43,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:43,077 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:43,079 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:43,079 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,079 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:43,084 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:43,085 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_324|]. (let ((.cse0 (select |v_#memory_int_324| ULTIMATE.start_main_p1))) (and (= 16 .cse0) (= |#memory_int| (store |v_#memory_int_324| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:43,085 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:28:43,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:43,109 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:43,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:43,112 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,112 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:43,119 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:43,119 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_325|]. (let ((.cse0 (select |v_#memory_int_325| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_325| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 17))) [2019-05-15 10:28:43,119 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:28:43,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:43,201 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:43,203 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:43,204 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,204 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:43,210 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:43,210 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_326|]. (let ((.cse0 (select |v_#memory_int_326| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_326| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 18))) [2019-05-15 10:28:43,211 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:28:43,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 16 treesize of output 11 [2019-05-15 10:28:43,235 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:43,237 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:43,237 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,237 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:43,244 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:43,244 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_327|]. (let ((.cse0 (select |v_#memory_int_327| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_327| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 19))) [2019-05-15 10:28:43,244 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:28:43,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 16 treesize of output 11 [2019-05-15 10:28:43,271 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:43,273 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:43,273 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,274 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:43,281 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:43,281 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_328|]. (let ((.cse0 (select |v_#memory_int_328| ULTIMATE.start_main_p1))) (and (= .cse0 20) (= (store |v_#memory_int_328| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:43,281 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:28:43,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 16 treesize of output 11 [2019-05-15 10:28:43,309 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:43,311 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:43,311 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,312 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:43,319 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:43,319 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_329|]. (let ((.cse0 (select |v_#memory_int_329| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_329| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 21))) [2019-05-15 10:28:43,319 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:28:43,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 16 treesize of output 11 [2019-05-15 10:28:43,347 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:43,349 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:43,350 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,350 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:43,357 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:43,357 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_330|]. (let ((.cse0 (select |v_#memory_int_330| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_330| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 22))) [2019-05-15 10:28:43,357 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:28:43,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 16 treesize of output 11 [2019-05-15 10:28:43,386 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:43,388 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:43,388 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,388 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:43,396 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:43,397 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_331|]. (let ((.cse0 (select |v_#memory_int_331| ULTIMATE.start_main_p1))) (and (= .cse0 23) (= (store |v_#memory_int_331| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:43,397 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:28:43,419 INFO L273 TraceCheckUtils]: 0: Hoare triple {3134#true} havoc main_p1; {3134#true} is VALID [2019-05-15 10:28:43,419 INFO L273 TraceCheckUtils]: 1: Hoare triple {3134#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {3134#true} is VALID [2019-05-15 10:28:43,420 INFO L273 TraceCheckUtils]: 2: Hoare triple {3134#true} #memory_int := #memory_int[main_p1 := 0]; {3145#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:43,421 INFO L273 TraceCheckUtils]: 3: Hoare triple {3145#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3149#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:43,422 INFO L273 TraceCheckUtils]: 4: Hoare triple {3149#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3153#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:43,423 INFO L273 TraceCheckUtils]: 5: Hoare triple {3153#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3157#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:28:43,425 INFO L273 TraceCheckUtils]: 6: Hoare triple {3157#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3161#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:28:43,426 INFO L273 TraceCheckUtils]: 7: Hoare triple {3161#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3165#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:28:43,427 INFO L273 TraceCheckUtils]: 8: Hoare triple {3165#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3169#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:28:43,428 INFO L273 TraceCheckUtils]: 9: Hoare triple {3169#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3173#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:28:43,428 INFO L273 TraceCheckUtils]: 10: Hoare triple {3173#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3177#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:28:43,434 INFO L273 TraceCheckUtils]: 11: Hoare triple {3177#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3181#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:28:43,436 INFO L273 TraceCheckUtils]: 12: Hoare triple {3181#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3185#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:28:43,437 INFO L273 TraceCheckUtils]: 13: Hoare triple {3185#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3189#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:28:43,437 INFO L273 TraceCheckUtils]: 14: Hoare triple {3189#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3193#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:28:43,438 INFO L273 TraceCheckUtils]: 15: Hoare triple {3193#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3197#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:28:43,438 INFO L273 TraceCheckUtils]: 16: Hoare triple {3197#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3201#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:28:43,439 INFO L273 TraceCheckUtils]: 17: Hoare triple {3201#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3205#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:28:43,439 INFO L273 TraceCheckUtils]: 18: Hoare triple {3205#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3209#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:28:43,440 INFO L273 TraceCheckUtils]: 19: Hoare triple {3209#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3213#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:28:43,441 INFO L273 TraceCheckUtils]: 20: Hoare triple {3213#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3217#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:28:43,441 INFO L273 TraceCheckUtils]: 21: Hoare triple {3217#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3221#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:28:43,442 INFO L273 TraceCheckUtils]: 22: Hoare triple {3221#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3225#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:28:43,443 INFO L273 TraceCheckUtils]: 23: Hoare triple {3225#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3229#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:28:43,444 INFO L273 TraceCheckUtils]: 24: Hoare triple {3229#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3233#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:28:43,445 INFO L273 TraceCheckUtils]: 25: Hoare triple {3233#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3237#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:28:43,445 INFO L273 TraceCheckUtils]: 26: Hoare triple {3237#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3241#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:28:43,446 INFO L273 TraceCheckUtils]: 27: Hoare triple {3241#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} assume !(#memory_int[main_p1] >= 0); {3135#false} is VALID [2019-05-15 10:28:43,448 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:43,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:43,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-05-15 10:28:43,449 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 28 [2019-05-15 10:28:43,449 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:43,449 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2019-05-15 10:28:43,471 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:43,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-05-15 10:28:43,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-05-15 10:28:43,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-05-15 10:28:43,473 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 27 states. [2019-05-15 10:28:44,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:44,927 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-05-15 10:28:44,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-05-15 10:28:44,927 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 28 [2019-05-15 10:28:44,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:44,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-05-15 10:28:44,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-05-15 10:28:44,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-05-15 10:28:44,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-05-15 10:28:44,929 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 31 transitions. [2019-05-15 10:28:44,954 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:44,955 INFO L225 Difference]: With dead ends: 30 [2019-05-15 10:28:44,955 INFO L226 Difference]: Without dead ends: 30 [2019-05-15 10:28:44,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-05-15 10:28:44,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-05-15 10:28:44,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-05-15 10:28:44,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:44,957 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2019-05-15 10:28:44,957 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2019-05-15 10:28:44,957 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2019-05-15 10:28:44,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:44,958 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-05-15 10:28:44,958 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-05-15 10:28:44,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:44,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:44,958 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2019-05-15 10:28:44,958 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2019-05-15 10:28:44,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:44,959 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-05-15 10:28:44,959 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-05-15 10:28:44,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:44,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:44,960 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:44,960 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:44,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-05-15 10:28:44,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-05-15 10:28:44,961 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-05-15 10:28:44,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:44,961 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-05-15 10:28:44,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-05-15 10:28:44,961 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-05-15 10:28:44,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-05-15 10:28:44,962 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:44,962 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1] [2019-05-15 10:28:44,962 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:44,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:44,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1013136962, now seen corresponding path program 25 times [2019-05-15 10:28:44,963 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:44,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:44,977 WARN L254 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 27 conjunts are in the unsatisfiable core [2019-05-15 10:28:45,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:45,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:45,020 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:45,021 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,023 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:45,023 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,023 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:45,025 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:45,026 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_332|]. (= (store |v_#memory_int_332| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:28:45,026 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:45,035 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:45,036 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,038 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:45,039 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,039 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:45,046 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:45,046 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_333|]. (let ((.cse0 (select |v_#memory_int_333| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_333| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 0 .cse0))) [2019-05-15 10:28:45,046 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:45,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:45,056 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,058 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:45,059 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,059 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:45,067 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:45,067 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_334|]. (let ((.cse0 (select |v_#memory_int_334| ULTIMATE.start_main_p1))) (and (= .cse0 1) (= (store |v_#memory_int_334| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:45,067 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:45,077 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:45,078 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,080 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:45,081 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,081 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:45,088 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:45,088 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_335|]. (let ((.cse0 (select |v_#memory_int_335| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_335| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 2))) [2019-05-15 10:28:45,089 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:28:45,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 16 treesize of output 11 [2019-05-15 10:28:45,104 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,106 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:45,106 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,106 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:45,113 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:45,113 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_336|]. (let ((.cse0 (select |v_#memory_int_336| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_336| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 3 .cse0))) [2019-05-15 10:28:45,114 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:28:45,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 16 treesize of output 11 [2019-05-15 10:28:45,127 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,129 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:45,129 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,129 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:45,136 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:45,137 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_337|]. (let ((.cse0 (select |v_#memory_int_337| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_337| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 4))) [2019-05-15 10:28:45,137 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:28: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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:45,154 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,156 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:45,156 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,157 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:45,164 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:45,164 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_338|]. (let ((.cse0 (select |v_#memory_int_338| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_338| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 5))) [2019-05-15 10:28:45,164 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:28:45,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 16 treesize of output 11 [2019-05-15 10:28:45,184 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,186 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:45,186 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,187 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:45,193 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:45,193 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_339|]. (let ((.cse0 (select |v_#memory_int_339| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_339| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 6 .cse0))) [2019-05-15 10:28:45,193 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:28:45,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 16 treesize of output 11 [2019-05-15 10:28:45,234 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,236 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:45,237 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,237 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:45,245 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:45,245 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_340|]. (let ((.cse0 (select |v_#memory_int_340| ULTIMATE.start_main_p1))) (and (= .cse0 7) (= (store |v_#memory_int_340| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:45,245 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:28:45,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 16 treesize of output 11 [2019-05-15 10:28:45,262 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,264 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:45,265 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,265 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:45,273 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:45,273 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_341|]. (let ((.cse0 (select |v_#memory_int_341| ULTIMATE.start_main_p1))) (and (= 8 .cse0) (= |#memory_int| (store |v_#memory_int_341| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:45,273 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:28:45,293 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:45,294 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,296 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:45,297 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,297 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:45,305 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:45,305 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_342|]. (let ((.cse0 (select |v_#memory_int_342| ULTIMATE.start_main_p1))) (and (= .cse0 9) (= (store |v_#memory_int_342| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:45,305 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:28:45,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:45,355 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,381 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:45,382 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,382 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:45,387 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:45,387 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_343|]. (let ((.cse0 (select |v_#memory_int_343| ULTIMATE.start_main_p1))) (and (= .cse0 10) (= |#memory_int| (store |v_#memory_int_343| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:45,387 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:28:45,407 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:45,408 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,410 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:45,410 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,411 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:45,418 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:45,419 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_344|]. (let ((.cse0 (select |v_#memory_int_344| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_344| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 11 .cse0))) [2019-05-15 10:28:45,419 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:28:45,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:45,439 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:45,441 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,442 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:45,450 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:45,450 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_345|]. (let ((.cse0 (select |v_#memory_int_345| ULTIMATE.start_main_p1))) (and (= 12 .cse0) (= |#memory_int| (store |v_#memory_int_345| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:45,451 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:28:45,472 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:45,473 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,476 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:45,476 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,476 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:45,484 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:45,485 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_346|]. (let ((.cse0 (select |v_#memory_int_346| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_346| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 13))) [2019-05-15 10:28:45,485 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:28:45,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 16 treesize of output 11 [2019-05-15 10:28:45,507 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,509 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:45,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:45,510 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:45,517 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:45,517 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_347|]. (let ((.cse0 (select |v_#memory_int_347| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_347| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 14))) [2019-05-15 10:28:45,517 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:28:45,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:45,539 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,541 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:45,541 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,542 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:45,549 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:45,550 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_348|]. (let ((.cse0 (select |v_#memory_int_348| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_348| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 15 .cse0))) [2019-05-15 10:28:45,550 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:28:45,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:45,575 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,577 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:45,577 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,578 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:45,585 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:45,585 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_349|]. (let ((.cse0 (select |v_#memory_int_349| ULTIMATE.start_main_p1))) (and (= 16 .cse0) (= |#memory_int| (store |v_#memory_int_349| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:45,585 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:28:45,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:45,607 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,609 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:45,610 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,610 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:45,617 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:45,617 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_350|]. (let ((.cse0 (select |v_#memory_int_350| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_350| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 17))) [2019-05-15 10:28:45,617 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:28:45,643 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:45,644 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,647 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:45,648 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,648 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:45,654 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:45,655 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_351|]. (let ((.cse0 (select |v_#memory_int_351| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_351| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 18 .cse0))) [2019-05-15 10:28:45,655 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:28:45,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:45,694 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,695 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:45,696 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,696 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:45,702 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:45,702 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_352|]. (let ((.cse0 (select |v_#memory_int_352| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_352| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 19 .cse0))) [2019-05-15 10:28:45,702 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:28:45,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:45,730 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,732 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:45,733 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,733 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:45,740 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:45,741 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_353|]. (let ((.cse0 (select |v_#memory_int_353| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_353| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 20 .cse0))) [2019-05-15 10:28:45,741 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:28:45,768 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:45,772 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,774 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:45,774 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,774 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:45,780 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:45,781 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_354|]. (let ((.cse0 (select |v_#memory_int_354| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_354| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 21))) [2019-05-15 10:28:45,781 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:28:45,810 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:45,811 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,813 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:45,814 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,814 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:45,820 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:45,821 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_355|]. (let ((.cse0 (select |v_#memory_int_355| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_355| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 22 .cse0))) [2019-05-15 10:28:45,821 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:28:45,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 16 treesize of output 11 [2019-05-15 10:28:45,851 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,853 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:45,853 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,854 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:45,862 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:45,862 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_356|]. (let ((.cse0 (select |v_#memory_int_356| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_356| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 23 .cse0))) [2019-05-15 10:28:45,862 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:28:45,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:45,897 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,899 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:45,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:45,899 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:45,906 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:45,906 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_357|]. (let ((.cse0 (select |v_#memory_int_357| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_357| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 24))) [2019-05-15 10:28:45,906 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:28:45,929 INFO L273 TraceCheckUtils]: 0: Hoare triple {3364#true} havoc main_p1; {3364#true} is VALID [2019-05-15 10:28:45,930 INFO L273 TraceCheckUtils]: 1: Hoare triple {3364#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {3364#true} is VALID [2019-05-15 10:28:45,930 INFO L273 TraceCheckUtils]: 2: Hoare triple {3364#true} #memory_int := #memory_int[main_p1 := 0]; {3375#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:45,931 INFO L273 TraceCheckUtils]: 3: Hoare triple {3375#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3379#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:45,932 INFO L273 TraceCheckUtils]: 4: Hoare triple {3379#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3383#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:45,933 INFO L273 TraceCheckUtils]: 5: Hoare triple {3383#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3387#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:28:45,934 INFO L273 TraceCheckUtils]: 6: Hoare triple {3387#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3391#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:28:45,934 INFO L273 TraceCheckUtils]: 7: Hoare triple {3391#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3395#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:28:45,935 INFO L273 TraceCheckUtils]: 8: Hoare triple {3395#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3399#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:28:45,936 INFO L273 TraceCheckUtils]: 9: Hoare triple {3399#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3403#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:28:45,937 INFO L273 TraceCheckUtils]: 10: Hoare triple {3403#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3407#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:28:45,938 INFO L273 TraceCheckUtils]: 11: Hoare triple {3407#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3411#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:28:45,938 INFO L273 TraceCheckUtils]: 12: Hoare triple {3411#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3415#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:28:45,939 INFO L273 TraceCheckUtils]: 13: Hoare triple {3415#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3419#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:28:45,940 INFO L273 TraceCheckUtils]: 14: Hoare triple {3419#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3423#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:28:45,941 INFO L273 TraceCheckUtils]: 15: Hoare triple {3423#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3427#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:28:45,942 INFO L273 TraceCheckUtils]: 16: Hoare triple {3427#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3431#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:28:45,943 INFO L273 TraceCheckUtils]: 17: Hoare triple {3431#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3435#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:28:45,943 INFO L273 TraceCheckUtils]: 18: Hoare triple {3435#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3439#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:28:45,944 INFO L273 TraceCheckUtils]: 19: Hoare triple {3439#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3443#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:28:45,945 INFO L273 TraceCheckUtils]: 20: Hoare triple {3443#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3447#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:28:45,946 INFO L273 TraceCheckUtils]: 21: Hoare triple {3447#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3451#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:28:45,947 INFO L273 TraceCheckUtils]: 22: Hoare triple {3451#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3455#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:28:45,948 INFO L273 TraceCheckUtils]: 23: Hoare triple {3455#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3459#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:28:45,949 INFO L273 TraceCheckUtils]: 24: Hoare triple {3459#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3463#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:28:45,949 INFO L273 TraceCheckUtils]: 25: Hoare triple {3463#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3467#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:28:45,950 INFO L273 TraceCheckUtils]: 26: Hoare triple {3467#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3471#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:28:45,951 INFO L273 TraceCheckUtils]: 27: Hoare triple {3471#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3475#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:28:45,952 INFO L273 TraceCheckUtils]: 28: Hoare triple {3475#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} assume !(#memory_int[main_p1] >= 0); {3365#false} is VALID [2019-05-15 10:28:45,954 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:45,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:45,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-05-15 10:28:45,955 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 29 [2019-05-15 10:28:45,955 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:45,955 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2019-05-15 10:28:45,980 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:45,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-05-15 10:28:45,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-05-15 10:28:45,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-05-15 10:28:45,982 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 28 states. [2019-05-15 10:28:47,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:47,607 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-05-15 10:28:47,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-05-15 10:28:47,608 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 29 [2019-05-15 10:28:47,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:47,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-05-15 10:28:47,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-05-15 10:28:47,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-05-15 10:28:47,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-05-15 10:28:47,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 32 transitions. [2019-05-15 10:28:47,637 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:47,638 INFO L225 Difference]: With dead ends: 31 [2019-05-15 10:28:47,638 INFO L226 Difference]: Without dead ends: 31 [2019-05-15 10:28:47,638 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-05-15 10:28:47,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-05-15 10:28:47,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-05-15 10:28:47,640 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:47,640 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2019-05-15 10:28:47,641 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2019-05-15 10:28:47,641 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2019-05-15 10:28:47,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:47,641 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-05-15 10:28:47,641 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-05-15 10:28:47,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:47,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:47,642 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2019-05-15 10:28:47,642 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2019-05-15 10:28:47,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:47,643 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-05-15 10:28:47,643 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-05-15 10:28:47,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:47,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:47,643 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:47,643 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:47,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-05-15 10:28:47,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-05-15 10:28:47,644 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-05-15 10:28:47,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:47,644 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-05-15 10:28:47,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-05-15 10:28:47,645 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-05-15 10:28:47,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-05-15 10:28:47,645 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:47,645 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1] [2019-05-15 10:28:47,645 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:47,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:47,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1342474696, now seen corresponding path program 26 times [2019-05-15 10:28:47,646 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:47,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:47,668 WARN L254 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 28 conjunts are in the unsatisfiable core [2019-05-15 10:28:47,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:47,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:47,832 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:47,833 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:47,872 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:47,872 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:47,873 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:47,882 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:47,882 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_358|]. (= (store |v_#memory_int_358| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:28:47,882 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:47,998 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:48,016 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,051 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:48,051 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,051 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:48,057 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:48,058 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_359|]. (let ((.cse0 (select |v_#memory_int_359| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_359| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 0 .cse0))) [2019-05-15 10:28:48,058 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:48,069 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:48,070 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,072 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:48,073 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,073 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:48,081 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:48,082 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_360|]. (let ((.cse0 (select |v_#memory_int_360| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_360| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 1 .cse0))) [2019-05-15 10:28:48,082 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:48,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:48,094 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,096 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:48,096 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,097 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:48,104 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:48,104 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_361|]. (let ((.cse0 (select |v_#memory_int_361| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_361| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 2))) [2019-05-15 10:28:48,104 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:28:48,119 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:48,120 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,123 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:48,123 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,123 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:48,130 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:48,131 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_362|]. (let ((.cse0 (select |v_#memory_int_362| ULTIMATE.start_main_p1))) (and (= 3 .cse0) (= (store |v_#memory_int_362| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:48,131 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:28:48,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 16 treesize of output 11 [2019-05-15 10:28:48,144 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,147 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:48,147 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,147 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:48,154 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:48,154 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_363|]. (let ((.cse0 (select |v_#memory_int_363| ULTIMATE.start_main_p1))) (and (= 4 .cse0) (= (store |v_#memory_int_363| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:48,155 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:28:48,168 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:48,169 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,171 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:48,171 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,171 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:48,178 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:48,178 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_364|]. (let ((.cse0 (select |v_#memory_int_364| ULTIMATE.start_main_p1))) (and (= .cse0 5) (= |#memory_int| (store |v_#memory_int_364| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:48,178 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:28:48,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 16 treesize of output 11 [2019-05-15 10:28:48,195 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,197 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:48,197 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,197 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:48,205 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:48,205 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_365|]. (let ((.cse0 (select |v_#memory_int_365| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_365| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 6))) [2019-05-15 10:28:48,205 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:28:48,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 16 treesize of output 11 [2019-05-15 10:28:48,222 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,224 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:48,224 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,224 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:48,232 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:48,233 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_366|]. (let ((.cse0 (select |v_#memory_int_366| ULTIMATE.start_main_p1))) (and (= 7 .cse0) (= |#memory_int| (store |v_#memory_int_366| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:48,233 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:28:48,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 16 treesize of output 11 [2019-05-15 10:28:48,249 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,251 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:48,252 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,252 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:48,258 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:48,258 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_367|]. (let ((.cse0 (select |v_#memory_int_367| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_367| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 8 .cse0))) [2019-05-15 10:28:48,258 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:28:48,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 16 treesize of output 11 [2019-05-15 10:28:48,277 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,279 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:48,279 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,279 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:48,286 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:48,286 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_368|]. (let ((.cse0 (select |v_#memory_int_368| ULTIMATE.start_main_p1))) (and (= 9 .cse0) (= |#memory_int| (store |v_#memory_int_368| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:48,286 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:28:48,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 16 treesize of output 11 [2019-05-15 10:28:48,305 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,307 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:48,307 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,307 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:48,315 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:48,315 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_369|]. (let ((.cse0 (select |v_#memory_int_369| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_369| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 10))) [2019-05-15 10:28:48,315 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:28:48,333 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:48,334 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,336 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:48,336 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,336 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:48,343 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:48,344 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_370|]. (let ((.cse0 (select |v_#memory_int_370| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_370| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 11 .cse0))) [2019-05-15 10:28:48,344 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:28:48,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:48,363 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,365 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:48,365 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,365 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:48,373 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:48,373 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_371|]. (let ((.cse0 (select |v_#memory_int_371| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_371| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 12 .cse0))) [2019-05-15 10:28:48,373 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:28:48,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:48,395 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,397 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:48,397 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,397 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:48,404 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:48,405 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_372|]. (let ((.cse0 (select |v_#memory_int_372| ULTIMATE.start_main_p1))) (and (= .cse0 13) (= (store |v_#memory_int_372| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:48,405 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:28:48,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 16 treesize of output 11 [2019-05-15 10:28:48,425 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,427 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:48,428 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,428 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:48,435 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:48,436 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_373|]. (let ((.cse0 (select |v_#memory_int_373| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_373| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 14))) [2019-05-15 10:28:48,436 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:28:48,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:48,460 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,462 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:48,462 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,463 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:48,470 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:48,470 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_374|]. (let ((.cse0 (select |v_#memory_int_374| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_374| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 15))) [2019-05-15 10:28:48,470 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:28:48,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 16 treesize of output 11 [2019-05-15 10:28:48,496 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,498 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:48,498 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,498 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:48,506 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:48,506 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_375|]. (let ((.cse0 (select |v_#memory_int_375| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_375| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 16))) [2019-05-15 10:28:48,506 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:28:48,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 16 treesize of output 11 [2019-05-15 10:28:48,531 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,533 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:48,534 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,534 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:48,541 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:48,541 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_376|]. (let ((.cse0 (select |v_#memory_int_376| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_376| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 17 .cse0))) [2019-05-15 10:28:48,541 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:28:48,564 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:48,567 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,568 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:48,569 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,569 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:48,575 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:48,575 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_377|]. (let ((.cse0 (select |v_#memory_int_377| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_377| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 18))) [2019-05-15 10:28:48,576 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:28:49,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:49,100 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:49,102 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:49,103 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:49,103 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:49,111 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:49,112 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_378|]. (let ((.cse0 (select |v_#memory_int_378| ULTIMATE.start_main_p1))) (and (= 19 .cse0) (= |#memory_int| (store |v_#memory_int_378| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:49,112 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:28:49,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:49,138 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:49,140 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:49,141 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:49,141 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:49,147 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:49,147 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_379|]. (let ((.cse0 (select |v_#memory_int_379| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_379| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 20))) [2019-05-15 10:28:49,147 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:28:49,175 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:49,176 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:49,179 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:49,180 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:49,180 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:49,188 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:49,188 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_380|]. (let ((.cse0 (select |v_#memory_int_380| ULTIMATE.start_main_p1))) (and (= .cse0 21) (= (store |v_#memory_int_380| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:49,188 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:28:49,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:49,215 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:49,217 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:49,218 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:49,218 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:49,226 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:49,226 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_381|]. (let ((.cse0 (select |v_#memory_int_381| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_381| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 22))) [2019-05-15 10:28:49,226 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:28:49,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 16 treesize of output 11 [2019-05-15 10:28:49,268 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:49,270 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:49,270 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:49,271 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:49,277 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:49,277 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_382|]. (let ((.cse0 (select |v_#memory_int_382| ULTIMATE.start_main_p1))) (and (= .cse0 23) (= |#memory_int| (store |v_#memory_int_382| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:49,277 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:28:49,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:49,307 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:49,309 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:49,309 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:49,309 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:49,316 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:49,316 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_383|]. (let ((.cse0 (select |v_#memory_int_383| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_383| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 24))) [2019-05-15 10:28:49,316 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:28:49,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 16 treesize of output 11 [2019-05-15 10:28:49,347 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:49,349 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:49,349 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:49,350 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:49,357 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:49,357 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_384|]. (let ((.cse0 (select |v_#memory_int_384| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_384| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 25))) [2019-05-15 10:28:49,357 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:28:49,381 INFO L273 TraceCheckUtils]: 0: Hoare triple {3602#true} havoc main_p1; {3602#true} is VALID [2019-05-15 10:28:49,381 INFO L273 TraceCheckUtils]: 1: Hoare triple {3602#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {3602#true} is VALID [2019-05-15 10:28:49,382 INFO L273 TraceCheckUtils]: 2: Hoare triple {3602#true} #memory_int := #memory_int[main_p1 := 0]; {3613#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:49,383 INFO L273 TraceCheckUtils]: 3: Hoare triple {3613#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3617#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:49,383 INFO L273 TraceCheckUtils]: 4: Hoare triple {3617#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3621#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:49,384 INFO L273 TraceCheckUtils]: 5: Hoare triple {3621#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3625#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:28:49,384 INFO L273 TraceCheckUtils]: 6: Hoare triple {3625#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3629#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:28:49,385 INFO L273 TraceCheckUtils]: 7: Hoare triple {3629#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3633#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:28:49,386 INFO L273 TraceCheckUtils]: 8: Hoare triple {3633#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3637#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:28:49,387 INFO L273 TraceCheckUtils]: 9: Hoare triple {3637#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3641#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:28:49,388 INFO L273 TraceCheckUtils]: 10: Hoare triple {3641#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3645#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:28:49,388 INFO L273 TraceCheckUtils]: 11: Hoare triple {3645#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3649#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:28:49,389 INFO L273 TraceCheckUtils]: 12: Hoare triple {3649#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3653#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:28:49,390 INFO L273 TraceCheckUtils]: 13: Hoare triple {3653#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3657#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:28:49,390 INFO L273 TraceCheckUtils]: 14: Hoare triple {3657#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3661#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:28:49,391 INFO L273 TraceCheckUtils]: 15: Hoare triple {3661#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3665#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:28:49,392 INFO L273 TraceCheckUtils]: 16: Hoare triple {3665#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3669#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:28:49,393 INFO L273 TraceCheckUtils]: 17: Hoare triple {3669#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3673#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:28:49,394 INFO L273 TraceCheckUtils]: 18: Hoare triple {3673#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3677#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:28:49,395 INFO L273 TraceCheckUtils]: 19: Hoare triple {3677#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3681#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:28:49,396 INFO L273 TraceCheckUtils]: 20: Hoare triple {3681#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3685#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:28:49,397 INFO L273 TraceCheckUtils]: 21: Hoare triple {3685#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3689#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:28:49,398 INFO L273 TraceCheckUtils]: 22: Hoare triple {3689#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3693#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:28:49,399 INFO L273 TraceCheckUtils]: 23: Hoare triple {3693#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3697#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:28:49,400 INFO L273 TraceCheckUtils]: 24: Hoare triple {3697#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3701#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:28:49,401 INFO L273 TraceCheckUtils]: 25: Hoare triple {3701#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3705#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:28:49,401 INFO L273 TraceCheckUtils]: 26: Hoare triple {3705#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3709#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:28:49,402 INFO L273 TraceCheckUtils]: 27: Hoare triple {3709#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3713#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:28:49,403 INFO L273 TraceCheckUtils]: 28: Hoare triple {3713#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3717#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:28:49,404 INFO L273 TraceCheckUtils]: 29: Hoare triple {3717#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} assume !(#memory_int[main_p1] >= 0); {3603#false} is VALID [2019-05-15 10:28:49,407 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:49,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:49,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-05-15 10:28:49,408 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 30 [2019-05-15 10:28:49,408 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:49,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2019-05-15 10:28:49,437 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:49,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-05-15 10:28:49,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-05-15 10:28:49,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-05-15 10:28:49,438 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 29 states. [2019-05-15 10:28:51,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:51,189 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-05-15 10:28:51,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-05-15 10:28:51,189 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 30 [2019-05-15 10:28:51,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:51,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-05-15 10:28:51,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-05-15 10:28:51,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-05-15 10:28:51,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-05-15 10:28:51,191 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 33 transitions. [2019-05-15 10:28:51,261 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:51,262 INFO L225 Difference]: With dead ends: 32 [2019-05-15 10:28:51,262 INFO L226 Difference]: Without dead ends: 32 [2019-05-15 10:28:51,263 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-05-15 10:28:51,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-05-15 10:28:51,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-05-15 10:28:51,266 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:51,266 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2019-05-15 10:28:51,266 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2019-05-15 10:28:51,266 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2019-05-15 10:28:51,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:51,267 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-05-15 10:28:51,267 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-05-15 10:28:51,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:51,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:51,267 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2019-05-15 10:28:51,268 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2019-05-15 10:28:51,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:51,268 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-05-15 10:28:51,268 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-05-15 10:28:51,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:51,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:51,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:51,269 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:51,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-05-15 10:28:51,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-05-15 10:28:51,270 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-05-15 10:28:51,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:51,270 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-05-15 10:28:51,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-05-15 10:28:51,270 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-05-15 10:28:51,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-05-15 10:28:51,271 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:51,271 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1] [2019-05-15 10:28:51,271 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:51,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:51,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1332957438, now seen corresponding path program 27 times [2019-05-15 10:28:51,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:51,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:51,285 WARN L254 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 29 conjunts are in the unsatisfiable core [2019-05-15 10:28:51,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:51,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:51,388 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,388 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,390 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:51,390 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,390 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:51,392 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:51,392 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_385|]. (= |#memory_int| (store |v_#memory_int_385| ULTIMATE.start_main_p1 0)) [2019-05-15 10:28:51,392 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:51,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:51,410 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,413 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:51,413 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,413 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:51,420 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:51,420 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_386|]. (let ((.cse0 (select |v_#memory_int_386| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_386| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 0 .cse0))) [2019-05-15 10:28:51,420 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:51,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 16 treesize of output 11 [2019-05-15 10:28:51,431 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,434 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:51,434 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,434 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:51,442 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:51,442 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_387|]. (let ((.cse0 (select |v_#memory_int_387| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_387| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 1 .cse0))) [2019-05-15 10:28:51,442 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:51,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 16 treesize of output 11 [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,525 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:51,526 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,526 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:51,533 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:51,533 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_388|]. (let ((.cse0 (select |v_#memory_int_388| ULTIMATE.start_main_p1))) (and (= .cse0 2) (= (store |v_#memory_int_388| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:51,533 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:28:51,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 16 treesize of output 11 [2019-05-15 10:28:51,551 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,553 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 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 1 xjuncts. [2019-05-15 10:28:51,553 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:51,560 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:51,561 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_389|]. (let ((.cse0 (select |v_#memory_int_389| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_389| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 3))) [2019-05-15 10:28:51,561 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:28:51,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:51,589 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,590 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:51,590 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,591 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:51,601 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:51,602 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_390|]. (let ((.cse0 (select |v_#memory_int_390| ULTIMATE.start_main_p1))) (and (= 4 .cse0) (= |#memory_int| (store |v_#memory_int_390| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:51,602 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:28:51,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 16 treesize of output 11 [2019-05-15 10:28:51,619 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,622 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:51,622 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,622 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:51,629 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:51,629 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_391|]. (let ((.cse0 (select |v_#memory_int_391| ULTIMATE.start_main_p1))) (and (= .cse0 5) (= (store |v_#memory_int_391| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:51,630 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:28:51,643 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:51,644 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,646 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:51,646 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,646 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:51,654 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:51,655 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_392|]. (let ((.cse0 (select |v_#memory_int_392| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_392| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 6 .cse0))) [2019-05-15 10:28:51,655 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:28:51,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:51,677 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,679 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:51,679 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,679 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:51,685 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:51,685 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_393|]. (let ((.cse0 (select |v_#memory_int_393| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_393| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 7 .cse0))) [2019-05-15 10:28:51,685 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:51,704 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,705 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:51,705 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,705 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:51,711 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:51,712 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_394|]. (let ((.cse0 (select |v_#memory_int_394| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_394| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 8 .cse0))) [2019-05-15 10:28:51,712 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:28:51,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:51,731 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,734 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:51,734 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,734 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:51,742 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:51,742 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_395|]. (let ((.cse0 (select |v_#memory_int_395| ULTIMATE.start_main_p1))) (and (= .cse0 9) (= (store |v_#memory_int_395| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:51,742 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:28:51,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:51,761 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,763 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:51,764 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,764 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:51,771 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:51,771 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_396|]. (let ((.cse0 (select |v_#memory_int_396| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_396| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 10))) [2019-05-15 10:28:51,772 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:28:51,789 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:51,790 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,792 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:51,792 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,793 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:51,800 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:51,800 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_397|]. (let ((.cse0 (select |v_#memory_int_397| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_397| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 11 .cse0))) [2019-05-15 10:28:51,800 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:28:51,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 16 treesize of output 11 [2019-05-15 10:28:51,819 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,821 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:51,821 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,822 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:51,828 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:51,828 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_398|]. (let ((.cse0 (select |v_#memory_int_398| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_398| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 12 .cse0))) [2019-05-15 10:28:51,828 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:28:51,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 16 treesize of output 11 [2019-05-15 10:28:51,851 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,853 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:51,853 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,853 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:51,861 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:51,861 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_399|]. (let ((.cse0 (select |v_#memory_int_399| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_399| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 13))) [2019-05-15 10:28:51,861 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:28:51,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 16 treesize of output 11 [2019-05-15 10:28:51,884 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,887 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:51,887 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,887 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:51,895 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:51,895 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_400|]. (let ((.cse0 (select |v_#memory_int_400| ULTIMATE.start_main_p1))) (and (= 14 .cse0) (= (store |v_#memory_int_400| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:51,895 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:28:51,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:51,918 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,921 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:51,921 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,921 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:51,929 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:51,929 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_401|]. (let ((.cse0 (select |v_#memory_int_401| ULTIMATE.start_main_p1))) (and (= .cse0 15) (= |#memory_int| (store |v_#memory_int_401| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:51,929 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:28:51,953 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:51,954 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,956 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:51,957 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,957 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:51,964 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:51,964 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_402|]. (let ((.cse0 (select |v_#memory_int_402| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_402| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 16))) [2019-05-15 10:28:51,964 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:28:51,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:51,989 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,991 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 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 1 xjuncts. [2019-05-15 10:28:51,991 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:51,998 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:51,999 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_403|]. (let ((.cse0 (select |v_#memory_int_403| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_403| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 17 .cse0))) [2019-05-15 10:28:51,999 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:28:52,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:52,024 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:52,026 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:52,026 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:52,026 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:52,033 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:52,034 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_404|]. (let ((.cse0 (select |v_#memory_int_404| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_404| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 18 .cse0))) [2019-05-15 10:28:52,034 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:28:52,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 16 treesize of output 11 [2019-05-15 10:28:52,063 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:52,065 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:52,066 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:52,066 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:52,073 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:52,074 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_405|]. (let ((.cse0 (select |v_#memory_int_405| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_405| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 19 .cse0))) [2019-05-15 10:28:52,074 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:28:52,102 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:52,109 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:52,110 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:52,111 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:52,111 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:52,118 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:52,118 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_406|]. (let ((.cse0 (select |v_#memory_int_406| ULTIMATE.start_main_p1))) (and (= .cse0 20) (= |#memory_int| (store |v_#memory_int_406| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:52,118 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:28:52,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 16 treesize of output 11 [2019-05-15 10:28:52,147 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:52,149 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:52,150 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:52,150 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:52,158 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:52,159 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_407|]. (let ((.cse0 (select |v_#memory_int_407| ULTIMATE.start_main_p1))) (and (= .cse0 21) (= (store |v_#memory_int_407| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:52,159 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:28:52,187 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:52,188 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:52,190 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:52,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:52,191 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:52,197 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:52,197 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_408|]. (let ((.cse0 (select |v_#memory_int_408| ULTIMATE.start_main_p1))) (and (= .cse0 22) (= (store |v_#memory_int_408| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:52,198 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:28:52,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 16 treesize of output 11 [2019-05-15 10:28:52,228 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:52,230 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:52,230 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:52,231 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:52,238 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:52,238 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_409|]. (let ((.cse0 (select |v_#memory_int_409| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_409| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 23 .cse0))) [2019-05-15 10:28:52,239 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:28:52,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 16 treesize of output 11 [2019-05-15 10:28:52,269 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:52,271 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:52,272 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:52,272 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:52,280 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:52,280 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_410|]. (let ((.cse0 (select |v_#memory_int_410| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_410| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 24))) [2019-05-15 10:28:52,280 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:28:52,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:52,311 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:52,313 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:52,314 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:52,314 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:52,321 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:52,321 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_411|]. (let ((.cse0 (select |v_#memory_int_411| ULTIMATE.start_main_p1))) (and (= .cse0 25) (= |#memory_int| (store |v_#memory_int_411| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:52,321 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:28:52,372 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:52,373 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:52,375 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:52,375 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:52,375 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:52,383 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:52,384 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_412|]. (let ((.cse0 (select |v_#memory_int_412| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_412| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 26 .cse0))) [2019-05-15 10:28:52,384 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:28:52,494 INFO L273 TraceCheckUtils]: 0: Hoare triple {3848#true} havoc main_p1; {3848#true} is VALID [2019-05-15 10:28:52,494 INFO L273 TraceCheckUtils]: 1: Hoare triple {3848#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {3848#true} is VALID [2019-05-15 10:28:52,495 INFO L273 TraceCheckUtils]: 2: Hoare triple {3848#true} #memory_int := #memory_int[main_p1 := 0]; {3859#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:52,496 INFO L273 TraceCheckUtils]: 3: Hoare triple {3859#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3863#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:52,496 INFO L273 TraceCheckUtils]: 4: Hoare triple {3863#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3867#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:52,498 INFO L273 TraceCheckUtils]: 5: Hoare triple {3867#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3871#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:28:52,498 INFO L273 TraceCheckUtils]: 6: Hoare triple {3871#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3875#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:28:52,501 INFO L273 TraceCheckUtils]: 7: Hoare triple {3875#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3879#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:28:52,501 INFO L273 TraceCheckUtils]: 8: Hoare triple {3879#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3883#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:28:52,503 INFO L273 TraceCheckUtils]: 9: Hoare triple {3883#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3887#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:28:52,503 INFO L273 TraceCheckUtils]: 10: Hoare triple {3887#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3891#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:28:52,506 INFO L273 TraceCheckUtils]: 11: Hoare triple {3891#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3895#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:28:52,506 INFO L273 TraceCheckUtils]: 12: Hoare triple {3895#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3899#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:28:52,509 INFO L273 TraceCheckUtils]: 13: Hoare triple {3899#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3903#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:28:52,509 INFO L273 TraceCheckUtils]: 14: Hoare triple {3903#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3907#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:28:52,511 INFO L273 TraceCheckUtils]: 15: Hoare triple {3907#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3911#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:28:52,511 INFO L273 TraceCheckUtils]: 16: Hoare triple {3911#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3915#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:28:52,514 INFO L273 TraceCheckUtils]: 17: Hoare triple {3915#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3919#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:28:52,514 INFO L273 TraceCheckUtils]: 18: Hoare triple {3919#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3923#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:28:52,516 INFO L273 TraceCheckUtils]: 19: Hoare triple {3923#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3927#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:28:52,516 INFO L273 TraceCheckUtils]: 20: Hoare triple {3927#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3931#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:28:52,519 INFO L273 TraceCheckUtils]: 21: Hoare triple {3931#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3935#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:28:52,519 INFO L273 TraceCheckUtils]: 22: Hoare triple {3935#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3939#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:28:52,524 INFO L273 TraceCheckUtils]: 23: Hoare triple {3939#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3943#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:28:52,526 INFO L273 TraceCheckUtils]: 24: Hoare triple {3943#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3947#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:28:52,526 INFO L273 TraceCheckUtils]: 25: Hoare triple {3947#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3951#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:28:52,529 INFO L273 TraceCheckUtils]: 26: Hoare triple {3951#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3955#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:28:52,529 INFO L273 TraceCheckUtils]: 27: Hoare triple {3955#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3959#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:28:52,531 INFO L273 TraceCheckUtils]: 28: Hoare triple {3959#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3963#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:28:52,531 INFO L273 TraceCheckUtils]: 29: Hoare triple {3963#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3967#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:28:52,533 INFO L273 TraceCheckUtils]: 30: Hoare triple {3967#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} assume !(#memory_int[main_p1] >= 0); {3849#false} is VALID [2019-05-15 10:28:52,534 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:52,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:52,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-05-15 10:28:52,535 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 31 [2019-05-15 10:28:52,535 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:52,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2019-05-15 10:28:52,592 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:52,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-05-15 10:28:52,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-05-15 10:28:52,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-05-15 10:28:52,593 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 30 states. [2019-05-15 10:28:54,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:54,448 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-05-15 10:28:54,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-05-15 10:28:54,448 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 31 [2019-05-15 10:28:54,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:54,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-05-15 10:28:54,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-05-15 10:28:54,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-05-15 10:28:54,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-05-15 10:28:54,449 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 34 transitions. [2019-05-15 10:28:54,477 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:54,478 INFO L225 Difference]: With dead ends: 33 [2019-05-15 10:28:54,478 INFO L226 Difference]: Without dead ends: 33 [2019-05-15 10:28:54,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-05-15 10:28:54,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-05-15 10:28:54,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-05-15 10:28:54,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:54,481 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2019-05-15 10:28:54,481 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2019-05-15 10:28:54,481 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2019-05-15 10:28:54,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:54,482 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-05-15 10:28:54,482 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-05-15 10:28:54,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:54,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:54,482 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2019-05-15 10:28:54,483 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2019-05-15 10:28:54,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:54,483 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-05-15 10:28:54,483 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-05-15 10:28:54,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:54,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:54,484 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:54,484 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:54,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-05-15 10:28:54,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-05-15 10:28:54,484 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-05-15 10:28:54,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:54,484 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-05-15 10:28:54,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-05-15 10:28:54,484 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-05-15 10:28:54,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-05-15 10:28:54,485 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:54,485 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1] [2019-05-15 10:28:54,485 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:54,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:54,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1627992328, now seen corresponding path program 28 times [2019-05-15 10:28:54,486 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:54,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:54,497 WARN L254 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 30 conjunts are in the unsatisfiable core [2019-05-15 10:28:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:54,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:54,537 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:54,537 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,539 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:54,540 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,540 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:54,541 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:54,542 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_413|]. (= (store |v_#memory_int_413| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:28:54,542 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:54,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 16 treesize of output 11 [2019-05-15 10:28:54,553 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,555 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:54,555 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,556 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:54,563 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:54,563 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_414|]. (let ((.cse0 (select |v_#memory_int_414| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_414| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 0))) [2019-05-15 10:28:54,563 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:54,573 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:54,581 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,583 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:54,583 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,583 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:54,589 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:54,590 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_415|]. (let ((.cse0 (select |v_#memory_int_415| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_415| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 1))) [2019-05-15 10:28:54,590 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:54,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:54,626 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,628 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:54,628 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,629 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:54,636 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:54,636 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_416|]. (let ((.cse0 (select |v_#memory_int_416| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_416| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 2 .cse0))) [2019-05-15 10:28:54,636 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:28:54,647 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:54,648 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,650 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:54,650 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,651 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:54,658 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:54,658 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_417|]. (let ((.cse0 (select |v_#memory_int_417| ULTIMATE.start_main_p1))) (and (= .cse0 3) (= (store |v_#memory_int_417| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:54,658 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:28:54,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 16 treesize of output 11 [2019-05-15 10:28:54,673 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,675 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:54,675 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,676 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:54,683 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:54,683 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_418|]. (let ((.cse0 (select |v_#memory_int_418| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_418| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 4))) [2019-05-15 10:28:54,684 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:28:54,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:54,702 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,703 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:54,703 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,703 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:54,710 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:54,710 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_419|]. (let ((.cse0 (select |v_#memory_int_419| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_419| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 5))) [2019-05-15 10:28:54,710 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:28:54,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:54,728 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,729 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:54,730 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,730 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:54,738 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:54,738 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_420|]. (let ((.cse0 (select |v_#memory_int_420| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_420| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 6))) [2019-05-15 10:28:54,738 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:28:54,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 16 treesize of output 11 [2019-05-15 10:28:54,755 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,757 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:54,758 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,758 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:54,766 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:54,766 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_421|]. (let ((.cse0 (select |v_#memory_int_421| ULTIMATE.start_main_p1))) (and (= 7 .cse0) (= (store |v_#memory_int_421| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:54,767 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:28:54,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 16 treesize of output 11 [2019-05-15 10:28:54,789 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,790 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:54,790 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,790 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:54,797 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:54,797 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_422|]. (let ((.cse0 (select |v_#memory_int_422| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_422| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 8 .cse0))) [2019-05-15 10:28:54,797 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:28:54,814 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:54,815 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,817 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:54,818 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,818 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:54,825 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:54,825 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_423|]. (let ((.cse0 (select |v_#memory_int_423| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_423| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 9))) [2019-05-15 10:28:54,825 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:28:54,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 16 treesize of output 11 [2019-05-15 10:28:54,843 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,845 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:54,846 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,846 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:54,852 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:54,853 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_424|]. (let ((.cse0 (select |v_#memory_int_424| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_424| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 10))) [2019-05-15 10:28:54,853 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:28:54,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 16 treesize of output 11 [2019-05-15 10:28:54,870 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,872 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:54,872 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,873 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:54,879 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:54,880 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_425|]. (let ((.cse0 (select |v_#memory_int_425| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_425| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 11 .cse0))) [2019-05-15 10:28:54,880 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:28:54,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:54,900 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,902 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:54,903 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,903 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:54,910 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:54,911 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_426|]. (let ((.cse0 (select |v_#memory_int_426| ULTIMATE.start_main_p1))) (and (= 12 .cse0) (= (store |v_#memory_int_426| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:54,911 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:28:54,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:54,936 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,938 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:54,938 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,938 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:54,946 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:54,946 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_427|]. (let ((.cse0 (select |v_#memory_int_427| ULTIMATE.start_main_p1))) (and (= .cse0 13) (= |#memory_int| (store |v_#memory_int_427| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:54,946 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:28:54,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 16 treesize of output 11 [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,971 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:54,971 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,971 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:54,978 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:54,979 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_428|]. (let ((.cse0 (select |v_#memory_int_428| ULTIMATE.start_main_p1))) (and (= 14 .cse0) (= (store |v_#memory_int_428| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:54,979 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:28:55,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 16 treesize of output 11 [2019-05-15 10:28:55,002 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,004 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:55,004 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,004 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:55,011 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:55,012 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_429|]. (let ((.cse0 (select |v_#memory_int_429| ULTIMATE.start_main_p1))) (and (= 15 .cse0) (= (store |v_#memory_int_429| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:55,012 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:28:55,033 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:55,034 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,036 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:55,036 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,037 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:55,058 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:55,059 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_430|]. (let ((.cse0 (select |v_#memory_int_430| ULTIMATE.start_main_p1))) (and (= 16 .cse0) (= |#memory_int| (store |v_#memory_int_430| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:55,059 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:28:55,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 16 treesize of output 11 [2019-05-15 10:28:55,200 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:55,202 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,202 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:55,208 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:55,208 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_431|]. (let ((.cse0 (select |v_#memory_int_431| ULTIMATE.start_main_p1))) (and (= 17 .cse0) (= |#memory_int| (store |v_#memory_int_431| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:55,208 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:28:55,236 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:55,237 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,239 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:55,240 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,240 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:55,247 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:55,247 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_432|]. (let ((.cse0 (select |v_#memory_int_432| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_432| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 18 .cse0))) [2019-05-15 10:28:55,247 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:28:55,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:55,290 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,295 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 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 1 xjuncts. [2019-05-15 10:28:55,295 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:55,301 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:55,301 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_433|]. (let ((.cse0 (select |v_#memory_int_433| ULTIMATE.start_main_p1))) (and (= .cse0 19) (= (store |v_#memory_int_433| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:55,302 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:28:55,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:55,332 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,334 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:55,334 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,335 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:55,342 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:55,343 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_434|]. (let ((.cse0 (select |v_#memory_int_434| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_434| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 20))) [2019-05-15 10:28:55,343 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:28:55,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:55,396 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,398 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:55,398 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,398 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:55,406 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:55,406 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_435|]. (let ((.cse0 (select |v_#memory_int_435| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_435| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 21 .cse0))) [2019-05-15 10:28:55,406 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:28:55,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:55,433 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,436 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:55,436 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,436 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:55,443 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:55,443 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_436|]. (let ((.cse0 (select |v_#memory_int_436| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_436| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 22))) [2019-05-15 10:28:55,443 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:28:55,471 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:55,472 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,474 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:55,474 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,475 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:55,483 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:55,483 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_437|]. (let ((.cse0 (select |v_#memory_int_437| ULTIMATE.start_main_p1))) (and (= 23 .cse0) (= |#memory_int| (store |v_#memory_int_437| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:55,483 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:28:55,511 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:55,512 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,515 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:55,515 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,515 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:55,523 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:55,523 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_438|]. (let ((.cse0 (select |v_#memory_int_438| ULTIMATE.start_main_p1))) (and (= 24 .cse0) (= |#memory_int| (store |v_#memory_int_438| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:55,523 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:28:55,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 16 treesize of output 11 [2019-05-15 10:28:55,554 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,556 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:55,556 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,557 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:55,563 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:55,563 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_439|]. (let ((.cse0 (select |v_#memory_int_439| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_439| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 25 .cse0))) [2019-05-15 10:28:55,563 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:28:55,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:55,725 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,762 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:55,762 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,763 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:55,776 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:55,776 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_440|]. (let ((.cse0 (select |v_#memory_int_440| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_440| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 26 .cse0))) [2019-05-15 10:28:55,776 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:28:55,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 16 treesize of output 11 [2019-05-15 10:28:55,856 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,858 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:55,858 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,858 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:55,876 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:55,877 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_441|]. (let ((.cse0 (select |v_#memory_int_441| ULTIMATE.start_main_p1))) (and (= .cse0 27) (= (store |v_#memory_int_441| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:55,877 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:28:55,906 INFO L273 TraceCheckUtils]: 0: Hoare triple {4102#true} havoc main_p1; {4102#true} is VALID [2019-05-15 10:28:55,906 INFO L273 TraceCheckUtils]: 1: Hoare triple {4102#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {4102#true} is VALID [2019-05-15 10:28:55,907 INFO L273 TraceCheckUtils]: 2: Hoare triple {4102#true} #memory_int := #memory_int[main_p1 := 0]; {4113#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:55,907 INFO L273 TraceCheckUtils]: 3: Hoare triple {4113#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4117#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:55,908 INFO L273 TraceCheckUtils]: 4: Hoare triple {4117#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4121#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:55,909 INFO L273 TraceCheckUtils]: 5: Hoare triple {4121#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4125#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:28:55,910 INFO L273 TraceCheckUtils]: 6: Hoare triple {4125#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4129#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:28:55,910 INFO L273 TraceCheckUtils]: 7: Hoare triple {4129#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4133#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:28:55,911 INFO L273 TraceCheckUtils]: 8: Hoare triple {4133#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4137#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:28:55,912 INFO L273 TraceCheckUtils]: 9: Hoare triple {4137#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4141#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:28:55,913 INFO L273 TraceCheckUtils]: 10: Hoare triple {4141#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4145#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:28:55,914 INFO L273 TraceCheckUtils]: 11: Hoare triple {4145#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4149#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:28:55,915 INFO L273 TraceCheckUtils]: 12: Hoare triple {4149#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4153#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:28:55,915 INFO L273 TraceCheckUtils]: 13: Hoare triple {4153#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4157#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:28:55,916 INFO L273 TraceCheckUtils]: 14: Hoare triple {4157#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4161#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:28:55,917 INFO L273 TraceCheckUtils]: 15: Hoare triple {4161#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4165#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:28:55,918 INFO L273 TraceCheckUtils]: 16: Hoare triple {4165#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4169#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:28:55,919 INFO L273 TraceCheckUtils]: 17: Hoare triple {4169#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4173#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:28:55,920 INFO L273 TraceCheckUtils]: 18: Hoare triple {4173#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4177#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:28:55,920 INFO L273 TraceCheckUtils]: 19: Hoare triple {4177#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4181#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:28:55,921 INFO L273 TraceCheckUtils]: 20: Hoare triple {4181#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4185#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:28:55,922 INFO L273 TraceCheckUtils]: 21: Hoare triple {4185#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4189#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:28:55,940 INFO L273 TraceCheckUtils]: 22: Hoare triple {4189#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4193#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:28:55,941 INFO L273 TraceCheckUtils]: 23: Hoare triple {4193#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4197#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:28:55,941 INFO L273 TraceCheckUtils]: 24: Hoare triple {4197#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4201#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:28:55,942 INFO L273 TraceCheckUtils]: 25: Hoare triple {4201#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4205#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:28:55,942 INFO L273 TraceCheckUtils]: 26: Hoare triple {4205#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4209#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:28:55,943 INFO L273 TraceCheckUtils]: 27: Hoare triple {4209#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4213#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:28:55,944 INFO L273 TraceCheckUtils]: 28: Hoare triple {4213#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4217#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:28:55,945 INFO L273 TraceCheckUtils]: 29: Hoare triple {4217#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4221#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:28:55,945 INFO L273 TraceCheckUtils]: 30: Hoare triple {4221#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4225#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:28:55,946 INFO L273 TraceCheckUtils]: 31: Hoare triple {4225#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} assume !(#memory_int[main_p1] >= 0); {4103#false} is VALID [2019-05-15 10:28:55,948 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:55,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:55,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-05-15 10:28:55,949 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 32 [2019-05-15 10:28:55,949 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:55,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2019-05-15 10:28:55,978 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:55,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-05-15 10:28:55,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-05-15 10:28:55,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-05-15 10:28:55,979 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 31 states. [2019-05-15 10:28:58,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:58,045 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-05-15 10:28:58,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-05-15 10:28:58,045 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 32 [2019-05-15 10:28:58,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:58,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-05-15 10:28:58,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-05-15 10:28:58,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-05-15 10:28:58,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-05-15 10:28:58,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 35 transitions. [2019-05-15 10:28:58,119 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:58,120 INFO L225 Difference]: With dead ends: 34 [2019-05-15 10:28:58,120 INFO L226 Difference]: Without dead ends: 34 [2019-05-15 10:28:58,121 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-05-15 10:28:58,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-05-15 10:28:58,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-05-15 10:28:58,123 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:58,123 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 34 states. [2019-05-15 10:28:58,123 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2019-05-15 10:28:58,123 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2019-05-15 10:28:58,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:58,124 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-05-15 10:28:58,124 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-05-15 10:28:58,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:58,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:58,125 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2019-05-15 10:28:58,125 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2019-05-15 10:28:58,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:58,126 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-05-15 10:28:58,126 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-05-15 10:28:58,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:58,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:58,126 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:58,126 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:58,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-05-15 10:28:58,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-05-15 10:28:58,127 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-05-15 10:28:58,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:58,127 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-05-15 10:28:58,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-05-15 10:28:58,127 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-05-15 10:28:58,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-05-15 10:28:58,127 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:58,127 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1] [2019-05-15 10:28:58,127 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:58,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:58,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1071845438, now seen corresponding path program 29 times [2019-05-15 10:28:58,128 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:58,141 WARN L254 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 31 conjunts are in the unsatisfiable core [2019-05-15 10:28:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:58,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:58,304 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,305 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,338 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:58,339 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,339 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:58,348 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:58,349 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_442|]. (= (store |v_#memory_int_442| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:28:58,349 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:58,366 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:58,368 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,370 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:58,370 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,370 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:58,378 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:58,378 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_443|]. (let ((.cse0 (select |v_#memory_int_443| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_443| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 0 .cse0))) [2019-05-15 10:28:58,378 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:58,389 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:58,391 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,393 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:58,393 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,393 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:58,401 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:58,402 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_444|]. (let ((.cse0 (select |v_#memory_int_444| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_444| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 1))) [2019-05-15 10:28:58,402 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:58,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 16 treesize of output 11 [2019-05-15 10:28:58,414 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,417 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:58,417 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,417 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:58,425 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:58,426 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_445|]. (let ((.cse0 (select |v_#memory_int_445| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_445| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 2))) [2019-05-15 10:28:58,426 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:28:58,444 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:58,454 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,456 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:58,456 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,456 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:58,463 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:58,463 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_446|]. (let ((.cse0 (select |v_#memory_int_446| ULTIMATE.start_main_p1))) (and (= 3 .cse0) (= (store |v_#memory_int_446| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:58,463 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:28:58,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:58,479 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,481 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:58,481 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,481 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:58,487 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:58,488 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_447|]. (let ((.cse0 (select |v_#memory_int_447| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_447| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 4))) [2019-05-15 10:28:58,488 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:28:58,532 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:58,533 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,535 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:58,535 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,535 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:58,544 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:58,544 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_448|]. (let ((.cse0 (select |v_#memory_int_448| ULTIMATE.start_main_p1))) (and (= 5 .cse0) (= |#memory_int| (store |v_#memory_int_448| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:58,544 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:28:58,639 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:58,654 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,692 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:58,692 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,692 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:58,702 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:58,702 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_449|]. (let ((.cse0 (select |v_#memory_int_449| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_449| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 6))) [2019-05-15 10:28:58,702 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:28:58,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 16 treesize of output 11 [2019-05-15 10:28:58,944 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,946 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:58,947 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,947 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:58,954 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:58,954 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_450|]. (let ((.cse0 (select |v_#memory_int_450| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_450| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 7))) [2019-05-15 10:28:58,954 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:28:58,972 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:58,974 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,976 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:58,976 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,976 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:58,984 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:58,984 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_451|]. (let ((.cse0 (select |v_#memory_int_451| ULTIMATE.start_main_p1))) (and (= 8 .cse0) (= (store |v_#memory_int_451| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:58,984 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:28:59,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 16 treesize of output 11 [2019-05-15 10:28:59,003 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,005 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:59,005 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,006 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:59,013 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:59,013 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_452|]. (let ((.cse0 (select |v_#memory_int_452| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_452| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 9))) [2019-05-15 10:28:59,014 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:28:59,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:59,032 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,035 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:59,035 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,035 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:59,043 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:59,043 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_453|]. (let ((.cse0 (select |v_#memory_int_453| ULTIMATE.start_main_p1))) (and (= .cse0 10) (= (store |v_#memory_int_453| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:59,043 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:28: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 16 treesize of output 11 [2019-05-15 10:28:59,062 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,064 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:59,064 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,065 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:59,073 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:59,073 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_454|]. (let ((.cse0 (select |v_#memory_int_454| ULTIMATE.start_main_p1))) (and (= 11 .cse0) (= (store |v_#memory_int_454| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:59,073 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:28:59,094 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:59,095 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,097 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:59,097 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,098 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:59,103 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:59,103 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_455|]. (let ((.cse0 (select |v_#memory_int_455| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_455| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 12))) [2019-05-15 10:28:59,103 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:28:59,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 16 treesize of output 11 [2019-05-15 10:28:59,132 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,133 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:59,134 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,134 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:59,139 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:59,140 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_456|]. (let ((.cse0 (select |v_#memory_int_456| ULTIMATE.start_main_p1))) (and (= .cse0 13) (= |#memory_int| (store |v_#memory_int_456| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:59,140 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:28:59,161 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:59,168 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,170 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:59,170 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,170 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:59,176 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:59,177 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_457|]. (let ((.cse0 (select |v_#memory_int_457| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_457| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 14 .cse0))) [2019-05-15 10:28:59,177 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:28:59,295 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:59,311 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,321 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:59,321 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,322 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:59,327 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:59,327 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_458|]. (let ((.cse0 (select |v_#memory_int_458| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_458| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 15 .cse0))) [2019-05-15 10:28:59,327 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:28:59,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:59,351 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,354 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:59,354 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,354 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:59,362 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:59,362 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_459|]. (let ((.cse0 (select |v_#memory_int_459| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_459| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 16))) [2019-05-15 10:28:59,362 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:28:59,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:59,385 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,387 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:59,388 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,388 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:59,396 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:59,396 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_460|]. (let ((.cse0 (select |v_#memory_int_460| ULTIMATE.start_main_p1))) (and (= 17 .cse0) (= (store |v_#memory_int_460| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:59,396 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:28:59,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:59,420 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,423 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:59,423 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,423 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:59,430 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:59,430 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_461|]. (let ((.cse0 (select |v_#memory_int_461| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_461| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 18))) [2019-05-15 10:28:59,430 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:28:59,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 16 treesize of output 11 [2019-05-15 10:28:59,462 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,464 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:59,464 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,464 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:59,472 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:59,472 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_462|]. (let ((.cse0 (select |v_#memory_int_462| ULTIMATE.start_main_p1))) (and (= .cse0 19) (= |#memory_int| (store |v_#memory_int_462| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:59,472 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:28:59,499 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:59,500 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,503 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:59,503 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,503 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:59,511 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:59,511 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_463|]. (let ((.cse0 (select |v_#memory_int_463| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_463| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 20))) [2019-05-15 10:28:59,511 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:28:59,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:59,537 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,540 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:59,540 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,540 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:59,548 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:59,548 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_464|]. (let ((.cse0 (select |v_#memory_int_464| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_464| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 21))) [2019-05-15 10:28:59,548 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:28:59,573 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:59,574 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,576 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:59,576 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,576 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:59,584 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:59,584 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_465|]. (let ((.cse0 (select |v_#memory_int_465| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_465| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 22))) [2019-05-15 10:28:59,584 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:28:59,612 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:59,613 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,615 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:59,615 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,616 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:59,623 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:59,623 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_466|]. (let ((.cse0 (select |v_#memory_int_466| ULTIMATE.start_main_p1))) (and (= 23 .cse0) (= |#memory_int| (store |v_#memory_int_466| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:59,624 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:28:59,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:59,651 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,653 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:59,654 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,654 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:59,661 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:59,662 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_467|]. (let ((.cse0 (select |v_#memory_int_467| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_467| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 24 .cse0))) [2019-05-15 10:28:59,662 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:28:59,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 16 treesize of output 11 [2019-05-15 10:28:59,694 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,697 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:59,697 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,697 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:59,707 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:59,707 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_468|]. (let ((.cse0 (select |v_#memory_int_468| ULTIMATE.start_main_p1))) (and (= .cse0 25) (= |#memory_int| (store |v_#memory_int_468| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:59,707 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:28:59,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [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,740 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:59,741 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,741 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:59,749 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:59,749 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_469|]. (let ((.cse0 (select |v_#memory_int_469| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_469| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 26))) [2019-05-15 10:28:59,749 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:28:59,783 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:59,784 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,786 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:59,786 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,786 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:59,793 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:59,794 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_470|]. (let ((.cse0 (select |v_#memory_int_470| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_470| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 27 .cse0))) [2019-05-15 10:28:59,794 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:28:59,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 16 treesize of output 11 [2019-05-15 10:28:59,826 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,828 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:59,828 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,829 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:59,836 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:59,837 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_471|]. (let ((.cse0 (select |v_#memory_int_471| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_471| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 28 .cse0))) [2019-05-15 10:28:59,837 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:28:59,862 INFO L273 TraceCheckUtils]: 0: Hoare triple {4364#true} havoc main_p1; {4364#true} is VALID [2019-05-15 10:28:59,863 INFO L273 TraceCheckUtils]: 1: Hoare triple {4364#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {4364#true} is VALID [2019-05-15 10:28:59,864 INFO L273 TraceCheckUtils]: 2: Hoare triple {4364#true} #memory_int := #memory_int[main_p1 := 0]; {4375#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:59,864 INFO L273 TraceCheckUtils]: 3: Hoare triple {4375#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4379#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:59,865 INFO L273 TraceCheckUtils]: 4: Hoare triple {4379#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4383#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:59,866 INFO L273 TraceCheckUtils]: 5: Hoare triple {4383#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4387#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:28:59,867 INFO L273 TraceCheckUtils]: 6: Hoare triple {4387#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4391#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:28:59,868 INFO L273 TraceCheckUtils]: 7: Hoare triple {4391#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4395#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:28:59,869 INFO L273 TraceCheckUtils]: 8: Hoare triple {4395#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4399#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:28:59,869 INFO L273 TraceCheckUtils]: 9: Hoare triple {4399#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4403#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:28:59,870 INFO L273 TraceCheckUtils]: 10: Hoare triple {4403#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4407#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:28:59,871 INFO L273 TraceCheckUtils]: 11: Hoare triple {4407#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4411#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:28:59,872 INFO L273 TraceCheckUtils]: 12: Hoare triple {4411#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4415#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:28:59,873 INFO L273 TraceCheckUtils]: 13: Hoare triple {4415#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4419#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:28:59,873 INFO L273 TraceCheckUtils]: 14: Hoare triple {4419#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4423#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:28:59,874 INFO L273 TraceCheckUtils]: 15: Hoare triple {4423#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4427#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:28:59,875 INFO L273 TraceCheckUtils]: 16: Hoare triple {4427#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4431#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:28:59,876 INFO L273 TraceCheckUtils]: 17: Hoare triple {4431#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4435#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:28:59,877 INFO L273 TraceCheckUtils]: 18: Hoare triple {4435#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4439#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:28:59,878 INFO L273 TraceCheckUtils]: 19: Hoare triple {4439#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4443#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:28:59,878 INFO L273 TraceCheckUtils]: 20: Hoare triple {4443#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4447#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:28:59,879 INFO L273 TraceCheckUtils]: 21: Hoare triple {4447#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4451#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:28:59,880 INFO L273 TraceCheckUtils]: 22: Hoare triple {4451#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4455#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:28:59,881 INFO L273 TraceCheckUtils]: 23: Hoare triple {4455#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4459#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:28:59,882 INFO L273 TraceCheckUtils]: 24: Hoare triple {4459#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4463#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:28:59,884 INFO L273 TraceCheckUtils]: 25: Hoare triple {4463#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4467#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:28:59,885 INFO L273 TraceCheckUtils]: 26: Hoare triple {4467#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4471#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:28:59,886 INFO L273 TraceCheckUtils]: 27: Hoare triple {4471#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4475#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:28:59,886 INFO L273 TraceCheckUtils]: 28: Hoare triple {4475#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4479#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:28:59,887 INFO L273 TraceCheckUtils]: 29: Hoare triple {4479#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4483#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:28:59,887 INFO L273 TraceCheckUtils]: 30: Hoare triple {4483#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4487#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:28:59,888 INFO L273 TraceCheckUtils]: 31: Hoare triple {4487#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4491#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:28:59,888 INFO L273 TraceCheckUtils]: 32: Hoare triple {4491#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} assume !(#memory_int[main_p1] >= 0); {4365#false} is VALID [2019-05-15 10:28:59,890 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:59,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:59,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-05-15 10:28:59,891 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 33 [2019-05-15 10:28:59,891 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:59,891 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2019-05-15 10:28:59,918 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:59,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-05-15 10:28:59,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-05-15 10:28:59,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-05-15 10:28:59,919 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 32 states. [2019-05-15 10:29:01,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:01,966 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-05-15 10:29:01,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-05-15 10:29:01,966 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 33 [2019-05-15 10:29:01,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:29:01,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-05-15 10:29:01,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-05-15 10:29:01,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-05-15 10:29:01,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-05-15 10:29:01,968 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 36 transitions. [2019-05-15 10:29:01,996 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:01,997 INFO L225 Difference]: With dead ends: 35 [2019-05-15 10:29:01,997 INFO L226 Difference]: Without dead ends: 35 [2019-05-15 10:29:01,998 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-05-15 10:29:01,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-05-15 10:29:01,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-05-15 10:29:01,999 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:29:01,999 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2019-05-15 10:29:02,000 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2019-05-15 10:29:02,000 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2019-05-15 10:29:02,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:02,000 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-05-15 10:29:02,000 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-05-15 10:29:02,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:02,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:02,001 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2019-05-15 10:29:02,001 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2019-05-15 10:29:02,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:02,001 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-05-15 10:29:02,001 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-05-15 10:29:02,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:02,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:02,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:29:02,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:29:02,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-05-15 10:29:02,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-05-15 10:29:02,002 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-05-15 10:29:02,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:29:02,002 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-05-15 10:29:02,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-05-15 10:29:02,002 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-05-15 10:29:02,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-05-15 10:29:02,003 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:29:02,003 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1] [2019-05-15 10:29:02,003 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:29:02,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:29:02,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1132529736, now seen corresponding path program 30 times [2019-05-15 10:29:02,004 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:29:02,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:02,016 WARN L254 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 32 conjunts are in the unsatisfiable core [2019-05-15 10:29:02,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:02,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:29:02,046 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:02,046 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,048 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:02,048 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,048 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:29:02,049 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:02,049 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_472|]. (= (store |v_#memory_int_472| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:29:02,049 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:29:02,058 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:02,059 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,061 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:02,061 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,061 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:02,069 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:02,069 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_473|]. (let ((.cse0 (select |v_#memory_int_473| ULTIMATE.start_main_p1))) (and (= 0 .cse0) (= |#memory_int| (store |v_#memory_int_473| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:02,069 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:29:02,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:02,081 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,083 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:02,083 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,084 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:02,092 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:02,092 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_474|]. (let ((.cse0 (select |v_#memory_int_474| ULTIMATE.start_main_p1))) (and (= 1 .cse0) (= (store |v_#memory_int_474| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:02,092 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:29:02,104 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:02,105 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,107 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:02,107 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,107 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:02,115 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:02,115 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_475|]. (let ((.cse0 (select |v_#memory_int_475| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_475| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 2))) [2019-05-15 10:29:02,115 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:29:02,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 16 treesize of output 11 [2019-05-15 10:29:02,129 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,131 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:02,131 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,131 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:02,138 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:02,138 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_476|]. (let ((.cse0 (select |v_#memory_int_476| ULTIMATE.start_main_p1))) (and (= .cse0 3) (= (store |v_#memory_int_476| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:02,138 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:29:02,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 16 treesize of output 11 [2019-05-15 10:29:02,152 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,154 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:02,154 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,154 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:02,162 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:02,162 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_477|]. (let ((.cse0 (select |v_#memory_int_477| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_477| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 4))) [2019-05-15 10:29:02,162 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:29:02,177 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:02,178 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,180 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:02,180 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,181 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:02,188 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:02,189 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_478|]. (let ((.cse0 (select |v_#memory_int_478| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_478| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 5 .cse0))) [2019-05-15 10:29:02,189 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:29:02,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 16 treesize of output 11 [2019-05-15 10:29:02,203 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,205 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:02,205 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,205 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:02,213 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:02,213 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_479|]. (let ((.cse0 (select |v_#memory_int_479| ULTIMATE.start_main_p1))) (and (= .cse0 6) (= (store |v_#memory_int_479| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:02,213 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:29:02,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 16 treesize of output 11 [2019-05-15 10:29:02,229 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,231 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:02,231 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,231 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:02,239 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:02,239 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_480|]. (let ((.cse0 (select |v_#memory_int_480| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_480| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 7))) [2019-05-15 10:29:02,239 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:29:02,253 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [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,256 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:02,257 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,257 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:02,264 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:02,264 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_481|]. (let ((.cse0 (select |v_#memory_int_481| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_481| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 8))) [2019-05-15 10:29:02,264 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:29:02,280 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:02,281 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,283 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:02,283 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,283 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:02,291 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:02,291 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_482|]. (let ((.cse0 (select |v_#memory_int_482| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_482| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 9))) [2019-05-15 10:29:02,291 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:29:02,307 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:02,308 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,310 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:02,311 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,311 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:02,319 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:02,319 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_483|]. (let ((.cse0 (select |v_#memory_int_483| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_483| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 10 .cse0))) [2019-05-15 10:29:02,319 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:29:02,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 16 treesize of output 11 [2019-05-15 10:29:02,338 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,340 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:02,340 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,341 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:02,349 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:02,349 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_484|]. (let ((.cse0 (select |v_#memory_int_484| ULTIMATE.start_main_p1))) (and (= .cse0 11) (= |#memory_int| (store |v_#memory_int_484| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:02,349 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:29:02,369 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:02,370 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,372 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:02,373 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,373 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:02,380 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:02,380 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_485|]. (let ((.cse0 (select |v_#memory_int_485| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_485| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 12))) [2019-05-15 10:29:02,380 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:29:02,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:02,400 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,402 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:02,402 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,402 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:02,409 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:02,410 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_486|]. (let ((.cse0 (select |v_#memory_int_486| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_486| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 13))) [2019-05-15 10:29:02,410 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:29:02,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 16 treesize of output 11 [2019-05-15 10:29:02,432 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,434 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:02,434 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,435 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:02,442 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:02,443 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_487|]. (let ((.cse0 (select |v_#memory_int_487| ULTIMATE.start_main_p1))) (and (= 14 .cse0) (= |#memory_int| (store |v_#memory_int_487| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:02,443 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:29:02,464 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:02,466 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,468 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:02,468 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,468 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:02,476 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:02,476 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_488|]. (let ((.cse0 (select |v_#memory_int_488| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_488| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 15))) [2019-05-15 10:29:02,476 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:29:02,502 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:02,503 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,505 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:02,506 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,506 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:02,512 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:02,512 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_489|]. (let ((.cse0 (select |v_#memory_int_489| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_489| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 16))) [2019-05-15 10:29:02,513 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:29:02,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 16 treesize of output 11 [2019-05-15 10:29:02,536 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,538 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:02,538 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,539 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:02,545 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:02,546 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_490|]. (let ((.cse0 (select |v_#memory_int_490| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_490| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 17))) [2019-05-15 10:29:02,546 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:29:02,570 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:02,571 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,573 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:02,574 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,574 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:02,581 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:02,582 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_491|]. (let ((.cse0 (select |v_#memory_int_491| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_491| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 18 .cse0))) [2019-05-15 10:29:02,582 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:29:02,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:02,607 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,609 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:02,609 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,610 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:02,617 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:02,618 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_492|]. (let ((.cse0 (select |v_#memory_int_492| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_492| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 19))) [2019-05-15 10:29:02,618 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:29:02,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:02,668 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,673 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:02,673 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,673 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:02,679 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:02,679 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_493|]. (let ((.cse0 (select |v_#memory_int_493| ULTIMATE.start_main_p1))) (and (= .cse0 20) (= (store |v_#memory_int_493| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:02,680 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:29:02,781 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:02,782 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,784 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:02,784 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,784 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:02,792 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:02,792 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_494|]. (let ((.cse0 (select |v_#memory_int_494| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_494| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 21))) [2019-05-15 10:29:02,792 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:29:02,930 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:02,931 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,936 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:02,937 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,937 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:02,944 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:02,944 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_495|]. (let ((.cse0 (select |v_#memory_int_495| ULTIMATE.start_main_p1))) (and (= .cse0 22) (= (store |v_#memory_int_495| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:02,944 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:29:03,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:03,017 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:03,025 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:03,025 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:03,025 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:03,031 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:03,031 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_496|]. (let ((.cse0 (select |v_#memory_int_496| ULTIMATE.start_main_p1))) (and (= 23 .cse0) (= (store |v_#memory_int_496| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:03,031 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:29:03,071 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:03,072 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:03,075 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:03,075 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:03,075 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:03,083 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:03,084 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_497|]. (let ((.cse0 (select |v_#memory_int_497| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_497| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 24))) [2019-05-15 10:29:03,084 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:29:03,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 16 treesize of output 11 [2019-05-15 10:29:03,112 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:03,115 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:03,115 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:03,115 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:03,122 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:03,122 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_498|]. (let ((.cse0 (select |v_#memory_int_498| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_498| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 25))) [2019-05-15 10:29:03,122 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:29:03,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 16 treesize of output 11 [2019-05-15 10:29:03,156 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:03,158 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:03,158 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:03,158 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:03,166 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:03,166 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_499|]. (let ((.cse0 (select |v_#memory_int_499| ULTIMATE.start_main_p1))) (and (= 26 .cse0) (= |#memory_int| (store |v_#memory_int_499| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:03,166 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:29:03,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 16 treesize of output 11 [2019-05-15 10:29:03,199 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:03,201 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:03,202 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:03,202 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:03,210 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:03,210 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_500|]. (let ((.cse0 (select |v_#memory_int_500| ULTIMATE.start_main_p1))) (and (= 27 .cse0) (= (store |v_#memory_int_500| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:03,210 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:29:03,242 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:03,243 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:03,246 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:03,246 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:03,246 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:03,253 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:03,253 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_501|]. (let ((.cse0 (select |v_#memory_int_501| ULTIMATE.start_main_p1))) (and (= 28 .cse0) (= (store |v_#memory_int_501| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:03,254 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:29:03,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:03,292 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:03,295 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:03,295 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:03,295 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:03,303 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:03,303 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_502|]. (let ((.cse0 (select |v_#memory_int_502| ULTIMATE.start_main_p1))) (and (= .cse0 29) (= (store |v_#memory_int_502| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:03,303 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:29:03,331 INFO L273 TraceCheckUtils]: 0: Hoare triple {4634#true} havoc main_p1; {4634#true} is VALID [2019-05-15 10:29:03,331 INFO L273 TraceCheckUtils]: 1: Hoare triple {4634#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {4634#true} is VALID [2019-05-15 10:29:03,331 INFO L273 TraceCheckUtils]: 2: Hoare triple {4634#true} #memory_int := #memory_int[main_p1 := 0]; {4645#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:29:03,332 INFO L273 TraceCheckUtils]: 3: Hoare triple {4645#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4649#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:29:03,333 INFO L273 TraceCheckUtils]: 4: Hoare triple {4649#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4653#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:29:03,333 INFO L273 TraceCheckUtils]: 5: Hoare triple {4653#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4657#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:29:03,334 INFO L273 TraceCheckUtils]: 6: Hoare triple {4657#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4661#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:29:03,335 INFO L273 TraceCheckUtils]: 7: Hoare triple {4661#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4665#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:29:03,336 INFO L273 TraceCheckUtils]: 8: Hoare triple {4665#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4669#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:29:03,357 INFO L273 TraceCheckUtils]: 9: Hoare triple {4669#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4673#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:29:03,368 INFO L273 TraceCheckUtils]: 10: Hoare triple {4673#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4677#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:29:03,369 INFO L273 TraceCheckUtils]: 11: Hoare triple {4677#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4681#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:29:03,370 INFO L273 TraceCheckUtils]: 12: Hoare triple {4681#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4685#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:29:03,370 INFO L273 TraceCheckUtils]: 13: Hoare triple {4685#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4689#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:29:03,371 INFO L273 TraceCheckUtils]: 14: Hoare triple {4689#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4693#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:29:03,371 INFO L273 TraceCheckUtils]: 15: Hoare triple {4693#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4697#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:29:03,372 INFO L273 TraceCheckUtils]: 16: Hoare triple {4697#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4701#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:29:03,373 INFO L273 TraceCheckUtils]: 17: Hoare triple {4701#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4705#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:29:03,374 INFO L273 TraceCheckUtils]: 18: Hoare triple {4705#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4709#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:29:03,374 INFO L273 TraceCheckUtils]: 19: Hoare triple {4709#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4713#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:29:03,375 INFO L273 TraceCheckUtils]: 20: Hoare triple {4713#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4717#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:29:03,376 INFO L273 TraceCheckUtils]: 21: Hoare triple {4717#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4721#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:29:03,377 INFO L273 TraceCheckUtils]: 22: Hoare triple {4721#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4725#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:29:03,377 INFO L273 TraceCheckUtils]: 23: Hoare triple {4725#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4729#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:29:03,378 INFO L273 TraceCheckUtils]: 24: Hoare triple {4729#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4733#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:29:03,379 INFO L273 TraceCheckUtils]: 25: Hoare triple {4733#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4737#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:29:03,380 INFO L273 TraceCheckUtils]: 26: Hoare triple {4737#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4741#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:29:03,381 INFO L273 TraceCheckUtils]: 27: Hoare triple {4741#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4745#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:29:03,381 INFO L273 TraceCheckUtils]: 28: Hoare triple {4745#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4749#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:29:03,382 INFO L273 TraceCheckUtils]: 29: Hoare triple {4749#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4753#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:29:03,383 INFO L273 TraceCheckUtils]: 30: Hoare triple {4753#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4757#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:29:03,384 INFO L273 TraceCheckUtils]: 31: Hoare triple {4757#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4761#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:29:03,385 INFO L273 TraceCheckUtils]: 32: Hoare triple {4761#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4765#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:29:03,385 INFO L273 TraceCheckUtils]: 33: Hoare triple {4765#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} assume !(#memory_int[main_p1] >= 0); {4635#false} is VALID [2019-05-15 10:29:03,388 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:29:03,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:29:03,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-05-15 10:29:03,389 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 34 [2019-05-15 10:29:03,389 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:29:03,389 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2019-05-15 10:29:03,416 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:29:03,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-05-15 10:29:03,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-05-15 10:29:03,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-05-15 10:29:03,417 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 33 states. [2019-05-15 10:29:05,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:05,674 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-05-15 10:29:05,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-05-15 10:29:05,674 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 34 [2019-05-15 10:29:05,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:29:05,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-05-15 10:29:05,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-05-15 10:29:05,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-05-15 10:29:05,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-05-15 10:29:05,676 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 37 transitions. [2019-05-15 10:29:05,710 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:29:05,711 INFO L225 Difference]: With dead ends: 36 [2019-05-15 10:29:05,711 INFO L226 Difference]: Without dead ends: 36 [2019-05-15 10:29:05,712 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-05-15 10:29:05,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-05-15 10:29:05,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-05-15 10:29:05,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:29:05,714 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 36 states. [2019-05-15 10:29:05,715 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2019-05-15 10:29:05,715 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2019-05-15 10:29:05,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:05,715 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-05-15 10:29:05,716 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-05-15 10:29:05,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:05,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:05,716 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2019-05-15 10:29:05,716 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2019-05-15 10:29:05,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:05,717 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-05-15 10:29:05,717 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-05-15 10:29:05,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:05,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:05,718 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:29:05,718 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:29:05,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-05-15 10:29:05,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-05-15 10:29:05,719 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-05-15 10:29:05,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:29:05,719 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-05-15 10:29:05,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-05-15 10:29:05,719 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-05-15 10:29:05,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-05-15 10:29:05,720 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:29:05,720 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1] [2019-05-15 10:29:05,720 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:29:05,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:29:05,721 INFO L82 PathProgramCache]: Analyzing trace with hash 748683394, now seen corresponding path program 31 times [2019-05-15 10:29:05,721 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:29:05,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:05,734 WARN L254 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 33 conjunts are in the unsatisfiable core [2019-05-15 10:29:05,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:05,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:29:05,888 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:05,888 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:05,891 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:05,891 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:05,891 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:29:05,893 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:05,894 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_503|]. (= (store |v_#memory_int_503| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:29:05,894 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:29:05,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:05,910 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:05,912 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:05,912 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:05,912 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:05,919 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:05,919 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_504|]. (let ((.cse0 (select |v_#memory_int_504| ULTIMATE.start_main_p1))) (and (= 0 .cse0) (= |#memory_int| (store |v_#memory_int_504| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:05,920 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:29:05,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 16 treesize of output 11 [2019-05-15 10:29:05,932 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:05,934 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:05,934 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:05,934 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:05,943 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:05,944 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_505|]. (let ((.cse0 (select |v_#memory_int_505| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_505| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 1))) [2019-05-15 10:29:05,944 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:29:05,953 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:05,954 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:05,956 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:05,956 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:05,956 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:05,963 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:05,963 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_506|]. (let ((.cse0 (select |v_#memory_int_506| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_506| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 2))) [2019-05-15 10:29:05,964 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:29:05,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:05,976 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:05,978 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:05,979 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:05,979 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:05,987 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:05,987 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_507|]. (let ((.cse0 (select |v_#memory_int_507| ULTIMATE.start_main_p1))) (and (= .cse0 3) (= (store |v_#memory_int_507| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:05,987 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:29:06,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 16 treesize of output 11 [2019-05-15 10:29:06,001 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:06,003 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:06,003 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,003 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:06,011 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:06,011 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_508|]. (let ((.cse0 (select |v_#memory_int_508| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_508| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 4 .cse0))) [2019-05-15 10:29:06,011 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:29:06,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 16 treesize of output 11 [2019-05-15 10:29:06,031 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:06,033 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:06,033 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,034 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:06,041 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:06,041 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_509|]. (let ((.cse0 (select |v_#memory_int_509| ULTIMATE.start_main_p1))) (and (= 5 .cse0) (= |#memory_int| (store |v_#memory_int_509| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:06,042 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:29:06,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 16 treesize of output 11 [2019-05-15 10:29:06,058 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:06,060 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:06,060 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,061 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:06,067 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:06,068 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_510|]. (let ((.cse0 (select |v_#memory_int_510| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_510| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 6))) [2019-05-15 10:29:06,068 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:29:06,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:06,086 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:06,088 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:06,088 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,089 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:06,095 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:06,095 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_511|]. (let ((.cse0 (select |v_#memory_int_511| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_511| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 7 .cse0))) [2019-05-15 10:29:06,095 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:29:06,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:06,111 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:06,113 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:06,113 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,114 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:06,120 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:06,121 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_512|]. (let ((.cse0 (select |v_#memory_int_512| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_512| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 8 .cse0))) [2019-05-15 10:29:06,121 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:29:06,136 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:06,137 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:06,139 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:06,139 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,139 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:06,146 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:06,147 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_513|]. (let ((.cse0 (select |v_#memory_int_513| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_513| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 9))) [2019-05-15 10:29:06,147 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:29:06,164 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:06,165 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:06,167 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:06,167 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,168 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:06,175 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:06,175 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_514|]. (let ((.cse0 (select |v_#memory_int_514| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_514| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 10))) [2019-05-15 10:29:06,175 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:29:06,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 16 treesize of output 11 [2019-05-15 10:29:06,194 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:06,196 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:06,196 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,197 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:06,203 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:06,203 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_515|]. (let ((.cse0 (select |v_#memory_int_515| ULTIMATE.start_main_p1))) (and (= 11 .cse0) (= (store |v_#memory_int_515| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:06,203 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:29:06,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:06,223 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:06,225 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:06,225 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,226 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:06,233 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:06,233 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_516|]. (let ((.cse0 (select |v_#memory_int_516| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_516| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 12 .cse0))) [2019-05-15 10:29:06,233 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:29:06,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 16 treesize of output 11 [2019-05-15 10:29:06,254 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:06,256 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:06,256 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,256 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:06,262 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:06,262 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_517|]. (let ((.cse0 (select |v_#memory_int_517| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_517| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 13))) [2019-05-15 10:29:06,262 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:29:06,293 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:06,294 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:06,295 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:06,295 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,296 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:06,303 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:06,304 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_518|]. (let ((.cse0 (select |v_#memory_int_518| ULTIMATE.start_main_p1))) (and (= .cse0 14) (= (store |v_#memory_int_518| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:06,304 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:29:06,325 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:06,326 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:06,328 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:06,328 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,329 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:06,334 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:06,335 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_519|]. (let ((.cse0 (select |v_#memory_int_519| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_519| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 15 .cse0))) [2019-05-15 10:29:06,335 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:29:06,358 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:06,360 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:06,362 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:06,362 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,362 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:06,369 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:06,370 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_520|]. (let ((.cse0 (select |v_#memory_int_520| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_520| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 16))) [2019-05-15 10:29:06,370 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:29:06,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 16 treesize of output 11 [2019-05-15 10:29:06,395 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:06,396 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:06,397 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,397 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:06,403 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:06,403 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_521|]. (let ((.cse0 (select |v_#memory_int_521| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_521| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 17 .cse0))) [2019-05-15 10:29:06,403 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:29:06,427 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:06,428 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:06,430 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:06,431 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,431 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:06,438 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:06,439 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_522|]. (let ((.cse0 (select |v_#memory_int_522| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_522| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 18 .cse0))) [2019-05-15 10:29:06,439 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:29:06,472 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:06,473 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:06,475 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:06,475 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,476 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:06,483 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:06,484 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_523|]. (let ((.cse0 (select |v_#memory_int_523| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_523| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 19 .cse0))) [2019-05-15 10:29:06,484 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:29:06,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 16 treesize of output 11 [2019-05-15 10:29:06,511 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:06,513 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:06,514 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,514 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:06,521 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:06,521 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_524|]. (let ((.cse0 (select |v_#memory_int_524| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_524| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 20))) [2019-05-15 10:29:06,521 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:29:06,547 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:06,548 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:06,551 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:06,551 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,551 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:06,558 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:06,558 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_525|]. (let ((.cse0 (select |v_#memory_int_525| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_525| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 21))) [2019-05-15 10:29:06,558 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:29:06,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:06,603 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:06,605 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:06,605 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,605 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:06,611 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:06,611 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_526|]. (let ((.cse0 (select |v_#memory_int_526| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_526| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 22))) [2019-05-15 10:29:06,611 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:29:06,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 16 treesize of output 11 [2019-05-15 10:29:06,639 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:06,640 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:06,640 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,640 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:06,647 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:06,648 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_527|]. (let ((.cse0 (select |v_#memory_int_527| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_527| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 23 .cse0))) [2019-05-15 10:29:06,648 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:29:06,678 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:06,679 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:06,681 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:06,681 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,682 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:06,689 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:06,690 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_528|]. (let ((.cse0 (select |v_#memory_int_528| ULTIMATE.start_main_p1))) (and (= .cse0 24) (= |#memory_int| (store |v_#memory_int_528| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:06,690 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:29:06,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:06,721 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:06,723 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:06,723 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,724 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:06,731 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:06,731 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_529|]. (let ((.cse0 (select |v_#memory_int_529| ULTIMATE.start_main_p1))) (and (= .cse0 25) (= (store |v_#memory_int_529| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:06,731 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:29:06,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 16 treesize of output 11 [2019-05-15 10:29:06,763 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:06,766 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:06,766 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,766 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:06,776 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:06,776 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_530|]. (let ((.cse0 (select |v_#memory_int_530| ULTIMATE.start_main_p1))) (and (= 26 .cse0) (= (store |v_#memory_int_530| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:06,776 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:29:06,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 16 treesize of output 11 [2019-05-15 10:29:06,813 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:06,815 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:06,816 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,816 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:06,823 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:06,823 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_531|]. (let ((.cse0 (select |v_#memory_int_531| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_531| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 27))) [2019-05-15 10:29:06,823 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:29:06,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 16 treesize of output 11 [2019-05-15 10:29:06,856 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:06,858 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:06,859 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,859 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:06,868 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:06,868 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_532|]. (let ((.cse0 (select |v_#memory_int_532| ULTIMATE.start_main_p1))) (and (= .cse0 28) (= (store |v_#memory_int_532| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:06,868 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:29:06,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 16 treesize of output 11 [2019-05-15 10:29:06,922 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:06,926 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:06,926 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,926 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:06,934 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:06,934 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_533|]. (let ((.cse0 (select |v_#memory_int_533| ULTIMATE.start_main_p1))) (and (= .cse0 29) (= |#memory_int| (store |v_#memory_int_533| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:06,934 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:29:06,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 16 treesize of output 11 [2019-05-15 10:29:06,967 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:06,969 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:06,969 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,970 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:06,978 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:06,978 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_534|]. (let ((.cse0 (select |v_#memory_int_534| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_534| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 30 .cse0))) [2019-05-15 10:29:06,978 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:29:07,006 INFO L273 TraceCheckUtils]: 0: Hoare triple {4912#true} havoc main_p1; {4912#true} is VALID [2019-05-15 10:29:07,007 INFO L273 TraceCheckUtils]: 1: Hoare triple {4912#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {4912#true} is VALID [2019-05-15 10:29:07,008 INFO L273 TraceCheckUtils]: 2: Hoare triple {4912#true} #memory_int := #memory_int[main_p1 := 0]; {4923#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:29:07,009 INFO L273 TraceCheckUtils]: 3: Hoare triple {4923#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4927#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:29:07,010 INFO L273 TraceCheckUtils]: 4: Hoare triple {4927#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4931#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:29:07,010 INFO L273 TraceCheckUtils]: 5: Hoare triple {4931#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4935#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:29:07,011 INFO L273 TraceCheckUtils]: 6: Hoare triple {4935#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4939#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:29:07,011 INFO L273 TraceCheckUtils]: 7: Hoare triple {4939#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4943#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:29:07,012 INFO L273 TraceCheckUtils]: 8: Hoare triple {4943#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4947#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:29:07,012 INFO L273 TraceCheckUtils]: 9: Hoare triple {4947#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4951#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:29:07,013 INFO L273 TraceCheckUtils]: 10: Hoare triple {4951#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4955#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:29:07,014 INFO L273 TraceCheckUtils]: 11: Hoare triple {4955#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4959#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:29:07,015 INFO L273 TraceCheckUtils]: 12: Hoare triple {4959#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4963#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:29:07,016 INFO L273 TraceCheckUtils]: 13: Hoare triple {4963#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4967#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:29:07,016 INFO L273 TraceCheckUtils]: 14: Hoare triple {4967#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4971#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:29:07,017 INFO L273 TraceCheckUtils]: 15: Hoare triple {4971#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4975#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:29:07,018 INFO L273 TraceCheckUtils]: 16: Hoare triple {4975#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4979#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:29:07,019 INFO L273 TraceCheckUtils]: 17: Hoare triple {4979#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4983#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:29:07,020 INFO L273 TraceCheckUtils]: 18: Hoare triple {4983#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4987#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:29:07,021 INFO L273 TraceCheckUtils]: 19: Hoare triple {4987#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4991#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:29:07,021 INFO L273 TraceCheckUtils]: 20: Hoare triple {4991#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4995#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:29:07,022 INFO L273 TraceCheckUtils]: 21: Hoare triple {4995#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4999#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:29:07,023 INFO L273 TraceCheckUtils]: 22: Hoare triple {4999#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5003#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:29:07,024 INFO L273 TraceCheckUtils]: 23: Hoare triple {5003#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5007#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:29:07,025 INFO L273 TraceCheckUtils]: 24: Hoare triple {5007#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5011#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:29:07,025 INFO L273 TraceCheckUtils]: 25: Hoare triple {5011#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5015#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:29:07,026 INFO L273 TraceCheckUtils]: 26: Hoare triple {5015#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5019#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:29:07,027 INFO L273 TraceCheckUtils]: 27: Hoare triple {5019#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5023#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:29:07,028 INFO L273 TraceCheckUtils]: 28: Hoare triple {5023#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5027#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:29:07,028 INFO L273 TraceCheckUtils]: 29: Hoare triple {5027#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5031#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:29:07,029 INFO L273 TraceCheckUtils]: 30: Hoare triple {5031#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5035#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:29:07,030 INFO L273 TraceCheckUtils]: 31: Hoare triple {5035#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5039#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:29:07,031 INFO L273 TraceCheckUtils]: 32: Hoare triple {5039#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5043#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:29:07,032 INFO L273 TraceCheckUtils]: 33: Hoare triple {5043#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5047#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:29:07,032 INFO L273 TraceCheckUtils]: 34: Hoare triple {5047#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} assume !(#memory_int[main_p1] >= 0); {4913#false} is VALID [2019-05-15 10:29:07,035 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:29:07,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:29:07,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-05-15 10:29:07,036 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 35 [2019-05-15 10:29:07,036 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:29:07,036 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2019-05-15 10:29:07,064 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:29:07,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-05-15 10:29:07,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-05-15 10:29:07,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-05-15 10:29:07,066 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 34 states. [2019-05-15 10:29:09,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:09,410 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-05-15 10:29:09,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-05-15 10:29:09,411 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 35 [2019-05-15 10:29:09,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:29:09,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-05-15 10:29:09,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-05-15 10:29:09,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-05-15 10:29:09,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-05-15 10:29:09,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 38 transitions. [2019-05-15 10:29:09,444 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:09,444 INFO L225 Difference]: With dead ends: 37 [2019-05-15 10:29:09,445 INFO L226 Difference]: Without dead ends: 37 [2019-05-15 10:29:09,445 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-05-15 10:29:09,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-05-15 10:29:09,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-05-15 10:29:09,447 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:29:09,447 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2019-05-15 10:29:09,447 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2019-05-15 10:29:09,447 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2019-05-15 10:29:09,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:09,448 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-05-15 10:29:09,448 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-05-15 10:29:09,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:09,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:09,448 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2019-05-15 10:29:09,448 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2019-05-15 10:29:09,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:09,449 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-05-15 10:29:09,449 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-05-15 10:29:09,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:09,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:09,449 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:29:09,449 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:29:09,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-05-15 10:29:09,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-05-15 10:29:09,450 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-05-15 10:29:09,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:29:09,450 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-05-15 10:29:09,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-05-15 10:29:09,450 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-05-15 10:29:09,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-05-15 10:29:09,450 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:29:09,451 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1] [2019-05-15 10:29:09,451 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:29:09,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:29:09,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1734348680, now seen corresponding path program 32 times [2019-05-15 10:29:09,452 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:29:09,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:09,464 WARN L254 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 34 conjunts are in the unsatisfiable core [2019-05-15 10:29:09,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:09,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:29:09,496 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:09,496 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:09,498 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:09,499 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:09,499 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:29:09,501 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:09,501 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_535|]. (= (store |v_#memory_int_535| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:29:09,501 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:29:09,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:09,514 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:09,516 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:09,516 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:09,516 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:09,524 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:09,524 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_536|]. (let ((.cse0 (select |v_#memory_int_536| ULTIMATE.start_main_p1))) (and (= .cse0 0) (= |#memory_int| (store |v_#memory_int_536| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:09,525 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:29:09,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 16 treesize of output 11 [2019-05-15 10:29:09,569 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:09,570 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:09,570 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:09,571 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:09,578 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:09,578 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_537|]. (let ((.cse0 (select |v_#memory_int_537| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_537| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 1 .cse0))) [2019-05-15 10:29:09,578 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:29:09,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 16 treesize of output 11 [2019-05-15 10:29:09,590 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:09,592 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:09,593 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:09,593 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:09,601 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:09,602 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_538|]. (let ((.cse0 (select |v_#memory_int_538| ULTIMATE.start_main_p1))) (and (= .cse0 2) (= (store |v_#memory_int_538| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:09,602 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:29:09,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 16 treesize of output 11 [2019-05-15 10:29:09,621 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:09,623 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:09,624 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:09,624 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:09,632 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:09,632 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_539|]. (let ((.cse0 (select |v_#memory_int_539| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_539| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 3 .cse0))) [2019-05-15 10:29:09,632 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:29:09,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:09,645 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:09,647 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:09,648 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:09,648 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:09,656 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:09,656 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_540|]. (let ((.cse0 (select |v_#memory_int_540| ULTIMATE.start_main_p1))) (and (= .cse0 4) (= |#memory_int| (store |v_#memory_int_540| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:09,656 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:29:09,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:09,688 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:09,724 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:09,724 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:09,724 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:09,734 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:09,734 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_541|]. (let ((.cse0 (select |v_#memory_int_541| ULTIMATE.start_main_p1))) (and (= .cse0 5) (= (store |v_#memory_int_541| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:09,734 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:29:09,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:09,808 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:09,810 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:09,810 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:09,810 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:09,817 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:09,818 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_542|]. (let ((.cse0 (select |v_#memory_int_542| ULTIMATE.start_main_p1))) (and (= 6 .cse0) (= (store |v_#memory_int_542| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:09,818 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:29:09,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:09,834 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:09,836 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:09,836 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:09,836 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:09,845 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:09,845 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_543|]. (let ((.cse0 (select |v_#memory_int_543| ULTIMATE.start_main_p1))) (and (= .cse0 7) (= (store |v_#memory_int_543| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:09,845 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:29:09,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 16 treesize of output 11 [2019-05-15 10:29:09,861 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:09,863 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:09,863 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:09,863 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:09,877 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:09,877 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_544|]. (let ((.cse0 (select |v_#memory_int_544| ULTIMATE.start_main_p1))) (and (= .cse0 8) (= |#memory_int| (store |v_#memory_int_544| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:09,878 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:29:09,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:09,902 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:09,904 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:09,904 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:09,904 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:09,912 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:09,912 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_545|]. (let ((.cse0 (select |v_#memory_int_545| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_545| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 9 .cse0))) [2019-05-15 10:29:09,913 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:29:09,930 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:09,931 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:09,933 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:09,934 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:09,934 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:09,941 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:09,941 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_546|]. (let ((.cse0 (select |v_#memory_int_546| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_546| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 10 .cse0))) [2019-05-15 10:29:09,941 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:29:09,959 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:09,960 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:09,962 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:09,962 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:09,963 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:09,970 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:09,970 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_547|]. (let ((.cse0 (select |v_#memory_int_547| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_547| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 11))) [2019-05-15 10:29:09,970 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:29:09,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:09,989 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:09,991 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:09,991 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:09,992 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:09,999 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:10,000 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_548|]. (let ((.cse0 (select |v_#memory_int_548| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_548| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 12 .cse0))) [2019-05-15 10:29:10,000 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:29:10,021 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:10,022 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:10,024 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,025 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:10,030 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:10,031 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_549|]. (let ((.cse0 (select |v_#memory_int_549| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_549| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 13 .cse0))) [2019-05-15 10:29:10,031 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:29:10,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 16 treesize of output 11 [2019-05-15 10:29:10,052 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,054 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:10,054 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,054 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:10,062 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:10,063 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_550|]. (let ((.cse0 (select |v_#memory_int_550| ULTIMATE.start_main_p1))) (and (= .cse0 14) (= |#memory_int| (store |v_#memory_int_550| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:10,063 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:29:10,088 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:10,089 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,091 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:10,091 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,091 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:10,097 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:10,097 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_551|]. (let ((.cse0 (select |v_#memory_int_551| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_551| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 15))) [2019-05-15 10:29:10,098 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:29:10,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:10,141 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,180 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:10,180 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,181 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:10,190 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:10,190 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_552|]. (let ((.cse0 (select |v_#memory_int_552| ULTIMATE.start_main_p1))) (and (= 16 .cse0) (= (store |v_#memory_int_552| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:10,191 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:29:10,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 16 treesize of output 11 [2019-05-15 10:29:10,276 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,278 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:10,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:10,278 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:10,284 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:10,285 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_553|]. (let ((.cse0 (select |v_#memory_int_553| ULTIMATE.start_main_p1))) (and (= 17 .cse0) (= |#memory_int| (store |v_#memory_int_553| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:10,285 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:29:10,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:10,314 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,317 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:10,317 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,317 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:10,326 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:10,326 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_554|]. (let ((.cse0 (select |v_#memory_int_554| ULTIMATE.start_main_p1))) (and (= .cse0 18) (= (store |v_#memory_int_554| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:10,326 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:29:10,353 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:10,370 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,409 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:10,409 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,410 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:10,420 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:10,420 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_555|]. (let ((.cse0 (select |v_#memory_int_555| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_555| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 19))) [2019-05-15 10:29:10,421 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:29:11,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:11,002 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,004 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:11,004 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,005 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:11,012 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:11,012 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_556|]. (let ((.cse0 (select |v_#memory_int_556| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_556| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 20 .cse0))) [2019-05-15 10:29:11,012 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:29: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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:11,090 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,091 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:11,092 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,092 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:11,100 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:11,101 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_557|]. (let ((.cse0 (select |v_#memory_int_557| ULTIMATE.start_main_p1))) (and (= .cse0 21) (= |#memory_int| (store |v_#memory_int_557| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:11,101 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:29:11,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 16 treesize of output 11 [2019-05-15 10:29:11,131 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,133 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:11,133 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,133 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:11,142 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:11,142 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_558|]. (let ((.cse0 (select |v_#memory_int_558| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_558| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 22))) [2019-05-15 10:29:11,142 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:29:11,170 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:11,172 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,174 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:11,175 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,175 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:11,183 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:11,183 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_559|]. (let ((.cse0 (select |v_#memory_int_559| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_559| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 23))) [2019-05-15 10:29:11,183 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:29:11,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:11,215 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,218 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:11,218 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,218 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:11,226 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:11,227 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_560|]. (let ((.cse0 (select |v_#memory_int_560| ULTIMATE.start_main_p1))) (and (= .cse0 24) (= |#memory_int| (store |v_#memory_int_560| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:11,227 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:29:11,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:11,257 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,260 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:11,260 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,260 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:11,268 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:11,269 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_561|]. (let ((.cse0 (select |v_#memory_int_561| ULTIMATE.start_main_p1))) (and (= .cse0 25) (= (store |v_#memory_int_561| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:11,269 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:29:11,300 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:11,301 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,304 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:11,304 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,305 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:11,313 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:11,313 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_562|]. (let ((.cse0 (select |v_#memory_int_562| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_562| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 26))) [2019-05-15 10:29:11,313 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:29:11,351 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:11,352 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,354 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:11,354 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,355 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:11,364 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:11,364 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_563|]. (let ((.cse0 (select |v_#memory_int_563| ULTIMATE.start_main_p1))) (and (= 27 .cse0) (= |#memory_int| (store |v_#memory_int_563| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:11,365 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:29:11,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:11,415 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,427 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:11,427 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,428 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:11,435 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:11,435 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_564|]. (let ((.cse0 (select |v_#memory_int_564| ULTIMATE.start_main_p1))) (and (= 28 .cse0) (= (store |v_#memory_int_564| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:11,435 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:29:11,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 16 treesize of output 11 [2019-05-15 10:29:11,472 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,474 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:11,474 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,474 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:11,482 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:11,482 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_565|]. (let ((.cse0 (select |v_#memory_int_565| ULTIMATE.start_main_p1))) (and (= .cse0 29) (= (store |v_#memory_int_565| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:11,482 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:29:11,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 16 treesize of output 11 [2019-05-15 10:29:11,519 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,530 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:11,530 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,530 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:11,537 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:11,537 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_566|]. (let ((.cse0 (select |v_#memory_int_566| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_566| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 30))) [2019-05-15 10:29:11,537 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:29:11,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 16 treesize of output 11 [2019-05-15 10:29:11,597 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,600 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:11,600 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,601 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:11,608 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:11,608 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_567|]. (let ((.cse0 (select |v_#memory_int_567| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_567| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 31))) [2019-05-15 10:29:11,609 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:29:11,643 INFO L273 TraceCheckUtils]: 0: Hoare triple {5198#true} havoc main_p1; {5198#true} is VALID [2019-05-15 10:29:11,643 INFO L273 TraceCheckUtils]: 1: Hoare triple {5198#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {5198#true} is VALID [2019-05-15 10:29:11,644 INFO L273 TraceCheckUtils]: 2: Hoare triple {5198#true} #memory_int := #memory_int[main_p1 := 0]; {5209#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:29:11,645 INFO L273 TraceCheckUtils]: 3: Hoare triple {5209#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5213#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:29:11,646 INFO L273 TraceCheckUtils]: 4: Hoare triple {5213#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5217#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:29:11,647 INFO L273 TraceCheckUtils]: 5: Hoare triple {5217#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5221#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:29:11,648 INFO L273 TraceCheckUtils]: 6: Hoare triple {5221#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5225#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:29:11,649 INFO L273 TraceCheckUtils]: 7: Hoare triple {5225#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5229#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:29:11,650 INFO L273 TraceCheckUtils]: 8: Hoare triple {5229#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5233#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:29:11,651 INFO L273 TraceCheckUtils]: 9: Hoare triple {5233#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5237#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:29:11,651 INFO L273 TraceCheckUtils]: 10: Hoare triple {5237#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5241#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:29:11,652 INFO L273 TraceCheckUtils]: 11: Hoare triple {5241#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5245#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:29:11,653 INFO L273 TraceCheckUtils]: 12: Hoare triple {5245#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5249#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:29:11,654 INFO L273 TraceCheckUtils]: 13: Hoare triple {5249#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5253#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:29:11,655 INFO L273 TraceCheckUtils]: 14: Hoare triple {5253#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5257#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:29:11,656 INFO L273 TraceCheckUtils]: 15: Hoare triple {5257#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5261#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:29:11,657 INFO L273 TraceCheckUtils]: 16: Hoare triple {5261#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5265#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:29:11,658 INFO L273 TraceCheckUtils]: 17: Hoare triple {5265#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5269#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:29:11,659 INFO L273 TraceCheckUtils]: 18: Hoare triple {5269#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5273#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:29:11,660 INFO L273 TraceCheckUtils]: 19: Hoare triple {5273#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5277#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:29:11,661 INFO L273 TraceCheckUtils]: 20: Hoare triple {5277#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5281#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:29:11,661 INFO L273 TraceCheckUtils]: 21: Hoare triple {5281#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5285#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:29:11,662 INFO L273 TraceCheckUtils]: 22: Hoare triple {5285#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5289#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:29:11,663 INFO L273 TraceCheckUtils]: 23: Hoare triple {5289#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5293#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:29:11,664 INFO L273 TraceCheckUtils]: 24: Hoare triple {5293#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5297#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:29:11,665 INFO L273 TraceCheckUtils]: 25: Hoare triple {5297#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5301#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:29:11,666 INFO L273 TraceCheckUtils]: 26: Hoare triple {5301#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5305#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:29:11,667 INFO L273 TraceCheckUtils]: 27: Hoare triple {5305#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5309#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:29:11,668 INFO L273 TraceCheckUtils]: 28: Hoare triple {5309#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5313#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:29:11,669 INFO L273 TraceCheckUtils]: 29: Hoare triple {5313#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5317#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:29:11,670 INFO L273 TraceCheckUtils]: 30: Hoare triple {5317#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5321#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:29:11,670 INFO L273 TraceCheckUtils]: 31: Hoare triple {5321#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5325#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:29:11,671 INFO L273 TraceCheckUtils]: 32: Hoare triple {5325#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5329#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:29:11,672 INFO L273 TraceCheckUtils]: 33: Hoare triple {5329#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5333#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:29:11,673 INFO L273 TraceCheckUtils]: 34: Hoare triple {5333#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5337#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:29:11,674 INFO L273 TraceCheckUtils]: 35: Hoare triple {5337#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} assume !(#memory_int[main_p1] >= 0); {5199#false} is VALID [2019-05-15 10:29:11,677 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:29:11,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:29:11,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-05-15 10:29:11,678 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 36 [2019-05-15 10:29:11,678 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:29:11,679 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2019-05-15 10:29:11,772 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:11,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-05-15 10:29:11,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-05-15 10:29:11,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-05-15 10:29:11,774 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 35 states. [2019-05-15 10:29:15,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:15,091 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-05-15 10:29:15,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-05-15 10:29:15,091 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 36 [2019-05-15 10:29:15,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:29:15,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-05-15 10:29:15,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-05-15 10:29:15,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-05-15 10:29:15,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-05-15 10:29:15,093 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 39 transitions. [2019-05-15 10:29:15,128 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:29:15,129 INFO L225 Difference]: With dead ends: 38 [2019-05-15 10:29:15,129 INFO L226 Difference]: Without dead ends: 38 [2019-05-15 10:29:15,130 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-05-15 10:29:15,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-05-15 10:29:15,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-05-15 10:29:15,131 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:29:15,132 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 38 states. [2019-05-15 10:29:15,132 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2019-05-15 10:29:15,132 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2019-05-15 10:29:15,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:15,132 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-05-15 10:29:15,132 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-05-15 10:29:15,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:15,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:15,133 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2019-05-15 10:29:15,133 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2019-05-15 10:29:15,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:15,133 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-05-15 10:29:15,133 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-05-15 10:29:15,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:15,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:15,134 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:29:15,134 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:29:15,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-05-15 10:29:15,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-05-15 10:29:15,135 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-05-15 10:29:15,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:29:15,135 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-05-15 10:29:15,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-05-15 10:29:15,135 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-05-15 10:29:15,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-05-15 10:29:15,135 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:29:15,136 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1] [2019-05-15 10:29:15,136 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:29:15,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:29:15,136 INFO L82 PathProgramCache]: Analyzing trace with hash -2069765822, now seen corresponding path program 33 times [2019-05-15 10:29:15,137 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:29:15,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:15,150 WARN L254 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 35 conjunts are in the unsatisfiable core [2019-05-15 10:29:15,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:15,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:29:15,186 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,187 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:15,193 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:15,193 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,193 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:29:15,195 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:15,195 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_568|]. (= (store |v_#memory_int_568| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:29:15,196 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:29:15,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:15,219 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:15,221 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:15,221 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,222 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:15,230 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:15,230 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_569|]. (let ((.cse0 (select |v_#memory_int_569| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_569| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 0 .cse0))) [2019-05-15 10:29:15,231 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:29:15,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 16 treesize of output 11 [2019-05-15 10:29:15,252 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:15,254 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:15,255 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,255 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:15,264 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:15,264 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_570|]. (let ((.cse0 (select |v_#memory_int_570| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_570| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 1 .cse0))) [2019-05-15 10:29:15,264 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:29:15,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:15,279 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:15,281 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:15,282 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,282 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:15,291 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:15,291 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_571|]. (let ((.cse0 (select |v_#memory_int_571| ULTIMATE.start_main_p1))) (and (= .cse0 2) (= (store |v_#memory_int_571| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:15,291 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:29:15,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 16 treesize of output 11 [2019-05-15 10:29:15,305 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:15,308 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:15,308 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,308 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:15,316 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:15,317 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_572|]. (let ((.cse0 (select |v_#memory_int_572| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_572| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 3))) [2019-05-15 10:29:15,317 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:29:15,332 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:15,333 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:15,335 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:15,336 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,336 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:15,345 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:15,345 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_573|]. (let ((.cse0 (select |v_#memory_int_573| ULTIMATE.start_main_p1))) (and (= .cse0 4) (= |#memory_int| (store |v_#memory_int_573| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:15,345 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:29:15,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:15,363 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:15,365 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:15,365 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,365 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:15,374 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:15,375 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_574|]. (let ((.cse0 (select |v_#memory_int_574| ULTIMATE.start_main_p1))) (and (= .cse0 5) (= (store |v_#memory_int_574| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:15,375 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:29:15,391 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:15,393 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:15,395 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:15,395 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,396 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:15,404 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:15,404 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_575|]. (let ((.cse0 (select |v_#memory_int_575| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_575| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 6))) [2019-05-15 10:29:15,405 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:29:15,422 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:15,423 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:15,426 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:15,426 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,426 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:15,435 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:15,435 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_576|]. (let ((.cse0 (select |v_#memory_int_576| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_576| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 7))) [2019-05-15 10:29:15,435 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:29:15,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 16 treesize of output 11 [2019-05-15 10:29:15,452 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:15,454 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:15,455 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,455 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:15,466 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:15,467 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_577|]. (let ((.cse0 (select |v_#memory_int_577| ULTIMATE.start_main_p1))) (and (= .cse0 8) (= |#memory_int| (store |v_#memory_int_577| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:15,467 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:29:15,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 16 treesize of output 11 [2019-05-15 10:29:15,485 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:15,488 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:15,488 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,489 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:15,496 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:15,497 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_578|]. (let ((.cse0 (select |v_#memory_int_578| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_578| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 9))) [2019-05-15 10:29:15,497 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:29: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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:15,517 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:15,520 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:15,520 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,521 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:15,529 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:15,529 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_579|]. (let ((.cse0 (select |v_#memory_int_579| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_579| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 10))) [2019-05-15 10:29:15,529 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:29:15,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:15,550 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:15,552 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:15,553 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,553 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:15,561 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:15,561 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_580|]. (let ((.cse0 (select |v_#memory_int_580| ULTIMATE.start_main_p1))) (and (= .cse0 11) (= (store |v_#memory_int_580| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:15,561 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:29:15,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 16 treesize of output 11 [2019-05-15 10:29:15,599 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:15,602 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:15,603 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,603 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:15,611 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:15,611 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_581|]. (let ((.cse0 (select |v_#memory_int_581| ULTIMATE.start_main_p1))) (and (= 12 .cse0) (= |#memory_int| (store |v_#memory_int_581| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:15,611 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:29:15,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:15,632 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:15,635 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:15,635 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,635 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:15,643 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:15,643 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_582|]. (let ((.cse0 (select |v_#memory_int_582| ULTIMATE.start_main_p1))) (and (= .cse0 13) (= (store |v_#memory_int_582| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:15,643 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:29:15,665 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:15,666 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:15,669 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:15,669 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,670 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:15,677 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:15,678 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_583|]. (let ((.cse0 (select |v_#memory_int_583| ULTIMATE.start_main_p1))) (and (= 14 .cse0) (= |#memory_int| (store |v_#memory_int_583| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:15,678 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:29:15,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:15,702 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:15,705 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:15,705 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,705 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:15,714 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:15,715 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_584|]. (let ((.cse0 (select |v_#memory_int_584| ULTIMATE.start_main_p1))) (and (= .cse0 15) (= (store |v_#memory_int_584| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:15,715 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:29:15,739 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:15,740 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:15,742 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:15,743 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,743 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:15,751 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:15,752 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_585|]. (let ((.cse0 (select |v_#memory_int_585| ULTIMATE.start_main_p1))) (and (= .cse0 16) (= (store |v_#memory_int_585| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:15,752 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:29:15,776 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:15,777 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:15,780 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:15,780 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,780 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:15,789 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:15,789 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_586|]. (let ((.cse0 (select |v_#memory_int_586| ULTIMATE.start_main_p1))) (and (= .cse0 17) (= (store |v_#memory_int_586| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:15,790 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:29:15,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 16 treesize of output 11 [2019-05-15 10:29:15,818 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:15,821 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:15,821 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,821 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:15,830 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:15,830 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_587|]. (let ((.cse0 (select |v_#memory_int_587| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_587| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 18 .cse0))) [2019-05-15 10:29:15,830 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:29:15,857 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:15,858 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:15,861 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:15,861 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,861 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:15,868 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:15,868 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_588|]. (let ((.cse0 (select |v_#memory_int_588| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_588| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 19))) [2019-05-15 10:29:15,868 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:29:15,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:15,896 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:15,899 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:15,899 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,900 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:15,907 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:15,907 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_589|]. (let ((.cse0 (select |v_#memory_int_589| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_589| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 20))) [2019-05-15 10:29:15,907 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:29:15,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 16 treesize of output 11 [2019-05-15 10:29:15,937 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:15,940 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:15,941 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,941 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:15,948 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:15,949 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_590|]. (let ((.cse0 (select |v_#memory_int_590| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_590| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 21 .cse0))) [2019-05-15 10:29:15,949 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:29:16,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:16,018 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:16,021 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:16,021 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:16,022 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:16,030 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:16,030 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_591|]. (let ((.cse0 (select |v_#memory_int_591| ULTIMATE.start_main_p1))) (and (= .cse0 22) (= (store |v_#memory_int_591| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:16,030 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:29:16,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:16,061 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:16,064 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:16,064 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:16,064 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:16,073 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:16,073 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_592|]. (let ((.cse0 (select |v_#memory_int_592| ULTIMATE.start_main_p1))) (and (= 23 .cse0) (= |#memory_int| (store |v_#memory_int_592| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:16,073 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:29:16,105 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:16,106 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:16,109 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:16,109 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:16,110 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:16,117 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:16,118 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_593|]. (let ((.cse0 (select |v_#memory_int_593| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_593| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 24 .cse0))) [2019-05-15 10:29:16,118 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:29:16,152 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:16,154 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:16,156 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:16,157 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:16,157 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:16,164 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:16,164 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_594|]. (let ((.cse0 (select |v_#memory_int_594| ULTIMATE.start_main_p1))) (and (= 25 .cse0) (= (store |v_#memory_int_594| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:16,165 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:29:16,196 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:16,197 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:16,200 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:16,200 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:16,201 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:16,217 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:16,218 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_595|]. (let ((.cse0 (select |v_#memory_int_595| ULTIMATE.start_main_p1))) (and (= .cse0 26) (= (store |v_#memory_int_595| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:16,218 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:29:16,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 16 treesize of output 11 [2019-05-15 10:29:16,255 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:16,258 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:16,258 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:16,258 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:16,266 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:16,267 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_596|]. (let ((.cse0 (select |v_#memory_int_596| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_596| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 27))) [2019-05-15 10:29:16,267 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:29:16,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 16 treesize of output 11 [2019-05-15 10:29:16,304 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:16,307 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:16,307 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:16,307 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:16,315 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:16,316 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_597|]. (let ((.cse0 (select |v_#memory_int_597| ULTIMATE.start_main_p1))) (and (= 28 .cse0) (= |#memory_int| (store |v_#memory_int_597| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:16,316 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:29:16,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:16,353 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:16,356 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:16,356 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:16,356 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:16,365 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:16,366 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_598|]. (let ((.cse0 (select |v_#memory_int_598| ULTIMATE.start_main_p1))) (and (= 29 .cse0) (= |#memory_int| (store |v_#memory_int_598| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:16,366 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:29:16,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 16 treesize of output 11 [2019-05-15 10:29:16,401 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:16,404 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:16,404 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:16,405 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:16,413 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:16,414 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_599|]. (let ((.cse0 (select |v_#memory_int_599| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_599| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 30))) [2019-05-15 10:29:16,414 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:29:16,453 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:16,454 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:16,457 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:16,457 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:16,458 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:16,465 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:16,466 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_600|]. (let ((.cse0 (select |v_#memory_int_600| ULTIMATE.start_main_p1))) (and (= 31 .cse0) (= |#memory_int| (store |v_#memory_int_600| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:16,466 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:29:16,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 16 treesize of output 11 [2019-05-15 10:29:16,509 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:16,512 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:16,512 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:16,512 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:16,518 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:16,519 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_601|]. (let ((.cse0 (select |v_#memory_int_601| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_601| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 32))) [2019-05-15 10:29:16,519 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:29:16,551 INFO L273 TraceCheckUtils]: 0: Hoare triple {5492#true} havoc main_p1; {5492#true} is VALID [2019-05-15 10:29:16,551 INFO L273 TraceCheckUtils]: 1: Hoare triple {5492#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {5492#true} is VALID [2019-05-15 10:29:16,552 INFO L273 TraceCheckUtils]: 2: Hoare triple {5492#true} #memory_int := #memory_int[main_p1 := 0]; {5503#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:29:16,553 INFO L273 TraceCheckUtils]: 3: Hoare triple {5503#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5507#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:29:16,553 INFO L273 TraceCheckUtils]: 4: Hoare triple {5507#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5511#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:29:16,554 INFO L273 TraceCheckUtils]: 5: Hoare triple {5511#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5515#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:29:16,555 INFO L273 TraceCheckUtils]: 6: Hoare triple {5515#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5519#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:29:16,572 INFO L273 TraceCheckUtils]: 7: Hoare triple {5519#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5523#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:29:16,578 INFO L273 TraceCheckUtils]: 8: Hoare triple {5523#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5527#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:29:16,579 INFO L273 TraceCheckUtils]: 9: Hoare triple {5527#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5531#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:29:16,580 INFO L273 TraceCheckUtils]: 10: Hoare triple {5531#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5535#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:29:16,580 INFO L273 TraceCheckUtils]: 11: Hoare triple {5535#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5539#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:29:16,581 INFO L273 TraceCheckUtils]: 12: Hoare triple {5539#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5543#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:29:16,582 INFO L273 TraceCheckUtils]: 13: Hoare triple {5543#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5547#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:29:16,582 INFO L273 TraceCheckUtils]: 14: Hoare triple {5547#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5551#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:29:16,583 INFO L273 TraceCheckUtils]: 15: Hoare triple {5551#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5555#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:29:16,583 INFO L273 TraceCheckUtils]: 16: Hoare triple {5555#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5559#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:29:16,584 INFO L273 TraceCheckUtils]: 17: Hoare triple {5559#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5563#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:29:16,585 INFO L273 TraceCheckUtils]: 18: Hoare triple {5563#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5567#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:29:16,586 INFO L273 TraceCheckUtils]: 19: Hoare triple {5567#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5571#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:29:16,587 INFO L273 TraceCheckUtils]: 20: Hoare triple {5571#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5575#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:29:16,588 INFO L273 TraceCheckUtils]: 21: Hoare triple {5575#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5579#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:29:16,589 INFO L273 TraceCheckUtils]: 22: Hoare triple {5579#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5583#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:29:16,590 INFO L273 TraceCheckUtils]: 23: Hoare triple {5583#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5587#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:29:16,591 INFO L273 TraceCheckUtils]: 24: Hoare triple {5587#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5591#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:29:16,592 INFO L273 TraceCheckUtils]: 25: Hoare triple {5591#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5595#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:29:16,593 INFO L273 TraceCheckUtils]: 26: Hoare triple {5595#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5599#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:29:16,594 INFO L273 TraceCheckUtils]: 27: Hoare triple {5599#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5603#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:29:16,595 INFO L273 TraceCheckUtils]: 28: Hoare triple {5603#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5607#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:29:16,596 INFO L273 TraceCheckUtils]: 29: Hoare triple {5607#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5611#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:29:16,596 INFO L273 TraceCheckUtils]: 30: Hoare triple {5611#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5615#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:29:16,597 INFO L273 TraceCheckUtils]: 31: Hoare triple {5615#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5619#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:29:16,598 INFO L273 TraceCheckUtils]: 32: Hoare triple {5619#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5623#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:29:16,599 INFO L273 TraceCheckUtils]: 33: Hoare triple {5623#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5627#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:29:16,600 INFO L273 TraceCheckUtils]: 34: Hoare triple {5627#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5631#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:29:16,601 INFO L273 TraceCheckUtils]: 35: Hoare triple {5631#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5635#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:29:16,602 INFO L273 TraceCheckUtils]: 36: Hoare triple {5635#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} assume !(#memory_int[main_p1] >= 0); {5493#false} is VALID [2019-05-15 10:29:16,605 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:29:16,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:29:16,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-05-15 10:29:16,607 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 37 [2019-05-15 10:29:16,607 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:29:16,607 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2019-05-15 10:29:16,639 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:29:16,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-05-15 10:29:16,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-05-15 10:29:16,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-05-15 10:29:16,640 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 36 states. [2019-05-15 10:29:19,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:19,660 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-05-15 10:29:19,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-05-15 10:29:19,661 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 37 [2019-05-15 10:29:19,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:29:19,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-05-15 10:29:19,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-05-15 10:29:19,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-05-15 10:29:19,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-05-15 10:29:19,663 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 40 transitions. [2019-05-15 10:29:19,698 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:19,699 INFO L225 Difference]: With dead ends: 39 [2019-05-15 10:29:19,699 INFO L226 Difference]: Without dead ends: 39 [2019-05-15 10:29:19,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-05-15 10:29:19,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-05-15 10:29:19,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-05-15 10:29:19,702 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:29:19,702 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 39 states. [2019-05-15 10:29:19,702 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2019-05-15 10:29:19,702 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2019-05-15 10:29:19,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:19,703 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-05-15 10:29:19,703 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-05-15 10:29:19,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:19,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:19,704 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2019-05-15 10:29:19,704 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2019-05-15 10:29:19,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:19,705 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-05-15 10:29:19,705 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-05-15 10:29:19,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:19,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:19,705 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:29:19,705 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:29:19,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-05-15 10:29:19,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-05-15 10:29:19,706 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-05-15 10:29:19,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:29:19,706 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-05-15 10:29:19,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-05-15 10:29:19,707 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-05-15 10:29:19,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-05-15 10:29:19,707 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:29:19,707 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1] [2019-05-15 10:29:19,707 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:29:19,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:29:19,708 INFO L82 PathProgramCache]: Analyzing trace with hash 261768904, now seen corresponding path program 34 times [2019-05-15 10:29:19,708 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:29:19,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:19,721 WARN L254 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 36 conjunts are in the unsatisfiable core [2019-05-15 10:29:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:19,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:29:19,752 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:19,752 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,753 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:19,754 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,754 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:29:19,756 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:19,757 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_602|]. (= (store |v_#memory_int_602| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:29:19,757 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:29:19,768 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:19,769 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,771 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:19,772 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,772 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:19,783 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:19,783 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_603|]. (let ((.cse0 (select |v_#memory_int_603| ULTIMATE.start_main_p1))) (and (= 0 .cse0) (= (store |v_#memory_int_603| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:19,784 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:29:19,799 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:19,800 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,801 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:19,802 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,802 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:19,810 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:19,811 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_604|]. (let ((.cse0 (select |v_#memory_int_604| ULTIMATE.start_main_p1))) (and (= 1 .cse0) (= (store |v_#memory_int_604| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:19,811 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:29:19,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 16 treesize of output 11 [2019-05-15 10:29:19,825 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,828 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:19,828 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,828 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:19,836 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:19,837 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_605|]. (let ((.cse0 (select |v_#memory_int_605| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_605| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 2 .cse0))) [2019-05-15 10:29:19,837 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:29:19,849 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:19,850 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,853 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:19,853 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,853 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:19,863 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:19,863 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_606|]. (let ((.cse0 (select |v_#memory_int_606| ULTIMATE.start_main_p1))) (and (= .cse0 3) (= (store |v_#memory_int_606| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:19,863 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:29:19,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 16 treesize of output 11 [2019-05-15 10:29:19,880 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,881 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:19,882 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,882 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:19,891 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:19,892 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_607|]. (let ((.cse0 (select |v_#memory_int_607| ULTIMATE.start_main_p1))) (and (= .cse0 4) (= |#memory_int| (store |v_#memory_int_607| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:19,892 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:29:19,907 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:19,908 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,910 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:19,910 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,911 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:19,918 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:19,918 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_608|]. (let ((.cse0 (select |v_#memory_int_608| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_608| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 5 .cse0))) [2019-05-15 10:29:19,918 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:29:19,934 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:19,935 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,937 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:19,938 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,938 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:19,948 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:19,948 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_609|]. (let ((.cse0 (select |v_#memory_int_609| ULTIMATE.start_main_p1))) (and (= .cse0 6) (= (store |v_#memory_int_609| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:19,948 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:29:19,963 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:19,964 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,967 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:19,967 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,967 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:19,975 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:19,975 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_610|]. (let ((.cse0 (select |v_#memory_int_610| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_610| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 7))) [2019-05-15 10:29:19,975 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:29:19,993 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:19,994 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,997 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:19,997 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,997 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:20,006 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:20,006 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_611|]. (let ((.cse0 (select |v_#memory_int_611| ULTIMATE.start_main_p1))) (and (= 8 .cse0) (= (store |v_#memory_int_611| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:20,006 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:29:20,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 16 treesize of output 11 [2019-05-15 10:29:20,026 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,028 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:20,029 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,029 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:20,037 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:20,038 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_612|]. (let ((.cse0 (select |v_#memory_int_612| ULTIMATE.start_main_p1))) (and (= 9 .cse0) (= |#memory_int| (store |v_#memory_int_612| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:20,038 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:29:20,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 16 treesize of output 11 [2019-05-15 10:29:20,059 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,061 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:20,062 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,062 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:20,069 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:20,069 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_613|]. (let ((.cse0 (select |v_#memory_int_613| ULTIMATE.start_main_p1))) (and (= 10 .cse0) (= |#memory_int| (store |v_#memory_int_613| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:20,069 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:29:20,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 16 treesize of output 11 [2019-05-15 10:29:20,093 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,095 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:20,095 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,095 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:20,104 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:20,104 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_614|]. (let ((.cse0 (select |v_#memory_int_614| ULTIMATE.start_main_p1))) (and (= .cse0 11) (= (store |v_#memory_int_614| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:20,104 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:29:20,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 16 treesize of output 11 [2019-05-15 10:29:20,127 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,129 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:20,130 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,130 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:20,137 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:20,138 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_615|]. (let ((.cse0 (select |v_#memory_int_615| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_615| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 12))) [2019-05-15 10:29:20,138 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:29:20,161 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:20,162 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,165 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:20,166 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,166 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:20,174 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:20,175 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_616|]. (let ((.cse0 (select |v_#memory_int_616| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_616| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 13))) [2019-05-15 10:29:20,175 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:29:20,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:20,207 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,210 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:20,210 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,210 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:20,217 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:20,218 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_617|]. (let ((.cse0 (select |v_#memory_int_617| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_617| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 14))) [2019-05-15 10:29:20,218 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:29:20,241 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:20,242 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,244 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:20,245 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,245 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:20,253 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:20,253 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_618|]. (let ((.cse0 (select |v_#memory_int_618| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_618| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 15 .cse0))) [2019-05-15 10:29:20,254 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:29:20,277 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:20,278 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,281 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29: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:29:20,281 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:20,290 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:20,290 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_619|]. (let ((.cse0 (select |v_#memory_int_619| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_619| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 16))) [2019-05-15 10:29:20,290 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:29:20,315 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:20,316 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,318 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:20,319 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,319 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:20,327 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:20,327 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_620|]. (let ((.cse0 (select |v_#memory_int_620| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_620| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 17))) [2019-05-15 10:29:20,328 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:29:20,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 16 treesize of output 11 [2019-05-15 10:29:20,355 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,357 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:20,358 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,358 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:20,367 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:20,367 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_621|]. (let ((.cse0 (select |v_#memory_int_621| ULTIMATE.start_main_p1))) (and (= 18 .cse0) (= |#memory_int| (store |v_#memory_int_621| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:20,367 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:29:20,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:20,393 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,396 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:20,396 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,396 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:20,404 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:20,404 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_622|]. (let ((.cse0 (select |v_#memory_int_622| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_622| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 19 .cse0))) [2019-05-15 10:29:20,404 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:29:20,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:20,431 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,433 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:20,434 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,434 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:20,443 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:20,443 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_623|]. (let ((.cse0 (select |v_#memory_int_623| ULTIMATE.start_main_p1))) (and (= .cse0 20) (= |#memory_int| (store |v_#memory_int_623| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:20,443 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:29:20,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 16 treesize of output 11 [2019-05-15 10:29:20,476 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,478 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:20,479 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,479 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:20,488 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:20,488 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_624|]. (let ((.cse0 (select |v_#memory_int_624| ULTIMATE.start_main_p1))) (and (= 21 .cse0) (= (store |v_#memory_int_624| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:20,489 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:29:20,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:20,518 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,520 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:20,520 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,521 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:20,528 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:20,529 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_625|]. (let ((.cse0 (select |v_#memory_int_625| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_625| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 22 .cse0))) [2019-05-15 10:29:20,529 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:29:20,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:20,560 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,562 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:20,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:20,563 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:20,571 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:20,571 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_626|]. (let ((.cse0 (select |v_#memory_int_626| ULTIMATE.start_main_p1))) (and (= 23 .cse0) (= |#memory_int| (store |v_#memory_int_626| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:20,571 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:29:20,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:20,608 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,610 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:20,610 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,610 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:20,619 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:20,619 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_627|]. (let ((.cse0 (select |v_#memory_int_627| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_627| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 24))) [2019-05-15 10:29:20,619 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:29:20,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 16 treesize of output 11 [2019-05-15 10:29:20,652 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,654 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:20,655 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,655 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:20,661 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:20,662 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_628|]. (let ((.cse0 (select |v_#memory_int_628| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_628| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 25))) [2019-05-15 10:29:20,662 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:29:20,694 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:20,695 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,697 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:20,698 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,698 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:20,706 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:20,707 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_629|]. (let ((.cse0 (select |v_#memory_int_629| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_629| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 26))) [2019-05-15 10:29:20,707 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:29:20,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:20,742 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,744 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:20,745 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,745 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:20,753 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:20,753 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_630|]. (let ((.cse0 (select |v_#memory_int_630| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_630| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 27))) [2019-05-15 10:29:20,753 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:29: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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:20,789 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,792 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:20,792 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,792 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:20,801 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:20,801 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_631|]. (let ((.cse0 (select |v_#memory_int_631| ULTIMATE.start_main_p1))) (and (= .cse0 28) (= (store |v_#memory_int_631| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:20,801 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:29:20,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 16 treesize of output 11 [2019-05-15 10:29:20,838 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,841 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:20,842 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,842 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:20,850 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:20,850 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_632|]. (let ((.cse0 (select |v_#memory_int_632| ULTIMATE.start_main_p1))) (and (= 29 .cse0) (= (store |v_#memory_int_632| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:20,850 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:29:20,886 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:20,887 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,889 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:20,890 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,890 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:20,899 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:20,899 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_633|]. (let ((.cse0 (select |v_#memory_int_633| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_633| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 30 .cse0))) [2019-05-15 10:29:20,899 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:29:20,934 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:20,935 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,937 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:20,938 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,938 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:20,945 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:20,945 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_634|]. (let ((.cse0 (select |v_#memory_int_634| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_634| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 31))) [2019-05-15 10:29:20,945 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:29:20,980 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:20,981 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,983 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:20,983 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:20,983 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:20,991 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:20,991 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_635|]. (let ((.cse0 (select |v_#memory_int_635| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_635| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 32))) [2019-05-15 10:29:20,992 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:29:21,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:21,028 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:21,030 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:21,031 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:21,031 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:21,037 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:21,038 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_636|]. (let ((.cse0 (select |v_#memory_int_636| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_636| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 33 .cse0))) [2019-05-15 10:29:21,038 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:29:21,069 INFO L273 TraceCheckUtils]: 0: Hoare triple {5794#true} havoc main_p1; {5794#true} is VALID [2019-05-15 10:29:21,070 INFO L273 TraceCheckUtils]: 1: Hoare triple {5794#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {5794#true} is VALID [2019-05-15 10:29:21,070 INFO L273 TraceCheckUtils]: 2: Hoare triple {5794#true} #memory_int := #memory_int[main_p1 := 0]; {5805#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:29:21,071 INFO L273 TraceCheckUtils]: 3: Hoare triple {5805#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5809#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:29:21,072 INFO L273 TraceCheckUtils]: 4: Hoare triple {5809#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5813#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:29:21,073 INFO L273 TraceCheckUtils]: 5: Hoare triple {5813#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5817#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:29:21,074 INFO L273 TraceCheckUtils]: 6: Hoare triple {5817#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5821#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:29:21,074 INFO L273 TraceCheckUtils]: 7: Hoare triple {5821#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5825#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:29:21,075 INFO L273 TraceCheckUtils]: 8: Hoare triple {5825#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5829#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:29:21,076 INFO L273 TraceCheckUtils]: 9: Hoare triple {5829#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5833#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:29:21,077 INFO L273 TraceCheckUtils]: 10: Hoare triple {5833#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5837#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:29:21,078 INFO L273 TraceCheckUtils]: 11: Hoare triple {5837#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5841#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:29:21,079 INFO L273 TraceCheckUtils]: 12: Hoare triple {5841#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5845#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:29:21,079 INFO L273 TraceCheckUtils]: 13: Hoare triple {5845#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5849#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:29:21,080 INFO L273 TraceCheckUtils]: 14: Hoare triple {5849#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5853#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:29:21,081 INFO L273 TraceCheckUtils]: 15: Hoare triple {5853#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5857#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:29:21,082 INFO L273 TraceCheckUtils]: 16: Hoare triple {5857#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5861#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:29:21,083 INFO L273 TraceCheckUtils]: 17: Hoare triple {5861#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5865#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:29:21,083 INFO L273 TraceCheckUtils]: 18: Hoare triple {5865#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5869#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:29:21,084 INFO L273 TraceCheckUtils]: 19: Hoare triple {5869#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5873#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:29:21,085 INFO L273 TraceCheckUtils]: 20: Hoare triple {5873#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5877#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:29:21,086 INFO L273 TraceCheckUtils]: 21: Hoare triple {5877#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5881#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:29:21,087 INFO L273 TraceCheckUtils]: 22: Hoare triple {5881#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5885#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:29:21,088 INFO L273 TraceCheckUtils]: 23: Hoare triple {5885#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5889#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:29:21,088 INFO L273 TraceCheckUtils]: 24: Hoare triple {5889#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5893#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:29:21,089 INFO L273 TraceCheckUtils]: 25: Hoare triple {5893#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5897#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:29:21,090 INFO L273 TraceCheckUtils]: 26: Hoare triple {5897#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5901#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:29:21,091 INFO L273 TraceCheckUtils]: 27: Hoare triple {5901#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5905#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:29:21,092 INFO L273 TraceCheckUtils]: 28: Hoare triple {5905#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5909#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:29:21,092 INFO L273 TraceCheckUtils]: 29: Hoare triple {5909#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5913#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:29:21,093 INFO L273 TraceCheckUtils]: 30: Hoare triple {5913#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5917#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:29:21,094 INFO L273 TraceCheckUtils]: 31: Hoare triple {5917#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5921#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:29:21,095 INFO L273 TraceCheckUtils]: 32: Hoare triple {5921#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5925#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:29:21,096 INFO L273 TraceCheckUtils]: 33: Hoare triple {5925#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5929#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:29:21,097 INFO L273 TraceCheckUtils]: 34: Hoare triple {5929#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5933#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:29:21,097 INFO L273 TraceCheckUtils]: 35: Hoare triple {5933#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5937#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:29:21,098 INFO L273 TraceCheckUtils]: 36: Hoare triple {5937#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5941#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:29:21,099 INFO L273 TraceCheckUtils]: 37: Hoare triple {5941#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} assume !(#memory_int[main_p1] >= 0); {5795#false} is VALID [2019-05-15 10:29:21,102 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:29:21,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:29:21,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-05-15 10:29:21,103 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 38 [2019-05-15 10:29:21,103 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:29:21,103 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states. [2019-05-15 10:29:21,136 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:21,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-05-15 10:29:21,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-05-15 10:29:21,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-05-15 10:29:21,137 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 37 states. [2019-05-15 10:29:23,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:23,968 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-05-15 10:29:23,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-05-15 10:29:23,968 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 38 [2019-05-15 10:29:23,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:29:23,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-05-15 10:29:23,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-05-15 10:29:23,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-05-15 10:29:23,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-05-15 10:29:23,970 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 41 transitions. [2019-05-15 10:29:24,003 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:29:24,004 INFO L225 Difference]: With dead ends: 40 [2019-05-15 10:29:24,004 INFO L226 Difference]: Without dead ends: 40 [2019-05-15 10:29:24,005 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-05-15 10:29:24,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-05-15 10:29:24,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-05-15 10:29:24,007 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:29:24,007 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2019-05-15 10:29:24,007 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2019-05-15 10:29:24,007 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2019-05-15 10:29:24,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:24,008 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-05-15 10:29:24,008 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-05-15 10:29:24,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:24,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:24,008 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2019-05-15 10:29:24,008 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2019-05-15 10:29:24,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:24,009 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-05-15 10:29:24,009 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-05-15 10:29:24,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:24,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:24,010 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:29:24,010 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:29:24,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-05-15 10:29:24,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-05-15 10:29:24,011 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-05-15 10:29:24,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:29:24,011 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-05-15 10:29:24,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-05-15 10:29:24,011 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-05-15 10:29:24,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-05-15 10:29:24,012 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:29:24,012 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1] [2019-05-15 10:29:24,012 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:29:24,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:29:24,012 INFO L82 PathProgramCache]: Analyzing trace with hash -475098622, now seen corresponding path program 35 times [2019-05-15 10:29:24,013 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:29:24,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:24,025 WARN L254 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 37 conjunts are in the unsatisfiable core [2019-05-15 10:29:24,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:24,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:29:24,122 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:24,123 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,124 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:24,124 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,125 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:29:24,127 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:24,127 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_637|]. (= |#memory_int| (store |v_#memory_int_637| ULTIMATE.start_main_p1 0)) [2019-05-15 10:29:24,127 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:29:24,136 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:24,137 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,139 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:24,140 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,140 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:24,146 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:24,146 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_638|]. (let ((.cse0 (select |v_#memory_int_638| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_638| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 0 .cse0))) [2019-05-15 10:29:24,146 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:29:24,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:24,156 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,158 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:24,159 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,159 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:24,166 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:24,166 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_639|]. (let ((.cse0 (select |v_#memory_int_639| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_639| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 1))) [2019-05-15 10:29:24,166 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:29:24,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 16 treesize of output 11 [2019-05-15 10:29:24,177 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,179 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:24,179 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,179 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:24,187 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:24,187 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_640|]. (let ((.cse0 (select |v_#memory_int_640| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_640| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 2 .cse0))) [2019-05-15 10:29:24,187 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:29:24,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 16 treesize of output 11 [2019-05-15 10:29:24,198 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,200 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:24,201 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,201 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:24,209 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:24,209 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_641|]. (let ((.cse0 (select |v_#memory_int_641| ULTIMATE.start_main_p1))) (and (= .cse0 3) (= (store |v_#memory_int_641| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:24,209 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:29:24,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:24,226 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,227 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:24,227 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,228 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:24,233 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:24,233 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_642|]. (let ((.cse0 (select |v_#memory_int_642| ULTIMATE.start_main_p1))) (and (= .cse0 4) (= (store |v_#memory_int_642| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:24,233 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:29:24,246 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:24,247 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,249 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:24,249 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,249 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:24,257 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:24,257 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_643|]. (let ((.cse0 (select |v_#memory_int_643| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_643| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 5 .cse0))) [2019-05-15 10:29:24,257 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:29:24,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 16 treesize of output 11 [2019-05-15 10:29:24,284 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,286 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:24,286 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,286 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:24,294 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:24,294 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_644|]. (let ((.cse0 (select |v_#memory_int_644| ULTIMATE.start_main_p1))) (and (= .cse0 6) (= (store |v_#memory_int_644| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:24,294 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:29:24,309 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:24,310 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,312 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:24,312 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,312 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:24,320 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:24,320 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_645|]. (let ((.cse0 (select |v_#memory_int_645| ULTIMATE.start_main_p1))) (and (= 7 .cse0) (= (store |v_#memory_int_645| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:24,320 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:29:24,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 16 treesize of output 11 [2019-05-15 10:29:24,337 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,339 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:24,339 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,340 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:24,346 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:24,347 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_646|]. (let ((.cse0 (select |v_#memory_int_646| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_646| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 8))) [2019-05-15 10:29:24,347 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:29:24,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:24,364 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,366 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:24,366 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,366 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:24,374 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:24,374 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_647|]. (let ((.cse0 (select |v_#memory_int_647| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_647| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 9 .cse0))) [2019-05-15 10:29:24,374 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:29:24,391 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:24,392 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,394 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:24,394 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,394 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:24,401 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:24,401 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_648|]. (let ((.cse0 (select |v_#memory_int_648| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_648| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 10 .cse0))) [2019-05-15 10:29:24,402 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:29:24,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:24,420 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,422 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:24,423 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,423 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:24,430 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:24,430 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_649|]. (let ((.cse0 (select |v_#memory_int_649| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_649| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 11 .cse0))) [2019-05-15 10:29:24,430 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:29:24,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 16 treesize of output 11 [2019-05-15 10:29:24,452 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,454 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:24,454 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,454 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:24,461 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:24,462 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_650|]. (let ((.cse0 (select |v_#memory_int_650| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_650| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 12))) [2019-05-15 10:29:24,462 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:29:24,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 16 treesize of output 11 [2019-05-15 10:29:24,483 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,485 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:24,485 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,485 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:24,492 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:24,493 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_651|]. (let ((.cse0 (select |v_#memory_int_651| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_651| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 13))) [2019-05-15 10:29:24,493 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:29:24,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 16 treesize of output 11 [2019-05-15 10:29:24,513 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,515 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:24,516 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,516 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:24,524 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:24,524 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_652|]. (let ((.cse0 (select |v_#memory_int_652| ULTIMATE.start_main_p1))) (and (= 14 .cse0) (= |#memory_int| (store |v_#memory_int_652| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:24,524 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:29:24,546 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:24,547 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,549 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:24,549 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,549 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:24,556 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:24,557 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_653|]. (let ((.cse0 (select |v_#memory_int_653| ULTIMATE.start_main_p1))) (and (= .cse0 15) (= (store |v_#memory_int_653| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:24,557 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:29:24,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:24,578 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,580 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:24,581 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,581 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:24,588 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:24,588 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_654|]. (let ((.cse0 (select |v_#memory_int_654| ULTIMATE.start_main_p1))) (and (= .cse0 16) (= (store |v_#memory_int_654| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:24,589 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:29:24,612 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:24,613 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,615 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:24,615 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,615 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:24,622 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:24,622 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_655|]. (let ((.cse0 (select |v_#memory_int_655| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_655| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 17 .cse0))) [2019-05-15 10:29:24,623 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:29:24,648 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:24,649 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,651 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:24,651 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,651 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:24,658 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:24,658 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_656|]. (let ((.cse0 (select |v_#memory_int_656| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_656| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 18 .cse0))) [2019-05-15 10:29:24,658 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:29:24,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 16 treesize of output 11 [2019-05-15 10:29:24,684 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,686 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:24,686 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,686 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:24,692 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:24,692 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_657|]. (let ((.cse0 (select |v_#memory_int_657| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_657| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 19 .cse0))) [2019-05-15 10:29:24,692 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:29:24,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:24,718 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,720 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:24,720 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,720 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:24,727 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:24,727 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_658|]. (let ((.cse0 (select |v_#memory_int_658| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_658| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 20))) [2019-05-15 10:29:24,728 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:29:24,814 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:24,815 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,817 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:24,817 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,818 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:24,825 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:24,825 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_659|]. (let ((.cse0 (select |v_#memory_int_659| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_659| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 21 .cse0))) [2019-05-15 10:29:24,825 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:29:24,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 16 treesize of output 11 [2019-05-15 10:29:24,853 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,855 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:24,855 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,855 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:24,863 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:24,863 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_660|]. (let ((.cse0 (select |v_#memory_int_660| ULTIMATE.start_main_p1))) (and (= .cse0 22) (= (store |v_#memory_int_660| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:24,863 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:29:24,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 16 treesize of output 11 [2019-05-15 10:29:24,893 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,895 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:24,896 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,896 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:24,903 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:24,903 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_661|]. (let ((.cse0 (select |v_#memory_int_661| ULTIMATE.start_main_p1))) (and (= .cse0 23) (= (store |v_#memory_int_661| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:24,903 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:29:24,934 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:24,936 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,938 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:24,938 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,938 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:24,946 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:24,946 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_662|]. (let ((.cse0 (select |v_#memory_int_662| ULTIMATE.start_main_p1))) (and (= .cse0 24) (= (store |v_#memory_int_662| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:24,946 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:29:24,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:24,976 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,978 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:24,978 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,979 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:24,986 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:24,986 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_663|]. (let ((.cse0 (select |v_#memory_int_663| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_663| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 25))) [2019-05-15 10:29:24,986 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:29:25,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:25,018 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:25,020 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:25,021 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,021 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:25,028 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:25,028 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_664|]. (let ((.cse0 (select |v_#memory_int_664| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_664| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 26 .cse0))) [2019-05-15 10:29:25,028 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:29:25,063 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:25,064 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:25,066 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:25,066 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,066 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:25,073 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:25,074 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_665|]. (let ((.cse0 (select |v_#memory_int_665| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_665| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 27))) [2019-05-15 10:29:25,074 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:29:25,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:25,108 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:25,110 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:25,110 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,110 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:25,118 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:25,118 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_666|]. (let ((.cse0 (select |v_#memory_int_666| ULTIMATE.start_main_p1))) (and (= .cse0 28) (= (store |v_#memory_int_666| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:25,118 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:29:25,152 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:25,153 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:25,155 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:25,155 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,156 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:25,163 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:25,163 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_667|]. (let ((.cse0 (select |v_#memory_int_667| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_667| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 29 .cse0))) [2019-05-15 10:29:25,163 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:29:25,196 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:25,197 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:25,199 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:25,200 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,200 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:25,206 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:25,207 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_668|]. (let ((.cse0 (select |v_#memory_int_668| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_668| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 30 .cse0))) [2019-05-15 10:29:25,207 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:29:25,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:25,241 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:25,243 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:25,243 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,244 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:25,251 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:25,251 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_669|]. (let ((.cse0 (select |v_#memory_int_669| ULTIMATE.start_main_p1))) (and (= .cse0 31) (= (store |v_#memory_int_669| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:25,252 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:29:25,288 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:25,289 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:25,291 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:25,292 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,292 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:25,301 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:25,301 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_670|]. (let ((.cse0 (select |v_#memory_int_670| ULTIMATE.start_main_p1))) (and (= 32 .cse0) (= (store |v_#memory_int_670| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:25,301 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:29:25,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:25,385 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:25,400 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:25,401 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,401 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:25,407 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:25,407 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_671|]. (let ((.cse0 (select |v_#memory_int_671| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_671| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 33 .cse0))) [2019-05-15 10:29:25,407 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:29:25,442 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:25,443 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:25,445 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:25,446 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,446 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:25,453 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:25,453 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_672|]. (let ((.cse0 (select |v_#memory_int_672| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_672| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 34))) [2019-05-15 10:29:25,453 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:29:25,484 INFO L273 TraceCheckUtils]: 0: Hoare triple {6104#true} havoc main_p1; {6104#true} is VALID [2019-05-15 10:29:25,485 INFO L273 TraceCheckUtils]: 1: Hoare triple {6104#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {6104#true} is VALID [2019-05-15 10:29:25,485 INFO L273 TraceCheckUtils]: 2: Hoare triple {6104#true} #memory_int := #memory_int[main_p1 := 0]; {6115#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:29:25,486 INFO L273 TraceCheckUtils]: 3: Hoare triple {6115#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6119#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:29:25,486 INFO L273 TraceCheckUtils]: 4: Hoare triple {6119#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6123#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:29:25,487 INFO L273 TraceCheckUtils]: 5: Hoare triple {6123#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6127#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:29:25,488 INFO L273 TraceCheckUtils]: 6: Hoare triple {6127#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6131#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:29:25,489 INFO L273 TraceCheckUtils]: 7: Hoare triple {6131#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6135#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:29:25,489 INFO L273 TraceCheckUtils]: 8: Hoare triple {6135#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6139#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:29:25,490 INFO L273 TraceCheckUtils]: 9: Hoare triple {6139#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6143#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:29:25,491 INFO L273 TraceCheckUtils]: 10: Hoare triple {6143#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6147#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:29:25,492 INFO L273 TraceCheckUtils]: 11: Hoare triple {6147#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6151#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:29:25,492 INFO L273 TraceCheckUtils]: 12: Hoare triple {6151#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6155#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:29:25,493 INFO L273 TraceCheckUtils]: 13: Hoare triple {6155#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6159#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:29:25,494 INFO L273 TraceCheckUtils]: 14: Hoare triple {6159#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6163#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:29:25,495 INFO L273 TraceCheckUtils]: 15: Hoare triple {6163#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6167#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:29:25,495 INFO L273 TraceCheckUtils]: 16: Hoare triple {6167#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6171#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:29:25,496 INFO L273 TraceCheckUtils]: 17: Hoare triple {6171#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6175#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:29:25,497 INFO L273 TraceCheckUtils]: 18: Hoare triple {6175#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6179#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:29:25,498 INFO L273 TraceCheckUtils]: 19: Hoare triple {6179#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6183#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:29:25,500 INFO L273 TraceCheckUtils]: 20: Hoare triple {6183#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6187#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:29:25,520 INFO L273 TraceCheckUtils]: 21: Hoare triple {6187#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6191#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:29:25,533 INFO L273 TraceCheckUtils]: 22: Hoare triple {6191#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6195#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:29:25,542 INFO L273 TraceCheckUtils]: 23: Hoare triple {6195#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6199#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:29:25,557 INFO L273 TraceCheckUtils]: 24: Hoare triple {6199#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6203#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:29:25,566 INFO L273 TraceCheckUtils]: 25: Hoare triple {6203#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6207#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:29:25,581 INFO L273 TraceCheckUtils]: 26: Hoare triple {6207#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6211#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:29:25,590 INFO L273 TraceCheckUtils]: 27: Hoare triple {6211#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6215#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:29:25,604 INFO L273 TraceCheckUtils]: 28: Hoare triple {6215#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6219#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:29:25,613 INFO L273 TraceCheckUtils]: 29: Hoare triple {6219#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6223#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:29:25,626 INFO L273 TraceCheckUtils]: 30: Hoare triple {6223#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6227#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:29:25,640 INFO L273 TraceCheckUtils]: 31: Hoare triple {6227#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6231#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:29:25,649 INFO L273 TraceCheckUtils]: 32: Hoare triple {6231#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6235#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:29:25,658 INFO L273 TraceCheckUtils]: 33: Hoare triple {6235#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6239#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:29:25,659 INFO L273 TraceCheckUtils]: 34: Hoare triple {6239#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6243#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:29:25,663 INFO L273 TraceCheckUtils]: 35: Hoare triple {6243#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6247#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:29:25,663 INFO L273 TraceCheckUtils]: 36: Hoare triple {6247#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6251#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:29:25,665 INFO L273 TraceCheckUtils]: 37: Hoare triple {6251#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6255#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:29:25,665 INFO L273 TraceCheckUtils]: 38: Hoare triple {6255#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} assume !(#memory_int[main_p1] >= 0); {6105#false} is VALID [2019-05-15 10:29:25,667 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:29:25,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:29:25,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-05-15 10:29:25,668 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 39 [2019-05-15 10:29:25,668 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:29:25,668 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2019-05-15 10:29:25,700 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:29:25,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-05-15 10:29:25,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-05-15 10:29:25,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-05-15 10:29:25,701 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 38 states. [2019-05-15 10:29:28,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:28,634 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-05-15 10:29:28,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-05-15 10:29:28,634 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 39 [2019-05-15 10:29:28,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:29:28,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-05-15 10:29:28,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-05-15 10:29:28,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-05-15 10:29:28,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-05-15 10:29:28,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 42 transitions. [2019-05-15 10:29:28,671 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:28,671 INFO L225 Difference]: With dead ends: 41 [2019-05-15 10:29:28,672 INFO L226 Difference]: Without dead ends: 41 [2019-05-15 10:29:28,672 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-05-15 10:29:28,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-05-15 10:29:28,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-05-15 10:29:28,674 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:29:28,674 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 41 states. [2019-05-15 10:29:28,674 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2019-05-15 10:29:28,674 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2019-05-15 10:29:28,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:28,675 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-05-15 10:29:28,675 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-05-15 10:29:28,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:28,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:28,675 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2019-05-15 10:29:28,675 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2019-05-15 10:29:28,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:28,676 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-05-15 10:29:28,676 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-05-15 10:29:28,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:28,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:28,676 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:29:28,676 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:29:28,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-05-15 10:29:28,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-05-15 10:29:28,677 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-05-15 10:29:28,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:29:28,677 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-05-15 10:29:28,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-05-15 10:29:28,677 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-05-15 10:29:28,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-05-15 10:29:28,677 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:29:28,678 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1, 1] [2019-05-15 10:29:28,678 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:29:28,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:29:28,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1843155448, now seen corresponding path program 36 times [2019-05-15 10:29:28,679 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:29:28,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:28,691 WARN L254 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 38 conjunts are in the unsatisfiable core [2019-05-15 10:29:28,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:28,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:29:28,865 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:28,866 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:28,903 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:28,903 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:28,903 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:29:28,918 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:28,918 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_673|]. (= |#memory_int| (store |v_#memory_int_673| ULTIMATE.start_main_p1 0)) [2019-05-15 10:29:28,919 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:29:29,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 16 treesize of output 11 [2019-05-15 10:29:29,048 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,050 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:29,050 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,050 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:29,058 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:29,058 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_674|]. (let ((.cse0 (select |v_#memory_int_674| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_674| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 0 .cse0))) [2019-05-15 10:29:29,058 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:29:29,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 16 treesize of output 11 [2019-05-15 10:29:29,068 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:29,071 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,071 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:29,079 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:29,079 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_675|]. (let ((.cse0 (select |v_#memory_int_675| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_675| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 1 .cse0))) [2019-05-15 10:29:29,079 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:29:29,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 16 treesize of output 11 [2019-05-15 10:29:29,092 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,094 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:29,095 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,095 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:29,102 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:29,103 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_676|]. (let ((.cse0 (select |v_#memory_int_676| ULTIMATE.start_main_p1))) (and (= .cse0 2) (= |#memory_int| (store |v_#memory_int_676| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:29,103 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:29: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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:29,114 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,116 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:29,117 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,117 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:29,124 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:29,125 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_677|]. (let ((.cse0 (select |v_#memory_int_677| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_677| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 3))) [2019-05-15 10:29:29,125 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:29:29,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:29,140 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,142 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:29,142 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,142 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:29,150 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:29,151 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_678|]. (let ((.cse0 (select |v_#memory_int_678| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_678| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 4 .cse0))) [2019-05-15 10:29:29,151 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:29:29,166 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:29,167 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,169 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:29,169 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,169 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:29,177 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:29,177 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_679|]. (let ((.cse0 (select |v_#memory_int_679| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_679| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 5))) [2019-05-15 10:29:29,178 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:29:29,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 16 treesize of output 11 [2019-05-15 10:29:29,194 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,196 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:29,197 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,197 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:29,205 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:29,205 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_680|]. (let ((.cse0 (select |v_#memory_int_680| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_680| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 6))) [2019-05-15 10:29:29,205 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:29:29,220 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:29,221 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,223 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:29,223 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,223 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:29,231 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:29,231 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_681|]. (let ((.cse0 (select |v_#memory_int_681| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_681| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 7 .cse0))) [2019-05-15 10:29:29,231 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:29:29,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:29,251 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,253 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:29,253 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,254 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:29,262 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:29,262 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_682|]. (let ((.cse0 (select |v_#memory_int_682| ULTIMATE.start_main_p1))) (and (= 8 .cse0) (= |#memory_int| (store |v_#memory_int_682| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:29,262 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:29:29,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 16 treesize of output 11 [2019-05-15 10:29:29,288 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,290 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:29,290 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,291 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:29,298 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:29,298 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_683|]. (let ((.cse0 (select |v_#memory_int_683| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_683| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 9))) [2019-05-15 10:29:29,299 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:29:29,315 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:29,316 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,318 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:29,318 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,319 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:29,326 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:29,326 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_684|]. (let ((.cse0 (select |v_#memory_int_684| ULTIMATE.start_main_p1))) (and (= 10 .cse0) (= |#memory_int| (store |v_#memory_int_684| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:29,326 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:29:29,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 16 treesize of output 11 [2019-05-15 10:29:29,344 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,346 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:29,346 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,347 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:29,354 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:29,354 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_685|]. (let ((.cse0 (select |v_#memory_int_685| ULTIMATE.start_main_p1))) (and (= 11 .cse0) (= |#memory_int| (store |v_#memory_int_685| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:29,354 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:29:29,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 16 treesize of output 11 [2019-05-15 10:29:29,374 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,377 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:29,377 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,377 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:29,385 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:29,385 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_686|]. (let ((.cse0 (select |v_#memory_int_686| ULTIMATE.start_main_p1))) (and (= .cse0 12) (= (store |v_#memory_int_686| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:29,386 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:29:29,407 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:29,408 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,410 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:29,410 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,410 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:29,417 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:29,417 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_687|]. (let ((.cse0 (select |v_#memory_int_687| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_687| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 13 .cse0))) [2019-05-15 10:29:29,417 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:29:29,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [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,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:29,441 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,441 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:29,449 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:29,449 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_688|]. (let ((.cse0 (select |v_#memory_int_688| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_688| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 14 .cse0))) [2019-05-15 10:29:29,449 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:29:29,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 16 treesize of output 11 [2019-05-15 10:29:29,474 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,476 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:29,476 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,476 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:29,485 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:29,485 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_689|]. (let ((.cse0 (select |v_#memory_int_689| ULTIMATE.start_main_p1))) (and (= .cse0 15) (= |#memory_int| (store |v_#memory_int_689| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:29,485 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:29:29,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 16 treesize of output 11 [2019-05-15 10:29:29,511 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,513 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:29,513 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,513 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:29,520 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_#memory_int_690|]. (let ((.cse0 (select |v_#memory_int_690| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_690| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 16))) [2019-05-15 10:29:29,521 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:29:29,544 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:29,545 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,547 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:29,547 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,547 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:29,555 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:29,555 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_691|]. (let ((.cse0 (select |v_#memory_int_691| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_691| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 17))) [2019-05-15 10:29:29,555 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:29:29,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:29,580 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,582 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:29,582 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,582 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:29,591 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:29,592 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_692|]. (let ((.cse0 (select |v_#memory_int_692| ULTIMATE.start_main_p1))) (and (= .cse0 18) (= (store |v_#memory_int_692| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:29,592 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:29:29,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 16 treesize of output 11 [2019-05-15 10:29:29,617 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,619 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:29,619 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,620 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:29,628 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:29,628 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_693|]. (let ((.cse0 (select |v_#memory_int_693| ULTIMATE.start_main_p1))) (and (= .cse0 19) (= |#memory_int| (store |v_#memory_int_693| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:29,628 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:29:29,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:29,661 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,662 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:29,662 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,662 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:29,670 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:29,671 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_694|]. (let ((.cse0 (select |v_#memory_int_694| ULTIMATE.start_main_p1))) (and (= .cse0 20) (= (store |v_#memory_int_694| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:29,671 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:29:29,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:29,696 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,698 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:29,698 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,699 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:29,706 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:29,706 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_695|]. (let ((.cse0 (select |v_#memory_int_695| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_695| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 21))) [2019-05-15 10:29:29,706 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:29:29,732 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:29,733 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,736 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:29,736 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,736 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:29,744 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:29,744 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_696|]. (let ((.cse0 (select |v_#memory_int_696| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_696| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 22))) [2019-05-15 10:29:29,744 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:29:29,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:29,774 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,776 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:29,777 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,777 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:29,784 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:29,785 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_697|]. (let ((.cse0 (select |v_#memory_int_697| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_697| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 23))) [2019-05-15 10:29:29,785 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:29:29,813 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:29,814 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,816 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:29,816 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,817 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:29,825 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:29,825 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_698|]. (let ((.cse0 (select |v_#memory_int_698| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_698| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 24 .cse0))) [2019-05-15 10:29:29,825 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:29:29,854 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:29,855 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,858 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:29,858 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,858 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:29,866 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:29,866 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_699|]. (let ((.cse0 (select |v_#memory_int_699| ULTIMATE.start_main_p1))) (and (= 25 .cse0) (= |#memory_int| (store |v_#memory_int_699| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:29,866 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:29:29,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 16 treesize of output 11 [2019-05-15 10:29:29,895 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,898 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:29,898 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,898 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:29,906 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:29,906 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_700|]. (let ((.cse0 (select |v_#memory_int_700| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_700| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 26 .cse0))) [2019-05-15 10:29:29,906 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:29:29,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 16 treesize of output 11 [2019-05-15 10:29:29,937 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,939 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:29,939 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,939 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:29,947 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:29,947 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_701|]. (let ((.cse0 (select |v_#memory_int_701| ULTIMATE.start_main_p1))) (and (= .cse0 27) (= |#memory_int| (store |v_#memory_int_701| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:29,947 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:29:29,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 16 treesize of output 11 [2019-05-15 10:29:29,980 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,983 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:29,983 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,983 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:29,991 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:29,992 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_702|]. (let ((.cse0 (select |v_#memory_int_702| ULTIMATE.start_main_p1))) (and (= 28 .cse0) (= (store |v_#memory_int_702| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:29,992 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:29:30,024 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:30,025 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:30,028 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:30,028 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:30,028 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:30,036 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:30,036 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_703|]. (let ((.cse0 (select |v_#memory_int_703| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_703| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 29 .cse0))) [2019-05-15 10:29:30,036 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:29:30,071 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:30,072 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:30,074 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:30,074 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:30,074 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:30,082 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:30,082 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_704|]. (let ((.cse0 (select |v_#memory_int_704| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_704| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 30))) [2019-05-15 10:29:30,082 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:29:30,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 16 treesize of output 11 [2019-05-15 10:29:30,117 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:30,119 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:30,120 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:30,120 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:30,127 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:30,127 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_705|]. (let ((.cse0 (select |v_#memory_int_705| ULTIMATE.start_main_p1))) (and (= .cse0 31) (= |#memory_int| (store |v_#memory_int_705| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:30,127 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:29:30,164 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:30,165 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:30,167 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:30,167 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:30,167 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:30,178 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:30,178 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_706|]. (let ((.cse0 (select |v_#memory_int_706| ULTIMATE.start_main_p1))) (and (= .cse0 32) (= (store |v_#memory_int_706| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:30,178 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:29:30,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 16 treesize of output 11 [2019-05-15 10:29:30,251 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:30,253 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:30,253 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:30,253 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:30,259 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:30,259 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_707|]. (let ((.cse0 (select |v_#memory_int_707| ULTIMATE.start_main_p1))) (and (= 33 .cse0) (= |#memory_int| (store |v_#memory_int_707| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:30,259 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:29:30,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:30,299 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:30,301 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:30,301 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:30,302 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:30,310 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:30,310 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_708|]. (let ((.cse0 (select |v_#memory_int_708| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_708| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 34))) [2019-05-15 10:29:30,310 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:29:30,348 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:30,349 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:30,351 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:30,352 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:30,352 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:30,360 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:30,360 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_709|]. (let ((.cse0 (select |v_#memory_int_709| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_709| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 35))) [2019-05-15 10:29:30,360 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:29:30,392 INFO L273 TraceCheckUtils]: 0: Hoare triple {6422#true} havoc main_p1; {6422#true} is VALID [2019-05-15 10:29:30,392 INFO L273 TraceCheckUtils]: 1: Hoare triple {6422#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {6422#true} is VALID [2019-05-15 10:29:30,393 INFO L273 TraceCheckUtils]: 2: Hoare triple {6422#true} #memory_int := #memory_int[main_p1 := 0]; {6433#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:29:30,393 INFO L273 TraceCheckUtils]: 3: Hoare triple {6433#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6437#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:29:30,414 INFO L273 TraceCheckUtils]: 4: Hoare triple {6437#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6441#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:29:30,427 INFO L273 TraceCheckUtils]: 5: Hoare triple {6441#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6445#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:29:30,443 INFO L273 TraceCheckUtils]: 6: Hoare triple {6445#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6449#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:29:30,459 INFO L273 TraceCheckUtils]: 7: Hoare triple {6449#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6453#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:29:30,461 INFO L273 TraceCheckUtils]: 8: Hoare triple {6453#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6457#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:29:30,461 INFO L273 TraceCheckUtils]: 9: Hoare triple {6457#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6461#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:29:30,462 INFO L273 TraceCheckUtils]: 10: Hoare triple {6461#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6465#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:29:30,462 INFO L273 TraceCheckUtils]: 11: Hoare triple {6465#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6469#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:29:30,463 INFO L273 TraceCheckUtils]: 12: Hoare triple {6469#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6473#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:29:30,463 INFO L273 TraceCheckUtils]: 13: Hoare triple {6473#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6477#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:29:30,464 INFO L273 TraceCheckUtils]: 14: Hoare triple {6477#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6481#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:29:30,465 INFO L273 TraceCheckUtils]: 15: Hoare triple {6481#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6485#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:29:30,483 INFO L273 TraceCheckUtils]: 16: Hoare triple {6485#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6489#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:29:30,492 INFO L273 TraceCheckUtils]: 17: Hoare triple {6489#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6493#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:29:30,500 INFO L273 TraceCheckUtils]: 18: Hoare triple {6493#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6497#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:29:30,501 INFO L273 TraceCheckUtils]: 19: Hoare triple {6497#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6501#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:29:30,502 INFO L273 TraceCheckUtils]: 20: Hoare triple {6501#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6505#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:29:30,502 INFO L273 TraceCheckUtils]: 21: Hoare triple {6505#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6509#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:29:30,503 INFO L273 TraceCheckUtils]: 22: Hoare triple {6509#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6513#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:29:30,503 INFO L273 TraceCheckUtils]: 23: Hoare triple {6513#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6517#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:29:30,504 INFO L273 TraceCheckUtils]: 24: Hoare triple {6517#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6521#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:29:30,504 INFO L273 TraceCheckUtils]: 25: Hoare triple {6521#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6525#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:29:30,505 INFO L273 TraceCheckUtils]: 26: Hoare triple {6525#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6529#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:29:30,506 INFO L273 TraceCheckUtils]: 27: Hoare triple {6529#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6533#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:29:30,506 INFO L273 TraceCheckUtils]: 28: Hoare triple {6533#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6537#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:29:30,507 INFO L273 TraceCheckUtils]: 29: Hoare triple {6537#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6541#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:29:30,508 INFO L273 TraceCheckUtils]: 30: Hoare triple {6541#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6545#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:29:30,509 INFO L273 TraceCheckUtils]: 31: Hoare triple {6545#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6549#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:29:30,510 INFO L273 TraceCheckUtils]: 32: Hoare triple {6549#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6553#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:29:30,510 INFO L273 TraceCheckUtils]: 33: Hoare triple {6553#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6557#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:29:30,511 INFO L273 TraceCheckUtils]: 34: Hoare triple {6557#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6561#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:29:30,512 INFO L273 TraceCheckUtils]: 35: Hoare triple {6561#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6565#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:29:30,513 INFO L273 TraceCheckUtils]: 36: Hoare triple {6565#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6569#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:29:30,514 INFO L273 TraceCheckUtils]: 37: Hoare triple {6569#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6573#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:29:30,515 INFO L273 TraceCheckUtils]: 38: Hoare triple {6573#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6577#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:29:30,515 INFO L273 TraceCheckUtils]: 39: Hoare triple {6577#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} assume !(#memory_int[main_p1] >= 0); {6423#false} is VALID [2019-05-15 10:29:30,519 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:29:30,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:29:30,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-05-15 10:29:30,520 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 40 [2019-05-15 10:29:30,520 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:29:30,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states. [2019-05-15 10:29:30,554 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:30,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-05-15 10:29:30,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-05-15 10:29:30,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-05-15 10:29:30,556 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 39 states. [2019-05-15 10:29:33,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:33,772 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-05-15 10:29:33,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-05-15 10:29:33,772 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 40 [2019-05-15 10:29:33,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:29:33,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-05-15 10:29:33,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-05-15 10:29:33,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-05-15 10:29:33,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-05-15 10:29:33,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 43 transitions. [2019-05-15 10:29:33,811 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:29:33,812 INFO L225 Difference]: With dead ends: 42 [2019-05-15 10:29:33,812 INFO L226 Difference]: Without dead ends: 42 [2019-05-15 10:29:33,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-05-15 10:29:33,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-05-15 10:29:33,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-05-15 10:29:33,814 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:29:33,814 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2019-05-15 10:29:33,814 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2019-05-15 10:29:33,814 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2019-05-15 10:29:33,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:33,815 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-05-15 10:29:33,815 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-05-15 10:29:33,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:33,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:33,816 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2019-05-15 10:29:33,816 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2019-05-15 10:29:33,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:33,816 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-05-15 10:29:33,817 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-05-15 10:29:33,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:33,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:33,817 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:29:33,817 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:29:33,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-05-15 10:29:33,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-05-15 10:29:33,818 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-05-15 10:29:33,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:29:33,818 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-05-15 10:29:33,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-05-15 10:29:33,818 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-05-15 10:29:33,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-05-15 10:29:33,819 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:29:33,819 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1, 1] [2019-05-15 10:29:33,819 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:29:33,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:29:33,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1303244094, now seen corresponding path program 37 times [2019-05-15 10:29:33,820 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:29:33,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:33,833 WARN L254 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 39 conjunts are in the unsatisfiable core [2019-05-15 10:29:33,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:33,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:29:33,871 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:33,871 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:33,873 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:33,873 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:33,873 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:29:33,875 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:33,876 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_710|]. (= |#memory_int| (store |v_#memory_int_710| ULTIMATE.start_main_p1 0)) [2019-05-15 10:29:33,876 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:29:33,886 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:33,887 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:33,889 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:33,889 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:33,889 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:33,896 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:33,897 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_711|]. (let ((.cse0 (select |v_#memory_int_711| ULTIMATE.start_main_p1))) (and (= .cse0 0) (= |#memory_int| (store |v_#memory_int_711| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:33,897 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:29:33,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:33,909 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:33,912 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:33,912 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:33,912 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:33,920 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:33,921 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_712|]. (let ((.cse0 (select |v_#memory_int_712| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_712| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 1))) [2019-05-15 10:29:33,921 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:29:33,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 16 treesize of output 11 [2019-05-15 10:29:33,932 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:33,935 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:33,935 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:33,935 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:33,943 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:33,943 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_713|]. (let ((.cse0 (select |v_#memory_int_713| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_713| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 2 .cse0))) [2019-05-15 10:29:33,943 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:29:33,956 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:33,957 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:33,959 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:33,959 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:33,960 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:33,968 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:33,968 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_714|]. (let ((.cse0 (select |v_#memory_int_714| ULTIMATE.start_main_p1))) (and (= .cse0 3) (= (store |v_#memory_int_714| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:33,968 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:29:33,981 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:33,982 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:33,984 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:33,984 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:33,985 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:33,993 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:33,993 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_715|]. (let ((.cse0 (select |v_#memory_int_715| ULTIMATE.start_main_p1))) (and (= .cse0 4) (= (store |v_#memory_int_715| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:33,994 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:29:34,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 16 treesize of output 11 [2019-05-15 10:29:34,009 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,013 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:34,014 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,014 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:34,020 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:34,020 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_716|]. (let ((.cse0 (select |v_#memory_int_716| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_716| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 5))) [2019-05-15 10:29:34,020 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:29:34,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 16 treesize of output 11 [2019-05-15 10:29:34,035 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,052 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:34,052 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,052 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:34,058 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:34,058 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_717|]. (let ((.cse0 (select |v_#memory_int_717| ULTIMATE.start_main_p1))) (and (= .cse0 6) (= (store |v_#memory_int_717| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:34,058 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:29:34,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:34,079 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,082 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:34,082 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,082 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:34,090 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:34,090 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_718|]. (let ((.cse0 (select |v_#memory_int_718| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_718| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 7))) [2019-05-15 10:29:34,090 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:29:34,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:34,108 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,110 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:34,110 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,111 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:34,119 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:34,119 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_719|]. (let ((.cse0 (select |v_#memory_int_719| ULTIMATE.start_main_p1))) (and (= 8 .cse0) (= (store |v_#memory_int_719| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:34,119 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:29:34,135 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:34,136 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,139 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:34,139 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,139 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:34,147 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:34,148 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_720|]. (let ((.cse0 (select |v_#memory_int_720| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_720| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 9 .cse0))) [2019-05-15 10:29:34,148 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:29:34,168 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:34,169 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,171 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:34,171 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,171 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:34,179 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:34,179 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_721|]. (let ((.cse0 (select |v_#memory_int_721| ULTIMATE.start_main_p1))) (and (= .cse0 10) (= |#memory_int| (store |v_#memory_int_721| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:34,179 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:29:34,196 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:34,197 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,200 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:34,200 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,200 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:34,208 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:34,209 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_722|]. (let ((.cse0 (select |v_#memory_int_722| ULTIMATE.start_main_p1))) (and (= .cse0 11) (= |#memory_int| (store |v_#memory_int_722| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:34,209 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:29:34,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 16 treesize of output 11 [2019-05-15 10:29:34,230 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,232 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:34,232 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,232 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:34,240 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:34,241 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_723|]. (let ((.cse0 (select |v_#memory_int_723| ULTIMATE.start_main_p1))) (and (= 12 .cse0) (= (store |v_#memory_int_723| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:34,241 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:29:34,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 16 treesize of output 11 [2019-05-15 10:29:34,263 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,265 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:34,265 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,265 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:34,273 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:34,273 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_724|]. (let ((.cse0 (select |v_#memory_int_724| ULTIMATE.start_main_p1))) (and (= 13 .cse0) (= (store |v_#memory_int_724| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:34,274 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:29:34,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 16 treesize of output 11 [2019-05-15 10:29:34,317 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,320 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:34,320 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,320 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:34,328 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:34,328 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_725|]. (let ((.cse0 (select |v_#memory_int_725| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_725| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 14 .cse0))) [2019-05-15 10:29:34,328 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:29:34,351 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:34,352 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,355 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:34,355 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,355 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:34,364 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:34,364 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_726|]. (let ((.cse0 (select |v_#memory_int_726| ULTIMATE.start_main_p1))) (and (= .cse0 15) (= |#memory_int| (store |v_#memory_int_726| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:34,364 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:29:34,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 16 treesize of output 11 [2019-05-15 10:29:34,386 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,388 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:34,388 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,388 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:34,396 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:34,396 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_727|]. (let ((.cse0 (select |v_#memory_int_727| ULTIMATE.start_main_p1))) (and (= .cse0 16) (= |#memory_int| (store |v_#memory_int_727| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:34,396 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:29:34,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 16 treesize of output 11 [2019-05-15 10:29:34,421 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,424 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:34,424 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,424 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:34,432 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:34,432 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_728|]. (let ((.cse0 (select |v_#memory_int_728| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_728| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 17 .cse0))) [2019-05-15 10:29:34,432 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:29:34,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:34,463 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,465 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:34,465 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,465 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:34,471 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:34,471 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_729|]. (let ((.cse0 (select |v_#memory_int_729| ULTIMATE.start_main_p1))) (and (= 18 .cse0) (= (store |v_#memory_int_729| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:34,471 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:29:34,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:34,499 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,501 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:34,502 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,502 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:34,510 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:34,510 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_730|]. (let ((.cse0 (select |v_#memory_int_730| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_730| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 19))) [2019-05-15 10:29:34,510 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:29:34,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:34,537 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,539 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:34,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:34,540 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:34,548 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:34,548 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_731|]. (let ((.cse0 (select |v_#memory_int_731| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_731| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 20))) [2019-05-15 10:29:34,548 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:29:34,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 16 treesize of output 11 [2019-05-15 10:29:34,583 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,584 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:34,585 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,585 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:34,593 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:34,593 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_732|]. (let ((.cse0 (select |v_#memory_int_732| ULTIMATE.start_main_p1))) (and (= 21 .cse0) (= |#memory_int| (store |v_#memory_int_732| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:34,593 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:29:34,622 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:34,623 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,626 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:34,626 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,626 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:34,634 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:34,634 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_733|]. (let ((.cse0 (select |v_#memory_int_733| ULTIMATE.start_main_p1))) (and (= 22 .cse0) (= (store |v_#memory_int_733| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:34,634 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:29:34,664 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:34,666 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,668 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:34,668 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,668 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:34,676 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:34,676 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_734|]. (let ((.cse0 (select |v_#memory_int_734| ULTIMATE.start_main_p1))) (and (= .cse0 23) (= (store |v_#memory_int_734| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:34,676 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:29:34,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:34,707 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,710 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:34,710 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,710 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:34,717 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:34,718 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_735|]. (let ((.cse0 (select |v_#memory_int_735| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_735| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 24))) [2019-05-15 10:29:34,718 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:29:34,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 16 treesize of output 11 [2019-05-15 10:29:34,748 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,750 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:34,750 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,750 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:34,757 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:34,757 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_736|]. (let ((.cse0 (select |v_#memory_int_736| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_736| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 25 .cse0))) [2019-05-15 10:29:34,758 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:29:34,789 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:34,790 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,792 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:34,792 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,793 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:34,800 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:34,801 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_737|]. (let ((.cse0 (select |v_#memory_int_737| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_737| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 26 .cse0))) [2019-05-15 10:29:34,801 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:29:34,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:34,834 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,836 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:34,837 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,837 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:34,843 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:34,844 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_738|]. (let ((.cse0 (select |v_#memory_int_738| ULTIMATE.start_main_p1))) (and (= .cse0 27) (= (store |v_#memory_int_738| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:34,844 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:29:34,877 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:34,879 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,881 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:34,881 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,882 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:34,890 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:34,890 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_739|]. (let ((.cse0 (select |v_#memory_int_739| ULTIMATE.start_main_p1))) (and (= .cse0 28) (= |#memory_int| (store |v_#memory_int_739| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:34,890 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:29:34,923 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:34,924 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,927 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:34,927 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,927 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:34,934 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:34,935 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_740|]. (let ((.cse0 (select |v_#memory_int_740| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_740| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 29 .cse0))) [2019-05-15 10:29:34,935 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:29:34,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 16 treesize of output 11 [2019-05-15 10:29:34,971 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,973 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:34,973 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,973 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:34,982 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:34,982 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_741|]. (let ((.cse0 (select |v_#memory_int_741| ULTIMATE.start_main_p1))) (and (= .cse0 30) (= (store |v_#memory_int_741| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:34,983 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:29:35,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 16 treesize of output 11 [2019-05-15 10:29:35,020 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:35,023 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:35,023 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,024 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:35,031 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:35,032 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_742|]. (let ((.cse0 (select |v_#memory_int_742| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_742| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 31 .cse0))) [2019-05-15 10:29:35,032 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:29:35,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 16 treesize of output 11 [2019-05-15 10:29:35,070 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:35,072 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:35,072 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,072 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:35,078 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:35,078 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_743|]. (let ((.cse0 (select |v_#memory_int_743| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_743| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 32))) [2019-05-15 10:29:35,078 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:29:35,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 16 treesize of output 11 [2019-05-15 10:29:35,117 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:35,119 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:35,119 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,120 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:35,127 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:35,128 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_744|]. (let ((.cse0 (select |v_#memory_int_744| ULTIMATE.start_main_p1))) (and (= .cse0 33) (= (store |v_#memory_int_744| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:35,128 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:29:35,170 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:35,171 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:35,173 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:35,173 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,173 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:35,183 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:35,183 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_745|]. (let ((.cse0 (select |v_#memory_int_745| ULTIMATE.start_main_p1))) (and (= .cse0 34) (= (store |v_#memory_int_745| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:35,183 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:29:35,220 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:35,221 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:35,223 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:35,223 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,223 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:35,232 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:35,232 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_746|]. (let ((.cse0 (select |v_#memory_int_746| ULTIMATE.start_main_p1))) (and (= 35 .cse0) (= (store |v_#memory_int_746| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:35,232 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:29:35,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 16 treesize of output 11 [2019-05-15 10:29:35,272 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:35,274 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:35,275 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,275 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:35,282 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:35,283 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_747|]. (let ((.cse0 (select |v_#memory_int_747| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_747| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 36))) [2019-05-15 10:29:35,283 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:29:35,313 INFO L273 TraceCheckUtils]: 0: Hoare triple {6748#true} havoc main_p1; {6748#true} is VALID [2019-05-15 10:29:35,314 INFO L273 TraceCheckUtils]: 1: Hoare triple {6748#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {6748#true} is VALID [2019-05-15 10:29:35,314 INFO L273 TraceCheckUtils]: 2: Hoare triple {6748#true} #memory_int := #memory_int[main_p1 := 0]; {6759#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:29:35,315 INFO L273 TraceCheckUtils]: 3: Hoare triple {6759#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6763#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:29:35,315 INFO L273 TraceCheckUtils]: 4: Hoare triple {6763#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6767#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:29:35,316 INFO L273 TraceCheckUtils]: 5: Hoare triple {6767#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6771#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:29:35,316 INFO L273 TraceCheckUtils]: 6: Hoare triple {6771#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6775#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:29:35,317 INFO L273 TraceCheckUtils]: 7: Hoare triple {6775#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6779#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:29:35,317 INFO L273 TraceCheckUtils]: 8: Hoare triple {6779#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6783#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:29:35,318 INFO L273 TraceCheckUtils]: 9: Hoare triple {6783#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6787#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:29:35,319 INFO L273 TraceCheckUtils]: 10: Hoare triple {6787#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6791#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:29:35,320 INFO L273 TraceCheckUtils]: 11: Hoare triple {6791#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6795#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:29:35,321 INFO L273 TraceCheckUtils]: 12: Hoare triple {6795#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6799#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:29:35,321 INFO L273 TraceCheckUtils]: 13: Hoare triple {6799#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6803#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:29:35,322 INFO L273 TraceCheckUtils]: 14: Hoare triple {6803#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6807#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:29:35,323 INFO L273 TraceCheckUtils]: 15: Hoare triple {6807#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6811#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:29:35,324 INFO L273 TraceCheckUtils]: 16: Hoare triple {6811#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6815#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:29:35,325 INFO L273 TraceCheckUtils]: 17: Hoare triple {6815#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6819#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:29:35,326 INFO L273 TraceCheckUtils]: 18: Hoare triple {6819#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6823#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:29:35,326 INFO L273 TraceCheckUtils]: 19: Hoare triple {6823#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6827#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:29:35,327 INFO L273 TraceCheckUtils]: 20: Hoare triple {6827#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6831#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:29:35,328 INFO L273 TraceCheckUtils]: 21: Hoare triple {6831#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6835#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:29:35,329 INFO L273 TraceCheckUtils]: 22: Hoare triple {6835#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6839#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:29:35,330 INFO L273 TraceCheckUtils]: 23: Hoare triple {6839#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6843#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:29:35,330 INFO L273 TraceCheckUtils]: 24: Hoare triple {6843#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6847#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:29:35,331 INFO L273 TraceCheckUtils]: 25: Hoare triple {6847#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6851#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:29:35,332 INFO L273 TraceCheckUtils]: 26: Hoare triple {6851#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6855#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:29:35,333 INFO L273 TraceCheckUtils]: 27: Hoare triple {6855#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6859#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:29:35,334 INFO L273 TraceCheckUtils]: 28: Hoare triple {6859#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6863#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:29:35,335 INFO L273 TraceCheckUtils]: 29: Hoare triple {6863#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6867#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:29:35,335 INFO L273 TraceCheckUtils]: 30: Hoare triple {6867#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6871#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:29:35,336 INFO L273 TraceCheckUtils]: 31: Hoare triple {6871#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6875#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:29:35,337 INFO L273 TraceCheckUtils]: 32: Hoare triple {6875#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6879#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:29:35,338 INFO L273 TraceCheckUtils]: 33: Hoare triple {6879#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6883#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:29:35,339 INFO L273 TraceCheckUtils]: 34: Hoare triple {6883#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6887#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:29:35,339 INFO L273 TraceCheckUtils]: 35: Hoare triple {6887#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6891#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:29:35,340 INFO L273 TraceCheckUtils]: 36: Hoare triple {6891#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6895#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:29:35,341 INFO L273 TraceCheckUtils]: 37: Hoare triple {6895#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6899#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:29:35,342 INFO L273 TraceCheckUtils]: 38: Hoare triple {6899#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6903#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:29:35,343 INFO L273 TraceCheckUtils]: 39: Hoare triple {6903#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6907#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:29:35,343 INFO L273 TraceCheckUtils]: 40: Hoare triple {6907#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} assume !(#memory_int[main_p1] >= 0); {6749#false} is VALID [2019-05-15 10:29:35,346 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:29:35,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:29:35,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-05-15 10:29:35,347 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 41 [2019-05-15 10:29:35,347 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:29:35,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states. [2019-05-15 10:29:35,382 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:29:35,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-05-15 10:29:35,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-05-15 10:29:35,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-05-15 10:29:35,384 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 40 states. [2019-05-15 10:29:38,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:38,723 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-05-15 10:29:38,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-05-15 10:29:38,724 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 41 [2019-05-15 10:29:38,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:29:38,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-05-15 10:29:38,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-05-15 10:29:38,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-05-15 10:29:38,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-05-15 10:29:38,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 44 transitions. [2019-05-15 10:29:38,764 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:38,765 INFO L225 Difference]: With dead ends: 43 [2019-05-15 10:29:38,765 INFO L226 Difference]: Without dead ends: 43 [2019-05-15 10:29:38,766 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-05-15 10:29:38,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-05-15 10:29:38,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-05-15 10:29:38,767 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:29:38,768 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2019-05-15 10:29:38,768 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2019-05-15 10:29:38,768 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2019-05-15 10:29:38,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:38,769 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-05-15 10:29:38,769 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-05-15 10:29:38,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:38,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:38,769 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2019-05-15 10:29:38,769 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2019-05-15 10:29:38,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:38,770 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-05-15 10:29:38,770 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-05-15 10:29:38,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:38,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:38,771 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:29:38,771 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:29:38,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-05-15 10:29:38,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-05-15 10:29:38,771 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-05-15 10:29:38,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:29:38,772 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-05-15 10:29:38,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-05-15 10:29:38,772 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-05-15 10:29:38,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-05-15 10:29:38,772 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:29:38,773 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1, 1] [2019-05-15 10:29:38,773 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:29:38,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:29:38,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1745861304, now seen corresponding path program 38 times [2019-05-15 10:29:38,774 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:29:38,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:38,786 WARN L254 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 40 conjunts are in the unsatisfiable core [2019-05-15 10:29:38,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:38,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:29:38,833 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:38,834 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,839 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:38,840 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,840 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:29:38,841 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:38,841 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_748|]. (= (store |v_#memory_int_748| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:29:38,841 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:29:38,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 16 treesize of output 11 [2019-05-15 10:29:38,853 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,858 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:38,858 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,858 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:38,864 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:38,865 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_749|]. (let ((.cse0 (select |v_#memory_int_749| ULTIMATE.start_main_p1))) (and (= 0 .cse0) (= (store |v_#memory_int_749| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:38,865 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:29:38,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:38,875 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,877 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:38,878 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,878 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:38,886 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:38,886 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_750|]. (let ((.cse0 (select |v_#memory_int_750| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_750| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 1))) [2019-05-15 10:29:38,886 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:29:38,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:38,896 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,898 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:38,899 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,899 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:38,906 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:38,906 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_751|]. (let ((.cse0 (select |v_#memory_int_751| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_751| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 2))) [2019-05-15 10:29:38,906 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:29:38,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 16 treesize of output 11 [2019-05-15 10:29:38,921 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,926 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:38,926 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,926 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:38,937 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:38,938 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_752|]. (let ((.cse0 (select |v_#memory_int_752| ULTIMATE.start_main_p1))) (and (= .cse0 3) (= |#memory_int| (store |v_#memory_int_752| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:38,938 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:29:38,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 16 treesize of output 11 [2019-05-15 10:29:38,956 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,958 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:38,958 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,958 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:38,966 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:38,966 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_753|]. (let ((.cse0 (select |v_#memory_int_753| ULTIMATE.start_main_p1))) (and (= .cse0 4) (= (store |v_#memory_int_753| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:38,967 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:29:38,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 16 treesize of output 11 [2019-05-15 10:29:38,980 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,982 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:38,983 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,983 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:38,990 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:38,991 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_754|]. (let ((.cse0 (select |v_#memory_int_754| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_754| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 5))) [2019-05-15 10:29:38,991 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:29:39,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:39,005 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,007 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:39,008 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,008 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:39,016 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:39,016 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_755|]. (let ((.cse0 (select |v_#memory_int_755| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_755| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 6))) [2019-05-15 10:29:39,016 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:29:39,033 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:39,034 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,036 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:39,036 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,036 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:39,044 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:39,044 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_756|]. (let ((.cse0 (select |v_#memory_int_756| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_756| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 7 .cse0))) [2019-05-15 10:29:39,044 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:29:39,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 16 treesize of output 11 [2019-05-15 10:29:39,062 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,064 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:39,065 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,065 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:39,073 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:39,073 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_757|]. (let ((.cse0 (select |v_#memory_int_757| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_757| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 8 .cse0))) [2019-05-15 10:29:39,074 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:29:39,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:39,094 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,096 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:39,097 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,097 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:39,104 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:39,105 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_758|]. (let ((.cse0 (select |v_#memory_int_758| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_758| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 9 .cse0))) [2019-05-15 10:29:39,105 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:29:39,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 16 treesize of output 11 [2019-05-15 10:29:39,124 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,126 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:39,126 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,127 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:39,136 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:39,136 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_759|]. (let ((.cse0 (select |v_#memory_int_759| ULTIMATE.start_main_p1))) (and (= .cse0 10) (= |#memory_int| (store |v_#memory_int_759| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:39,136 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:29:39,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:39,154 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,157 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:39,157 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,157 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:39,164 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:39,164 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_760|]. (let ((.cse0 (select |v_#memory_int_760| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_760| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 11 .cse0))) [2019-05-15 10:29:39,165 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:29:39,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 16 treesize of output 11 [2019-05-15 10:29:39,186 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,188 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:39,188 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,188 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:39,196 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:39,197 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_761|]. (let ((.cse0 (select |v_#memory_int_761| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_761| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 12))) [2019-05-15 10:29:39,197 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:29:39,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:39,219 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,221 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:39,222 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,222 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:39,229 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:39,230 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_762|]. (let ((.cse0 (select |v_#memory_int_762| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_762| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 13))) [2019-05-15 10:29:39,230 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:29:39,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:39,251 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,253 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:39,253 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,253 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:39,261 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:39,261 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_763|]. (let ((.cse0 (select |v_#memory_int_763| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_763| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 14))) [2019-05-15 10:29:39,261 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:29:39,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:39,286 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,288 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:39,288 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,288 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:39,297 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:39,298 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_764|]. (let ((.cse0 (select |v_#memory_int_764| ULTIMATE.start_main_p1))) (and (= 15 .cse0) (= (store |v_#memory_int_764| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:39,298 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:29:39,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 16 treesize of output 11 [2019-05-15 10:29:39,324 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,326 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:39,327 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,327 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:39,335 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:39,335 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_765|]. (let ((.cse0 (select |v_#memory_int_765| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_765| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 16 .cse0))) [2019-05-15 10:29:39,335 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:29:39,358 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:39,360 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,362 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:39,362 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,362 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:39,370 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:39,370 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_766|]. (let ((.cse0 (select |v_#memory_int_766| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_766| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 17))) [2019-05-15 10:29:39,370 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:29:39,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:39,396 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,398 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:39,399 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,399 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:39,406 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:39,406 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_767|]. (let ((.cse0 (select |v_#memory_int_767| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_767| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 18))) [2019-05-15 10:29:39,406 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:29:39,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:39,433 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,435 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:39,435 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,436 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:39,443 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:39,443 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_768|]. (let ((.cse0 (select |v_#memory_int_768| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_768| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 19))) [2019-05-15 10:29:39,443 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:29:39,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 16 treesize of output 11 [2019-05-15 10:29:39,470 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,472 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:39,473 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,473 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:39,480 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:39,480 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_769|]. (let ((.cse0 (select |v_#memory_int_769| ULTIMATE.start_main_p1))) (and (= .cse0 20) (= (store |v_#memory_int_769| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:39,481 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:29:39,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 16 treesize of output 11 [2019-05-15 10:29:39,508 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,510 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:39,510 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,510 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:39,517 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:39,518 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_770|]. (let ((.cse0 (select |v_#memory_int_770| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_770| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 21))) [2019-05-15 10:29:39,518 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:29:39,544 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:39,545 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,548 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:39,548 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,548 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:39,556 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:39,556 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_771|]. (let ((.cse0 (select |v_#memory_int_771| ULTIMATE.start_main_p1))) (and (= 22 .cse0) (= (store |v_#memory_int_771| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:39,556 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:29:39,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:39,586 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,588 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:39,588 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,588 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:39,596 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:39,596 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_772|]. (let ((.cse0 (select |v_#memory_int_772| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_772| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 23 .cse0))) [2019-05-15 10:29:39,596 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:29:39,626 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:39,627 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,629 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:39,630 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,630 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:39,636 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:39,637 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_773|]. (let ((.cse0 (select |v_#memory_int_773| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_773| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 24))) [2019-05-15 10:29:39,637 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:29:39,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 16 treesize of output 11 [2019-05-15 10:29:39,667 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,670 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:39,670 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,670 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:39,679 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:39,679 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_774|]. (let ((.cse0 (select |v_#memory_int_774| ULTIMATE.start_main_p1))) (and (= 25 .cse0) (= (store |v_#memory_int_774| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:39,679 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:29:39,710 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:39,731 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,733 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:39,733 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,733 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:39,739 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:39,739 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_775|]. (let ((.cse0 (select |v_#memory_int_775| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_775| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 26))) [2019-05-15 10:29:39,739 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:29:39,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 16 treesize of output 11 [2019-05-15 10:29:39,775 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,777 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:39,778 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,778 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:39,786 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:39,787 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_776|]. (let ((.cse0 (select |v_#memory_int_776| ULTIMATE.start_main_p1))) (and (= .cse0 27) (= (store |v_#memory_int_776| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:39,787 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:29:39,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:39,822 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,824 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:39,825 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,825 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:39,833 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:39,834 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_777|]. (let ((.cse0 (select |v_#memory_int_777| ULTIMATE.start_main_p1))) (and (= 28 .cse0) (= |#memory_int| (store |v_#memory_int_777| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:39,834 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:29:39,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 16 treesize of output 11 [2019-05-15 10:29:39,868 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,870 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:39,871 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,871 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:39,877 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:39,877 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_778|]. (let ((.cse0 (select |v_#memory_int_778| ULTIMATE.start_main_p1))) (and (= 29 .cse0) (= (store |v_#memory_int_778| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:39,877 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:29:39,912 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:39,913 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,915 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:39,915 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,916 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:39,923 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:39,924 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_779|]. (let ((.cse0 (select |v_#memory_int_779| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_779| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 30))) [2019-05-15 10:29:39,924 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:29:39,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 16 treesize of output 11 [2019-05-15 10:29:39,961 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,963 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:39,963 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,963 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:39,971 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:39,971 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_780|]. (let ((.cse0 (select |v_#memory_int_780| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_780| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 31 .cse0))) [2019-05-15 10:29:39,971 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:29:40,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:40,017 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:40,018 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:40,018 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:40,019 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:40,024 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:40,025 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_781|]. (let ((.cse0 (select |v_#memory_int_781| ULTIMATE.start_main_p1))) (and (= 32 .cse0) (= |#memory_int| (store |v_#memory_int_781| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:40,025 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:29:40,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:40,063 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:40,065 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:40,065 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:40,065 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:40,074 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:40,074 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_782|]. (let ((.cse0 (select |v_#memory_int_782| ULTIMATE.start_main_p1))) (and (= .cse0 33) (= (store |v_#memory_int_782| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:40,074 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:29:40,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 16 treesize of output 11 [2019-05-15 10:29:40,112 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:40,114 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:40,114 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:40,115 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:40,122 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:40,122 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_783|]. (let ((.cse0 (select |v_#memory_int_783| ULTIMATE.start_main_p1))) (and (= 34 .cse0) (= (store |v_#memory_int_783| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:40,122 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:29:40,160 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:40,161 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:40,164 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:40,164 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:40,164 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:40,172 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:40,172 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_784|]. (let ((.cse0 (select |v_#memory_int_784| ULTIMATE.start_main_p1))) (and (= 35 .cse0) (= (store |v_#memory_int_784| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:40,172 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:29:40,244 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:40,247 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:40,248 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:40,248 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:40,248 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:40,255 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:40,255 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_785|]. (let ((.cse0 (select |v_#memory_int_785| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_785| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 36 .cse0))) [2019-05-15 10:29:40,255 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:29:40,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 16 treesize of output 11 [2019-05-15 10:29:40,390 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:40,391 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:40,391 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:40,391 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:40,397 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:40,397 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_786|]. (let ((.cse0 (select |v_#memory_int_786| ULTIMATE.start_main_p1))) (and (= 37 .cse0) (= (store |v_#memory_int_786| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:40,398 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:29:40,434 INFO L273 TraceCheckUtils]: 0: Hoare triple {7082#true} havoc main_p1; {7082#true} is VALID [2019-05-15 10:29:40,434 INFO L273 TraceCheckUtils]: 1: Hoare triple {7082#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {7082#true} is VALID [2019-05-15 10:29:40,435 INFO L273 TraceCheckUtils]: 2: Hoare triple {7082#true} #memory_int := #memory_int[main_p1 := 0]; {7093#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:29:40,436 INFO L273 TraceCheckUtils]: 3: Hoare triple {7093#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7097#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:29:40,436 INFO L273 TraceCheckUtils]: 4: Hoare triple {7097#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7101#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:29:40,437 INFO L273 TraceCheckUtils]: 5: Hoare triple {7101#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7105#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:29:40,438 INFO L273 TraceCheckUtils]: 6: Hoare triple {7105#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7109#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:29:40,439 INFO L273 TraceCheckUtils]: 7: Hoare triple {7109#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7113#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:29:40,439 INFO L273 TraceCheckUtils]: 8: Hoare triple {7113#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7117#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:29:40,440 INFO L273 TraceCheckUtils]: 9: Hoare triple {7117#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7121#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:29:40,441 INFO L273 TraceCheckUtils]: 10: Hoare triple {7121#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7125#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:29:40,442 INFO L273 TraceCheckUtils]: 11: Hoare triple {7125#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7129#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:29:40,442 INFO L273 TraceCheckUtils]: 12: Hoare triple {7129#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7133#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:29:40,443 INFO L273 TraceCheckUtils]: 13: Hoare triple {7133#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7137#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:29:40,444 INFO L273 TraceCheckUtils]: 14: Hoare triple {7137#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7141#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:29:40,445 INFO L273 TraceCheckUtils]: 15: Hoare triple {7141#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7145#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:29:40,445 INFO L273 TraceCheckUtils]: 16: Hoare triple {7145#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7149#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:29:40,446 INFO L273 TraceCheckUtils]: 17: Hoare triple {7149#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7153#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:29:40,447 INFO L273 TraceCheckUtils]: 18: Hoare triple {7153#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7157#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:29:40,448 INFO L273 TraceCheckUtils]: 19: Hoare triple {7157#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7161#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:29:40,448 INFO L273 TraceCheckUtils]: 20: Hoare triple {7161#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7165#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:29:40,449 INFO L273 TraceCheckUtils]: 21: Hoare triple {7165#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7169#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:29:40,450 INFO L273 TraceCheckUtils]: 22: Hoare triple {7169#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7173#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:29:40,451 INFO L273 TraceCheckUtils]: 23: Hoare triple {7173#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7177#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:29:40,452 INFO L273 TraceCheckUtils]: 24: Hoare triple {7177#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7181#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:29:40,452 INFO L273 TraceCheckUtils]: 25: Hoare triple {7181#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7185#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:29:40,453 INFO L273 TraceCheckUtils]: 26: Hoare triple {7185#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7189#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:29:40,454 INFO L273 TraceCheckUtils]: 27: Hoare triple {7189#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7193#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:29:40,455 INFO L273 TraceCheckUtils]: 28: Hoare triple {7193#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7197#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:29:40,455 INFO L273 TraceCheckUtils]: 29: Hoare triple {7197#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7201#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:29:40,456 INFO L273 TraceCheckUtils]: 30: Hoare triple {7201#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7205#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:29:40,457 INFO L273 TraceCheckUtils]: 31: Hoare triple {7205#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7209#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:29:40,458 INFO L273 TraceCheckUtils]: 32: Hoare triple {7209#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7213#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:29:40,459 INFO L273 TraceCheckUtils]: 33: Hoare triple {7213#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7217#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:29:40,459 INFO L273 TraceCheckUtils]: 34: Hoare triple {7217#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7221#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:29:40,460 INFO L273 TraceCheckUtils]: 35: Hoare triple {7221#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7225#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:29:40,461 INFO L273 TraceCheckUtils]: 36: Hoare triple {7225#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7229#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:29:40,462 INFO L273 TraceCheckUtils]: 37: Hoare triple {7229#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7233#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:29:40,463 INFO L273 TraceCheckUtils]: 38: Hoare triple {7233#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7237#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:29:40,463 INFO L273 TraceCheckUtils]: 39: Hoare triple {7237#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7241#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:29:40,464 INFO L273 TraceCheckUtils]: 40: Hoare triple {7241#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7245#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:29:40,465 INFO L273 TraceCheckUtils]: 41: Hoare triple {7245#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} assume !(#memory_int[main_p1] >= 0); {7083#false} is VALID [2019-05-15 10:29:40,468 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:29:40,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:29:40,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-05-15 10:29:40,469 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 42 [2019-05-15 10:29:40,469 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:29:40,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states. [2019-05-15 10:29:40,504 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:40,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-05-15 10:29:40,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-05-15 10:29:40,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-05-15 10:29:40,506 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 41 states. [2019-05-15 10:29:44,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:44,064 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-05-15 10:29:44,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-05-15 10:29:44,064 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 42 [2019-05-15 10:29:44,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:29:44,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-05-15 10:29:44,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-05-15 10:29:44,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-05-15 10:29:44,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-05-15 10:29:44,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 45 transitions. [2019-05-15 10:29:44,112 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:29:44,113 INFO L225 Difference]: With dead ends: 44 [2019-05-15 10:29:44,113 INFO L226 Difference]: Without dead ends: 44 [2019-05-15 10:29:44,114 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-05-15 10:29:44,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-05-15 10:29:44,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-05-15 10:29:44,114 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:29:44,115 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2019-05-15 10:29:44,115 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2019-05-15 10:29:44,115 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2019-05-15 10:29:44,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:44,115 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-05-15 10:29:44,116 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-05-15 10:29:44,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:44,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:44,116 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2019-05-15 10:29:44,116 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2019-05-15 10:29:44,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:44,117 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-05-15 10:29:44,117 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-05-15 10:29:44,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:44,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:44,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:29:44,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:29:44,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-05-15 10:29:44,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-05-15 10:29:44,119 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-05-15 10:29:44,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:29:44,119 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-05-15 10:29:44,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-05-15 10:29:44,119 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-05-15 10:29:44,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-05-15 10:29:44,120 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:29:44,120 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1, 1] [2019-05-15 10:29:44,120 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:29:44,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:29:44,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1712874370, now seen corresponding path program 39 times [2019-05-15 10:29:44,121 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:29:44,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:44,134 WARN L254 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 41 conjunts are in the unsatisfiable core [2019-05-15 10:29:44,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:44,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:29:44,278 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:44,278 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,280 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:44,281 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,281 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:29:44,286 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:44,286 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_787|]. (= |#memory_int| (store |v_#memory_int_787| ULTIMATE.start_main_p1 0)) [2019-05-15 10:29:44,286 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:29:44,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:44,299 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,301 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:44,302 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,302 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:44,310 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:44,310 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_788|]. (let ((.cse0 (select |v_#memory_int_788| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_788| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 0))) [2019-05-15 10:29:44,310 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:29:44,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 16 treesize of output 11 [2019-05-15 10:29:44,322 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,324 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:44,324 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,325 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:44,333 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:44,334 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_789|]. (let ((.cse0 (select |v_#memory_int_789| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_789| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 1))) [2019-05-15 10:29:44,334 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:29:44,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 16 treesize of output 11 [2019-05-15 10:29:44,347 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,349 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:44,350 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,350 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:44,358 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:44,358 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_790|]. (let ((.cse0 (select |v_#memory_int_790| ULTIMATE.start_main_p1))) (and (= 2 .cse0) (= |#memory_int| (store |v_#memory_int_790| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:44,358 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:29:44,371 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:44,372 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,374 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:44,375 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,375 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:44,383 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:44,383 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_791|]. (let ((.cse0 (select |v_#memory_int_791| ULTIMATE.start_main_p1))) (and (= .cse0 3) (= |#memory_int| (store |v_#memory_int_791| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:44,383 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:29:44,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:44,396 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,398 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:44,399 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,399 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:44,405 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:44,405 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_792|]. (let ((.cse0 (select |v_#memory_int_792| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_792| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 4))) [2019-05-15 10:29:44,405 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:29:44,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 16 treesize of output 11 [2019-05-15 10:29:44,421 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,424 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:44,424 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,424 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:44,432 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:44,432 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_793|]. (let ((.cse0 (select |v_#memory_int_793| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_793| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 5))) [2019-05-15 10:29:44,433 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:29:44,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 16 treesize of output 11 [2019-05-15 10:29:44,450 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,453 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:44,453 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,453 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:44,461 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:44,461 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_794|]. (let ((.cse0 (select |v_#memory_int_794| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_794| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 6 .cse0))) [2019-05-15 10:29:44,461 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:29:44,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:44,479 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,481 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:44,481 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,482 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:44,488 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:44,489 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_795|]. (let ((.cse0 (select |v_#memory_int_795| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_795| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 7))) [2019-05-15 10:29:44,489 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:29:44,544 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:44,545 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,546 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:44,547 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,547 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:44,555 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:44,556 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_796|]. (let ((.cse0 (select |v_#memory_int_796| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_796| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 8))) [2019-05-15 10:29:44,556 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:29:44,573 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:44,574 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,577 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:44,577 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,577 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:44,586 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:44,586 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_797|]. (let ((.cse0 (select |v_#memory_int_797| ULTIMATE.start_main_p1))) (and (= .cse0 9) (= (store |v_#memory_int_797| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:44,586 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:29:44,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 16 treesize of output 11 [2019-05-15 10:29:44,605 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,608 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:44,608 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,608 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:44,616 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:44,616 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_798|]. (let ((.cse0 (select |v_#memory_int_798| ULTIMATE.start_main_p1))) (and (= .cse0 10) (= |#memory_int| (store |v_#memory_int_798| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:44,616 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:29:44,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 16 treesize of output 11 [2019-05-15 10:29:44,636 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,638 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:44,639 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,639 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:44,647 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:44,647 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_799|]. (let ((.cse0 (select |v_#memory_int_799| ULTIMATE.start_main_p1))) (and (= .cse0 11) (= (store |v_#memory_int_799| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:44,647 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:29:44,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:44,668 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,670 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:44,670 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,671 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:44,678 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:44,679 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_800|]. (let ((.cse0 (select |v_#memory_int_800| ULTIMATE.start_main_p1))) (and (= 12 .cse0) (= (store |v_#memory_int_800| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:44,679 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:29:44,698 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:44,699 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,701 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:44,701 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,702 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:44,712 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:44,712 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_801|]. (let ((.cse0 (select |v_#memory_int_801| ULTIMATE.start_main_p1))) (and (= 13 .cse0) (= (store |v_#memory_int_801| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:44,712 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:29:44,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 16 treesize of output 11 [2019-05-15 10:29:44,743 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,746 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:44,746 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,746 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:44,754 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:44,754 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_802|]. (let ((.cse0 (select |v_#memory_int_802| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_802| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 14))) [2019-05-15 10:29:44,754 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:29:44,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 16 treesize of output 11 [2019-05-15 10:29:44,785 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,787 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:44,788 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,788 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:44,796 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:44,796 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_803|]. (let ((.cse0 (select |v_#memory_int_803| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_803| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 15))) [2019-05-15 10:29:44,796 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:29:44,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:44,822 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,824 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:44,824 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,824 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:44,831 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:44,831 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_804|]. (let ((.cse0 (select |v_#memory_int_804| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_804| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 16))) [2019-05-15 10:29:44,831 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:29:44,854 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:44,856 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,858 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:44,858 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,859 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:44,865 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:44,865 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_805|]. (let ((.cse0 (select |v_#memory_int_805| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_805| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 17 .cse0))) [2019-05-15 10:29:44,865 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:29:44,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 16 treesize of output 11 [2019-05-15 10:29:44,893 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,896 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:44,896 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,896 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:44,904 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:44,904 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_806|]. (let ((.cse0 (select |v_#memory_int_806| ULTIMATE.start_main_p1))) (and (= .cse0 18) (= (store |v_#memory_int_806| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:44,904 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:29:44,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 16 treesize of output 11 [2019-05-15 10:29:44,933 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,935 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:44,935 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,936 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:44,944 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:44,944 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_807|]. (let ((.cse0 (select |v_#memory_int_807| ULTIMATE.start_main_p1))) (and (= 19 .cse0) (= (store |v_#memory_int_807| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:44,945 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:29:44,981 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:44,982 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,983 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:44,984 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,984 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:44,992 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:44,992 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_808|]. (let ((.cse0 (select |v_#memory_int_808| ULTIMATE.start_main_p1))) (and (= 20 .cse0) (= (store |v_#memory_int_808| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:44,993 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:29:45,021 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:45,022 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:45,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:45,025 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:45,025 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:45,033 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:45,033 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_809|]. (let ((.cse0 (select |v_#memory_int_809| ULTIMATE.start_main_p1))) (and (= 21 .cse0) (= |#memory_int| (store |v_#memory_int_809| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:45,033 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:29:45,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:45,060 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:45,062 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:45,063 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:45,063 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:45,071 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:45,071 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_810|]. (let ((.cse0 (select |v_#memory_int_810| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_810| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 22))) [2019-05-15 10:29:45,071 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:29:45,102 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:45,103 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:45,119 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:45,119 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:45,119 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:45,126 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:45,126 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_811|]. (let ((.cse0 (select |v_#memory_int_811| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_811| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 23))) [2019-05-15 10:29:45,126 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:29:45,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 16 treesize of output 11 [2019-05-15 10:29:45,184 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:45,186 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:45,187 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:45,187 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:45,195 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:45,196 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_812|]. (let ((.cse0 (select |v_#memory_int_812| ULTIMATE.start_main_p1))) (and (= 24 .cse0) (= |#memory_int| (store |v_#memory_int_812| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:45,196 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:29:45,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:45,226 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:45,228 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:45,229 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:45,229 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:45,237 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:45,237 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_813|]. (let ((.cse0 (select |v_#memory_int_813| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_813| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 25 .cse0))) [2019-05-15 10:29:45,237 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:29:45,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 16 treesize of output 11 [2019-05-15 10:29:45,271 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:45,273 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:45,273 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:45,274 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:45,281 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:45,281 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_814|]. (let ((.cse0 (select |v_#memory_int_814| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_814| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 26))) [2019-05-15 10:29:45,281 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:29:45,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:45,311 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:45,314 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:45,314 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:45,314 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:45,322 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:45,322 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_815|]. (let ((.cse0 (select |v_#memory_int_815| ULTIMATE.start_main_p1))) (and (= .cse0 27) (= |#memory_int| (store |v_#memory_int_815| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:45,323 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:29:45,357 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:45,358 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:45,360 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:45,360 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:45,361 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:45,368 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:45,368 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_816|]. (let ((.cse0 (select |v_#memory_int_816| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_816| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 28))) [2019-05-15 10:29:45,368 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:29:45,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 16 treesize of output 11 [2019-05-15 10:29:45,402 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:45,404 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:45,404 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:45,404 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:45,412 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:45,413 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_817|]. (let ((.cse0 (select |v_#memory_int_817| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_817| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 29 .cse0))) [2019-05-15 10:29:45,413 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:29:45,446 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:45,447 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:45,449 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:45,450 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:45,450 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:45,458 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:45,458 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_818|]. (let ((.cse0 (select |v_#memory_int_818| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_818| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 30))) [2019-05-15 10:29:45,458 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:29:45,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:45,492 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:45,495 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:45,495 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:45,495 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:45,503 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:45,503 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_819|]. (let ((.cse0 (select |v_#memory_int_819| ULTIMATE.start_main_p1))) (and (= .cse0 31) (= |#memory_int| (store |v_#memory_int_819| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:45,503 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:29:45,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:45,540 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:45,542 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:45,542 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:45,542 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:45,551 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:45,551 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_820|]. (let ((.cse0 (select |v_#memory_int_820| ULTIMATE.start_main_p1))) (and (= 32 .cse0) (= (store |v_#memory_int_820| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:45,551 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:29:45,588 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:45,589 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:45,591 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:45,592 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:45,592 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:45,600 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:45,600 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_821|]. (let ((.cse0 (select |v_#memory_int_821| ULTIMATE.start_main_p1))) (and (= .cse0 33) (= (store |v_#memory_int_821| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:45,600 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:29:45,636 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:45,637 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:45,640 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:45,640 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:45,640 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:45,647 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:45,647 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_822|]. (let ((.cse0 (select |v_#memory_int_822| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_822| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 34))) [2019-05-15 10:29:45,647 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:29:45,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 16 treesize of output 11 [2019-05-15 10:29:45,688 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:45,690 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:45,691 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:45,691 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:45,700 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:45,700 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_823|]. (let ((.cse0 (select |v_#memory_int_823| ULTIMATE.start_main_p1))) (and (= 35 .cse0) (= |#memory_int| (store |v_#memory_int_823| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:45,700 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:29:45,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 16 treesize of output 11 [2019-05-15 10:29:45,739 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:45,741 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:45,742 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:45,742 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:45,750 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:45,750 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_824|]. (let ((.cse0 (select |v_#memory_int_824| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_824| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 36))) [2019-05-15 10:29:45,750 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:29:45,789 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:45,790 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:45,792 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:45,792 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:45,793 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:45,801 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:45,801 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_825|]. (let ((.cse0 (select |v_#memory_int_825| ULTIMATE.start_main_p1))) (and (= .cse0 37) (= (store |v_#memory_int_825| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:45,802 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:29:45,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 16 treesize of output 11 [2019-05-15 10:29:45,844 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:45,846 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:45,847 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:45,847 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:45,853 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:45,854 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_826|]. (let ((.cse0 (select |v_#memory_int_826| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_826| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 38 .cse0))) [2019-05-15 10:29:45,854 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:29:45,889 INFO L273 TraceCheckUtils]: 0: Hoare triple {7424#true} havoc main_p1; {7424#true} is VALID [2019-05-15 10:29:45,889 INFO L273 TraceCheckUtils]: 1: Hoare triple {7424#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {7424#true} is VALID [2019-05-15 10:29:45,889 INFO L273 TraceCheckUtils]: 2: Hoare triple {7424#true} #memory_int := #memory_int[main_p1 := 0]; {7435#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:29:45,890 INFO L273 TraceCheckUtils]: 3: Hoare triple {7435#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7439#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:29:45,891 INFO L273 TraceCheckUtils]: 4: Hoare triple {7439#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7443#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:29:45,892 INFO L273 TraceCheckUtils]: 5: Hoare triple {7443#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7447#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:29:45,892 INFO L273 TraceCheckUtils]: 6: Hoare triple {7447#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7451#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:29:45,893 INFO L273 TraceCheckUtils]: 7: Hoare triple {7451#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7455#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:29:45,894 INFO L273 TraceCheckUtils]: 8: Hoare triple {7455#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7459#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:29:45,895 INFO L273 TraceCheckUtils]: 9: Hoare triple {7459#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7463#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:29:45,896 INFO L273 TraceCheckUtils]: 10: Hoare triple {7463#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7467#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:29:45,897 INFO L273 TraceCheckUtils]: 11: Hoare triple {7467#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7471#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:29:45,897 INFO L273 TraceCheckUtils]: 12: Hoare triple {7471#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7475#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:29:45,898 INFO L273 TraceCheckUtils]: 13: Hoare triple {7475#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7479#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:29:45,899 INFO L273 TraceCheckUtils]: 14: Hoare triple {7479#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7483#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:29:45,900 INFO L273 TraceCheckUtils]: 15: Hoare triple {7483#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7487#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:29:45,901 INFO L273 TraceCheckUtils]: 16: Hoare triple {7487#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7491#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:29:45,902 INFO L273 TraceCheckUtils]: 17: Hoare triple {7491#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7495#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:29:45,902 INFO L273 TraceCheckUtils]: 18: Hoare triple {7495#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7499#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:29:45,903 INFO L273 TraceCheckUtils]: 19: Hoare triple {7499#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7503#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:29:45,904 INFO L273 TraceCheckUtils]: 20: Hoare triple {7503#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7507#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:29:45,905 INFO L273 TraceCheckUtils]: 21: Hoare triple {7507#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7511#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:29:45,906 INFO L273 TraceCheckUtils]: 22: Hoare triple {7511#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7515#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:29:45,907 INFO L273 TraceCheckUtils]: 23: Hoare triple {7515#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7519#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:29:45,908 INFO L273 TraceCheckUtils]: 24: Hoare triple {7519#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7523#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:29:45,908 INFO L273 TraceCheckUtils]: 25: Hoare triple {7523#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7527#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:29:45,909 INFO L273 TraceCheckUtils]: 26: Hoare triple {7527#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7531#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:29:45,910 INFO L273 TraceCheckUtils]: 27: Hoare triple {7531#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7535#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:29:45,911 INFO L273 TraceCheckUtils]: 28: Hoare triple {7535#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7539#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:29:45,912 INFO L273 TraceCheckUtils]: 29: Hoare triple {7539#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7543#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:29:45,913 INFO L273 TraceCheckUtils]: 30: Hoare triple {7543#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7547#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:29:45,913 INFO L273 TraceCheckUtils]: 31: Hoare triple {7547#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7551#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:29:45,914 INFO L273 TraceCheckUtils]: 32: Hoare triple {7551#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7555#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:29:45,915 INFO L273 TraceCheckUtils]: 33: Hoare triple {7555#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7559#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:29:45,916 INFO L273 TraceCheckUtils]: 34: Hoare triple {7559#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7563#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:29:45,917 INFO L273 TraceCheckUtils]: 35: Hoare triple {7563#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7567#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:29:45,918 INFO L273 TraceCheckUtils]: 36: Hoare triple {7567#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7571#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:29:45,918 INFO L273 TraceCheckUtils]: 37: Hoare triple {7571#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7575#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:29:45,919 INFO L273 TraceCheckUtils]: 38: Hoare triple {7575#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7579#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:29:45,920 INFO L273 TraceCheckUtils]: 39: Hoare triple {7579#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7583#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:29:45,921 INFO L273 TraceCheckUtils]: 40: Hoare triple {7583#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7587#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:29:45,922 INFO L273 TraceCheckUtils]: 41: Hoare triple {7587#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7591#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:29:45,922 INFO L273 TraceCheckUtils]: 42: Hoare triple {7591#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} assume !(#memory_int[main_p1] >= 0); {7425#false} is VALID [2019-05-15 10:29:45,926 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:29:45,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:29:45,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-05-15 10:29:45,926 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 43 [2019-05-15 10:29:45,927 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:29:45,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2019-05-15 10:29:45,963 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:29:45,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-05-15 10:29:45,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-05-15 10:29:45,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-05-15 10:29:45,965 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 42 states. [2019-05-15 10:29:49,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:49,879 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-05-15 10:29:49,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-05-15 10:29:49,879 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 43 [2019-05-15 10:29:49,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:29:49,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-05-15 10:29:49,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-05-15 10:29:49,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-05-15 10:29:49,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-05-15 10:29:49,882 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 46 transitions. [2019-05-15 10:29:49,922 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:49,922 INFO L225 Difference]: With dead ends: 45 [2019-05-15 10:29:49,923 INFO L226 Difference]: Without dead ends: 45 [2019-05-15 10:29:49,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-05-15 10:29:49,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-05-15 10:29:49,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-05-15 10:29:49,924 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:29:49,924 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 45 states. [2019-05-15 10:29:49,924 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2019-05-15 10:29:49,925 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2019-05-15 10:29:49,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:49,925 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-05-15 10:29:49,925 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-05-15 10:29:49,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:49,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:49,926 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2019-05-15 10:29:49,926 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2019-05-15 10:29:49,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:49,926 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-05-15 10:29:49,927 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-05-15 10:29:49,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:49,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:49,927 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:29:49,927 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:29:49,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-05-15 10:29:49,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-05-15 10:29:49,928 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-05-15 10:29:49,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:29:49,928 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-05-15 10:29:49,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-05-15 10:29:49,928 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-05-15 10:29:49,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-05-15 10:29:49,929 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:29:49,929 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1, 1] [2019-05-15 10:29:49,929 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:29:49,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:29:49,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1559497864, now seen corresponding path program 40 times [2019-05-15 10:29:49,930 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:29:49,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:49,944 WARN L254 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 42 conjunts are in the unsatisfiable core [2019-05-15 10:29:49,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:49,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:29:50,109 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:50,109 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,147 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:50,147 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,147 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:29:50,160 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:50,160 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_827|]. (= (store |v_#memory_int_827| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:29:50,161 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:29:50,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:50,383 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,387 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:50,387 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,387 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:50,394 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:50,394 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_828|]. (let ((.cse0 (select |v_#memory_int_828| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_828| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 0))) [2019-05-15 10:29:50,394 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:29:50,404 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:50,405 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,407 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:50,408 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,408 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:50,416 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:50,416 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_829|]. (let ((.cse0 (select |v_#memory_int_829| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_829| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 1 .cse0))) [2019-05-15 10:29:50,417 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:29:50,429 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:50,430 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,432 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:50,432 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,433 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:50,439 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:50,439 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_830|]. (let ((.cse0 (select |v_#memory_int_830| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_830| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 2))) [2019-05-15 10:29:50,440 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:29:50,454 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:50,455 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,457 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:50,458 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,458 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:50,468 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:50,468 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_831|]. (let ((.cse0 (select |v_#memory_int_831| ULTIMATE.start_main_p1))) (and (= 3 .cse0) (= |#memory_int| (store |v_#memory_int_831| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:50,468 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:29:50,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 16 treesize of output 11 [2019-05-15 10:29:50,483 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,485 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:50,486 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,486 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:50,494 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:50,494 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_832|]. (let ((.cse0 (select |v_#memory_int_832| ULTIMATE.start_main_p1))) (and (= .cse0 4) (= |#memory_int| (store |v_#memory_int_832| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:50,494 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:29:50,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 16 treesize of output 11 [2019-05-15 10:29:50,511 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,513 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:50,514 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,514 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:50,522 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:50,523 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_833|]. (let ((.cse0 (select |v_#memory_int_833| ULTIMATE.start_main_p1))) (and (= .cse0 5) (= (store |v_#memory_int_833| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:50,523 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:29:50,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:50,537 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,540 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:50,540 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,540 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:50,550 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:50,550 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_834|]. (let ((.cse0 (select |v_#memory_int_834| ULTIMATE.start_main_p1))) (and (= .cse0 6) (= (store |v_#memory_int_834| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:50,551 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:29:50,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 16 treesize of output 11 [2019-05-15 10:29:50,568 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,570 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:50,571 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,571 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:50,579 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:50,579 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_835|]. (let ((.cse0 (select |v_#memory_int_835| ULTIMATE.start_main_p1))) (and (= .cse0 7) (= (store |v_#memory_int_835| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:50,579 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:29:50,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 16 treesize of output 11 [2019-05-15 10:29:50,597 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,599 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:50,600 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,600 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:50,608 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:50,609 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_836|]. (let ((.cse0 (select |v_#memory_int_836| ULTIMATE.start_main_p1))) (and (= .cse0 8) (= |#memory_int| (store |v_#memory_int_836| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:50,609 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:29:50,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 16 treesize of output 11 [2019-05-15 10:29:50,628 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,630 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:50,631 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,631 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:50,639 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:50,639 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_837|]. (let ((.cse0 (select |v_#memory_int_837| ULTIMATE.start_main_p1))) (and (= .cse0 9) (= (store |v_#memory_int_837| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:50,639 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:29:50,675 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:50,676 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,678 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:50,678 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,678 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:50,686 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:50,686 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_838|]. (let ((.cse0 (select |v_#memory_int_838| ULTIMATE.start_main_p1))) (and (= .cse0 10) (= (store |v_#memory_int_838| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:50,686 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:29:50,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:50,707 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,709 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:50,710 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,710 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:50,717 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:50,717 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_839|]. (let ((.cse0 (select |v_#memory_int_839| ULTIMATE.start_main_p1))) (and (= 11 .cse0) (= (store |v_#memory_int_839| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:50,717 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:29:50,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:50,738 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,740 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 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 1 xjuncts. [2019-05-15 10:29:50,741 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:50,749 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:50,750 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_840|]. (let ((.cse0 (select |v_#memory_int_840| ULTIMATE.start_main_p1))) (and (= .cse0 12) (= (store |v_#memory_int_840| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:50,750 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:29:50,772 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:50,773 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,775 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:50,776 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,776 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:50,783 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:50,784 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_841|]. (let ((.cse0 (select |v_#memory_int_841| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_841| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 13 .cse0))) [2019-05-15 10:29:50,784 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:29:50,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:50,807 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,809 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:50,809 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,810 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:50,818 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:50,818 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_842|]. (let ((.cse0 (select |v_#memory_int_842| ULTIMATE.start_main_p1))) (and (= 14 .cse0) (= (store |v_#memory_int_842| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:50,818 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:29: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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:50,843 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,845 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:50,846 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,846 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:50,855 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:50,855 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_843|]. (let ((.cse0 (select |v_#memory_int_843| ULTIMATE.start_main_p1))) (and (= .cse0 15) (= (store |v_#memory_int_843| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:50,855 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:29:50,877 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:50,878 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,881 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:50,881 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,881 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:50,887 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:50,888 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_844|]. (let ((.cse0 (select |v_#memory_int_844| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_844| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 16))) [2019-05-15 10:29:50,888 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:29:50,912 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:50,913 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,915 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:50,916 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,916 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:50,924 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:50,925 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_845|]. (let ((.cse0 (select |v_#memory_int_845| ULTIMATE.start_main_p1))) (and (= 17 .cse0) (= |#memory_int| (store |v_#memory_int_845| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:50,925 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:29:50,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:50,949 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,951 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:50,951 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,952 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:50,959 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:50,959 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_846|]. (let ((.cse0 (select |v_#memory_int_846| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_846| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 18))) [2019-05-15 10:29:50,959 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:29:50,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 16 treesize of output 11 [2019-05-15 10:29:50,985 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,988 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:50,988 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,988 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:50,995 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:50,995 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_847|]. (let ((.cse0 (select |v_#memory_int_847| ULTIMATE.start_main_p1))) (and (= .cse0 19) (= |#memory_int| (store |v_#memory_int_847| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:50,995 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:29:51,020 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:51,022 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:51,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:51,024 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:51,025 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:51,033 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:51,033 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_848|]. (let ((.cse0 (select |v_#memory_int_848| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_848| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 20))) [2019-05-15 10:29:51,033 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:29:51,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 16 treesize of output 11 [2019-05-15 10:29:51,062 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:51,064 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:51,065 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:51,065 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:51,072 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:51,073 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_849|]. (let ((.cse0 (select |v_#memory_int_849| ULTIMATE.start_main_p1))) (and (= 21 .cse0) (= |#memory_int| (store |v_#memory_int_849| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:51,073 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:29:51,102 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:51,103 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:51,106 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:51,106 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:51,106 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:51,114 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:51,114 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_850|]. (let ((.cse0 (select |v_#memory_int_850| ULTIMATE.start_main_p1))) (and (= .cse0 22) (= (store |v_#memory_int_850| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:51,115 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:29:51,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 16 treesize of output 11 [2019-05-15 10:29:51,145 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:51,147 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:51,147 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:51,148 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:51,156 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:51,156 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_851|]. (let ((.cse0 (select |v_#memory_int_851| ULTIMATE.start_main_p1))) (and (= 23 .cse0) (= |#memory_int| (store |v_#memory_int_851| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:51,156 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:29:51,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 16 treesize of output 11 [2019-05-15 10:29:51,191 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:51,193 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:51,194 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:51,194 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:51,202 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:51,202 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_852|]. (let ((.cse0 (select |v_#memory_int_852| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_852| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 24))) [2019-05-15 10:29:51,202 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:29:51,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:51,233 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:51,236 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:51,236 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:51,236 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:51,244 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:51,245 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_853|]. (let ((.cse0 (select |v_#memory_int_853| ULTIMATE.start_main_p1))) (and (= 25 .cse0) (= |#memory_int| (store |v_#memory_int_853| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:51,245 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:29: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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:51,277 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:51,280 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:51,280 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:51,280 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:51,288 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:51,288 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_854|]. (let ((.cse0 (select |v_#memory_int_854| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_854| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 26 .cse0))) [2019-05-15 10:29:51,289 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:29:51,320 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:51,321 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:51,324 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:51,324 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:51,325 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:51,332 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:51,333 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_855|]. (let ((.cse0 (select |v_#memory_int_855| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_855| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 27 .cse0))) [2019-05-15 10:29:51,333 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:29:51,366 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:51,367 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:51,369 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:51,370 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:51,370 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:51,379 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:51,379 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_856|]. (let ((.cse0 (select |v_#memory_int_856| ULTIMATE.start_main_p1))) (and (= .cse0 28) (= (store |v_#memory_int_856| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:51,379 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:29:51,415 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:51,417 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:51,419 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:51,420 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:51,420 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:51,429 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:51,429 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_857|]. (let ((.cse0 (select |v_#memory_int_857| ULTIMATE.start_main_p1))) (and (= 29 .cse0) (= |#memory_int| (store |v_#memory_int_857| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:51,429 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:29:51,464 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:51,466 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:51,468 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:51,468 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:51,469 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:51,477 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:51,477 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_858|]. (let ((.cse0 (select |v_#memory_int_858| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_858| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 30 .cse0))) [2019-05-15 10:29:51,477 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:29:51,511 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:51,512 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:51,515 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:51,515 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:51,515 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:51,524 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:51,524 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_859|]. (let ((.cse0 (select |v_#memory_int_859| ULTIMATE.start_main_p1))) (and (= .cse0 31) (= (store |v_#memory_int_859| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:51,524 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:29:51,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:51,564 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:51,566 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:51,567 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:51,567 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:51,575 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:51,576 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_860|]. (let ((.cse0 (select |v_#memory_int_860| ULTIMATE.start_main_p1))) (and (= 32 .cse0) (= (store |v_#memory_int_860| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:51,576 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:29:51,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 16 treesize of output 11 [2019-05-15 10:29:51,617 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:51,619 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29: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:29:51,620 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:51,628 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:51,628 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_861|]. (let ((.cse0 (select |v_#memory_int_861| ULTIMATE.start_main_p1))) (and (= 33 .cse0) (= |#memory_int| (store |v_#memory_int_861| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:51,628 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:29:51,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 16 treesize of output 11 [2019-05-15 10:29:51,667 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:51,670 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:51,670 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:51,670 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:51,679 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:51,679 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_862|]. (let ((.cse0 (select |v_#memory_int_862| ULTIMATE.start_main_p1))) (and (= 34 .cse0) (= |#memory_int| (store |v_#memory_int_862| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:51,679 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:29:51,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:51,721 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:51,724 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:51,724 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:51,724 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:51,731 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:51,731 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_863|]. (let ((.cse0 (select |v_#memory_int_863| ULTIMATE.start_main_p1))) (and (= .cse0 35) (= |#memory_int| (store |v_#memory_int_863| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:51,732 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:29:51,772 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:51,774 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:51,777 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:51,777 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:51,777 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:51,785 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:51,785 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_864|]. (let ((.cse0 (select |v_#memory_int_864| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_864| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 36 .cse0))) [2019-05-15 10:29:51,786 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:29:51,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 16 treesize of output 11 [2019-05-15 10:29:51,835 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:51,837 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:51,837 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:51,837 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:51,845 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:51,846 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_865|]. (let ((.cse0 (select |v_#memory_int_865| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_865| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 37 .cse0))) [2019-05-15 10:29:51,846 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:29:51,885 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:51,886 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:51,888 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:51,888 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:51,888 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:51,896 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:51,897 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_866|]. (let ((.cse0 (select |v_#memory_int_866| ULTIMATE.start_main_p1))) (and (= 38 .cse0) (= |#memory_int| (store |v_#memory_int_866| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:51,897 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:29: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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:51,939 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:51,942 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:51,942 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:51,942 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:51,950 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:51,951 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_867|]. (let ((.cse0 (select |v_#memory_int_867| ULTIMATE.start_main_p1))) (and (= .cse0 39) (= (store |v_#memory_int_867| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:51,951 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:29:51,988 INFO L273 TraceCheckUtils]: 0: Hoare triple {7774#true} havoc main_p1; {7774#true} is VALID [2019-05-15 10:29:51,988 INFO L273 TraceCheckUtils]: 1: Hoare triple {7774#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {7774#true} is VALID [2019-05-15 10:29:51,989 INFO L273 TraceCheckUtils]: 2: Hoare triple {7774#true} #memory_int := #memory_int[main_p1 := 0]; {7785#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:29:51,989 INFO L273 TraceCheckUtils]: 3: Hoare triple {7785#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7789#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:29:51,990 INFO L273 TraceCheckUtils]: 4: Hoare triple {7789#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7793#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:29:51,990 INFO L273 TraceCheckUtils]: 5: Hoare triple {7793#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7797#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:29:51,991 INFO L273 TraceCheckUtils]: 6: Hoare triple {7797#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7801#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:29:51,992 INFO L273 TraceCheckUtils]: 7: Hoare triple {7801#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7805#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:29:51,993 INFO L273 TraceCheckUtils]: 8: Hoare triple {7805#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7809#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:29:51,993 INFO L273 TraceCheckUtils]: 9: Hoare triple {7809#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7813#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:29:51,994 INFO L273 TraceCheckUtils]: 10: Hoare triple {7813#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7817#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:29:51,995 INFO L273 TraceCheckUtils]: 11: Hoare triple {7817#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7821#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:29:51,996 INFO L273 TraceCheckUtils]: 12: Hoare triple {7821#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7825#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:29:51,997 INFO L273 TraceCheckUtils]: 13: Hoare triple {7825#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7829#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:29:51,998 INFO L273 TraceCheckUtils]: 14: Hoare triple {7829#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7833#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:29:51,998 INFO L273 TraceCheckUtils]: 15: Hoare triple {7833#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7837#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:29:51,999 INFO L273 TraceCheckUtils]: 16: Hoare triple {7837#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7841#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:29:52,000 INFO L273 TraceCheckUtils]: 17: Hoare triple {7841#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7845#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:29:52,001 INFO L273 TraceCheckUtils]: 18: Hoare triple {7845#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7849#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:29:52,002 INFO L273 TraceCheckUtils]: 19: Hoare triple {7849#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7853#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:29:52,003 INFO L273 TraceCheckUtils]: 20: Hoare triple {7853#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7857#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:29:52,003 INFO L273 TraceCheckUtils]: 21: Hoare triple {7857#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7861#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:29:52,004 INFO L273 TraceCheckUtils]: 22: Hoare triple {7861#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7865#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:29:52,005 INFO L273 TraceCheckUtils]: 23: Hoare triple {7865#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7869#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:29:52,006 INFO L273 TraceCheckUtils]: 24: Hoare triple {7869#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7873#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:29:52,007 INFO L273 TraceCheckUtils]: 25: Hoare triple {7873#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7877#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:29:52,008 INFO L273 TraceCheckUtils]: 26: Hoare triple {7877#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7881#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:29:52,009 INFO L273 TraceCheckUtils]: 27: Hoare triple {7881#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7885#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:29:52,010 INFO L273 TraceCheckUtils]: 28: Hoare triple {7885#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7889#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:29:52,011 INFO L273 TraceCheckUtils]: 29: Hoare triple {7889#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7893#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:29:52,012 INFO L273 TraceCheckUtils]: 30: Hoare triple {7893#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7897#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:29:52,013 INFO L273 TraceCheckUtils]: 31: Hoare triple {7897#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7901#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:29:52,013 INFO L273 TraceCheckUtils]: 32: Hoare triple {7901#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7905#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:29:52,014 INFO L273 TraceCheckUtils]: 33: Hoare triple {7905#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7909#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:29:52,015 INFO L273 TraceCheckUtils]: 34: Hoare triple {7909#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7913#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:29:52,016 INFO L273 TraceCheckUtils]: 35: Hoare triple {7913#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7917#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:29:52,017 INFO L273 TraceCheckUtils]: 36: Hoare triple {7917#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7921#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:29:52,018 INFO L273 TraceCheckUtils]: 37: Hoare triple {7921#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7925#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:29:52,018 INFO L273 TraceCheckUtils]: 38: Hoare triple {7925#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7929#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:29:52,019 INFO L273 TraceCheckUtils]: 39: Hoare triple {7929#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7933#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:29:52,020 INFO L273 TraceCheckUtils]: 40: Hoare triple {7933#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7937#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:29:52,021 INFO L273 TraceCheckUtils]: 41: Hoare triple {7937#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7941#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:29:52,022 INFO L273 TraceCheckUtils]: 42: Hoare triple {7941#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7945#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:29:52,022 INFO L273 TraceCheckUtils]: 43: Hoare triple {7945#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} assume !(#memory_int[main_p1] >= 0); {7775#false} is VALID [2019-05-15 10:29:52,026 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:29:52,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:29:52,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-05-15 10:29:52,027 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 44 [2019-05-15 10:29:52,027 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:29:52,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states. [2019-05-15 10:29:52,064 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:52,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-05-15 10:29:52,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-05-15 10:29:52,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-05-15 10:29:52,066 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 43 states. [2019-05-15 10:29:56,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:56,061 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-05-15 10:29:56,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-05-15 10:29:56,061 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 44 [2019-05-15 10:29:56,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:29:56,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-05-15 10:29:56,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-05-15 10:29:56,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-05-15 10:29:56,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-05-15 10:29:56,063 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 47 transitions. [2019-05-15 10:29:56,100 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:29:56,100 INFO L225 Difference]: With dead ends: 46 [2019-05-15 10:29:56,101 INFO L226 Difference]: Without dead ends: 46 [2019-05-15 10:29:56,102 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-05-15 10:29:56,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-05-15 10:29:56,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-05-15 10:29:56,103 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:29:56,103 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 46 states. [2019-05-15 10:29:56,103 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2019-05-15 10:29:56,103 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2019-05-15 10:29:56,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:56,104 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-05-15 10:29:56,104 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-05-15 10:29:56,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:56,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:56,105 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2019-05-15 10:29:56,105 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2019-05-15 10:29:56,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:56,105 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-05-15 10:29:56,105 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-05-15 10:29:56,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:56,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:56,106 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:29:56,106 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:29:56,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-05-15 10:29:56,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-05-15 10:29:56,106 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-05-15 10:29:56,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:29:56,106 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-05-15 10:29:56,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-05-15 10:29:56,106 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-05-15 10:29:56,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-05-15 10:29:56,107 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:29:56,107 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1, 1] [2019-05-15 10:29:56,107 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:29:56,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:29:56,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1099793474, now seen corresponding path program 41 times [2019-05-15 10:29:56,108 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:29:56,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:56,120 WARN L254 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 43 conjunts are in the unsatisfiable core [2019-05-15 10:29:56,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:56,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:29:56,173 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:56,173 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,174 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:56,175 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,175 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:29:56,176 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:56,176 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_868|]. (= (store |v_#memory_int_868| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:29:56,176 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:29:56,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 16 treesize of output 11 [2019-05-15 10:29:56,187 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,189 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:56,189 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,189 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:56,197 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:56,197 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_869|]. (let ((.cse0 (select |v_#memory_int_869| ULTIMATE.start_main_p1))) (and (= .cse0 0) (= (store |v_#memory_int_869| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:56,197 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:29:56,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 16 treesize of output 11 [2019-05-15 10:29:56,208 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,210 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:56,210 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,211 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:56,218 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:56,219 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_870|]. (let ((.cse0 (select |v_#memory_int_870| ULTIMATE.start_main_p1))) (and (= 1 .cse0) (= |#memory_int| (store |v_#memory_int_870| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:56,219 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:29:56,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 16 treesize of output 11 [2019-05-15 10:29:56,230 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,232 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:56,232 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,232 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:56,240 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:56,240 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_871|]. (let ((.cse0 (select |v_#memory_int_871| ULTIMATE.start_main_p1))) (and (= .cse0 2) (= |#memory_int| (store |v_#memory_int_871| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:56,241 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:29:56,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 16 treesize of output 11 [2019-05-15 10:29:56,253 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,255 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:56,255 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,255 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:56,262 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:56,262 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_872|]. (let ((.cse0 (select |v_#memory_int_872| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_872| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 3 .cse0))) [2019-05-15 10:29:56,262 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:29:56,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 16 treesize of output 11 [2019-05-15 10:29:56,277 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,279 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:56,279 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,279 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:56,286 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:56,287 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_873|]. (let ((.cse0 (select |v_#memory_int_873| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_873| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 4))) [2019-05-15 10:29:56,287 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:29:56,300 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:56,301 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,303 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:56,303 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,303 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:56,310 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:56,310 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_874|]. (let ((.cse0 (select |v_#memory_int_874| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_874| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 5))) [2019-05-15 10:29:56,311 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:29:56,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 16 treesize of output 11 [2019-05-15 10:29:56,355 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,357 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:56,357 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,357 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:56,365 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:56,365 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_875|]. (let ((.cse0 (select |v_#memory_int_875| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_875| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 6 .cse0))) [2019-05-15 10:29:56,365 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:29: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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:56,381 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,383 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:56,383 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,384 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:56,390 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:56,390 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_876|]. (let ((.cse0 (select |v_#memory_int_876| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_876| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 7))) [2019-05-15 10:29:56,390 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:29:56,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 16 treesize of output 11 [2019-05-15 10:29:56,407 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,409 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:56,409 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,410 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:56,416 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:56,417 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_877|]. (let ((.cse0 (select |v_#memory_int_877| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_877| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 8))) [2019-05-15 10:29:56,417 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:29:56,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 16 treesize of output 11 [2019-05-15 10:29:56,435 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,437 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:56,437 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,438 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:56,444 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:56,444 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_878|]. (let ((.cse0 (select |v_#memory_int_878| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_878| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 9))) [2019-05-15 10:29:56,445 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:29:56,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:56,464 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,466 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:56,466 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,466 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:56,473 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:56,473 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_879|]. (let ((.cse0 (select |v_#memory_int_879| ULTIMATE.start_main_p1))) (and (= .cse0 10) (= |#memory_int| (store |v_#memory_int_879| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:56,473 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:29:56,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 16 treesize of output 11 [2019-05-15 10:29:56,492 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,494 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:56,495 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,495 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:56,502 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:56,502 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_880|]. (let ((.cse0 (select |v_#memory_int_880| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_880| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 11))) [2019-05-15 10:29:56,503 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:29:56,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 16 treesize of output 11 [2019-05-15 10:29:56,522 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,524 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:56,524 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,524 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:56,531 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:56,531 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_881|]. (let ((.cse0 (select |v_#memory_int_881| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_881| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 12 .cse0))) [2019-05-15 10:29:56,531 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:29:56,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 16 treesize of output 11 [2019-05-15 10:29:56,551 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,553 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:56,553 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,553 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:56,560 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:56,560 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_882|]. (let ((.cse0 (select |v_#memory_int_882| ULTIMATE.start_main_p1))) (and (= .cse0 13) (= (store |v_#memory_int_882| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:56,561 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:29:56,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 16 treesize of output 11 [2019-05-15 10:29:56,583 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,585 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:56,585 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,585 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:56,592 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:56,592 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_883|]. (let ((.cse0 (select |v_#memory_int_883| ULTIMATE.start_main_p1))) (and (= .cse0 14) (= (store |v_#memory_int_883| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:56,592 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:29:56,612 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:56,613 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,615 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:56,615 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,616 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:56,623 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:56,623 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_884|]. (let ((.cse0 (select |v_#memory_int_884| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_884| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 15))) [2019-05-15 10:29:56,623 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:29:56,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:56,646 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,648 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:56,648 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,648 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:56,656 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:56,656 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_885|]. (let ((.cse0 (select |v_#memory_int_885| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_885| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 16))) [2019-05-15 10:29:56,656 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:29:56,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 16 treesize of output 11 [2019-05-15 10:29:56,678 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,680 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:56,680 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,680 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:56,687 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:56,687 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_886|]. (let ((.cse0 (select |v_#memory_int_886| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_886| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 17 .cse0))) [2019-05-15 10:29:56,687 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:29:56,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:56,713 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,715 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:56,715 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,715 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:56,723 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:56,723 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_887|]. (let ((.cse0 (select |v_#memory_int_887| ULTIMATE.start_main_p1))) (and (= 18 .cse0) (= (store |v_#memory_int_887| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:56,724 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:29:56,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 16 treesize of output 11 [2019-05-15 10:29:56,748 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,750 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:56,750 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,750 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:56,762 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:56,762 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_888|]. (let ((.cse0 (select |v_#memory_int_888| ULTIMATE.start_main_p1))) (and (= .cse0 19) (= |#memory_int| (store |v_#memory_int_888| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:56,762 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:29:56,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:56,787 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,789 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:56,789 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,789 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:56,795 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:56,796 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_889|]. (let ((.cse0 (select |v_#memory_int_889| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_889| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 20))) [2019-05-15 10:29:56,796 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:29:56,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:56,821 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,824 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:56,824 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,824 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:56,832 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:56,832 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_890|]. (let ((.cse0 (select |v_#memory_int_890| ULTIMATE.start_main_p1))) (and (= .cse0 21) (= |#memory_int| (store |v_#memory_int_890| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:56,832 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:29:56,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 16 treesize of output 11 [2019-05-15 10:29:56,861 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,863 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:56,863 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,863 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:56,871 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:56,871 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_891|]. (let ((.cse0 (select |v_#memory_int_891| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_891| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 22))) [2019-05-15 10:29:56,871 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:29:56,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:56,901 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,903 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:56,903 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,903 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:56,910 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:56,910 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_892|]. (let ((.cse0 (select |v_#memory_int_892| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_892| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 23))) [2019-05-15 10:29:56,910 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:29:56,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:56,939 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,941 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:56,941 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,941 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:56,948 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:56,949 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_893|]. (let ((.cse0 (select |v_#memory_int_893| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_893| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 24))) [2019-05-15 10:29:56,949 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:29:56,980 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:56,981 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,983 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:56,983 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,984 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:56,992 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:56,992 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_894|]. (let ((.cse0 (select |v_#memory_int_894| ULTIMATE.start_main_p1))) (and (= .cse0 25) (= |#memory_int| (store |v_#memory_int_894| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:56,992 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:29:57,021 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:57,022 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:57,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:57,024 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:57,025 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:57,031 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:57,031 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_895|]. (let ((.cse0 (select |v_#memory_int_895| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_895| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 26 .cse0))) [2019-05-15 10:29:57,032 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:29:57,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:57,061 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:57,063 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:57,063 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:57,063 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:57,071 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:57,071 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_896|]. (let ((.cse0 (select |v_#memory_int_896| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_896| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 27))) [2019-05-15 10:29:57,071 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:29:57,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 16 treesize of output 11 [2019-05-15 10:29:57,104 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:57,106 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:57,106 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:57,107 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:57,114 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:57,114 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_897|]. (let ((.cse0 (select |v_#memory_int_897| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_897| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 28))) [2019-05-15 10:29:57,114 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:29: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 16 treesize of output 11 [2019-05-15 10:29:57,147 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:57,149 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:57,149 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:57,149 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:57,157 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:57,157 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_898|]. (let ((.cse0 (select |v_#memory_int_898| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_898| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 29 .cse0))) [2019-05-15 10:29:57,157 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:29:57,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 16 treesize of output 11 [2019-05-15 10:29:57,191 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:57,193 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:57,194 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:57,194 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:57,202 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:57,202 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_899|]. (let ((.cse0 (select |v_#memory_int_899| ULTIMATE.start_main_p1))) (and (= 30 .cse0) (= |#memory_int| (store |v_#memory_int_899| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:57,202 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:29:57,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 16 treesize of output 11 [2019-05-15 10:29:57,239 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:57,240 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:57,241 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:57,241 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:57,248 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:57,248 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_900|]. (let ((.cse0 (select |v_#memory_int_900| ULTIMATE.start_main_p1))) (and (= 31 .cse0) (= (store |v_#memory_int_900| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:57,249 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:29:57,282 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:57,283 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:57,285 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:57,285 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:57,285 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:57,292 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:57,293 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_901|]. (let ((.cse0 (select |v_#memory_int_901| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_901| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 32))) [2019-05-15 10:29:57,293 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:29:57,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 16 treesize of output 11 [2019-05-15 10:29:57,330 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:57,332 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:57,332 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:57,332 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:57,339 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:57,340 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_902|]. (let ((.cse0 (select |v_#memory_int_902| ULTIMATE.start_main_p1))) (and (= 33 .cse0) (= (store |v_#memory_int_902| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:57,340 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:29:57,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 16 treesize of output 11 [2019-05-15 10:29:57,374 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:57,376 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:57,376 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:57,377 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:57,383 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:57,384 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_903|]. (let ((.cse0 (select |v_#memory_int_903| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_903| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 34 .cse0))) [2019-05-15 10:29:57,384 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:29: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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:57,422 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:57,424 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:57,425 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:57,425 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:57,432 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:57,432 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_904|]. (let ((.cse0 (select |v_#memory_int_904| ULTIMATE.start_main_p1))) (and (= .cse0 35) (= (store |v_#memory_int_904| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:57,432 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:29:57,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 16 treesize of output 11 [2019-05-15 10:29:57,474 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:57,476 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:57,476 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:57,477 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:57,485 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:57,485 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_905|]. (let ((.cse0 (select |v_#memory_int_905| ULTIMATE.start_main_p1))) (and (= .cse0 36) (= (store |v_#memory_int_905| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:57,485 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:29:57,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 16 treesize of output 11 [2019-05-15 10:29:57,524 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:57,526 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:57,526 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:57,527 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:57,535 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:57,535 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_906|]. (let ((.cse0 (select |v_#memory_int_906| ULTIMATE.start_main_p1))) (and (= 37 .cse0) (= |#memory_int| (store |v_#memory_int_906| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:57,535 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:29:57,615 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:57,616 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:57,618 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:57,619 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:57,619 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:57,627 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:57,627 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_907|]. (let ((.cse0 (select |v_#memory_int_907| ULTIMATE.start_main_p1))) (and (= 38 .cse0) (= (store |v_#memory_int_907| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:57,628 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:29:57,668 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:57,669 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:57,671 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:57,672 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:57,672 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:57,681 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:57,681 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_908|]. (let ((.cse0 (select |v_#memory_int_908| ULTIMATE.start_main_p1))) (and (= 39 .cse0) (= (store |v_#memory_int_908| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:57,681 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:29:57,723 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:57,725 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:57,727 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:57,727 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:57,728 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:57,735 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:57,735 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_909|]. (let ((.cse0 (select |v_#memory_int_909| ULTIMATE.start_main_p1))) (and (= .cse0 40) (= (store |v_#memory_int_909| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:57,736 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:29:57,775 INFO L273 TraceCheckUtils]: 0: Hoare triple {8132#true} havoc main_p1; {8132#true} is VALID [2019-05-15 10:29:57,775 INFO L273 TraceCheckUtils]: 1: Hoare triple {8132#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {8132#true} is VALID [2019-05-15 10:29:57,776 INFO L273 TraceCheckUtils]: 2: Hoare triple {8132#true} #memory_int := #memory_int[main_p1 := 0]; {8143#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:29:57,777 INFO L273 TraceCheckUtils]: 3: Hoare triple {8143#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8147#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:29:57,778 INFO L273 TraceCheckUtils]: 4: Hoare triple {8147#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8151#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:29:57,778 INFO L273 TraceCheckUtils]: 5: Hoare triple {8151#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8155#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:29:57,779 INFO L273 TraceCheckUtils]: 6: Hoare triple {8155#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8159#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:29:57,780 INFO L273 TraceCheckUtils]: 7: Hoare triple {8159#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8163#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:29:57,781 INFO L273 TraceCheckUtils]: 8: Hoare triple {8163#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8167#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:29:57,782 INFO L273 TraceCheckUtils]: 9: Hoare triple {8167#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8171#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:29:57,782 INFO L273 TraceCheckUtils]: 10: Hoare triple {8171#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8175#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:29:57,783 INFO L273 TraceCheckUtils]: 11: Hoare triple {8175#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8179#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:29:57,784 INFO L273 TraceCheckUtils]: 12: Hoare triple {8179#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8183#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:29:57,785 INFO L273 TraceCheckUtils]: 13: Hoare triple {8183#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8187#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:29:57,786 INFO L273 TraceCheckUtils]: 14: Hoare triple {8187#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8191#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:29:57,786 INFO L273 TraceCheckUtils]: 15: Hoare triple {8191#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8195#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:29:57,787 INFO L273 TraceCheckUtils]: 16: Hoare triple {8195#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8199#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:29:57,788 INFO L273 TraceCheckUtils]: 17: Hoare triple {8199#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8203#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:29:57,789 INFO L273 TraceCheckUtils]: 18: Hoare triple {8203#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8207#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:29:57,790 INFO L273 TraceCheckUtils]: 19: Hoare triple {8207#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8211#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:29:57,791 INFO L273 TraceCheckUtils]: 20: Hoare triple {8211#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8215#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:29:57,791 INFO L273 TraceCheckUtils]: 21: Hoare triple {8215#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8219#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:29:57,792 INFO L273 TraceCheckUtils]: 22: Hoare triple {8219#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8223#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:29:57,793 INFO L273 TraceCheckUtils]: 23: Hoare triple {8223#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8227#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:29:57,794 INFO L273 TraceCheckUtils]: 24: Hoare triple {8227#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8231#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:29:57,795 INFO L273 TraceCheckUtils]: 25: Hoare triple {8231#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8235#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:29:57,795 INFO L273 TraceCheckUtils]: 26: Hoare triple {8235#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8239#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:29:57,796 INFO L273 TraceCheckUtils]: 27: Hoare triple {8239#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8243#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:29:57,797 INFO L273 TraceCheckUtils]: 28: Hoare triple {8243#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8247#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:29:57,798 INFO L273 TraceCheckUtils]: 29: Hoare triple {8247#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8251#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:29:57,799 INFO L273 TraceCheckUtils]: 30: Hoare triple {8251#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8255#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:29:57,799 INFO L273 TraceCheckUtils]: 31: Hoare triple {8255#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8259#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:29:57,800 INFO L273 TraceCheckUtils]: 32: Hoare triple {8259#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8263#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:29:57,801 INFO L273 TraceCheckUtils]: 33: Hoare triple {8263#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8267#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:29:57,802 INFO L273 TraceCheckUtils]: 34: Hoare triple {8267#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8271#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:29:57,803 INFO L273 TraceCheckUtils]: 35: Hoare triple {8271#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8275#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:29:57,804 INFO L273 TraceCheckUtils]: 36: Hoare triple {8275#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8279#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:29:57,804 INFO L273 TraceCheckUtils]: 37: Hoare triple {8279#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8283#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:29:57,805 INFO L273 TraceCheckUtils]: 38: Hoare triple {8283#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8287#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:29:57,806 INFO L273 TraceCheckUtils]: 39: Hoare triple {8287#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8291#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:29:57,807 INFO L273 TraceCheckUtils]: 40: Hoare triple {8291#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8295#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:29:57,808 INFO L273 TraceCheckUtils]: 41: Hoare triple {8295#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8299#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:29:57,808 INFO L273 TraceCheckUtils]: 42: Hoare triple {8299#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8303#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:29:57,809 INFO L273 TraceCheckUtils]: 43: Hoare triple {8303#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8307#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:29:57,810 INFO L273 TraceCheckUtils]: 44: Hoare triple {8307#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} assume !(#memory_int[main_p1] >= 0); {8133#false} is VALID [2019-05-15 10:29:57,814 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:29:57,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:29:57,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-05-15 10:29:57,815 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 45 [2019-05-15 10:29:57,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:29:57,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states. [2019-05-15 10:29:57,852 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:29:57,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-05-15 10:29:57,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-05-15 10:29:57,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-05-15 10:29:57,854 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 44 states. [2019-05-15 10:30:01,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:01,952 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-05-15 10:30:01,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-05-15 10:30:01,952 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 45 [2019-05-15 10:30:01,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:30:01,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-05-15 10:30:01,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-05-15 10:30:01,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-05-15 10:30:01,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-05-15 10:30:01,954 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states and 48 transitions. [2019-05-15 10:30:01,995 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:01,996 INFO L225 Difference]: With dead ends: 47 [2019-05-15 10:30:01,996 INFO L226 Difference]: Without dead ends: 47 [2019-05-15 10:30:01,997 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-05-15 10:30:01,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-05-15 10:30:01,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-05-15 10:30:01,999 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:30:01,999 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 47 states. [2019-05-15 10:30:01,999 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2019-05-15 10:30:01,999 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2019-05-15 10:30:02,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:02,000 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-05-15 10:30:02,000 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-05-15 10:30:02,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:30:02,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:30:02,001 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2019-05-15 10:30:02,001 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2019-05-15 10:30:02,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:02,002 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-05-15 10:30:02,002 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-05-15 10:30:02,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:30:02,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:30:02,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:30:02,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:30:02,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-05-15 10:30:02,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-05-15 10:30:02,003 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-05-15 10:30:02,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:30:02,003 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-05-15 10:30:02,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-05-15 10:30:02,003 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-05-15 10:30:02,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-05-15 10:30:02,004 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:30:02,004 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1, 1] [2019-05-15 10:30:02,004 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:30:02,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:30:02,004 INFO L82 PathProgramCache]: Analyzing trace with hash -266140728, now seen corresponding path program 42 times [2019-05-15 10:30:02,005 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:30:02,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:30:02,018 WARN L254 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 44 conjunts are in the unsatisfiable core [2019-05-15 10:30:02,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:30:02,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:30:02,057 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:02,058 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,059 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:02,059 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,059 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:30:02,062 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:02,062 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_910|]. (= (store |v_#memory_int_910| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:30:02,062 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:30:02,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 16 treesize of output 11 [2019-05-15 10:30:02,169 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,205 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:02,205 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,205 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:02,218 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:02,219 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_911|]. (let ((.cse0 (select |v_#memory_int_911| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_911| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 0))) [2019-05-15 10:30:02,219 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:30:02,239 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:02,248 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,250 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:02,250 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,250 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:02,257 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:02,258 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_912|]. (let ((.cse0 (select |v_#memory_int_912| ULTIMATE.start_main_p1))) (and (= .cse0 1) (= (store |v_#memory_int_912| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:02,258 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:30:02,269 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:02,270 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,273 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:02,273 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,273 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:02,281 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:02,281 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_913|]. (let ((.cse0 (select |v_#memory_int_913| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_913| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 2))) [2019-05-15 10:30:02,281 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:30:02,293 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:02,294 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,297 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:02,297 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,297 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:02,305 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:02,305 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_914|]. (let ((.cse0 (select |v_#memory_int_914| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_914| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 3))) [2019-05-15 10:30:02,305 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:30:02,318 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:02,319 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,321 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 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 1 xjuncts. [2019-05-15 10:30:02,322 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:02,329 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:02,329 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_915|]. (let ((.cse0 (select |v_#memory_int_915| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_915| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 4))) [2019-05-15 10:30:02,329 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:30:02,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 16 treesize of output 11 [2019-05-15 10:30:02,344 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,346 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:02,347 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,347 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:02,355 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:02,356 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_916|]. (let ((.cse0 (select |v_#memory_int_916| ULTIMATE.start_main_p1))) (and (= .cse0 5) (= (store |v_#memory_int_916| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:02,356 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:30:02,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 16 treesize of output 11 [2019-05-15 10:30:02,375 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,377 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:02,377 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,377 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:02,385 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:02,386 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_917|]. (let ((.cse0 (select |v_#memory_int_917| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_917| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 6 .cse0))) [2019-05-15 10:30:02,386 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:30:02,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:02,410 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,412 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:02,412 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,412 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:02,420 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:02,420 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_918|]. (let ((.cse0 (select |v_#memory_int_918| ULTIMATE.start_main_p1))) (and (= .cse0 7) (= |#memory_int| (store |v_#memory_int_918| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:02,420 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:30:02,439 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:02,440 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,442 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 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 1 xjuncts. [2019-05-15 10:30:02,443 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:02,451 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:02,451 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_919|]. (let ((.cse0 (select |v_#memory_int_919| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_919| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 8))) [2019-05-15 10:30:02,451 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:30:02,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:02,469 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,471 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:02,472 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,472 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:02,479 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:02,480 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_920|]. (let ((.cse0 (select |v_#memory_int_920| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_920| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 9 .cse0))) [2019-05-15 10:30:02,480 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:30:02,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 16 treesize of output 11 [2019-05-15 10:30:02,498 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,500 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:02,500 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,501 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:02,508 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:02,509 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_921|]. (let ((.cse0 (select |v_#memory_int_921| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_921| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 10 .cse0))) [2019-05-15 10:30:02,509 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:30:02,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:02,529 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,531 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:02,531 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,531 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:02,539 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:02,540 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_922|]. (let ((.cse0 (select |v_#memory_int_922| ULTIMATE.start_main_p1))) (and (= .cse0 11) (= (store |v_#memory_int_922| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:02,540 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:30:02,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:02,559 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,561 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:02,562 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,562 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:02,569 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:02,570 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_923|]. (let ((.cse0 (select |v_#memory_int_923| ULTIMATE.start_main_p1))) (and (= .cse0 12) (= (store |v_#memory_int_923| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:02,570 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:30:02,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:02,591 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,593 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:02,593 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,593 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:02,600 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:02,600 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_924|]. (let ((.cse0 (select |v_#memory_int_924| ULTIMATE.start_main_p1))) (and (= 13 .cse0) (= (store |v_#memory_int_924| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:02,600 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:30:02,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:02,624 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,626 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:02,627 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,627 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:02,635 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:02,636 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_925|]. (let ((.cse0 (select |v_#memory_int_925| ULTIMATE.start_main_p1))) (and (= 14 .cse0) (= (store |v_#memory_int_925| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:02,636 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:30:02,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 16 treesize of output 11 [2019-05-15 10:30:02,659 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,661 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:02,661 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,661 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:02,667 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:02,668 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_926|]. (let ((.cse0 (select |v_#memory_int_926| ULTIMATE.start_main_p1))) (and (= 15 .cse0) (= (store |v_#memory_int_926| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:02,668 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:30:02,691 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:02,692 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,695 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:02,695 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,695 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:02,703 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:02,704 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_927|]. (let ((.cse0 (select |v_#memory_int_927| ULTIMATE.start_main_p1))) (and (= .cse0 16) (= |#memory_int| (store |v_#memory_int_927| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:02,704 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:30:02,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:02,728 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,730 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:02,731 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,731 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:02,738 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:02,739 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_928|]. (let ((.cse0 (select |v_#memory_int_928| ULTIMATE.start_main_p1))) (and (= .cse0 17) (= (store |v_#memory_int_928| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:02,739 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:30:02,764 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:02,765 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,768 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:02,768 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,768 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:02,776 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:02,776 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_929|]. (let ((.cse0 (select |v_#memory_int_929| ULTIMATE.start_main_p1))) (and (= 18 .cse0) (= |#memory_int| (store |v_#memory_int_929| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:02,776 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:30:02,803 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:02,804 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,806 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:02,807 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,807 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:02,814 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:02,815 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_930|]. (let ((.cse0 (select |v_#memory_int_930| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_930| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 19 .cse0))) [2019-05-15 10:30:02,815 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:30:02,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:02,845 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,847 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:02,847 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,848 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:02,855 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:02,855 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_931|]. (let ((.cse0 (select |v_#memory_int_931| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_931| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 20))) [2019-05-15 10:30:02,855 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:30:02,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:02,882 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,884 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:02,884 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,884 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:02,891 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:02,892 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_932|]. (let ((.cse0 (select |v_#memory_int_932| ULTIMATE.start_main_p1))) (and (= .cse0 21) (= |#memory_int| (store |v_#memory_int_932| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:02,892 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:30:02,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 16 treesize of output 11 [2019-05-15 10:30:02,921 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,923 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:02,923 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,923 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:02,932 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:02,932 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_933|]. (let ((.cse0 (select |v_#memory_int_933| ULTIMATE.start_main_p1))) (and (= 22 .cse0) (= (store |v_#memory_int_933| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:02,932 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:30:02,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 16 treesize of output 11 [2019-05-15 10:30:02,963 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,965 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:02,965 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,966 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:02,974 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:02,974 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_934|]. (let ((.cse0 (select |v_#memory_int_934| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_934| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 23 .cse0))) [2019-05-15 10:30:02,974 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:30:03,005 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:03,006 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:03,008 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:03,008 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:03,009 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:03,016 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:03,016 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_935|]. (let ((.cse0 (select |v_#memory_int_935| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_935| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 24))) [2019-05-15 10:30:03,016 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:30:03,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 16 treesize of output 11 [2019-05-15 10:30:03,046 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:03,048 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:03,049 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:03,049 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:03,057 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:03,057 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_936|]. (let ((.cse0 (select |v_#memory_int_936| ULTIMATE.start_main_p1))) (and (= .cse0 25) (= |#memory_int| (store |v_#memory_int_936| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:03,057 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:30:03,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:03,152 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:03,179 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:03,179 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:03,179 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:03,185 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:03,185 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_937|]. (let ((.cse0 (select |v_#memory_int_937| ULTIMATE.start_main_p1))) (and (= 26 .cse0) (= |#memory_int| (store |v_#memory_int_937| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:03,185 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:30:03,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 16 treesize of output 11 [2019-05-15 10:30:03,217 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:03,219 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:03,219 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:03,220 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:03,227 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:03,227 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_938|]. (let ((.cse0 (select |v_#memory_int_938| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_938| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 27 .cse0))) [2019-05-15 10:30:03,227 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:30:03,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 16 treesize of output 11 [2019-05-15 10:30:03,263 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:03,265 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:03,265 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:03,266 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:03,273 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:03,274 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_939|]. (let ((.cse0 (select |v_#memory_int_939| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_939| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 28))) [2019-05-15 10:30:03,274 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:30:03,307 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:03,308 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:03,311 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:03,311 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:03,311 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:03,319 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:03,319 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_940|]. (let ((.cse0 (select |v_#memory_int_940| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_940| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 29))) [2019-05-15 10:30:03,320 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:30:03,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 16 treesize of output 11 [2019-05-15 10:30:03,355 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:03,358 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:03,358 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:03,358 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:03,366 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:03,367 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_941|]. (let ((.cse0 (select |v_#memory_int_941| ULTIMATE.start_main_p1))) (and (= .cse0 30) (= (store |v_#memory_int_941| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:03,367 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:30:03,402 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:03,403 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:03,405 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:03,406 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:03,406 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:03,414 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:03,414 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_942|]. (let ((.cse0 (select |v_#memory_int_942| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_942| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 31 .cse0))) [2019-05-15 10:30:03,414 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:30:03,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 16 treesize of output 11 [2019-05-15 10:30:03,450 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:03,452 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:03,453 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:03,453 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:03,460 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:03,460 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_943|]. (let ((.cse0 (select |v_#memory_int_943| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_943| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 32))) [2019-05-15 10:30:03,460 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:30:03,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 16 treesize of output 11 [2019-05-15 10:30:03,498 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:03,501 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:03,501 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:03,501 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:03,510 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:03,510 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_944|]. (let ((.cse0 (select |v_#memory_int_944| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_944| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 33))) [2019-05-15 10:30:03,510 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:30:03,546 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:03,547 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:03,549 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:03,549 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:03,550 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:03,557 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:03,558 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_945|]. (let ((.cse0 (select |v_#memory_int_945| ULTIMATE.start_main_p1))) (and (= 34 .cse0) (= (store |v_#memory_int_945| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:03,558 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:30:03,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 16 treesize of output 11 [2019-05-15 10:30:03,598 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:03,600 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:03,601 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:03,601 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:03,609 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:03,609 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_946|]. (let ((.cse0 (select |v_#memory_int_946| ULTIMATE.start_main_p1))) (and (= 35 .cse0) (= |#memory_int| (store |v_#memory_int_946| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:03,609 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:30:03,648 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:03,650 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:03,652 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:03,652 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:03,653 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:03,661 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:03,661 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_947|]. (let ((.cse0 (select |v_#memory_int_947| ULTIMATE.start_main_p1))) (and (= 36 .cse0) (= |#memory_int| (store |v_#memory_int_947| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:03,661 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:30:03,705 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:03,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:03,709 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:03,709 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:03,709 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:03,717 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:03,717 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_948|]. (let ((.cse0 (select |v_#memory_int_948| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_948| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 37))) [2019-05-15 10:30:03,717 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:30:03,763 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:03,765 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:03,767 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:03,767 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:03,768 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:03,775 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:03,775 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_949|]. (let ((.cse0 (select |v_#memory_int_949| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_949| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 38))) [2019-05-15 10:30:03,775 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:30:03,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 16 treesize of output 11 [2019-05-15 10:30:03,823 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:03,824 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:03,825 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:03,825 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:03,833 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:03,833 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_950|]. (let ((.cse0 (select |v_#memory_int_950| ULTIMATE.start_main_p1))) (and (= 39 .cse0) (= (store |v_#memory_int_950| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:03,833 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:30:03,878 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:03,879 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:03,882 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:03,882 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:03,882 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:03,890 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:03,890 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_951|]. (let ((.cse0 (select |v_#memory_int_951| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_951| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 40))) [2019-05-15 10:30:03,891 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:30:03,934 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:03,935 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:03,938 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:03,938 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:03,938 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:03,946 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:03,947 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_952|]. (let ((.cse0 (select |v_#memory_int_952| ULTIMATE.start_main_p1))) (and (= .cse0 41) (= |#memory_int| (store |v_#memory_int_952| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:03,947 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:30:03,986 INFO L273 TraceCheckUtils]: 0: Hoare triple {8498#true} havoc main_p1; {8498#true} is VALID [2019-05-15 10:30:03,986 INFO L273 TraceCheckUtils]: 1: Hoare triple {8498#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {8498#true} is VALID [2019-05-15 10:30:03,987 INFO L273 TraceCheckUtils]: 2: Hoare triple {8498#true} #memory_int := #memory_int[main_p1 := 0]; {8509#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:30:03,987 INFO L273 TraceCheckUtils]: 3: Hoare triple {8509#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8513#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:30:03,988 INFO L273 TraceCheckUtils]: 4: Hoare triple {8513#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8517#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:30:03,988 INFO L273 TraceCheckUtils]: 5: Hoare triple {8517#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8521#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:30:03,989 INFO L273 TraceCheckUtils]: 6: Hoare triple {8521#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8525#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:30:03,989 INFO L273 TraceCheckUtils]: 7: Hoare triple {8525#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8529#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:30:03,990 INFO L273 TraceCheckUtils]: 8: Hoare triple {8529#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8533#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:30:03,991 INFO L273 TraceCheckUtils]: 9: Hoare triple {8533#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8537#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:30:03,991 INFO L273 TraceCheckUtils]: 10: Hoare triple {8537#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8541#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:30:03,992 INFO L273 TraceCheckUtils]: 11: Hoare triple {8541#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8545#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:30:03,993 INFO L273 TraceCheckUtils]: 12: Hoare triple {8545#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8549#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:30:03,994 INFO L273 TraceCheckUtils]: 13: Hoare triple {8549#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8553#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:30:03,995 INFO L273 TraceCheckUtils]: 14: Hoare triple {8553#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8557#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:30:03,995 INFO L273 TraceCheckUtils]: 15: Hoare triple {8557#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8561#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:30:03,996 INFO L273 TraceCheckUtils]: 16: Hoare triple {8561#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8565#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:30:03,997 INFO L273 TraceCheckUtils]: 17: Hoare triple {8565#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8569#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:30:03,998 INFO L273 TraceCheckUtils]: 18: Hoare triple {8569#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8573#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:30:03,999 INFO L273 TraceCheckUtils]: 19: Hoare triple {8573#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8577#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:30:04,000 INFO L273 TraceCheckUtils]: 20: Hoare triple {8577#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8581#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:30:04,000 INFO L273 TraceCheckUtils]: 21: Hoare triple {8581#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8585#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:30:04,001 INFO L273 TraceCheckUtils]: 22: Hoare triple {8585#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8589#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:30:04,002 INFO L273 TraceCheckUtils]: 23: Hoare triple {8589#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8593#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:30:04,003 INFO L273 TraceCheckUtils]: 24: Hoare triple {8593#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8597#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:30:04,004 INFO L273 TraceCheckUtils]: 25: Hoare triple {8597#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8601#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:30:04,005 INFO L273 TraceCheckUtils]: 26: Hoare triple {8601#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8605#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:30:04,005 INFO L273 TraceCheckUtils]: 27: Hoare triple {8605#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8609#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:30:04,006 INFO L273 TraceCheckUtils]: 28: Hoare triple {8609#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8613#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:30:04,007 INFO L273 TraceCheckUtils]: 29: Hoare triple {8613#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8617#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:30:04,008 INFO L273 TraceCheckUtils]: 30: Hoare triple {8617#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8621#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:30:04,009 INFO L273 TraceCheckUtils]: 31: Hoare triple {8621#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8625#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:30:04,009 INFO L273 TraceCheckUtils]: 32: Hoare triple {8625#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8629#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:30:04,010 INFO L273 TraceCheckUtils]: 33: Hoare triple {8629#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8633#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:30:04,011 INFO L273 TraceCheckUtils]: 34: Hoare triple {8633#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8637#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:30:04,012 INFO L273 TraceCheckUtils]: 35: Hoare triple {8637#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8641#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:30:04,013 INFO L273 TraceCheckUtils]: 36: Hoare triple {8641#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8645#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:30:04,014 INFO L273 TraceCheckUtils]: 37: Hoare triple {8645#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8649#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:30:04,014 INFO L273 TraceCheckUtils]: 38: Hoare triple {8649#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8653#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:30:04,015 INFO L273 TraceCheckUtils]: 39: Hoare triple {8653#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8657#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:30:04,016 INFO L273 TraceCheckUtils]: 40: Hoare triple {8657#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8661#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:30:04,017 INFO L273 TraceCheckUtils]: 41: Hoare triple {8661#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8665#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:30:04,018 INFO L273 TraceCheckUtils]: 42: Hoare triple {8665#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8669#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:30:04,018 INFO L273 TraceCheckUtils]: 43: Hoare triple {8669#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8673#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:30:04,019 INFO L273 TraceCheckUtils]: 44: Hoare triple {8673#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8677#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:30:04,020 INFO L273 TraceCheckUtils]: 45: Hoare triple {8677#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} assume !(#memory_int[main_p1] >= 0); {8499#false} is VALID [2019-05-15 10:30:04,024 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:30:04,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:30:04,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-05-15 10:30:04,024 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 46 [2019-05-15 10:30:04,025 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:30:04,025 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states. [2019-05-15 10:30:04,078 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:30:04,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-05-15 10:30:04,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-05-15 10:30:04,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-05-15 10:30:04,079 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 45 states. [2019-05-15 10:30:08,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:08,549 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-05-15 10:30:08,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-05-15 10:30:08,549 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 46 [2019-05-15 10:30:08,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:30:08,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-05-15 10:30:08,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-05-15 10:30:08,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-05-15 10:30:08,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-05-15 10:30:08,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states and 49 transitions. [2019-05-15 10:30:08,598 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:30:08,599 INFO L225 Difference]: With dead ends: 48 [2019-05-15 10:30:08,599 INFO L226 Difference]: Without dead ends: 48 [2019-05-15 10:30:08,600 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-05-15 10:30:08,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-05-15 10:30:08,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-05-15 10:30:08,601 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:30:08,601 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 48 states. [2019-05-15 10:30:08,602 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2019-05-15 10:30:08,602 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2019-05-15 10:30:08,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:08,602 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-05-15 10:30:08,603 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-05-15 10:30:08,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:30:08,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:30:08,603 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2019-05-15 10:30:08,603 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2019-05-15 10:30:08,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:08,604 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-05-15 10:30:08,604 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-05-15 10:30:08,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:30:08,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:30:08,604 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:30:08,604 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:30:08,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-05-15 10:30:08,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-05-15 10:30:08,605 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-05-15 10:30:08,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:30:08,605 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-05-15 10:30:08,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-05-15 10:30:08,605 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-05-15 10:30:08,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-05-15 10:30:08,606 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:30:08,606 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1, 1] [2019-05-15 10:30:08,606 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:30:08,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:30:08,606 INFO L82 PathProgramCache]: Analyzing trace with hash 339571970, now seen corresponding path program 43 times [2019-05-15 10:30:08,607 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:30:08,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:30:08,620 WARN L254 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 45 conjunts are in the unsatisfiable core [2019-05-15 10:30:08,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:30:08,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:30:08,724 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:08,724 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,730 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:08,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:08,730 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:30:08,731 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:08,731 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_953|]. (= |#memory_int| (store |v_#memory_int_953| ULTIMATE.start_main_p1 0)) [2019-05-15 10:30:08,731 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:30:08,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:08,742 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,744 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:08,745 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,745 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:08,751 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:08,752 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_954|]. (let ((.cse0 (select |v_#memory_int_954| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_954| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 0))) [2019-05-15 10:30:08,752 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:30:08,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 16 treesize of output 11 [2019-05-15 10:30:08,763 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,765 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:08,765 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,765 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:08,772 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:08,773 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_955|]. (let ((.cse0 (select |v_#memory_int_955| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_955| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 1))) [2019-05-15 10:30:08,773 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:30:08,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 16 treesize of output 11 [2019-05-15 10:30:08,786 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,788 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:08,788 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,789 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:08,796 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:08,797 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_956|]. (let ((.cse0 (select |v_#memory_int_956| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_956| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 2))) [2019-05-15 10:30:08,797 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:30:08,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 16 treesize of output 11 [2019-05-15 10:30:08,810 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,812 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:08,812 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,812 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:08,819 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:08,820 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_957|]. (let ((.cse0 (select |v_#memory_int_957| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_957| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 3))) [2019-05-15 10:30:08,820 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:30:08,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 16 treesize of output 11 [2019-05-15 10:30:08,835 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,837 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:08,837 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,838 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:08,844 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:08,844 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_958|]. (let ((.cse0 (select |v_#memory_int_958| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_958| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 4 .cse0))) [2019-05-15 10:30:08,844 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:30:08,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:08,859 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,861 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:08,861 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,861 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:08,869 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:08,870 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_959|]. (let ((.cse0 (select |v_#memory_int_959| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_959| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 5 .cse0))) [2019-05-15 10:30:08,870 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:30:08,885 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:08,886 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,888 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:08,889 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,889 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:08,897 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:08,898 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_960|]. (let ((.cse0 (select |v_#memory_int_960| ULTIMATE.start_main_p1))) (and (= .cse0 6) (= |#memory_int| (store |v_#memory_int_960| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:08,898 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:30:08,912 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:08,913 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,915 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:08,915 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,915 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:08,924 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:08,924 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_961|]. (let ((.cse0 (select |v_#memory_int_961| ULTIMATE.start_main_p1))) (and (= 7 .cse0) (= (store |v_#memory_int_961| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:08,924 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:30:08,941 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:08,942 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,944 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:08,944 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,944 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:08,952 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:08,953 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_962|]. (let ((.cse0 (select |v_#memory_int_962| ULTIMATE.start_main_p1))) (and (= 8 .cse0) (= (store |v_#memory_int_962| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:08,953 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:30:08,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 16 treesize of output 11 [2019-05-15 10:30:08,972 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,975 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:08,975 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,975 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:08,982 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:08,983 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_963|]. (let ((.cse0 (select |v_#memory_int_963| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_963| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 9))) [2019-05-15 10:30:08,983 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:30:09,007 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:09,008 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,011 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:09,011 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,011 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:09,019 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:09,019 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_964|]. (let ((.cse0 (select |v_#memory_int_964| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_964| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 10))) [2019-05-15 10:30:09,019 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:30:09,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:09,040 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,042 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:09,043 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,043 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:09,050 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:09,051 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_965|]. (let ((.cse0 (select |v_#memory_int_965| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_965| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 11))) [2019-05-15 10:30:09,051 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:30:09,070 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:09,071 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,074 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:09,074 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,074 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:09,082 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:09,082 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_966|]. (let ((.cse0 (select |v_#memory_int_966| ULTIMATE.start_main_p1))) (and (= 12 .cse0) (= |#memory_int| (store |v_#memory_int_966| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:09,082 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:30:09,102 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:09,103 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,105 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:09,106 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,106 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:09,113 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:09,113 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_967|]. (let ((.cse0 (select |v_#memory_int_967| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_967| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 13))) [2019-05-15 10:30:09,113 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:30:09,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:09,136 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,138 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:09,138 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,138 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:09,146 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:09,147 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_968|]. (let ((.cse0 (select |v_#memory_int_968| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_968| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 14 .cse0))) [2019-05-15 10:30:09,147 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:30:09,169 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:09,170 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,173 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:09,173 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,173 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:09,181 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:09,181 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_969|]. (let ((.cse0 (select |v_#memory_int_969| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_969| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 15))) [2019-05-15 10:30:09,181 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:30:09,242 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:09,243 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,251 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:09,251 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,251 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:09,257 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:09,258 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_970|]. (let ((.cse0 (select |v_#memory_int_970| ULTIMATE.start_main_p1))) (and (= .cse0 16) (= (store |v_#memory_int_970| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:09,258 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:30:09,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:09,333 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,337 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:09,337 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,337 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:09,344 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:09,345 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_971|]. (let ((.cse0 (select |v_#memory_int_971| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_971| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 17))) [2019-05-15 10:30:09,345 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:30:09,462 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:09,465 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,469 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:09,469 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,469 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:09,475 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:09,476 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_972|]. (let ((.cse0 (select |v_#memory_int_972| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_972| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 18))) [2019-05-15 10:30:09,476 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:30:09,554 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:09,557 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,559 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:09,559 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,559 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:09,565 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:09,566 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_973|]. (let ((.cse0 (select |v_#memory_int_973| ULTIMATE.start_main_p1))) (and (= 19 .cse0) (= |#memory_int| (store |v_#memory_int_973| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:09,566 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:30:09,593 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:09,594 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,597 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:09,597 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,597 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:09,605 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:09,606 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_974|]. (let ((.cse0 (select |v_#memory_int_974| ULTIMATE.start_main_p1))) (and (= 20 .cse0) (= |#memory_int| (store |v_#memory_int_974| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:09,606 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:30:09,632 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:09,633 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,636 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:09,636 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,636 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:09,644 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:09,644 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_975|]. (let ((.cse0 (select |v_#memory_int_975| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_975| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 21 .cse0))) [2019-05-15 10:30:09,644 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:30:09,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:09,674 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,676 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:09,676 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,676 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:09,685 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:09,686 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_976|]. (let ((.cse0 (select |v_#memory_int_976| ULTIMATE.start_main_p1))) (and (= .cse0 22) (= |#memory_int| (store |v_#memory_int_976| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:09,686 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:30:09,713 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:09,714 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,716 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:09,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:09,716 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:09,725 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:09,725 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_977|]. (let ((.cse0 (select |v_#memory_int_977| ULTIMATE.start_main_p1))) (and (= .cse0 23) (= |#memory_int| (store |v_#memory_int_977| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:09,725 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:30:09,756 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:09,757 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,760 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:09,760 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,760 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:09,768 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:09,768 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_978|]. (let ((.cse0 (select |v_#memory_int_978| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_978| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 24 .cse0))) [2019-05-15 10:30:09,768 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:30:09,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 16 treesize of output 11 [2019-05-15 10:30:09,798 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,800 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:09,800 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,800 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:09,808 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:09,809 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_979|]. (let ((.cse0 (select |v_#memory_int_979| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_979| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 25))) [2019-05-15 10:30:09,809 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:30:09,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 16 treesize of output 11 [2019-05-15 10:30:09,840 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,842 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:09,842 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,842 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:09,850 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:09,851 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_980|]. (let ((.cse0 (select |v_#memory_int_980| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_980| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 26))) [2019-05-15 10:30:09,851 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:30:09,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 16 treesize of output 11 [2019-05-15 10:30:09,884 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,886 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:09,886 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,887 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:09,895 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:09,895 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_981|]. (let ((.cse0 (select |v_#memory_int_981| ULTIMATE.start_main_p1))) (and (= .cse0 27) (= (store |v_#memory_int_981| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:09,896 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:30:09,929 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:09,930 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,932 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:09,932 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,933 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:09,941 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:09,941 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_982|]. (let ((.cse0 (select |v_#memory_int_982| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_982| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 28))) [2019-05-15 10:30:09,941 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:30:09,973 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:09,974 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,976 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:09,976 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,977 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:09,983 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:09,984 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_983|]. (let ((.cse0 (select |v_#memory_int_983| ULTIMATE.start_main_p1))) (and (= 29 .cse0) (= |#memory_int| (store |v_#memory_int_983| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:09,984 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:30:10,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 16 treesize of output 11 [2019-05-15 10:30:10,019 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:10,021 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:10,022 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:10,022 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:10,031 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:10,031 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_984|]. (let ((.cse0 (select |v_#memory_int_984| ULTIMATE.start_main_p1))) (and (= .cse0 30) (= |#memory_int| (store |v_#memory_int_984| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:10,031 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:30:10,065 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:10,066 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:10,068 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:10,069 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:10,069 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:10,077 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:10,077 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_985|]. (let ((.cse0 (select |v_#memory_int_985| ULTIMATE.start_main_p1))) (and (= .cse0 31) (= (store |v_#memory_int_985| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:10,077 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:30:10,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 16 treesize of output 11 [2019-05-15 10:30:10,112 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:10,114 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:10,114 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:10,114 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:10,122 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:10,123 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_986|]. (let ((.cse0 (select |v_#memory_int_986| ULTIMATE.start_main_p1))) (and (= 32 .cse0) (= (store |v_#memory_int_986| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:10,123 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:30:10,160 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:10,161 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:10,164 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:10,164 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:10,164 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:10,170 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:10,170 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_987|]. (let ((.cse0 (select |v_#memory_int_987| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_987| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 33 .cse0))) [2019-05-15 10:30:10,171 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:30:10,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 16 treesize of output 11 [2019-05-15 10:30:10,210 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:10,212 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:10,213 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:10,213 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:10,223 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:10,224 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_988|]. (let ((.cse0 (select |v_#memory_int_988| ULTIMATE.start_main_p1))) (and (= 34 .cse0) (= (store |v_#memory_int_988| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:10,224 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:30:10,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 16 treesize of output 11 [2019-05-15 10:30:10,264 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:10,266 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:10,266 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:10,266 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:10,273 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:10,274 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_989|]. (let ((.cse0 (select |v_#memory_int_989| ULTIMATE.start_main_p1))) (and (= .cse0 35) (= |#memory_int| (store |v_#memory_int_989| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:10,274 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:30:10,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 16 treesize of output 11 [2019-05-15 10:30:10,313 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:10,316 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:10,316 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:10,316 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:10,325 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:10,325 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_990|]. (let ((.cse0 (select |v_#memory_int_990| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_990| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 36 .cse0))) [2019-05-15 10:30:10,325 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:30:10,366 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:10,367 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:10,370 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:10,370 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:10,370 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:10,379 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:10,379 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_991|]. (let ((.cse0 (select |v_#memory_int_991| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_991| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 37 .cse0))) [2019-05-15 10:30:10,379 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:30:10,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:10,422 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:10,424 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:10,425 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:10,425 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:10,433 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:10,433 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_992|]. (let ((.cse0 (select |v_#memory_int_992| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_992| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 38))) [2019-05-15 10:30:10,433 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:30:10,476 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:10,477 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:10,479 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:10,480 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:10,480 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:10,488 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:10,488 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_993|]. (let ((.cse0 (select |v_#memory_int_993| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_993| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 39 .cse0))) [2019-05-15 10:30:10,488 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:30:10,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 16 treesize of output 11 [2019-05-15 10:30:10,548 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:10,586 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:10,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:10,586 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:10,601 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:10,601 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_994|]. (let ((.cse0 (select |v_#memory_int_994| ULTIMATE.start_main_p1))) (and (= .cse0 40) (= |#memory_int| (store |v_#memory_int_994| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:10,601 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:30:11,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 16 treesize of output 11 [2019-05-15 10:30:11,663 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:11,690 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:11,690 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:11,691 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:11,704 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:11,705 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_995|]. (let ((.cse0 (select |v_#memory_int_995| ULTIMATE.start_main_p1))) (and (= 41 .cse0) (= (store |v_#memory_int_995| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:11,705 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:30:12,003 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:12,005 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:12,007 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:12,007 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,007 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:12,017 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:12,017 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_996|]. (let ((.cse0 (select |v_#memory_int_996| ULTIMATE.start_main_p1))) (and (= 42 .cse0) (= (store |v_#memory_int_996| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:12,017 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:30:12,054 INFO L273 TraceCheckUtils]: 0: Hoare triple {8872#true} havoc main_p1; {8872#true} is VALID [2019-05-15 10:30:12,054 INFO L273 TraceCheckUtils]: 1: Hoare triple {8872#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {8872#true} is VALID [2019-05-15 10:30:12,054 INFO L273 TraceCheckUtils]: 2: Hoare triple {8872#true} #memory_int := #memory_int[main_p1 := 0]; {8883#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:30:12,055 INFO L273 TraceCheckUtils]: 3: Hoare triple {8883#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8887#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:30:12,056 INFO L273 TraceCheckUtils]: 4: Hoare triple {8887#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8891#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:30:12,057 INFO L273 TraceCheckUtils]: 5: Hoare triple {8891#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8895#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:30:12,057 INFO L273 TraceCheckUtils]: 6: Hoare triple {8895#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8899#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:30:12,058 INFO L273 TraceCheckUtils]: 7: Hoare triple {8899#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8903#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:30:12,059 INFO L273 TraceCheckUtils]: 8: Hoare triple {8903#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8907#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:30:12,060 INFO L273 TraceCheckUtils]: 9: Hoare triple {8907#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8911#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:30:12,061 INFO L273 TraceCheckUtils]: 10: Hoare triple {8911#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8915#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:30:12,061 INFO L273 TraceCheckUtils]: 11: Hoare triple {8915#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8919#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:30:12,062 INFO L273 TraceCheckUtils]: 12: Hoare triple {8919#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8923#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:30:12,063 INFO L273 TraceCheckUtils]: 13: Hoare triple {8923#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8927#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:30:12,064 INFO L273 TraceCheckUtils]: 14: Hoare triple {8927#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8931#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:30:12,065 INFO L273 TraceCheckUtils]: 15: Hoare triple {8931#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8935#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:30:12,065 INFO L273 TraceCheckUtils]: 16: Hoare triple {8935#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8939#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:30:12,066 INFO L273 TraceCheckUtils]: 17: Hoare triple {8939#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8943#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:30:12,067 INFO L273 TraceCheckUtils]: 18: Hoare triple {8943#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8947#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:30:12,068 INFO L273 TraceCheckUtils]: 19: Hoare triple {8947#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8951#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:30:12,069 INFO L273 TraceCheckUtils]: 20: Hoare triple {8951#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8955#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:30:12,069 INFO L273 TraceCheckUtils]: 21: Hoare triple {8955#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8959#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:30:12,070 INFO L273 TraceCheckUtils]: 22: Hoare triple {8959#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8963#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:30:12,071 INFO L273 TraceCheckUtils]: 23: Hoare triple {8963#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8967#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:30:12,072 INFO L273 TraceCheckUtils]: 24: Hoare triple {8967#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8971#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:30:12,073 INFO L273 TraceCheckUtils]: 25: Hoare triple {8971#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8975#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:30:12,073 INFO L273 TraceCheckUtils]: 26: Hoare triple {8975#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8979#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:30:12,074 INFO L273 TraceCheckUtils]: 27: Hoare triple {8979#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8983#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:30:12,075 INFO L273 TraceCheckUtils]: 28: Hoare triple {8983#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8987#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:30:12,076 INFO L273 TraceCheckUtils]: 29: Hoare triple {8987#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8991#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:30:12,077 INFO L273 TraceCheckUtils]: 30: Hoare triple {8991#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8995#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:30:12,078 INFO L273 TraceCheckUtils]: 31: Hoare triple {8995#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8999#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:30:12,078 INFO L273 TraceCheckUtils]: 32: Hoare triple {8999#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9003#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:30:12,079 INFO L273 TraceCheckUtils]: 33: Hoare triple {9003#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9007#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:30:12,080 INFO L273 TraceCheckUtils]: 34: Hoare triple {9007#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9011#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:30:12,081 INFO L273 TraceCheckUtils]: 35: Hoare triple {9011#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9015#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:30:12,082 INFO L273 TraceCheckUtils]: 36: Hoare triple {9015#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9019#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:30:12,082 INFO L273 TraceCheckUtils]: 37: Hoare triple {9019#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9023#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:30:12,083 INFO L273 TraceCheckUtils]: 38: Hoare triple {9023#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9027#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:30:12,084 INFO L273 TraceCheckUtils]: 39: Hoare triple {9027#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9031#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:30:12,085 INFO L273 TraceCheckUtils]: 40: Hoare triple {9031#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9035#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:30:12,086 INFO L273 TraceCheckUtils]: 41: Hoare triple {9035#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9039#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:30:12,086 INFO L273 TraceCheckUtils]: 42: Hoare triple {9039#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9043#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:30:12,087 INFO L273 TraceCheckUtils]: 43: Hoare triple {9043#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9047#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:30:12,088 INFO L273 TraceCheckUtils]: 44: Hoare triple {9047#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9051#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:30:12,089 INFO L273 TraceCheckUtils]: 45: Hoare triple {9051#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9055#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:30:12,089 INFO L273 TraceCheckUtils]: 46: Hoare triple {9055#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} assume !(#memory_int[main_p1] >= 0); {8873#false} is VALID [2019-05-15 10:30:12,093 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:30:12,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:30:12,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-05-15 10:30:12,094 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 47 [2019-05-15 10:30:12,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:30:12,094 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states. [2019-05-15 10:30:12,134 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:30:12,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-05-15 10:30:12,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-05-15 10:30:12,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-05-15 10:30:12,135 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 46 states. [2019-05-15 10:30:16,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:16,550 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-05-15 10:30:16,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-05-15 10:30:16,550 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 47 [2019-05-15 10:30:16,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:30:16,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-05-15 10:30:16,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2019-05-15 10:30:16,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-05-15 10:30:16,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2019-05-15 10:30:16,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states and 50 transitions. [2019-05-15 10:30:16,594 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:16,595 INFO L225 Difference]: With dead ends: 49 [2019-05-15 10:30:16,595 INFO L226 Difference]: Without dead ends: 49 [2019-05-15 10:30:16,595 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-05-15 10:30:16,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-05-15 10:30:16,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-05-15 10:30:16,596 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:30:16,596 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 49 states. [2019-05-15 10:30:16,596 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2019-05-15 10:30:16,597 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2019-05-15 10:30:16,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:16,597 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-05-15 10:30:16,597 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-05-15 10:30:16,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:30:16,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:30:16,597 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2019-05-15 10:30:16,598 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2019-05-15 10:30:16,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:16,598 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-05-15 10:30:16,598 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-05-15 10:30:16,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:30:16,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:30:16,598 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:30:16,599 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:30:16,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-05-15 10:30:16,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-05-15 10:30:16,599 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-05-15 10:30:16,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:30:16,599 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-05-15 10:30:16,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-05-15 10:30:16,599 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-05-15 10:30:16,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-05-15 10:30:16,600 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:30:16,600 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1] [2019-05-15 10:30:16,600 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:30:16,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:30:16,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1936796424, now seen corresponding path program 44 times [2019-05-15 10:30:16,601 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:30:16,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:30:16,615 WARN L254 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 46 conjunts are in the unsatisfiable core [2019-05-15 10:30:16,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:30:16,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:30:16,662 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:16,662 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,666 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:16,666 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,666 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:30:16,669 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:16,669 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_997|]. (= |#memory_int| (store |v_#memory_int_997| ULTIMATE.start_main_p1 0)) [2019-05-15 10:30:16,669 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:30:16,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:16,681 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,683 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:16,684 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,684 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:16,692 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:16,692 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_998|]. (let ((.cse0 (select |v_#memory_int_998| ULTIMATE.start_main_p1))) (and (= .cse0 0) (= |#memory_int| (store |v_#memory_int_998| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:16,693 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:30:16,704 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:16,705 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,707 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:16,707 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,708 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:16,715 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:16,715 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_999|]. (let ((.cse0 (select |v_#memory_int_999| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_999| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 1))) [2019-05-15 10:30:16,715 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:30:16,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:16,728 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,730 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:16,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:16,731 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:16,739 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:16,739 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1000|]. (let ((.cse0 (select |v_#memory_int_1000| ULTIMATE.start_main_p1))) (and (= .cse0 2) (= (store |v_#memory_int_1000| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:16,739 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:30:16,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 16 treesize of output 11 [2019-05-15 10:30:16,753 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,755 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:16,756 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,756 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:16,764 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:16,764 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1001|]. (let ((.cse0 (select |v_#memory_int_1001| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1001| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 3))) [2019-05-15 10:30:16,765 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:30:16,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 16 treesize of output 11 [2019-05-15 10:30:16,778 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,781 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:16,781 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,781 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:16,789 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:16,789 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1002|]. (let ((.cse0 (select |v_#memory_int_1002| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1002| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 4))) [2019-05-15 10:30:16,789 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:30:16,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 16 treesize of output 11 [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,807 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:16,807 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,807 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:16,815 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:16,816 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1003|]. (let ((.cse0 (select |v_#memory_int_1003| ULTIMATE.start_main_p1))) (and (= 5 .cse0) (= (store |v_#memory_int_1003| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:16,816 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:30:16,830 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:16,831 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,833 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:16,833 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,833 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:16,841 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:16,841 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1004|]. (let ((.cse0 (select |v_#memory_int_1004| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1004| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 6 .cse0))) [2019-05-15 10:30:16,841 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:30:16,856 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:16,857 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,859 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:16,859 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,859 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:16,867 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:16,867 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1005|]. (let ((.cse0 (select |v_#memory_int_1005| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1005| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 7 .cse0))) [2019-05-15 10:30:16,867 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:30:16,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 16 treesize of output 11 [2019-05-15 10:30:16,884 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,886 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:16,887 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,887 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:16,896 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:16,897 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1006|]. (let ((.cse0 (select |v_#memory_int_1006| ULTIMATE.start_main_p1))) (and (= .cse0 8) (= (store |v_#memory_int_1006| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:16,897 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:30:16,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 16 treesize of output 11 [2019-05-15 10:30:16,914 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,916 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:16,917 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,917 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:16,924 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:16,924 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1007|]. (let ((.cse0 (select |v_#memory_int_1007| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1007| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 9))) [2019-05-15 10:30:16,924 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:30:16,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 16 treesize of output 11 [2019-05-15 10:30:16,943 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,946 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:16,946 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,946 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:16,954 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:16,954 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1008|]. (let ((.cse0 (select |v_#memory_int_1008| ULTIMATE.start_main_p1))) (and (= .cse0 10) (= |#memory_int| (store |v_#memory_int_1008| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:16,955 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:30:16,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 16 treesize of output 11 [2019-05-15 10:30:16,975 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,976 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:16,977 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,977 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:16,983 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:16,983 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1009|]. (let ((.cse0 (select |v_#memory_int_1009| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1009| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 11 .cse0))) [2019-05-15 10:30:16,983 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:30:17,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 16 treesize of output 11 [2019-05-15 10:30:17,003 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,007 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:17,007 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,007 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:17,013 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:17,013 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1010|]. (let ((.cse0 (select |v_#memory_int_1010| ULTIMATE.start_main_p1))) (and (= .cse0 12) (= (store |v_#memory_int_1010| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:17,013 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:30:17,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 16 treesize of output 11 [2019-05-15 10:30:17,035 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,037 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:17,038 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,038 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:17,045 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:17,046 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1011|]. (let ((.cse0 (select |v_#memory_int_1011| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1011| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 13))) [2019-05-15 10:30:17,046 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:30:17,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 16 treesize of output 11 [2019-05-15 10:30:17,067 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,069 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:17,070 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,070 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:17,077 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:17,077 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1012|]. (let ((.cse0 (select |v_#memory_int_1012| ULTIMATE.start_main_p1))) (and (= 14 .cse0) (= (store |v_#memory_int_1012| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:17,077 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:30:17,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 16 treesize of output 11 [2019-05-15 10:30:17,099 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,101 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:17,101 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,102 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:17,108 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:17,108 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1013|]. (let ((.cse0 (select |v_#memory_int_1013| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1013| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 15))) [2019-05-15 10:30:17,108 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:30:17,131 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:17,132 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,134 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:17,134 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,135 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:17,143 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:17,143 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1014|]. (let ((.cse0 (select |v_#memory_int_1014| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1014| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 16 .cse0))) [2019-05-15 10:30:17,143 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:30:17,167 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:17,168 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,171 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:17,171 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,171 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:17,178 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:17,178 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1015|]. (let ((.cse0 (select |v_#memory_int_1015| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1015| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 17))) [2019-05-15 10:30:17,178 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:30:17,205 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:17,206 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,209 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:17,209 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,209 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:17,217 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:17,218 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1016|]. (let ((.cse0 (select |v_#memory_int_1016| ULTIMATE.start_main_p1))) (and (= 18 .cse0) (= |#memory_int| (store |v_#memory_int_1016| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:17,218 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:30:17,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 16 treesize of output 11 [2019-05-15 10:30:17,246 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,248 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:17,249 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,249 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:17,257 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:17,257 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1017|]. (let ((.cse0 (select |v_#memory_int_1017| ULTIMATE.start_main_p1))) (and (= 19 .cse0) (= (store |v_#memory_int_1017| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:17,257 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:30:17,282 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:17,283 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,286 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:17,286 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,286 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:17,293 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:17,293 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1018|]. (let ((.cse0 (select |v_#memory_int_1018| ULTIMATE.start_main_p1))) (and (= .cse0 20) (= |#memory_int| (store |v_#memory_int_1018| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:17,293 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:30:17,320 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:17,321 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,323 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:17,324 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,324 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:17,331 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:17,331 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1019|]. (let ((.cse0 (select |v_#memory_int_1019| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1019| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 21 .cse0))) [2019-05-15 10:30:17,331 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:30:17,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 16 treesize of output 11 [2019-05-15 10:30:17,362 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,364 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:17,364 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,365 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:17,371 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:17,371 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1020|]. (let ((.cse0 (select |v_#memory_int_1020| ULTIMATE.start_main_p1))) (and (= 22 .cse0) (= (store |v_#memory_int_1020| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:17,372 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:30:17,402 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:17,403 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,405 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:17,406 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,406 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:17,414 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:17,414 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1021|]. (let ((.cse0 (select |v_#memory_int_1021| ULTIMATE.start_main_p1))) (and (= .cse0 23) (= (store |v_#memory_int_1021| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:17,414 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:30:17,444 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:17,462 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,500 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:17,500 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,501 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:17,516 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:17,517 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1022|]. (let ((.cse0 (select |v_#memory_int_1022| ULTIMATE.start_main_p1))) (and (= .cse0 24) (= (store |v_#memory_int_1022| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:17,517 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:30:17,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 16 treesize of output 11 [2019-05-15 10:30:17,585 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,587 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:17,588 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,588 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:17,595 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:17,596 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1023|]. (let ((.cse0 (select |v_#memory_int_1023| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1023| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 25 .cse0))) [2019-05-15 10:30:17,596 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:30:17,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:17,626 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,628 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:17,628 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,629 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:17,637 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:17,637 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1024|]. (let ((.cse0 (select |v_#memory_int_1024| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1024| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 26 .cse0))) [2019-05-15 10:30:17,637 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:30:17,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 16 treesize of output 11 [2019-05-15 10:30:17,670 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,673 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:17,673 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,673 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:17,679 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:17,680 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1025|]. (let ((.cse0 (select |v_#memory_int_1025| ULTIMATE.start_main_p1))) (and (= .cse0 27) (= |#memory_int| (store |v_#memory_int_1025| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:17,680 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:30:17,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 16 treesize of output 11 [2019-05-15 10:30:17,719 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,721 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:17,721 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,721 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:17,729 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:17,730 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1026|]. (let ((.cse0 (select |v_#memory_int_1026| ULTIMATE.start_main_p1))) (and (= .cse0 28) (= (store |v_#memory_int_1026| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:17,730 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:30:17,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 16 treesize of output 11 [2019-05-15 10:30:17,762 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,764 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:17,764 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,764 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:17,772 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:17,773 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1027|]. (let ((.cse0 (select |v_#memory_int_1027| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1027| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 29 .cse0))) [2019-05-15 10:30:17,773 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:30:17,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:17,806 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,809 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:17,809 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,809 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:17,815 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:17,816 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1028|]. (let ((.cse0 (select |v_#memory_int_1028| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1028| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 30))) [2019-05-15 10:30:17,816 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:30:17,849 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:17,850 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,852 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:17,853 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,853 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:17,862 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:17,863 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1029|]. (let ((.cse0 (select |v_#memory_int_1029| ULTIMATE.start_main_p1))) (and (= 31 .cse0) (= |#memory_int| (store |v_#memory_int_1029| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:17,863 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:30:17,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 16 treesize of output 11 [2019-05-15 10:30:17,901 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,903 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:17,904 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,904 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:17,912 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:17,912 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1030|]. (let ((.cse0 (select |v_#memory_int_1030| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1030| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 32))) [2019-05-15 10:30:17,912 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:30:17,948 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:17,950 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,952 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:17,952 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,952 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:17,960 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:17,960 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1031|]. (let ((.cse0 (select |v_#memory_int_1031| ULTIMATE.start_main_p1))) (and (= 33 .cse0) (= (store |v_#memory_int_1031| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:17,960 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:30:17,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:17,996 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,998 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:17,998 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:17,999 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:18,006 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:18,006 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1032|]. (let ((.cse0 (select |v_#memory_int_1032| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1032| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 34))) [2019-05-15 10:30:18,006 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:30:18,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:18,048 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:18,050 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:18,050 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:18,050 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:18,058 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:18,058 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1033|]. (let ((.cse0 (select |v_#memory_int_1033| ULTIMATE.start_main_p1))) (and (= 35 .cse0) (= (store |v_#memory_int_1033| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:18,059 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:30:18,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 16 treesize of output 11 [2019-05-15 10:30:18,099 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:18,102 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:18,102 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:18,102 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:18,110 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:18,110 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1034|]. (let ((.cse0 (select |v_#memory_int_1034| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1034| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 36 .cse0))) [2019-05-15 10:30:18,110 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:30:18,149 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:18,150 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:18,152 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:18,152 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:18,152 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:18,159 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:18,159 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1035|]. (let ((.cse0 (select |v_#memory_int_1035| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1035| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 37))) [2019-05-15 10:30:18,159 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:30:18,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 16 treesize of output 11 [2019-05-15 10:30:18,199 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:18,201 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:18,202 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:18,202 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:18,210 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:18,211 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1036|]. (let ((.cse0 (select |v_#memory_int_1036| ULTIMATE.start_main_p1))) (and (= .cse0 38) (= (store |v_#memory_int_1036| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:18,211 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:30:18,255 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:18,256 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:18,258 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:18,258 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:18,258 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:18,265 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:18,265 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1037|]. (let ((.cse0 (select |v_#memory_int_1037| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1037| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 39 .cse0))) [2019-05-15 10:30:18,265 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:30:18,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:18,307 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:18,309 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:18,309 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:18,309 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:18,318 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:18,318 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1038|]. (let ((.cse0 (select |v_#memory_int_1038| ULTIMATE.start_main_p1))) (and (= .cse0 40) (= |#memory_int| (store |v_#memory_int_1038| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:18,318 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:30:18,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:18,361 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:18,363 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:18,363 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:18,363 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:18,371 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:18,372 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1039|]. (let ((.cse0 (select |v_#memory_int_1039| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1039| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 41 .cse0))) [2019-05-15 10:30:18,372 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:30:18,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 16 treesize of output 11 [2019-05-15 10:30:18,415 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:18,418 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:18,418 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:18,418 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:18,426 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:18,426 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1040|]. (let ((.cse0 (select |v_#memory_int_1040| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1040| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 42 .cse0))) [2019-05-15 10:30:18,426 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:30:18,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 16 treesize of output 11 [2019-05-15 10:30:18,470 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:18,472 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:18,472 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:18,473 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:18,480 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:18,481 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1041|]. (let ((.cse0 (select |v_#memory_int_1041| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1041| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 43))) [2019-05-15 10:30:18,481 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:30:18,522 INFO L273 TraceCheckUtils]: 0: Hoare triple {9254#true} havoc main_p1; {9254#true} is VALID [2019-05-15 10:30:18,523 INFO L273 TraceCheckUtils]: 1: Hoare triple {9254#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {9254#true} is VALID [2019-05-15 10:30:18,524 INFO L273 TraceCheckUtils]: 2: Hoare triple {9254#true} #memory_int := #memory_int[main_p1 := 0]; {9265#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:30:18,525 INFO L273 TraceCheckUtils]: 3: Hoare triple {9265#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9269#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:30:18,526 INFO L273 TraceCheckUtils]: 4: Hoare triple {9269#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9273#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:30:18,526 INFO L273 TraceCheckUtils]: 5: Hoare triple {9273#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9277#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:30:18,527 INFO L273 TraceCheckUtils]: 6: Hoare triple {9277#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9281#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:30:18,528 INFO L273 TraceCheckUtils]: 7: Hoare triple {9281#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9285#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:30:18,529 INFO L273 TraceCheckUtils]: 8: Hoare triple {9285#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9289#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:30:18,530 INFO L273 TraceCheckUtils]: 9: Hoare triple {9289#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9293#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:30:18,530 INFO L273 TraceCheckUtils]: 10: Hoare triple {9293#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9297#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:30:18,531 INFO L273 TraceCheckUtils]: 11: Hoare triple {9297#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9301#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:30:18,532 INFO L273 TraceCheckUtils]: 12: Hoare triple {9301#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9305#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:30:18,533 INFO L273 TraceCheckUtils]: 13: Hoare triple {9305#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9309#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:30:18,534 INFO L273 TraceCheckUtils]: 14: Hoare triple {9309#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9313#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:30:18,535 INFO L273 TraceCheckUtils]: 15: Hoare triple {9313#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9317#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:30:18,535 INFO L273 TraceCheckUtils]: 16: Hoare triple {9317#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9321#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:30:18,536 INFO L273 TraceCheckUtils]: 17: Hoare triple {9321#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9325#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:30:18,537 INFO L273 TraceCheckUtils]: 18: Hoare triple {9325#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9329#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:30:18,538 INFO L273 TraceCheckUtils]: 19: Hoare triple {9329#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9333#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:30:18,539 INFO L273 TraceCheckUtils]: 20: Hoare triple {9333#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9337#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:30:18,539 INFO L273 TraceCheckUtils]: 21: Hoare triple {9337#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9341#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:30:18,540 INFO L273 TraceCheckUtils]: 22: Hoare triple {9341#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9345#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:30:18,541 INFO L273 TraceCheckUtils]: 23: Hoare triple {9345#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9349#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:30:18,542 INFO L273 TraceCheckUtils]: 24: Hoare triple {9349#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9353#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:30:18,543 INFO L273 TraceCheckUtils]: 25: Hoare triple {9353#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9357#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:30:18,544 INFO L273 TraceCheckUtils]: 26: Hoare triple {9357#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9361#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:30:18,544 INFO L273 TraceCheckUtils]: 27: Hoare triple {9361#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9365#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:30:18,545 INFO L273 TraceCheckUtils]: 28: Hoare triple {9365#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9369#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:30:18,546 INFO L273 TraceCheckUtils]: 29: Hoare triple {9369#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9373#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:30:18,547 INFO L273 TraceCheckUtils]: 30: Hoare triple {9373#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9377#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:30:18,548 INFO L273 TraceCheckUtils]: 31: Hoare triple {9377#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9381#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:30:18,548 INFO L273 TraceCheckUtils]: 32: Hoare triple {9381#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9385#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:30:18,549 INFO L273 TraceCheckUtils]: 33: Hoare triple {9385#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9389#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:30:18,550 INFO L273 TraceCheckUtils]: 34: Hoare triple {9389#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9393#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:30:18,551 INFO L273 TraceCheckUtils]: 35: Hoare triple {9393#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9397#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:30:18,552 INFO L273 TraceCheckUtils]: 36: Hoare triple {9397#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9401#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:30:18,553 INFO L273 TraceCheckUtils]: 37: Hoare triple {9401#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9405#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:30:18,553 INFO L273 TraceCheckUtils]: 38: Hoare triple {9405#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9409#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:30:18,554 INFO L273 TraceCheckUtils]: 39: Hoare triple {9409#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9413#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:30:18,555 INFO L273 TraceCheckUtils]: 40: Hoare triple {9413#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9417#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:30:18,556 INFO L273 TraceCheckUtils]: 41: Hoare triple {9417#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9421#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:30:18,557 INFO L273 TraceCheckUtils]: 42: Hoare triple {9421#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9425#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:30:18,558 INFO L273 TraceCheckUtils]: 43: Hoare triple {9425#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9429#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:30:18,558 INFO L273 TraceCheckUtils]: 44: Hoare triple {9429#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9433#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:30:18,559 INFO L273 TraceCheckUtils]: 45: Hoare triple {9433#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9437#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:30:18,560 INFO L273 TraceCheckUtils]: 46: Hoare triple {9437#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9441#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:30:18,561 INFO L273 TraceCheckUtils]: 47: Hoare triple {9441#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} assume !(#memory_int[main_p1] >= 0); {9255#false} is VALID [2019-05-15 10:30:18,565 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:30:18,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:30:18,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-05-15 10:30:18,565 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 48 [2019-05-15 10:30:18,566 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:30:18,566 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states. [2019-05-15 10:30:18,664 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:18,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-05-15 10:30:18,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-05-15 10:30:18,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-05-15 10:30:18,666 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 47 states. [2019-05-15 10:30:23,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:23,287 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-05-15 10:30:23,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-05-15 10:30:23,287 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 48 [2019-05-15 10:30:23,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:30:23,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-05-15 10:30:23,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-05-15 10:30:23,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-05-15 10:30:23,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-05-15 10:30:23,289 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states and 51 transitions. [2019-05-15 10:30:23,333 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:30:23,334 INFO L225 Difference]: With dead ends: 50 [2019-05-15 10:30:23,334 INFO L226 Difference]: Without dead ends: 50 [2019-05-15 10:30:23,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-05-15 10:30:23,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-05-15 10:30:23,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-05-15 10:30:23,335 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:30:23,336 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 50 states. [2019-05-15 10:30:23,336 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2019-05-15 10:30:23,336 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2019-05-15 10:30:23,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:23,336 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-05-15 10:30:23,336 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-05-15 10:30:23,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:30:23,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:30:23,337 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2019-05-15 10:30:23,337 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2019-05-15 10:30:23,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:23,337 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-05-15 10:30:23,337 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-05-15 10:30:23,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:30:23,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:30:23,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:30:23,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:30:23,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-05-15 10:30:23,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-05-15 10:30:23,338 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-05-15 10:30:23,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:30:23,339 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-05-15 10:30:23,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-05-15 10:30:23,339 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-05-15 10:30:23,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-05-15 10:30:23,339 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:30:23,339 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1, 1] [2019-05-15 10:30:23,339 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:30:23,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:30:23,339 INFO L82 PathProgramCache]: Analyzing trace with hash -88853054, now seen corresponding path program 45 times [2019-05-15 10:30:23,340 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:30:23,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:30:23,353 WARN L254 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 47 conjunts are in the unsatisfiable core [2019-05-15 10:30:23,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:30:23,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:30:23,386 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:23,387 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,388 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:23,388 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,389 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:30:23,391 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:23,391 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1042|]. (= (store |v_#memory_int_1042| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:30:23,391 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:30:23,462 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:23,463 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,464 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:23,465 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,465 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:23,473 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:23,473 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1043|]. (let ((.cse0 (select |v_#memory_int_1043| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1043| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 0))) [2019-05-15 10:30:23,473 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:30:23,485 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:23,486 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,488 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:23,488 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,489 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:23,496 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:23,496 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1044|]. (let ((.cse0 (select |v_#memory_int_1044| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1044| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 1))) [2019-05-15 10:30:23,496 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:30:23,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 16 treesize of output 11 [2019-05-15 10:30:23,508 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,510 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:23,511 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,511 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:23,519 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:23,519 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1045|]. (let ((.cse0 (select |v_#memory_int_1045| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1045| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 2 .cse0))) [2019-05-15 10:30:23,519 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:30:23,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 16 treesize of output 11 [2019-05-15 10:30:23,531 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,533 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:23,533 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,534 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:23,541 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:23,541 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1046|]. (let ((.cse0 (select |v_#memory_int_1046| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1046| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 3))) [2019-05-15 10:30:23,542 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:30:23,554 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:23,555 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,557 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:23,557 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,557 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:23,565 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:23,565 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1047|]. (let ((.cse0 (select |v_#memory_int_1047| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1047| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 4 .cse0))) [2019-05-15 10:30:23,565 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:30:23,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:23,580 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,583 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:23,583 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,583 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:23,590 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:23,590 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1048|]. (let ((.cse0 (select |v_#memory_int_1048| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1048| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 5))) [2019-05-15 10:30:23,590 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:30:23,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 16 treesize of output 11 [2019-05-15 10:30:23,605 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,607 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:23,607 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,608 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:23,614 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:23,614 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1049|]. (let ((.cse0 (select |v_#memory_int_1049| ULTIMATE.start_main_p1))) (and (= 6 .cse0) (= (store |v_#memory_int_1049| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:23,614 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:30: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 16 treesize of output 11 [2019-05-15 10:30:23,628 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,630 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:23,630 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,630 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:23,640 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:23,641 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1050|]. (let ((.cse0 (select |v_#memory_int_1050| ULTIMATE.start_main_p1))) (and (= .cse0 7) (= |#memory_int| (store |v_#memory_int_1050| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:23,641 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:30:23,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 16 treesize of output 11 [2019-05-15 10:30:23,657 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,659 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:23,659 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,659 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:23,667 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:23,667 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1051|]. (let ((.cse0 (select |v_#memory_int_1051| ULTIMATE.start_main_p1))) (and (= .cse0 8) (= (store |v_#memory_int_1051| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:23,667 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:30:23,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 16 treesize of output 11 [2019-05-15 10:30:23,684 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,686 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:23,687 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,687 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:23,694 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:23,695 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1052|]. (let ((.cse0 (select |v_#memory_int_1052| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1052| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 9))) [2019-05-15 10:30:23,695 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:30:23,713 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:23,714 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,716 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:23,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:23,717 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:23,725 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:23,725 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1053|]. (let ((.cse0 (select |v_#memory_int_1053| ULTIMATE.start_main_p1))) (and (= 10 .cse0) (= (store |v_#memory_int_1053| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:23,725 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:30:23,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 16 treesize of output 11 [2019-05-15 10:30:23,745 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,747 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:23,747 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,748 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:23,755 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:23,756 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1054|]. (let ((.cse0 (select |v_#memory_int_1054| ULTIMATE.start_main_p1))) (and (= .cse0 11) (= (store |v_#memory_int_1054| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:23,756 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:30:23,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 16 treesize of output 11 [2019-05-15 10:30:23,776 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,779 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:23,779 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,779 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:23,787 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:23,787 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1055|]. (let ((.cse0 (select |v_#memory_int_1055| ULTIMATE.start_main_p1))) (and (= .cse0 12) (= (store |v_#memory_int_1055| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:23,787 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:30:23,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 16 treesize of output 11 [2019-05-15 10:30:23,810 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,812 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:23,812 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,813 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:23,820 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:23,820 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1056|]. (let ((.cse0 (select |v_#memory_int_1056| ULTIMATE.start_main_p1))) (and (= 13 .cse0) (= (store |v_#memory_int_1056| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:23,820 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:30:23,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 16 treesize of output 11 [2019-05-15 10:30:23,843 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,845 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:23,846 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,846 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:23,853 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:23,853 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1057|]. (let ((.cse0 (select |v_#memory_int_1057| ULTIMATE.start_main_p1))) (and (= .cse0 14) (= |#memory_int| (store |v_#memory_int_1057| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:23,853 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:30:23,873 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:23,874 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,877 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:23,877 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,877 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:23,885 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:23,885 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1058|]. (let ((.cse0 (select |v_#memory_int_1058| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1058| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 15 .cse0))) [2019-05-15 10:30:23,885 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:30:23,907 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:23,908 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,911 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:23,911 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,911 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:23,920 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:23,920 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1059|]. (let ((.cse0 (select |v_#memory_int_1059| ULTIMATE.start_main_p1))) (and (= .cse0 16) (= (store |v_#memory_int_1059| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:23,920 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:30:23,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 16 treesize of output 11 [2019-05-15 10:30:23,946 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,948 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:23,948 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,948 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:23,956 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:23,956 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1060|]. (let ((.cse0 (select |v_#memory_int_1060| ULTIMATE.start_main_p1))) (and (= 17 .cse0) (= |#memory_int| (store |v_#memory_int_1060| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:23,956 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:30:23,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 16 treesize of output 11 [2019-05-15 10:30:23,980 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,982 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:23,983 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,983 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:23,990 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:23,990 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1061|]. (let ((.cse0 (select |v_#memory_int_1061| ULTIMATE.start_main_p1))) (and (= .cse0 18) (= (store |v_#memory_int_1061| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:23,990 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:30:24,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:24,014 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:24,017 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:24,017 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:24,017 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:24,024 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:24,024 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1062|]. (let ((.cse0 (select |v_#memory_int_1062| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1062| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 19))) [2019-05-15 10:30:24,024 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:30:24,049 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:24,050 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:24,053 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:24,053 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:24,053 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:24,061 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:24,061 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1063|]. (let ((.cse0 (select |v_#memory_int_1063| ULTIMATE.start_main_p1))) (and (= 20 .cse0) (= (store |v_#memory_int_1063| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:24,061 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:30:24,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 16 treesize of output 11 [2019-05-15 10:30:24,088 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:24,091 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:24,091 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:24,091 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:24,098 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:24,099 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1064|]. (let ((.cse0 (select |v_#memory_int_1064| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1064| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 21 .cse0))) [2019-05-15 10:30:24,099 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:30:24,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 16 treesize of output 11 [2019-05-15 10:30:24,130 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:24,131 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:24,132 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:24,132 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:24,137 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:24,138 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1065|]. (let ((.cse0 (select |v_#memory_int_1065| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1065| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 22 .cse0))) [2019-05-15 10:30:24,138 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:30:24,167 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:24,168 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:24,170 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:24,171 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:24,171 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:24,178 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:24,179 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1066|]. (let ((.cse0 (select |v_#memory_int_1066| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1066| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 23))) [2019-05-15 10:30:24,179 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:30:24,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:24,209 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:24,212 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:24,212 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:24,212 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:24,220 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:24,220 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1067|]. (let ((.cse0 (select |v_#memory_int_1067| ULTIMATE.start_main_p1))) (and (= .cse0 24) (= (store |v_#memory_int_1067| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:24,221 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:30:24,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 16 treesize of output 11 [2019-05-15 10:30:24,253 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:24,255 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:24,255 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:24,256 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:24,263 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:24,263 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1068|]. (let ((.cse0 (select |v_#memory_int_1068| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1068| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 25 .cse0))) [2019-05-15 10:30:24,263 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:30:24,294 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:24,295 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:24,297 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:24,297 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:24,298 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:24,305 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:24,306 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1069|]. (let ((.cse0 (select |v_#memory_int_1069| ULTIMATE.start_main_p1))) (and (= 26 .cse0) (= (store |v_#memory_int_1069| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:24,306 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:30:24,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 16 treesize of output 11 [2019-05-15 10:30:24,337 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:24,339 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:24,340 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:24,340 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:24,347 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:24,347 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1070|]. (let ((.cse0 (select |v_#memory_int_1070| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1070| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 27 .cse0))) [2019-05-15 10:30:24,348 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:30: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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:24,381 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:24,382 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:24,382 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:24,382 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:24,390 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:24,391 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1071|]. (let ((.cse0 (select |v_#memory_int_1071| ULTIMATE.start_main_p1))) (and (= 28 .cse0) (= |#memory_int| (store |v_#memory_int_1071| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:24,391 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:30:24,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 16 treesize of output 11 [2019-05-15 10:30:24,425 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:24,428 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:24,428 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:24,428 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:24,436 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:24,436 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1072|]. (let ((.cse0 (select |v_#memory_int_1072| ULTIMATE.start_main_p1))) (and (= 29 .cse0) (= |#memory_int| (store |v_#memory_int_1072| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:24,436 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:30:24,471 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:24,472 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:24,474 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:24,474 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:24,474 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:24,482 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:24,482 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1073|]. (let ((.cse0 (select |v_#memory_int_1073| ULTIMATE.start_main_p1))) (and (= .cse0 30) (= |#memory_int| (store |v_#memory_int_1073| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:24,482 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:30:24,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:24,516 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:24,519 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:24,519 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:24,519 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:24,528 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:24,528 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1074|]. (let ((.cse0 (select |v_#memory_int_1074| ULTIMATE.start_main_p1))) (and (= .cse0 31) (= (store |v_#memory_int_1074| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:24,528 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:30:24,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:24,587 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:24,591 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:24,591 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:24,591 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:24,597 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:24,598 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1075|]. (let ((.cse0 (select |v_#memory_int_1075| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1075| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 32))) [2019-05-15 10:30:24,598 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:30:24,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:24,768 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:24,771 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:24,771 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:24,771 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:24,779 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:24,780 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1076|]. (let ((.cse0 (select |v_#memory_int_1076| ULTIMATE.start_main_p1))) (and (= .cse0 33) (= (store |v_#memory_int_1076| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:24,780 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:30:24,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:24,901 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:24,903 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:24,903 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:24,903 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:24,911 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:24,912 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1077|]. (let ((.cse0 (select |v_#memory_int_1077| ULTIMATE.start_main_p1))) (and (= .cse0 34) (= (store |v_#memory_int_1077| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:24,912 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:30:24,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:24,948 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:24,950 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:24,950 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:24,950 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:24,958 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:24,958 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1078|]. (let ((.cse0 (select |v_#memory_int_1078| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1078| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 35 .cse0))) [2019-05-15 10:30:24,958 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:30:24,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 16 treesize of output 11 [2019-05-15 10:30:24,995 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:24,997 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:24,997 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:24,997 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:25,005 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:25,005 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1079|]. (let ((.cse0 (select |v_#memory_int_1079| ULTIMATE.start_main_p1))) (and (= 36 .cse0) (= (store |v_#memory_int_1079| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:25,005 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:30:25,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 16 treesize of output 11 [2019-05-15 10:30:25,046 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:25,047 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:25,047 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:25,048 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:25,056 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:25,056 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1080|]. (let ((.cse0 (select |v_#memory_int_1080| ULTIMATE.start_main_p1))) (and (= .cse0 37) (= (store |v_#memory_int_1080| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:25,056 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:30:25,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 16 treesize of output 11 [2019-05-15 10:30:25,097 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:25,099 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:25,100 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:25,100 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:25,108 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:25,108 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1081|]. (let ((.cse0 (select |v_#memory_int_1081| ULTIMATE.start_main_p1))) (and (= 38 .cse0) (= (store |v_#memory_int_1081| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:25,108 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:30:25,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:25,207 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:25,246 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:25,246 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:25,246 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:25,261 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:25,262 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1082|]. (let ((.cse0 (select |v_#memory_int_1082| ULTIMATE.start_main_p1))) (and (= .cse0 39) (= (store |v_#memory_int_1082| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:25,262 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:30:25,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:25,311 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:25,313 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:25,313 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:25,313 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:25,320 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:25,321 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1083|]. (let ((.cse0 (select |v_#memory_int_1083| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1083| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 40))) [2019-05-15 10:30:25,321 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:30:25,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 16 treesize of output 11 [2019-05-15 10:30:25,362 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:25,364 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:25,364 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:25,364 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:25,373 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:25,374 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1084|]. (let ((.cse0 (select |v_#memory_int_1084| ULTIMATE.start_main_p1))) (and (= 41 .cse0) (= (store |v_#memory_int_1084| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:25,374 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:30:25,415 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:25,416 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:25,418 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:25,418 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:25,419 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:25,427 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:25,427 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1085|]. (let ((.cse0 (select |v_#memory_int_1085| ULTIMATE.start_main_p1))) (and (= .cse0 42) (= (store |v_#memory_int_1085| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:25,427 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:30:25,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 16 treesize of output 11 [2019-05-15 10:30:25,470 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:25,472 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:25,472 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:25,472 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:25,480 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:25,480 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1086|]. (let ((.cse0 (select |v_#memory_int_1086| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1086| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 43))) [2019-05-15 10:30:25,480 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:30:25,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 16 treesize of output 11 [2019-05-15 10:30:25,528 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:25,530 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:25,530 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:25,530 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:25,537 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:25,538 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1087|]. (let ((.cse0 (select |v_#memory_int_1087| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1087| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 44))) [2019-05-15 10:30:25,538 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:30:25,576 INFO L273 TraceCheckUtils]: 0: Hoare triple {9644#true} havoc main_p1; {9644#true} is VALID [2019-05-15 10:30:25,577 INFO L273 TraceCheckUtils]: 1: Hoare triple {9644#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {9644#true} is VALID [2019-05-15 10:30:25,577 INFO L273 TraceCheckUtils]: 2: Hoare triple {9644#true} #memory_int := #memory_int[main_p1 := 0]; {9655#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:30:25,578 INFO L273 TraceCheckUtils]: 3: Hoare triple {9655#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9659#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:30:25,579 INFO L273 TraceCheckUtils]: 4: Hoare triple {9659#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9663#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:30:25,580 INFO L273 TraceCheckUtils]: 5: Hoare triple {9663#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9667#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:30:25,581 INFO L273 TraceCheckUtils]: 6: Hoare triple {9667#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9671#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:30:25,581 INFO L273 TraceCheckUtils]: 7: Hoare triple {9671#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9675#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:30:25,582 INFO L273 TraceCheckUtils]: 8: Hoare triple {9675#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9679#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:30:25,583 INFO L273 TraceCheckUtils]: 9: Hoare triple {9679#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9683#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:30:25,584 INFO L273 TraceCheckUtils]: 10: Hoare triple {9683#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9687#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:30:25,584 INFO L273 TraceCheckUtils]: 11: Hoare triple {9687#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9691#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:30:25,585 INFO L273 TraceCheckUtils]: 12: Hoare triple {9691#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9695#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:30:25,586 INFO L273 TraceCheckUtils]: 13: Hoare triple {9695#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9699#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:30:25,587 INFO L273 TraceCheckUtils]: 14: Hoare triple {9699#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9703#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:30:25,587 INFO L273 TraceCheckUtils]: 15: Hoare triple {9703#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9707#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:30:25,588 INFO L273 TraceCheckUtils]: 16: Hoare triple {9707#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9711#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:30:25,589 INFO L273 TraceCheckUtils]: 17: Hoare triple {9711#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9715#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:30:25,590 INFO L273 TraceCheckUtils]: 18: Hoare triple {9715#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9719#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:30:25,590 INFO L273 TraceCheckUtils]: 19: Hoare triple {9719#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9723#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:30:25,591 INFO L273 TraceCheckUtils]: 20: Hoare triple {9723#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9727#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:30:25,592 INFO L273 TraceCheckUtils]: 21: Hoare triple {9727#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9731#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:30:25,593 INFO L273 TraceCheckUtils]: 22: Hoare triple {9731#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9735#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:30:25,593 INFO L273 TraceCheckUtils]: 23: Hoare triple {9735#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9739#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:30:25,594 INFO L273 TraceCheckUtils]: 24: Hoare triple {9739#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9743#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:30:25,595 INFO L273 TraceCheckUtils]: 25: Hoare triple {9743#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9747#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:30:25,596 INFO L273 TraceCheckUtils]: 26: Hoare triple {9747#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9751#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:30:25,596 INFO L273 TraceCheckUtils]: 27: Hoare triple {9751#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9755#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:30:25,597 INFO L273 TraceCheckUtils]: 28: Hoare triple {9755#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9759#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:30:25,598 INFO L273 TraceCheckUtils]: 29: Hoare triple {9759#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9763#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:30:25,599 INFO L273 TraceCheckUtils]: 30: Hoare triple {9763#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9767#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:30:25,599 INFO L273 TraceCheckUtils]: 31: Hoare triple {9767#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9771#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:30:25,600 INFO L273 TraceCheckUtils]: 32: Hoare triple {9771#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9775#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:30:25,601 INFO L273 TraceCheckUtils]: 33: Hoare triple {9775#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9779#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:30:25,602 INFO L273 TraceCheckUtils]: 34: Hoare triple {9779#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9783#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:30:25,602 INFO L273 TraceCheckUtils]: 35: Hoare triple {9783#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9787#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:30:25,603 INFO L273 TraceCheckUtils]: 36: Hoare triple {9787#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9791#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:30:25,604 INFO L273 TraceCheckUtils]: 37: Hoare triple {9791#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9795#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:30:25,605 INFO L273 TraceCheckUtils]: 38: Hoare triple {9795#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9799#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:30:25,605 INFO L273 TraceCheckUtils]: 39: Hoare triple {9799#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9803#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:30:25,606 INFO L273 TraceCheckUtils]: 40: Hoare triple {9803#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9807#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:30:25,607 INFO L273 TraceCheckUtils]: 41: Hoare triple {9807#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9811#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:30:25,608 INFO L273 TraceCheckUtils]: 42: Hoare triple {9811#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9815#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:30:25,608 INFO L273 TraceCheckUtils]: 43: Hoare triple {9815#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9819#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:30:25,609 INFO L273 TraceCheckUtils]: 44: Hoare triple {9819#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9823#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:30:25,610 INFO L273 TraceCheckUtils]: 45: Hoare triple {9823#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9827#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:30:25,611 INFO L273 TraceCheckUtils]: 46: Hoare triple {9827#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9831#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:30:25,612 INFO L273 TraceCheckUtils]: 47: Hoare triple {9831#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9835#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:30:25,612 INFO L273 TraceCheckUtils]: 48: Hoare triple {9835#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} assume !(#memory_int[main_p1] >= 0); {9645#false} is VALID [2019-05-15 10:30:25,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:30:25,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:30:25,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-05-15 10:30:25,618 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 49 [2019-05-15 10:30:25,618 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:30:25,618 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2019-05-15 10:30:25,657 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:30:25,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-05-15 10:30:25,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-05-15 10:30:25,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-05-15 10:30:25,658 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 48 states. [2019-05-15 10:30:30,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:30,502 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-05-15 10:30:30,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-05-15 10:30:30,503 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 49 [2019-05-15 10:30:30,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:30:30,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-05-15 10:30:30,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-05-15 10:30:30,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-05-15 10:30:30,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-05-15 10:30:30,505 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 52 transitions. [2019-05-15 10:30:30,573 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:30,574 INFO L225 Difference]: With dead ends: 51 [2019-05-15 10:30:30,575 INFO L226 Difference]: Without dead ends: 51 [2019-05-15 10:30:30,575 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-05-15 10:30:30,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-05-15 10:30:30,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-05-15 10:30:30,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:30:30,577 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 51 states. [2019-05-15 10:30:30,577 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2019-05-15 10:30:30,577 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2019-05-15 10:30:30,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:30,578 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-05-15 10:30:30,578 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-05-15 10:30:30,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:30:30,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:30:30,579 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2019-05-15 10:30:30,579 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2019-05-15 10:30:30,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:30,580 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-05-15 10:30:30,580 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-05-15 10:30:30,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:30:30,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:30:30,581 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:30:30,581 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:30:30,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-05-15 10:30:30,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-05-15 10:30:30,582 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-05-15 10:30:30,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:30:30,582 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-05-15 10:30:30,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-05-15 10:30:30,582 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-05-15 10:30:30,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-05-15 10:30:30,583 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:30:30,583 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1, 1] [2019-05-15 10:30:30,583 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:30:30,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:30:30,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1540522568, now seen corresponding path program 46 times [2019-05-15 10:30:30,584 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:30:30,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:30:30,605 WARN L254 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 48 conjunts are in the unsatisfiable core [2019-05-15 10:30:30,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:30:30,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:30:30,763 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:30,764 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,770 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:30,770 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,771 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:30:30,773 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:30,773 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1088|]. (= (store |v_#memory_int_1088| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:30:30,774 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:30:30,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 16 treesize of output 11 [2019-05-15 10:30:30,789 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,791 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:30,791 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,791 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:30,801 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:30,802 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1089|]. (let ((.cse0 (select |v_#memory_int_1089| ULTIMATE.start_main_p1))) (and (= 0 .cse0) (= (store |v_#memory_int_1089| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:30,802 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:30:30,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 16 treesize of output 11 [2019-05-15 10:30:30,819 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,821 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:30,821 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,821 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:30,832 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:30,832 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1090|]. (let ((.cse0 (select |v_#memory_int_1090| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1090| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 1 .cse0))) [2019-05-15 10:30:30,832 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:30:30,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:30,849 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,852 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:30,853 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,853 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:30,862 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:30,862 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1091|]. (let ((.cse0 (select |v_#memory_int_1091| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1091| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 2))) [2019-05-15 10:30:30,862 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:30:30,878 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:30,880 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,882 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:30,883 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,883 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:30,892 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:30,892 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1092|]. (let ((.cse0 (select |v_#memory_int_1092| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1092| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 3))) [2019-05-15 10:30:30,892 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:30:30,909 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:30,911 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,914 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:30,914 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,914 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:30,923 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:30,924 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1093|]. (let ((.cse0 (select |v_#memory_int_1093| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1093| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 4 .cse0))) [2019-05-15 10:30:30,924 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:30:30,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 16 treesize of output 11 [2019-05-15 10:30:30,945 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,948 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:30,948 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,948 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:30,958 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_#memory_int_1094|]. (let ((.cse0 (select |v_#memory_int_1094| ULTIMATE.start_main_p1))) (and (= 5 .cse0) (= (store |v_#memory_int_1094| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:30,959 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:30:30,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:30,980 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,983 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:30,984 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,984 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:30,996 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:30,996 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1095|]. (let ((.cse0 (select |v_#memory_int_1095| ULTIMATE.start_main_p1))) (and (= 6 .cse0) (= (store |v_#memory_int_1095| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:30,996 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:30:31,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 16 treesize of output 11 [2019-05-15 10:30:31,020 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:31,022 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:31,023 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:31,023 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:31,033 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:31,034 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1096|]. (let ((.cse0 (select |v_#memory_int_1096| ULTIMATE.start_main_p1))) (and (= 7 .cse0) (= |#memory_int| (store |v_#memory_int_1096| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:31,034 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:30:31,053 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:31,055 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:31,058 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:31,058 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:31,058 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:31,068 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:31,069 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1097|]. (let ((.cse0 (select |v_#memory_int_1097| ULTIMATE.start_main_p1))) (and (= .cse0 8) (= (store |v_#memory_int_1097| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:31,069 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:30:31,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:31,091 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:31,094 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:31,095 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:31,095 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:31,104 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:31,105 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1098|]. (let ((.cse0 (select |v_#memory_int_1098| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1098| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 9))) [2019-05-15 10:30:31,105 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:30:31,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 16 treesize of output 11 [2019-05-15 10:30:31,133 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:31,135 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:31,136 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:31,136 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:31,147 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:31,147 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1099|]. (let ((.cse0 (select |v_#memory_int_1099| ULTIMATE.start_main_p1))) (and (= 10 .cse0) (= (store |v_#memory_int_1099| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:31,147 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:30:31,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:31,173 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:31,176 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:31,176 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:31,176 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:31,186 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:31,186 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1100|]. (let ((.cse0 (select |v_#memory_int_1100| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1100| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 11 .cse0))) [2019-05-15 10:30:31,186 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:30:31,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 16 treesize of output 11 [2019-05-15 10:30:31,217 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:31,220 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:31,220 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:31,220 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:31,227 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:31,228 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1101|]. (let ((.cse0 (select |v_#memory_int_1101| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1101| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 12))) [2019-05-15 10:30:31,228 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:30:31,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 16 treesize of output 11 [2019-05-15 10:30:31,256 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:31,259 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:31,259 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:31,260 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:31,269 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:31,270 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1102|]. (let ((.cse0 (select |v_#memory_int_1102| ULTIMATE.start_main_p1))) (and (= 13 .cse0) (= (store |v_#memory_int_1102| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:31,270 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:30:31,296 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:31,298 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:31,301 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:31,302 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:31,302 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:31,311 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:31,311 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1103|]. (let ((.cse0 (select |v_#memory_int_1103| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1103| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 14))) [2019-05-15 10:30:31,311 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:30:31,341 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:31,343 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:31,346 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:31,347 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:31,347 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:31,357 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:31,358 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1104|]. (let ((.cse0 (select |v_#memory_int_1104| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1104| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 15))) [2019-05-15 10:30:31,358 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:30:31,389 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:31,391 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:31,394 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:31,395 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:31,395 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:31,405 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:31,405 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1105|]. (let ((.cse0 (select |v_#memory_int_1105| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1105| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 16))) [2019-05-15 10:30:31,406 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:30:31,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:31,440 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:31,443 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:31,444 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:31,444 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:31,454 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:31,455 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1106|]. (let ((.cse0 (select |v_#memory_int_1106| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1106| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 17 .cse0))) [2019-05-15 10:30:31,455 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:30: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 16 treesize of output 11 [2019-05-15 10:30:31,488 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:31,491 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:31,492 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:31,492 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:31,501 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:31,501 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1107|]. (let ((.cse0 (select |v_#memory_int_1107| ULTIMATE.start_main_p1))) (and (= 18 .cse0) (= (store |v_#memory_int_1107| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:31,502 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:30:31,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:31,538 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:31,542 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:31,542 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:31,542 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:31,551 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:31,552 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1108|]. (let ((.cse0 (select |v_#memory_int_1108| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1108| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 19 .cse0))) [2019-05-15 10:30:31,552 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:30:31,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 16 treesize of output 11 [2019-05-15 10:30:31,589 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:31,592 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:31,593 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:31,593 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:31,603 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:31,604 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1109|]. (let ((.cse0 (select |v_#memory_int_1109| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1109| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 20 .cse0))) [2019-05-15 10:30:31,604 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:30:31,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:31,643 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:31,646 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:31,647 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:31,647 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:31,657 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:31,658 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1110|]. (let ((.cse0 (select |v_#memory_int_1110| ULTIMATE.start_main_p1))) (and (= .cse0 21) (= (store |v_#memory_int_1110| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:31,658 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:30:31,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:31,697 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:31,700 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:31,701 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:31,701 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:31,711 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:31,711 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1111|]. (let ((.cse0 (select |v_#memory_int_1111| ULTIMATE.start_main_p1))) (and (= .cse0 22) (= (store |v_#memory_int_1111| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:31,711 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:30:31,750 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:31,752 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:31,755 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:31,756 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:31,756 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:31,765 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:31,765 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1112|]. (let ((.cse0 (select |v_#memory_int_1112| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1112| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 23 .cse0))) [2019-05-15 10:30:31,765 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:30:31,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 16 treesize of output 11 [2019-05-15 10:30:31,807 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:31,810 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:31,810 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:31,811 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:31,833 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:31,834 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1113|]. (let ((.cse0 (select |v_#memory_int_1113| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1113| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 24 .cse0))) [2019-05-15 10:30:31,834 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:30:31,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 16 treesize of output 11 [2019-05-15 10:30:31,923 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:31,926 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:31,926 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:31,927 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:31,935 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:31,936 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1114|]. (let ((.cse0 (select |v_#memory_int_1114| ULTIMATE.start_main_p1))) (and (= 25 .cse0) (= |#memory_int| (store |v_#memory_int_1114| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:31,936 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:30:31,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:31,978 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:31,995 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:31,995 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:31,995 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:32,004 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:32,005 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1115|]. (let ((.cse0 (select |v_#memory_int_1115| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1115| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 26))) [2019-05-15 10:30:32,005 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:30:32,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 16 treesize of output 11 [2019-05-15 10:30:32,046 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:32,050 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:32,051 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:32,051 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:32,061 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:32,061 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1116|]. (let ((.cse0 (select |v_#memory_int_1116| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1116| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 27))) [2019-05-15 10:30:32,061 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:30:32,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 16 treesize of output 11 [2019-05-15 10:30:32,105 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:32,109 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:32,109 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:32,109 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:32,119 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:32,120 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1117|]. (let ((.cse0 (select |v_#memory_int_1117| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1117| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 28 .cse0))) [2019-05-15 10:30:32,120 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:30:32,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 16 treesize of output 11 [2019-05-15 10:30:32,277 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:32,315 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:32,316 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:32,316 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:32,330 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:32,330 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1118|]. (let ((.cse0 (select |v_#memory_int_1118| ULTIMATE.start_main_p1))) (and (= 29 .cse0) (= (store |v_#memory_int_1118| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:32,331 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:30:32,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 16 treesize of output 11 [2019-05-15 10:30:32,462 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:32,466 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:32,466 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:32,466 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:32,476 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:32,477 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1119|]. (let ((.cse0 (select |v_#memory_int_1119| ULTIMATE.start_main_p1))) (and (= .cse0 30) (= (store |v_#memory_int_1119| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:32,477 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:30:32,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 16 treesize of output 11 [2019-05-15 10:30:32,527 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:32,531 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:32,531 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:32,532 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:32,543 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:32,543 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1120|]. (let ((.cse0 (select |v_#memory_int_1120| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1120| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 31))) [2019-05-15 10:30:32,543 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:30:32,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 16 treesize of output 11 [2019-05-15 10:30:32,590 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:32,593 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:32,594 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:32,594 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:32,604 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:32,605 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1121|]. (let ((.cse0 (select |v_#memory_int_1121| ULTIMATE.start_main_p1))) (and (= .cse0 32) (= (store |v_#memory_int_1121| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:32,605 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:30:32,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:32,655 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:32,658 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:32,659 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:32,659 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:32,669 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:32,670 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1122|]. (let ((.cse0 (select |v_#memory_int_1122| ULTIMATE.start_main_p1))) (and (= .cse0 33) (= |#memory_int| (store |v_#memory_int_1122| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:32,670 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:30:32,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 16 treesize of output 11 [2019-05-15 10:30:32,720 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:32,723 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:32,724 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:32,725 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:32,735 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:32,735 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1123|]. (let ((.cse0 (select |v_#memory_int_1123| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1123| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 34))) [2019-05-15 10:30:32,735 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:30:32,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 16 treesize of output 11 [2019-05-15 10:30:32,794 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:32,798 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:32,798 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:32,798 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:32,808 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:32,809 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1124|]. (let ((.cse0 (select |v_#memory_int_1124| ULTIMATE.start_main_p1))) (and (= .cse0 35) (= |#memory_int| (store |v_#memory_int_1124| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:32,809 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:30:32,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:32,867 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:32,869 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:32,870 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:32,871 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:32,881 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:32,881 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1125|]. (let ((.cse0 (select |v_#memory_int_1125| ULTIMATE.start_main_p1))) (and (= 36 .cse0) (= (store |v_#memory_int_1125| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:32,882 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:30:32,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:32,939 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:32,943 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:32,943 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:32,943 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:32,955 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:32,955 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1126|]. (let ((.cse0 (select |v_#memory_int_1126| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1126| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 37))) [2019-05-15 10:30:32,955 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:30:33,007 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:33,009 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:33,013 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:33,014 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:33,014 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:33,035 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:33,036 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1127|]. (let ((.cse0 (select |v_#memory_int_1127| ULTIMATE.start_main_p1))) (and (= .cse0 38) (= (store |v_#memory_int_1127| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:33,036 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:30:33,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:33,090 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:33,092 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:33,092 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:33,093 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:33,101 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:33,102 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1128|]. (let ((.cse0 (select |v_#memory_int_1128| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1128| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 39))) [2019-05-15 10:30:33,102 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:30:33,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 16 treesize of output 11 [2019-05-15 10:30:33,156 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:33,160 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:33,160 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:33,160 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:33,171 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:33,172 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1129|]. (let ((.cse0 (select |v_#memory_int_1129| ULTIMATE.start_main_p1))) (and (= .cse0 40) (= (store |v_#memory_int_1129| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:33,172 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:30:33,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 16 treesize of output 11 [2019-05-15 10:30:33,225 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:33,227 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:33,228 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:33,228 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:33,238 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:33,238 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1130|]. (let ((.cse0 (select |v_#memory_int_1130| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1130| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 41))) [2019-05-15 10:30:33,238 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:30:33,292 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:33,293 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:33,297 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:33,297 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:33,297 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:33,307 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:33,307 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1131|]. (let ((.cse0 (select |v_#memory_int_1131| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1131| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 42))) [2019-05-15 10:30:33,307 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:30:33,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 16 treesize of output 11 [2019-05-15 10:30:33,362 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:33,365 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:33,366 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:33,366 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:33,374 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:33,375 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1132|]. (let ((.cse0 (select |v_#memory_int_1132| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1132| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 43))) [2019-05-15 10:30:33,375 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:30:33,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 16 treesize of output 11 [2019-05-15 10:30:33,466 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:33,474 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:33,474 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:33,475 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:33,482 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:33,483 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1133|]. (let ((.cse0 (select |v_#memory_int_1133| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1133| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 44 .cse0))) [2019-05-15 10:30:33,483 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:30:33,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:33,539 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:33,543 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:33,543 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:33,543 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:33,553 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:33,553 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1134|]. (let ((.cse0 (select |v_#memory_int_1134| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1134| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 45))) [2019-05-15 10:30:33,553 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:30:33,604 INFO L273 TraceCheckUtils]: 0: Hoare triple {10042#true} havoc main_p1; {10042#true} is VALID [2019-05-15 10:30:33,605 INFO L273 TraceCheckUtils]: 1: Hoare triple {10042#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {10042#true} is VALID [2019-05-15 10:30:33,605 INFO L273 TraceCheckUtils]: 2: Hoare triple {10042#true} #memory_int := #memory_int[main_p1 := 0]; {10053#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:30:33,607 INFO L273 TraceCheckUtils]: 3: Hoare triple {10053#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10057#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:30:33,607 INFO L273 TraceCheckUtils]: 4: Hoare triple {10057#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10061#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:30:33,608 INFO L273 TraceCheckUtils]: 5: Hoare triple {10061#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10065#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:30:33,609 INFO L273 TraceCheckUtils]: 6: Hoare triple {10065#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10069#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:30:33,610 INFO L273 TraceCheckUtils]: 7: Hoare triple {10069#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10073#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:30:33,612 INFO L273 TraceCheckUtils]: 8: Hoare triple {10073#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10077#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:30:33,613 INFO L273 TraceCheckUtils]: 9: Hoare triple {10077#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10081#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:30:33,614 INFO L273 TraceCheckUtils]: 10: Hoare triple {10081#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10085#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:30:33,615 INFO L273 TraceCheckUtils]: 11: Hoare triple {10085#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10089#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:30:33,616 INFO L273 TraceCheckUtils]: 12: Hoare triple {10089#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10093#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:30:33,618 INFO L273 TraceCheckUtils]: 13: Hoare triple {10093#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10097#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:30:33,618 INFO L273 TraceCheckUtils]: 14: Hoare triple {10097#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10101#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:30:33,620 INFO L273 TraceCheckUtils]: 15: Hoare triple {10101#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10105#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:30:33,621 INFO L273 TraceCheckUtils]: 16: Hoare triple {10105#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10109#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:30:33,622 INFO L273 TraceCheckUtils]: 17: Hoare triple {10109#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10113#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:30:33,623 INFO L273 TraceCheckUtils]: 18: Hoare triple {10113#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10117#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:30:33,624 INFO L273 TraceCheckUtils]: 19: Hoare triple {10117#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10121#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:30:33,626 INFO L273 TraceCheckUtils]: 20: Hoare triple {10121#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10125#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:30:33,627 INFO L273 TraceCheckUtils]: 21: Hoare triple {10125#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10129#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:30:33,629 INFO L273 TraceCheckUtils]: 22: Hoare triple {10129#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10133#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:30:33,629 INFO L273 TraceCheckUtils]: 23: Hoare triple {10133#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10137#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:30:33,630 INFO L273 TraceCheckUtils]: 24: Hoare triple {10137#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10141#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:30:33,631 INFO L273 TraceCheckUtils]: 25: Hoare triple {10141#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10145#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:30:33,632 INFO L273 TraceCheckUtils]: 26: Hoare triple {10145#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10149#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:30:33,633 INFO L273 TraceCheckUtils]: 27: Hoare triple {10149#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10153#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:30:33,635 INFO L273 TraceCheckUtils]: 28: Hoare triple {10153#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10157#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:30:33,636 INFO L273 TraceCheckUtils]: 29: Hoare triple {10157#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10161#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:30:33,637 INFO L273 TraceCheckUtils]: 30: Hoare triple {10161#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10165#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:30:33,638 INFO L273 TraceCheckUtils]: 31: Hoare triple {10165#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10169#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:30:33,640 INFO L273 TraceCheckUtils]: 32: Hoare triple {10169#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10173#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:30:33,641 INFO L273 TraceCheckUtils]: 33: Hoare triple {10173#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10177#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:30:33,642 INFO L273 TraceCheckUtils]: 34: Hoare triple {10177#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10181#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:30:33,643 INFO L273 TraceCheckUtils]: 35: Hoare triple {10181#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10185#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:30:33,645 INFO L273 TraceCheckUtils]: 36: Hoare triple {10185#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10189#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:30:33,646 INFO L273 TraceCheckUtils]: 37: Hoare triple {10189#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10193#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:30:33,647 INFO L273 TraceCheckUtils]: 38: Hoare triple {10193#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10197#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:30:33,648 INFO L273 TraceCheckUtils]: 39: Hoare triple {10197#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10201#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:30:33,650 INFO L273 TraceCheckUtils]: 40: Hoare triple {10201#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10205#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:30:33,651 INFO L273 TraceCheckUtils]: 41: Hoare triple {10205#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10209#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:30:33,652 INFO L273 TraceCheckUtils]: 42: Hoare triple {10209#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10213#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:30:33,653 INFO L273 TraceCheckUtils]: 43: Hoare triple {10213#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10217#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:30:33,655 INFO L273 TraceCheckUtils]: 44: Hoare triple {10217#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10221#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:30:33,656 INFO L273 TraceCheckUtils]: 45: Hoare triple {10221#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10225#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:30:33,657 INFO L273 TraceCheckUtils]: 46: Hoare triple {10225#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10229#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:30:33,658 INFO L273 TraceCheckUtils]: 47: Hoare triple {10229#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10233#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:30:33,659 INFO L273 TraceCheckUtils]: 48: Hoare triple {10233#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10237#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:30:33,661 INFO L273 TraceCheckUtils]: 49: Hoare triple {10237#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} assume !(#memory_int[main_p1] >= 0); {10043#false} is VALID [2019-05-15 10:30:33,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:30:33,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:30:33,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-05-15 10:30:33,667 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 50 [2019-05-15 10:30:33,667 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:30:33,667 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states. [2019-05-15 10:30:33,721 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:33,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-05-15 10:30:33,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-05-15 10:30:33,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-05-15 10:30:33,723 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 49 states. [2019-05-15 10:30:40,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:40,379 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-05-15 10:30:40,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-05-15 10:30:40,379 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 50 [2019-05-15 10:30:40,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:30:40,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-05-15 10:30:40,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-05-15 10:30:40,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-05-15 10:30:40,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-05-15 10:30:40,381 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states and 53 transitions. [2019-05-15 10:30:40,426 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:30:40,427 INFO L225 Difference]: With dead ends: 52 [2019-05-15 10:30:40,427 INFO L226 Difference]: Without dead ends: 52 [2019-05-15 10:30:40,427 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-05-15 10:30:40,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-05-15 10:30:40,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-05-15 10:30:40,429 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:30:40,429 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 52 states. [2019-05-15 10:30:40,429 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2019-05-15 10:30:40,429 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2019-05-15 10:30:40,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:40,430 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-05-15 10:30:40,430 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-05-15 10:30:40,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:30:40,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:30:40,430 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2019-05-15 10:30:40,430 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2019-05-15 10:30:40,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:40,431 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-05-15 10:30:40,431 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-05-15 10:30:40,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:30:40,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:30:40,431 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:30:40,431 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:30:40,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-05-15 10:30:40,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-05-15 10:30:40,432 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-05-15 10:30:40,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:30:40,432 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-05-15 10:30:40,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-05-15 10:30:40,432 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-05-15 10:30:40,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-05-15 10:30:40,432 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:30:40,432 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1, 1] [2019-05-15 10:30:40,433 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:30:40,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:30:40,433 INFO L82 PathProgramCache]: Analyzing trace with hash 511559298, now seen corresponding path program 47 times [2019-05-15 10:30:40,433 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:30:40,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:30:40,448 WARN L254 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 49 conjunts are in the unsatisfiable core [2019-05-15 10:30:40,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:30:40,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:30:40,594 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:40,594 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:40,598 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:40,599 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:40,599 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:30:40,600 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:40,600 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1135|]. (= |#memory_int| (store |v_#memory_int_1135| ULTIMATE.start_main_p1 0)) [2019-05-15 10:30:40,601 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:30:40,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 16 treesize of output 11 [2019-05-15 10:30:40,611 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:40,614 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:40,614 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:40,614 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:40,622 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:40,622 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1136|]. (let ((.cse0 (select |v_#memory_int_1136| ULTIMATE.start_main_p1))) (and (= .cse0 0) (= (store |v_#memory_int_1136| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:40,622 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:30:40,633 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:40,634 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:40,636 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:40,636 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:40,636 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:40,643 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:40,644 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1137|]. (let ((.cse0 (select |v_#memory_int_1137| ULTIMATE.start_main_p1))) (and (= .cse0 1) (= |#memory_int| (store |v_#memory_int_1137| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:40,644 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:30:40,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:40,674 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:40,714 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:40,714 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:40,714 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:40,728 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:40,729 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1138|]. (let ((.cse0 (select |v_#memory_int_1138| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1138| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 2))) [2019-05-15 10:30:40,729 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:30:40,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:40,756 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:40,759 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:40,759 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:40,759 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:40,767 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:40,768 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1139|]. (let ((.cse0 (select |v_#memory_int_1139| ULTIMATE.start_main_p1))) (and (= .cse0 3) (= (store |v_#memory_int_1139| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:40,768 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:30:40,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:40,781 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:40,783 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:40,783 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:40,783 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:40,792 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:40,792 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1140|]. (let ((.cse0 (select |v_#memory_int_1140| ULTIMATE.start_main_p1))) (and (= 4 .cse0) (= |#memory_int| (store |v_#memory_int_1140| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:40,792 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:30:40,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:40,806 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:40,808 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:40,808 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:40,808 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:40,815 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:40,815 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1141|]. (let ((.cse0 (select |v_#memory_int_1141| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1141| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 5 .cse0))) [2019-05-15 10:30:40,816 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:30:40,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:40,830 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:40,832 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:40,833 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:40,833 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:40,840 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:40,840 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1142|]. (let ((.cse0 (select |v_#memory_int_1142| ULTIMATE.start_main_p1))) (and (= 6 .cse0) (= |#memory_int| (store |v_#memory_int_1142| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:40,840 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:30:40,854 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:40,855 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:40,857 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:40,857 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:40,857 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:40,866 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:40,866 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1143|]. (let ((.cse0 (select |v_#memory_int_1143| ULTIMATE.start_main_p1))) (and (= .cse0 7) (= (store |v_#memory_int_1143| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:40,866 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:30:40,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:40,882 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:40,884 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:40,884 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:40,884 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:40,891 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:40,892 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1144|]. (let ((.cse0 (select |v_#memory_int_1144| ULTIMATE.start_main_p1))) (and (= 8 .cse0) (= (store |v_#memory_int_1144| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:40,892 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:30:40,907 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:40,908 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:40,910 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:40,911 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:40,911 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:40,918 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:40,918 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1145|]. (let ((.cse0 (select |v_#memory_int_1145| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1145| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 9))) [2019-05-15 10:30:40,918 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:30:40,934 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:40,935 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:40,937 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:40,938 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:40,938 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:40,945 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:40,945 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1146|]. (let ((.cse0 (select |v_#memory_int_1146| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1146| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 10 .cse0))) [2019-05-15 10:30:40,945 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:30:40,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 16 treesize of output 11 [2019-05-15 10:30:40,963 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:40,966 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:40,966 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:40,966 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:40,974 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:40,974 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1147|]. (let ((.cse0 (select |v_#memory_int_1147| ULTIMATE.start_main_p1))) (and (= 11 .cse0) (= (store |v_#memory_int_1147| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:40,974 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:30:40,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 16 treesize of output 11 [2019-05-15 10:30:40,995 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:40,997 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:40,997 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:40,997 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:41,005 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:41,005 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1148|]. (let ((.cse0 (select |v_#memory_int_1148| ULTIMATE.start_main_p1))) (and (= 12 .cse0) (= (store |v_#memory_int_1148| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:41,005 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:30:41,024 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:41,025 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:41,027 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:41,027 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,027 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:41,035 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:41,036 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1149|]. (let ((.cse0 (select |v_#memory_int_1149| ULTIMATE.start_main_p1))) (and (= .cse0 13) (= |#memory_int| (store |v_#memory_int_1149| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:41,036 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:30:41,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 16 treesize of output 11 [2019-05-15 10:30:41,072 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:41,074 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:41,074 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,074 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:41,081 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:41,081 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1150|]. (let ((.cse0 (select |v_#memory_int_1150| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1150| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 14 .cse0))) [2019-05-15 10:30:41,081 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:30:41,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 16 treesize of output 11 [2019-05-15 10:30:41,104 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:41,106 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:41,106 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,106 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:41,114 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:41,114 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1151|]. (let ((.cse0 (select |v_#memory_int_1151| ULTIMATE.start_main_p1))) (and (= 15 .cse0) (= |#memory_int| (store |v_#memory_int_1151| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:41,115 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:30:41,135 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:41,136 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:41,138 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:41,139 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,139 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:41,146 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:41,147 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1152|]. (let ((.cse0 (select |v_#memory_int_1152| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1152| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 16))) [2019-05-15 10:30:41,147 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:30:41,168 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:41,169 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:41,171 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:41,171 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,171 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:41,179 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:41,179 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1153|]. (let ((.cse0 (select |v_#memory_int_1153| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1153| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 17))) [2019-05-15 10:30:41,179 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:30:41,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 16 treesize of output 11 [2019-05-15 10:30:41,203 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:41,205 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:41,205 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,205 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:41,214 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:41,214 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1154|]. (let ((.cse0 (select |v_#memory_int_1154| ULTIMATE.start_main_p1))) (and (= 18 .cse0) (= (store |v_#memory_int_1154| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:41,215 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:30:41,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 16 treesize of output 11 [2019-05-15 10:30:41,239 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:41,242 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:41,242 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,242 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:41,250 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:41,250 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1155|]. (let ((.cse0 (select |v_#memory_int_1155| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1155| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 19))) [2019-05-15 10:30:41,250 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:30:41,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 16 treesize of output 11 [2019-05-15 10:30:41,277 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:41,280 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:41,280 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,280 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:41,288 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:41,288 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1156|]. (let ((.cse0 (select |v_#memory_int_1156| ULTIMATE.start_main_p1))) (and (= .cse0 20) (= |#memory_int| (store |v_#memory_int_1156| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:41,288 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:30:41,315 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:41,316 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:41,318 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:41,319 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,319 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:41,326 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:41,327 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1157|]. (let ((.cse0 (select |v_#memory_int_1157| ULTIMATE.start_main_p1))) (and (= 21 .cse0) (= (store |v_#memory_int_1157| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:41,327 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:30:41,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 16 treesize of output 11 [2019-05-15 10:30:41,355 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:41,357 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:41,358 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,358 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:41,365 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:41,365 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1158|]. (let ((.cse0 (select |v_#memory_int_1158| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1158| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 22 .cse0))) [2019-05-15 10:30:41,365 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:30:41,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 16 treesize of output 11 [2019-05-15 10:30:41,395 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:41,397 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:41,398 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,398 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:41,407 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:41,407 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1159|]. (let ((.cse0 (select |v_#memory_int_1159| ULTIMATE.start_main_p1))) (and (= 23 .cse0) (= |#memory_int| (store |v_#memory_int_1159| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:41,407 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:30:41,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:41,438 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:41,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:41,441 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,441 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:41,449 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:41,449 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1160|]. (let ((.cse0 (select |v_#memory_int_1160| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1160| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 24 .cse0))) [2019-05-15 10:30:41,449 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:30:41,480 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:41,481 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:41,483 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:41,483 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,483 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:41,491 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:41,492 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1161|]. (let ((.cse0 (select |v_#memory_int_1161| ULTIMATE.start_main_p1))) (and (= .cse0 25) (= (store |v_#memory_int_1161| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:41,492 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:30:41,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 16 treesize of output 11 [2019-05-15 10:30:41,523 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:41,526 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:41,526 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,526 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:41,535 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:41,536 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1162|]. (let ((.cse0 (select |v_#memory_int_1162| ULTIMATE.start_main_p1))) (and (= .cse0 26) (= (store |v_#memory_int_1162| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:41,536 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:30:41,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 16 treesize of output 11 [2019-05-15 10:30:41,568 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:41,571 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:41,571 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,571 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:41,579 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:41,579 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1163|]. (let ((.cse0 (select |v_#memory_int_1163| ULTIMATE.start_main_p1))) (and (= 27 .cse0) (= (store |v_#memory_int_1163| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:41,579 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:30:41,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 16 treesize of output 11 [2019-05-15 10:30:41,615 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:41,617 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:41,617 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,617 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:41,625 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:41,625 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1164|]. (let ((.cse0 (select |v_#memory_int_1164| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1164| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 28 .cse0))) [2019-05-15 10:30:41,625 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:30:41,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:41,658 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:41,660 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:41,661 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,661 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:41,669 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:41,669 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1165|]. (let ((.cse0 (select |v_#memory_int_1165| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1165| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 29))) [2019-05-15 10:30:41,670 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:30:41,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 16 treesize of output 11 [2019-05-15 10:30:41,703 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:41,705 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:41,705 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,705 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:41,712 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:41,713 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1166|]. (let ((.cse0 (select |v_#memory_int_1166| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1166| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 30))) [2019-05-15 10:30:41,713 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:30:41,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 16 treesize of output 11 [2019-05-15 10:30:41,748 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:41,750 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:41,751 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,751 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:41,758 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:41,758 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1167|]. (let ((.cse0 (select |v_#memory_int_1167| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1167| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 31 .cse0))) [2019-05-15 10:30:41,759 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:30:41,792 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:41,793 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:41,795 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:41,795 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,795 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:41,801 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:41,802 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1168|]. (let ((.cse0 (select |v_#memory_int_1168| ULTIMATE.start_main_p1))) (and (= .cse0 32) (= (store |v_#memory_int_1168| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:41,802 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:30:41,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 16 treesize of output 11 [2019-05-15 10:30:41,839 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:41,841 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:41,842 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,842 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:41,849 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:41,849 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1169|]. (let ((.cse0 (select |v_#memory_int_1169| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1169| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 33 .cse0))) [2019-05-15 10:30:41,849 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:30:41,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:41,888 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:41,890 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:41,890 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,890 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:41,898 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:41,898 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1170|]. (let ((.cse0 (select |v_#memory_int_1170| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1170| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 34 .cse0))) [2019-05-15 10:30:41,898 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:30:41,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:41,936 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:41,939 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:41,939 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,939 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:41,947 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:41,948 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1171|]. (let ((.cse0 (select |v_#memory_int_1171| ULTIMATE.start_main_p1))) (and (= .cse0 35) (= (store |v_#memory_int_1171| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:41,948 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:30:41,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:41,989 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:41,992 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:41,992 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,992 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:42,000 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:42,000 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1172|]. (let ((.cse0 (select |v_#memory_int_1172| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1172| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 36 .cse0))) [2019-05-15 10:30:42,000 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:30:42,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:42,040 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:42,043 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:42,043 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:42,043 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:42,051 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:42,052 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1173|]. (let ((.cse0 (select |v_#memory_int_1173| ULTIMATE.start_main_p1))) (and (= 37 .cse0) (= (store |v_#memory_int_1173| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:42,052 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:30:42,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 16 treesize of output 11 [2019-05-15 10:30:42,097 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:42,100 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:42,100 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:42,100 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:42,108 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:42,108 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1174|]. (let ((.cse0 (select |v_#memory_int_1174| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1174| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 38))) [2019-05-15 10:30:42,108 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:30:42,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 16 treesize of output 11 [2019-05-15 10:30:42,149 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:42,151 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:42,151 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:42,152 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:42,159 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:42,160 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1175|]. (let ((.cse0 (select |v_#memory_int_1175| ULTIMATE.start_main_p1))) (and (= .cse0 39) (= |#memory_int| (store |v_#memory_int_1175| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:42,160 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:30:42,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:42,200 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:42,203 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:42,203 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:42,203 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:42,211 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:42,211 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1176|]. (let ((.cse0 (select |v_#memory_int_1176| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1176| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 40))) [2019-05-15 10:30:42,211 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:30:42,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 16 treesize of output 11 [2019-05-15 10:30:42,266 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:42,268 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:42,269 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:42,269 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:42,277 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:42,277 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1177|]. (let ((.cse0 (select |v_#memory_int_1177| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1177| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 41))) [2019-05-15 10:30:42,277 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:30:42,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 16 treesize of output 11 [2019-05-15 10:30:42,322 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:42,324 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:42,324 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:42,324 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:42,332 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:42,332 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1178|]. (let ((.cse0 (select |v_#memory_int_1178| ULTIMATE.start_main_p1))) (and (= 42 .cse0) (= (store |v_#memory_int_1178| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:42,333 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:30:42,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 16 treesize of output 11 [2019-05-15 10:30:42,378 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:42,380 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:42,381 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:42,381 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:42,389 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:42,390 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1179|]. (let ((.cse0 (select |v_#memory_int_1179| ULTIMATE.start_main_p1))) (and (= 43 .cse0) (= (store |v_#memory_int_1179| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:42,390 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:30:42,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 16 treesize of output 11 [2019-05-15 10:30:42,435 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:42,437 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:42,437 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:42,437 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:42,444 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:42,444 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1180|]. (let ((.cse0 (select |v_#memory_int_1180| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1180| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 44 .cse0))) [2019-05-15 10:30:42,444 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:30:42,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 16 treesize of output 11 [2019-05-15 10:30:42,489 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:42,491 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:42,491 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:42,491 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:42,499 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:42,500 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1181|]. (let ((.cse0 (select |v_#memory_int_1181| ULTIMATE.start_main_p1))) (and (= 45 .cse0) (= (store |v_#memory_int_1181| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:42,500 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:30:42,544 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:42,545 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:42,547 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:42,547 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:42,548 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:42,555 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:42,556 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1182|]. (let ((.cse0 (select |v_#memory_int_1182| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1182| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 46))) [2019-05-15 10:30:42,556 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:30:42,596 INFO L273 TraceCheckUtils]: 0: Hoare triple {10448#true} havoc main_p1; {10448#true} is VALID [2019-05-15 10:30:42,596 INFO L273 TraceCheckUtils]: 1: Hoare triple {10448#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {10448#true} is VALID [2019-05-15 10:30:42,597 INFO L273 TraceCheckUtils]: 2: Hoare triple {10448#true} #memory_int := #memory_int[main_p1 := 0]; {10459#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:30:42,598 INFO L273 TraceCheckUtils]: 3: Hoare triple {10459#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10463#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:30:42,598 INFO L273 TraceCheckUtils]: 4: Hoare triple {10463#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10467#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:30:42,599 INFO L273 TraceCheckUtils]: 5: Hoare triple {10467#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10471#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:30:42,600 INFO L273 TraceCheckUtils]: 6: Hoare triple {10471#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10475#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:30:42,601 INFO L273 TraceCheckUtils]: 7: Hoare triple {10475#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10479#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:30:42,601 INFO L273 TraceCheckUtils]: 8: Hoare triple {10479#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10483#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:30:42,602 INFO L273 TraceCheckUtils]: 9: Hoare triple {10483#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10487#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:30:42,603 INFO L273 TraceCheckUtils]: 10: Hoare triple {10487#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10491#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:30:42,604 INFO L273 TraceCheckUtils]: 11: Hoare triple {10491#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10495#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:30:42,604 INFO L273 TraceCheckUtils]: 12: Hoare triple {10495#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10499#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:30:42,605 INFO L273 TraceCheckUtils]: 13: Hoare triple {10499#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10503#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:30:42,606 INFO L273 TraceCheckUtils]: 14: Hoare triple {10503#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10507#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:30:42,607 INFO L273 TraceCheckUtils]: 15: Hoare triple {10507#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10511#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:30:42,607 INFO L273 TraceCheckUtils]: 16: Hoare triple {10511#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10515#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:30:42,608 INFO L273 TraceCheckUtils]: 17: Hoare triple {10515#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10519#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:30:42,609 INFO L273 TraceCheckUtils]: 18: Hoare triple {10519#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10523#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:30:42,610 INFO L273 TraceCheckUtils]: 19: Hoare triple {10523#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10527#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:30:42,610 INFO L273 TraceCheckUtils]: 20: Hoare triple {10527#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10531#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:30:42,611 INFO L273 TraceCheckUtils]: 21: Hoare triple {10531#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10535#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:30:42,612 INFO L273 TraceCheckUtils]: 22: Hoare triple {10535#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10539#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:30:42,613 INFO L273 TraceCheckUtils]: 23: Hoare triple {10539#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10543#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:30:42,613 INFO L273 TraceCheckUtils]: 24: Hoare triple {10543#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10547#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:30:42,614 INFO L273 TraceCheckUtils]: 25: Hoare triple {10547#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10551#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:30:42,615 INFO L273 TraceCheckUtils]: 26: Hoare triple {10551#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10555#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:30:42,616 INFO L273 TraceCheckUtils]: 27: Hoare triple {10555#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10559#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:30:42,617 INFO L273 TraceCheckUtils]: 28: Hoare triple {10559#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10563#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:30:42,617 INFO L273 TraceCheckUtils]: 29: Hoare triple {10563#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10567#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:30:42,618 INFO L273 TraceCheckUtils]: 30: Hoare triple {10567#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10571#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:30:42,619 INFO L273 TraceCheckUtils]: 31: Hoare triple {10571#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10575#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:30:42,620 INFO L273 TraceCheckUtils]: 32: Hoare triple {10575#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10579#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:30:42,621 INFO L273 TraceCheckUtils]: 33: Hoare triple {10579#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10583#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:30:42,621 INFO L273 TraceCheckUtils]: 34: Hoare triple {10583#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10587#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:30:42,622 INFO L273 TraceCheckUtils]: 35: Hoare triple {10587#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10591#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:30:42,623 INFO L273 TraceCheckUtils]: 36: Hoare triple {10591#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10595#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:30:42,624 INFO L273 TraceCheckUtils]: 37: Hoare triple {10595#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10599#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:30:42,625 INFO L273 TraceCheckUtils]: 38: Hoare triple {10599#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10603#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:30:42,625 INFO L273 TraceCheckUtils]: 39: Hoare triple {10603#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10607#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:30:42,626 INFO L273 TraceCheckUtils]: 40: Hoare triple {10607#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10611#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:30:42,627 INFO L273 TraceCheckUtils]: 41: Hoare triple {10611#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10615#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:30:42,628 INFO L273 TraceCheckUtils]: 42: Hoare triple {10615#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10619#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:30:42,628 INFO L273 TraceCheckUtils]: 43: Hoare triple {10619#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10623#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:30:42,629 INFO L273 TraceCheckUtils]: 44: Hoare triple {10623#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10627#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:30:42,630 INFO L273 TraceCheckUtils]: 45: Hoare triple {10627#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10631#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:30:42,631 INFO L273 TraceCheckUtils]: 46: Hoare triple {10631#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10635#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:30:42,631 INFO L273 TraceCheckUtils]: 47: Hoare triple {10635#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10639#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:30:42,632 INFO L273 TraceCheckUtils]: 48: Hoare triple {10639#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10643#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:30:42,633 INFO L273 TraceCheckUtils]: 49: Hoare triple {10643#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10647#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:30:42,634 INFO L273 TraceCheckUtils]: 50: Hoare triple {10647#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} assume !(#memory_int[main_p1] >= 0); {10449#false} is VALID [2019-05-15 10:30:42,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:30:42,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:30:42,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-05-15 10:30:42,639 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 51 [2019-05-15 10:30:42,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:30:42,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states. [2019-05-15 10:30:42,680 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:30:42,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-05-15 10:30:42,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-05-15 10:30:42,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-05-15 10:30:42,681 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 50 states. [2019-05-15 10:30:47,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:47,890 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-05-15 10:30:47,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-05-15 10:30:47,891 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 51 [2019-05-15 10:30:47,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:30:47,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-05-15 10:30:47,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-05-15 10:30:47,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-05-15 10:30:47,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-05-15 10:30:47,892 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states and 54 transitions. [2019-05-15 10:30:47,944 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:47,945 INFO L225 Difference]: With dead ends: 53 [2019-05-15 10:30:47,946 INFO L226 Difference]: Without dead ends: 53 [2019-05-15 10:30:47,946 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-05-15 10:30:47,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-05-15 10:30:47,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-05-15 10:30:47,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:30:47,948 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 53 states. [2019-05-15 10:30:47,948 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2019-05-15 10:30:47,949 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2019-05-15 10:30:47,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:47,950 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-05-15 10:30:47,950 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-05-15 10:30:47,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:30:47,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:30:47,951 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2019-05-15 10:30:47,951 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2019-05-15 10:30:47,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:47,952 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-05-15 10:30:47,952 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-05-15 10:30:47,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:30:47,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:30:47,952 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:30:47,952 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:30:47,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-05-15 10:30:47,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-05-15 10:30:47,953 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-05-15 10:30:47,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:30:47,953 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-05-15 10:30:47,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-05-15 10:30:47,953 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-05-15 10:30:47,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-05-15 10:30:47,954 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:30:47,954 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1, 1] [2019-05-15 10:30:47,954 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:30:47,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:30:47,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1321531000, now seen corresponding path program 48 times [2019-05-15 10:30:47,955 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:30:47,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:30:47,969 WARN L254 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 50 conjunts are in the unsatisfiable core [2019-05-15 10:30:47,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:30:47,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:30:48,009 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:48,009 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,011 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:48,012 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,012 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:30:48,013 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:48,013 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1183|]. (= (store |v_#memory_int_1183| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:30:48,013 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:30:48,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 16 treesize of output 11 [2019-05-15 10:30:48,027 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,029 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:48,029 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,029 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:48,038 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:48,038 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1184|]. (let ((.cse0 (select |v_#memory_int_1184| ULTIMATE.start_main_p1))) (and (= .cse0 0) (= (store |v_#memory_int_1184| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:48,038 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:30:48,065 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:48,066 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,067 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:48,067 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,067 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:48,075 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:48,076 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1185|]. (let ((.cse0 (select |v_#memory_int_1185| ULTIMATE.start_main_p1))) (and (= 1 .cse0) (= |#memory_int| (store |v_#memory_int_1185| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:48,076 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:30:48,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 16 treesize of output 11 [2019-05-15 10:30:48,088 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,090 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:48,091 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,091 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:48,099 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:48,099 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1186|]. (let ((.cse0 (select |v_#memory_int_1186| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1186| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 2 .cse0))) [2019-05-15 10:30:48,099 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:30:48,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 16 treesize of output 11 [2019-05-15 10:30:48,112 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,114 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:48,115 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,115 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:48,123 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:48,123 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1187|]. (let ((.cse0 (select |v_#memory_int_1187| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1187| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 3))) [2019-05-15 10:30:48,123 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:30:48,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:48,138 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,140 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:48,140 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,140 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:48,146 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:48,147 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1188|]. (let ((.cse0 (select |v_#memory_int_1188| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1188| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 4))) [2019-05-15 10:30:48,147 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:30:48,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 16 treesize of output 11 [2019-05-15 10:30:48,163 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,165 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:48,165 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,165 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:48,173 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:48,173 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1189|]. (let ((.cse0 (select |v_#memory_int_1189| ULTIMATE.start_main_p1))) (and (= 5 .cse0) (= (store |v_#memory_int_1189| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:48,173 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:30:48,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 16 treesize of output 11 [2019-05-15 10:30:48,189 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,192 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:48,192 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,192 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:48,200 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:48,200 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1190|]. (let ((.cse0 (select |v_#memory_int_1190| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1190| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 6))) [2019-05-15 10:30:48,200 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:30:48,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 16 treesize of output 11 [2019-05-15 10:30:48,218 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,220 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:48,220 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,220 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:48,228 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:48,228 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1191|]. (let ((.cse0 (select |v_#memory_int_1191| ULTIMATE.start_main_p1))) (and (= 7 .cse0) (= |#memory_int| (store |v_#memory_int_1191| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:48,228 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:30:48,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 16 treesize of output 11 [2019-05-15 10:30:48,246 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,248 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:48,248 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,248 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:48,256 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:48,257 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1192|]. (let ((.cse0 (select |v_#memory_int_1192| ULTIMATE.start_main_p1))) (and (= 8 .cse0) (= (store |v_#memory_int_1192| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:48,257 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:30:48,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 16 treesize of output 11 [2019-05-15 10:30:48,276 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,278 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:48,278 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,279 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:48,287 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:48,287 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1193|]. (let ((.cse0 (select |v_#memory_int_1193| ULTIMATE.start_main_p1))) (and (= 9 .cse0) (= |#memory_int| (store |v_#memory_int_1193| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:48,288 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:30:48,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:48,307 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,309 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:48,310 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,310 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:48,317 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:48,317 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1194|]. (let ((.cse0 (select |v_#memory_int_1194| ULTIMATE.start_main_p1))) (and (= .cse0 10) (= (store |v_#memory_int_1194| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:48,318 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:30:48,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:48,336 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,338 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:48,338 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,338 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:48,345 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:48,345 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1195|]. (let ((.cse0 (select |v_#memory_int_1195| ULTIMATE.start_main_p1))) (and (= 11 .cse0) (= (store |v_#memory_int_1195| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:48,345 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:30:48,366 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:48,367 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,369 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:48,369 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,370 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:48,378 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:48,378 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1196|]. (let ((.cse0 (select |v_#memory_int_1196| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1196| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 12 .cse0))) [2019-05-15 10:30:48,378 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:30:48,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:48,399 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,401 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:48,402 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,402 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:48,410 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:48,410 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1197|]. (let ((.cse0 (select |v_#memory_int_1197| ULTIMATE.start_main_p1))) (and (= .cse0 13) (= |#memory_int| (store |v_#memory_int_1197| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:48,410 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:30:48,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 16 treesize of output 11 [2019-05-15 10:30:48,432 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,434 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:48,435 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,435 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:48,442 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:48,443 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1198|]. (let ((.cse0 (select |v_#memory_int_1198| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1198| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 14))) [2019-05-15 10:30:48,443 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:30:48,464 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:48,465 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,467 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:48,467 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,467 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:48,475 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:48,476 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1199|]. (let ((.cse0 (select |v_#memory_int_1199| ULTIMATE.start_main_p1))) (and (= 15 .cse0) (= (store |v_#memory_int_1199| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:48,476 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:30:48,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:48,499 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,501 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:48,501 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,502 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:48,510 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:48,510 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1200|]. (let ((.cse0 (select |v_#memory_int_1200| ULTIMATE.start_main_p1))) (and (= 16 .cse0) (= (store |v_#memory_int_1200| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:48,510 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:30:48,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:48,537 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,539 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:48,539 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,540 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:48,547 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:48,548 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1201|]. (let ((.cse0 (select |v_#memory_int_1201| ULTIMATE.start_main_p1))) (and (= 17 .cse0) (= (store |v_#memory_int_1201| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:48,548 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:30:48,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 16 treesize of output 11 [2019-05-15 10:30:48,573 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,575 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:48,576 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,576 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:48,583 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:48,584 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1202|]. (let ((.cse0 (select |v_#memory_int_1202| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1202| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 18))) [2019-05-15 10:30:48,584 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:30:48,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 16 treesize of output 11 [2019-05-15 10:30:48,612 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,614 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:48,614 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,614 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:48,622 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:48,622 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1203|]. (let ((.cse0 (select |v_#memory_int_1203| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1203| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 19))) [2019-05-15 10:30:48,623 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:30:48,648 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:48,650 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,652 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:48,652 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,652 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:48,660 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:48,660 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1204|]. (let ((.cse0 (select |v_#memory_int_1204| ULTIMATE.start_main_p1))) (and (= 20 .cse0) (= |#memory_int| (store |v_#memory_int_1204| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:48,661 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:30:48,686 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:48,687 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,690 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:48,690 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,690 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:48,698 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:48,698 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1205|]. (let ((.cse0 (select |v_#memory_int_1205| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1205| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 21 .cse0))) [2019-05-15 10:30:48,698 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:30:48,723 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:48,725 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,727 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:48,727 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,727 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:48,735 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:48,735 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1206|]. (let ((.cse0 (select |v_#memory_int_1206| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1206| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 22 .cse0))) [2019-05-15 10:30:48,735 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:30:48,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 16 treesize of output 11 [2019-05-15 10:30:48,763 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,765 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:48,766 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,766 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:48,775 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:48,775 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1207|]. (let ((.cse0 (select |v_#memory_int_1207| ULTIMATE.start_main_p1))) (and (= .cse0 23) (= (store |v_#memory_int_1207| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:48,775 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:30:48,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 16 treesize of output 11 [2019-05-15 10:30:48,805 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,808 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:48,808 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,808 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:48,816 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:48,816 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1208|]. (let ((.cse0 (select |v_#memory_int_1208| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1208| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 24 .cse0))) [2019-05-15 10:30:48,816 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:30:48,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:48,846 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,848 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:48,849 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,849 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:48,856 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:48,857 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1209|]. (let ((.cse0 (select |v_#memory_int_1209| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1209| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 25))) [2019-05-15 10:30:48,857 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:30:48,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:48,888 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,890 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:48,890 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,890 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:48,898 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:48,898 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1210|]. (let ((.cse0 (select |v_#memory_int_1210| ULTIMATE.start_main_p1))) (and (= .cse0 26) (= |#memory_int| (store |v_#memory_int_1210| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:48,898 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:30:48,929 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:48,930 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,933 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:48,933 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,933 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:48,941 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:48,942 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1211|]. (let ((.cse0 (select |v_#memory_int_1211| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1211| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 27))) [2019-05-15 10:30:48,942 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:30:48,972 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:48,973 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,975 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:48,976 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:48,976 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:48,983 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:48,984 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1212|]. (let ((.cse0 (select |v_#memory_int_1212| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1212| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 28 .cse0))) [2019-05-15 10:30:48,984 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:30:49,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 16 treesize of output 11 [2019-05-15 10:30:49,019 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:49,021 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:49,021 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:49,022 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:49,030 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:49,030 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1213|]. (let ((.cse0 (select |v_#memory_int_1213| ULTIMATE.start_main_p1))) (and (= 29 .cse0) (= (store |v_#memory_int_1213| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:49,030 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:30:49,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 16 treesize of output 11 [2019-05-15 10:30:49,067 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:49,070 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:49,070 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:49,070 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:49,077 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:49,077 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1214|]. (let ((.cse0 (select |v_#memory_int_1214| ULTIMATE.start_main_p1))) (and (= .cse0 30) (= (store |v_#memory_int_1214| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:49,077 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:30:49,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 16 treesize of output 11 [2019-05-15 10:30:49,112 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:49,115 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:49,115 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:49,115 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:49,123 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:49,123 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1215|]. (let ((.cse0 (select |v_#memory_int_1215| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1215| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 31))) [2019-05-15 10:30:49,124 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:30:49,161 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:49,162 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:49,164 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:49,164 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:49,165 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:49,172 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:49,173 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1216|]. (let ((.cse0 (select |v_#memory_int_1216| ULTIMATE.start_main_p1))) (and (= 32 .cse0) (= (store |v_#memory_int_1216| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:49,173 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:30:49,211 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:49,213 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:49,214 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:49,215 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:49,215 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:49,226 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:49,227 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1217|]. (let ((.cse0 (select |v_#memory_int_1217| ULTIMATE.start_main_p1))) (and (= 33 .cse0) (= |#memory_int| (store |v_#memory_int_1217| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:49,227 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:30:49,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 16 treesize of output 11 [2019-05-15 10:30:49,267 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:49,269 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:49,270 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:49,270 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:49,277 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:49,277 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1218|]. (let ((.cse0 (select |v_#memory_int_1218| ULTIMATE.start_main_p1))) (and (= .cse0 34) (= (store |v_#memory_int_1218| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:49,277 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:30:49,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 16 treesize of output 11 [2019-05-15 10:30:49,315 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:49,317 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:49,317 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:49,318 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:49,326 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:49,326 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1219|]. (let ((.cse0 (select |v_#memory_int_1219| ULTIMATE.start_main_p1))) (and (= .cse0 35) (= (store |v_#memory_int_1219| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:49,326 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:30:49,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:49,366 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:49,368 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:49,369 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:49,369 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:49,377 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:49,377 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1220|]. (let ((.cse0 (select |v_#memory_int_1220| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1220| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 36 .cse0))) [2019-05-15 10:30:49,377 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:30:49,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 16 treesize of output 11 [2019-05-15 10:30:49,421 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:49,424 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:49,424 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:49,424 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:49,432 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:49,433 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1221|]. (let ((.cse0 (select |v_#memory_int_1221| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1221| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 37 .cse0))) [2019-05-15 10:30:49,433 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:30:49,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 16 treesize of output 11 [2019-05-15 10:30:49,475 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:49,477 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:49,477 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:49,478 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:49,485 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:49,486 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1222|]. (let ((.cse0 (select |v_#memory_int_1222| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1222| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 38))) [2019-05-15 10:30:49,486 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:30:49,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:49,529 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:49,532 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:49,532 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:49,532 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:49,540 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:49,541 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1223|]. (let ((.cse0 (select |v_#memory_int_1223| ULTIMATE.start_main_p1))) (and (= .cse0 39) (= (store |v_#memory_int_1223| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:49,541 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:30:49,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 16 treesize of output 11 [2019-05-15 10:30:49,583 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:49,585 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:49,585 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:49,586 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:49,594 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:49,594 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1224|]. (let ((.cse0 (select |v_#memory_int_1224| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1224| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 40 .cse0))) [2019-05-15 10:30:49,594 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:30:49,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 16 treesize of output 11 [2019-05-15 10:30:49,637 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:49,639 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:49,640 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:49,640 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:49,648 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:49,649 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1225|]. (let ((.cse0 (select |v_#memory_int_1225| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1225| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 41))) [2019-05-15 10:30:49,649 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:30:49,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:49,696 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:49,699 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:49,699 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:49,699 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:49,707 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:49,707 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1226|]. (let ((.cse0 (select |v_#memory_int_1226| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1226| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 42))) [2019-05-15 10:30:49,707 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:30:49,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 16 treesize of output 11 [2019-05-15 10:30:49,762 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:49,764 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:49,764 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:49,764 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:49,771 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:49,772 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1227|]. (let ((.cse0 (select |v_#memory_int_1227| ULTIMATE.start_main_p1))) (and (= 43 .cse0) (= |#memory_int| (store |v_#memory_int_1227| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:49,772 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:30:49,816 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:49,817 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:49,819 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:49,819 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:49,819 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:49,827 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:49,827 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1228|]. (let ((.cse0 (select |v_#memory_int_1228| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1228| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 44 .cse0))) [2019-05-15 10:30:49,827 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:30:49,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:49,876 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:49,878 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:49,878 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:49,878 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:49,886 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:49,886 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1229|]. (let ((.cse0 (select |v_#memory_int_1229| ULTIMATE.start_main_p1))) (and (= .cse0 45) (= (store |v_#memory_int_1229| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:49,887 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:30:49,930 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:49,931 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:49,933 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:49,933 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:49,933 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:49,941 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:49,941 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1230|]. (let ((.cse0 (select |v_#memory_int_1230| ULTIMATE.start_main_p1))) (and (= 46 .cse0) (= (store |v_#memory_int_1230| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:49,941 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:30:49,992 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:49,993 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:49,995 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:49,995 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:49,996 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:50,003 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:50,004 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1231|]. (let ((.cse0 (select |v_#memory_int_1231| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1231| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 47))) [2019-05-15 10:30:50,004 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:30:50,048 INFO L273 TraceCheckUtils]: 0: Hoare triple {10862#true} havoc main_p1; {10862#true} is VALID [2019-05-15 10:30:50,048 INFO L273 TraceCheckUtils]: 1: Hoare triple {10862#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {10862#true} is VALID [2019-05-15 10:30:50,049 INFO L273 TraceCheckUtils]: 2: Hoare triple {10862#true} #memory_int := #memory_int[main_p1 := 0]; {10873#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:30:50,049 INFO L273 TraceCheckUtils]: 3: Hoare triple {10873#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10877#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:30:50,050 INFO L273 TraceCheckUtils]: 4: Hoare triple {10877#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10881#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:30:50,051 INFO L273 TraceCheckUtils]: 5: Hoare triple {10881#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10885#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:30:50,051 INFO L273 TraceCheckUtils]: 6: Hoare triple {10885#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10889#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:30:50,052 INFO L273 TraceCheckUtils]: 7: Hoare triple {10889#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10893#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:30:50,053 INFO L273 TraceCheckUtils]: 8: Hoare triple {10893#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10897#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:30:50,054 INFO L273 TraceCheckUtils]: 9: Hoare triple {10897#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10901#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:30:50,055 INFO L273 TraceCheckUtils]: 10: Hoare triple {10901#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10905#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:30:50,056 INFO L273 TraceCheckUtils]: 11: Hoare triple {10905#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10909#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:30:50,056 INFO L273 TraceCheckUtils]: 12: Hoare triple {10909#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10913#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:30:50,057 INFO L273 TraceCheckUtils]: 13: Hoare triple {10913#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10917#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:30:50,058 INFO L273 TraceCheckUtils]: 14: Hoare triple {10917#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10921#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:30:50,059 INFO L273 TraceCheckUtils]: 15: Hoare triple {10921#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10925#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:30:50,060 INFO L273 TraceCheckUtils]: 16: Hoare triple {10925#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10929#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:30:50,060 INFO L273 TraceCheckUtils]: 17: Hoare triple {10929#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10933#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:30:50,061 INFO L273 TraceCheckUtils]: 18: Hoare triple {10933#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10937#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:30:50,062 INFO L273 TraceCheckUtils]: 19: Hoare triple {10937#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10941#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:30:50,063 INFO L273 TraceCheckUtils]: 20: Hoare triple {10941#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10945#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:30:50,064 INFO L273 TraceCheckUtils]: 21: Hoare triple {10945#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10949#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:30:50,064 INFO L273 TraceCheckUtils]: 22: Hoare triple {10949#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10953#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:30:50,083 INFO L273 TraceCheckUtils]: 23: Hoare triple {10953#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10957#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:30:50,084 INFO L273 TraceCheckUtils]: 24: Hoare triple {10957#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10961#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:30:50,085 INFO L273 TraceCheckUtils]: 25: Hoare triple {10961#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10965#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:30:50,085 INFO L273 TraceCheckUtils]: 26: Hoare triple {10965#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10969#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:30:50,086 INFO L273 TraceCheckUtils]: 27: Hoare triple {10969#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10973#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:30:50,086 INFO L273 TraceCheckUtils]: 28: Hoare triple {10973#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10977#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:30:50,087 INFO L273 TraceCheckUtils]: 29: Hoare triple {10977#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10981#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:30:50,087 INFO L273 TraceCheckUtils]: 30: Hoare triple {10981#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10985#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:30:50,088 INFO L273 TraceCheckUtils]: 31: Hoare triple {10985#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10989#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:30:50,088 INFO L273 TraceCheckUtils]: 32: Hoare triple {10989#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10993#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:30:50,089 INFO L273 TraceCheckUtils]: 33: Hoare triple {10993#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10997#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:30:50,090 INFO L273 TraceCheckUtils]: 34: Hoare triple {10997#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11001#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:30:50,091 INFO L273 TraceCheckUtils]: 35: Hoare triple {11001#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11005#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:30:50,092 INFO L273 TraceCheckUtils]: 36: Hoare triple {11005#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11009#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:30:50,092 INFO L273 TraceCheckUtils]: 37: Hoare triple {11009#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11013#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:30:50,093 INFO L273 TraceCheckUtils]: 38: Hoare triple {11013#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11017#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:30:50,094 INFO L273 TraceCheckUtils]: 39: Hoare triple {11017#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11021#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:30:50,095 INFO L273 TraceCheckUtils]: 40: Hoare triple {11021#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11025#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:30:50,096 INFO L273 TraceCheckUtils]: 41: Hoare triple {11025#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11029#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:30:50,097 INFO L273 TraceCheckUtils]: 42: Hoare triple {11029#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11033#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:30:50,097 INFO L273 TraceCheckUtils]: 43: Hoare triple {11033#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11037#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:30:50,098 INFO L273 TraceCheckUtils]: 44: Hoare triple {11037#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11041#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:30:50,099 INFO L273 TraceCheckUtils]: 45: Hoare triple {11041#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11045#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:30:50,100 INFO L273 TraceCheckUtils]: 46: Hoare triple {11045#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11049#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:30:50,101 INFO L273 TraceCheckUtils]: 47: Hoare triple {11049#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11053#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:30:50,101 INFO L273 TraceCheckUtils]: 48: Hoare triple {11053#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11057#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:30:50,102 INFO L273 TraceCheckUtils]: 49: Hoare triple {11057#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11061#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:30:50,103 INFO L273 TraceCheckUtils]: 50: Hoare triple {11061#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11065#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:30:50,104 INFO L273 TraceCheckUtils]: 51: Hoare triple {11065#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} assume !(#memory_int[main_p1] >= 0); {10863#false} is VALID [2019-05-15 10:30:50,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:30:50,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:30:50,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-05-15 10:30:50,110 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 52 [2019-05-15 10:30:50,110 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:30:50,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states. [2019-05-15 10:30:50,173 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:50,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-05-15 10:30:50,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-05-15 10:30:50,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-05-15 10:30:50,174 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 51 states. [2019-05-15 10:30:56,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:56,135 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-05-15 10:30:56,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-05-15 10:30:56,135 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 52 [2019-05-15 10:30:56,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:30:56,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-05-15 10:30:56,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-05-15 10:30:56,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-05-15 10:30:56,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-05-15 10:30:56,137 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states and 55 transitions. [2019-05-15 10:30:56,185 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:30:56,186 INFO L225 Difference]: With dead ends: 54 [2019-05-15 10:30:56,186 INFO L226 Difference]: Without dead ends: 54 [2019-05-15 10:30:56,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-05-15 10:30:56,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-05-15 10:30:56,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-05-15 10:30:56,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:30:56,189 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 54 states. [2019-05-15 10:30:56,189 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2019-05-15 10:30:56,190 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2019-05-15 10:30:56,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:56,190 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-05-15 10:30:56,190 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-05-15 10:30:56,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:30:56,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:30:56,191 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2019-05-15 10:30:56,191 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2019-05-15 10:30:56,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:56,192 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-05-15 10:30:56,192 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-05-15 10:30:56,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:30:56,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:30:56,192 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:30:56,193 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:30:56,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-05-15 10:30:56,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-05-15 10:30:56,193 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-05-15 10:30:56,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:30:56,194 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-05-15 10:30:56,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-05-15 10:30:56,194 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-05-15 10:30:56,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-05-15 10:30:56,194 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:30:56,194 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1, 1] [2019-05-15 10:30:56,195 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:30:56,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:30:56,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1982211906, now seen corresponding path program 49 times [2019-05-15 10:30:56,196 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:30:56,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:30:56,213 WARN L254 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 51 conjunts are in the unsatisfiable core [2019-05-15 10:30:56,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:30:56,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:30:56,295 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,295 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:56,297 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:56,297 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,297 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:30:56,299 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:56,300 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1232|]. (= (store |v_#memory_int_1232| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:30:56,300 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:30:56,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:56,313 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:56,314 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:56,315 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,315 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:56,324 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:56,324 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1233|]. (let ((.cse0 (select |v_#memory_int_1233| ULTIMATE.start_main_p1))) (and (= 0 .cse0) (= |#memory_int| (store |v_#memory_int_1233| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:56,324 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:30:56,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:56,339 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:56,342 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:56,342 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,342 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:56,350 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:56,350 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1234|]. (let ((.cse0 (select |v_#memory_int_1234| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1234| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 1 .cse0))) [2019-05-15 10:30:56,351 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:30:56,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:56,363 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:56,365 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:56,366 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,366 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:56,374 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:56,374 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1235|]. (let ((.cse0 (select |v_#memory_int_1235| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1235| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 2))) [2019-05-15 10:30:56,375 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:30:56,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 16 treesize of output 11 [2019-05-15 10:30:56,386 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:56,388 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:56,389 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,389 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:56,397 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:56,397 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1236|]. (let ((.cse0 (select |v_#memory_int_1236| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1236| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 3))) [2019-05-15 10:30:56,397 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:30:56,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 16 treesize of output 11 [2019-05-15 10:30:56,411 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:56,413 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:56,413 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,413 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:56,420 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:56,420 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1237|]. (let ((.cse0 (select |v_#memory_int_1237| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1237| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 4))) [2019-05-15 10:30:56,420 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:30:56,436 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:56,437 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:56,439 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:56,439 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,439 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:56,446 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:56,446 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1238|]. (let ((.cse0 (select |v_#memory_int_1238| ULTIMATE.start_main_p1))) (and (= 5 .cse0) (= (store |v_#memory_int_1238| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:56,446 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:30:56,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:56,460 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:56,463 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:56,463 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,463 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:56,474 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:56,475 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1239|]. (let ((.cse0 (select |v_#memory_int_1239| ULTIMATE.start_main_p1))) (and (= 6 .cse0) (= (store |v_#memory_int_1239| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:56,475 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:30:56,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:56,491 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:56,493 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:56,493 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,494 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:56,500 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:56,501 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1240|]. (let ((.cse0 (select |v_#memory_int_1240| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1240| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 7 .cse0))) [2019-05-15 10:30:56,501 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:30:56,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:56,517 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:56,520 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:56,520 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,520 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:56,528 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:56,528 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1241|]. (let ((.cse0 (select |v_#memory_int_1241| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1241| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 8 .cse0))) [2019-05-15 10:30:56,528 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:30:56,545 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:56,546 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:56,549 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:56,549 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,549 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:56,556 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:56,557 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1242|]. (let ((.cse0 (select |v_#memory_int_1242| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1242| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 9))) [2019-05-15 10:30:56,557 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:30:56,575 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:56,576 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:56,578 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:56,578 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,579 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:56,586 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:56,586 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1243|]. (let ((.cse0 (select |v_#memory_int_1243| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1243| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 10 .cse0))) [2019-05-15 10:30:56,586 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:30:56,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 16 treesize of output 11 [2019-05-15 10:30:56,606 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:56,608 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:56,608 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,609 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:56,617 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:56,617 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1244|]. (let ((.cse0 (select |v_#memory_int_1244| ULTIMATE.start_main_p1))) (and (= .cse0 11) (= (store |v_#memory_int_1244| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:56,617 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:30:56,636 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:56,637 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:56,639 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:56,639 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,640 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:56,647 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:56,648 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1245|]. (let ((.cse0 (select |v_#memory_int_1245| ULTIMATE.start_main_p1))) (and (= 12 .cse0) (= (store |v_#memory_int_1245| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:56,648 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:30:56,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 16 treesize of output 11 [2019-05-15 10:30:56,670 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:56,672 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:56,672 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,672 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:56,678 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:56,678 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1246|]. (let ((.cse0 (select |v_#memory_int_1246| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1246| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 13 .cse0))) [2019-05-15 10:30:56,679 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:30:56,698 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:56,699 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:56,701 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:56,701 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,702 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:56,709 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:56,709 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1247|]. (let ((.cse0 (select |v_#memory_int_1247| ULTIMATE.start_main_p1))) (and (= 14 .cse0) (= (store |v_#memory_int_1247| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:56,710 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:30: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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:56,731 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:56,733 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:56,733 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,734 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:56,741 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:56,741 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1248|]. (let ((.cse0 (select |v_#memory_int_1248| ULTIMATE.start_main_p1))) (and (= 15 .cse0) (= (store |v_#memory_int_1248| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:56,742 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:30:56,763 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:56,764 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:56,766 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:56,766 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,766 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:56,774 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:56,774 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1249|]. (let ((.cse0 (select |v_#memory_int_1249| ULTIMATE.start_main_p1))) (and (= .cse0 16) (= (store |v_#memory_int_1249| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:56,774 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:30:56,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 16 treesize of output 11 [2019-05-15 10:30:56,796 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:56,798 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:56,799 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,799 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:56,807 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:56,807 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1250|]. (let ((.cse0 (select |v_#memory_int_1250| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1250| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 17))) [2019-05-15 10:30:56,807 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:30:56,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:56,841 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:56,842 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:56,843 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,843 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:56,852 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:56,852 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1251|]. (let ((.cse0 (select |v_#memory_int_1251| ULTIMATE.start_main_p1))) (and (= .cse0 18) (= |#memory_int| (store |v_#memory_int_1251| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:56,852 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:30:56,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:56,876 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:56,878 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:56,879 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,879 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:56,886 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:56,886 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1252|]. (let ((.cse0 (select |v_#memory_int_1252| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1252| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 19))) [2019-05-15 10:30:56,886 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:30:56,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 16 treesize of output 11 [2019-05-15 10:30:56,912 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:56,914 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:56,914 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,914 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:56,923 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:56,923 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1253|]. (let ((.cse0 (select |v_#memory_int_1253| ULTIMATE.start_main_p1))) (and (= 20 .cse0) (= (store |v_#memory_int_1253| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:56,923 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:30:56,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:56,948 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:56,950 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:56,951 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,951 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:56,959 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:56,959 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1254|]. (let ((.cse0 (select |v_#memory_int_1254| ULTIMATE.start_main_p1))) (and (= .cse0 21) (= |#memory_int| (store |v_#memory_int_1254| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:56,959 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:30:56,985 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:56,986 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:56,988 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:56,989 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,989 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:56,997 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:56,997 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1255|]. (let ((.cse0 (select |v_#memory_int_1255| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1255| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 22))) [2019-05-15 10:30:56,997 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:30:57,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 16 treesize of output 11 [2019-05-15 10:30:57,026 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:57,028 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:57,029 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:57,029 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:57,036 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:57,036 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1256|]. (let ((.cse0 (select |v_#memory_int_1256| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1256| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 23))) [2019-05-15 10:30:57,036 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:30:57,065 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:57,066 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:57,068 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:57,069 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:57,069 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:57,076 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:57,076 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1257|]. (let ((.cse0 (select |v_#memory_int_1257| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1257| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 24))) [2019-05-15 10:30:57,076 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:30:57,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:57,108 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:57,110 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:57,110 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:57,110 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:57,117 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:57,117 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1258|]. (let ((.cse0 (select |v_#memory_int_1258| ULTIMATE.start_main_p1))) (and (= 25 .cse0) (= (store |v_#memory_int_1258| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:57,117 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:30:57,147 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:57,148 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:57,164 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:57,164 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:57,164 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:57,169 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:57,170 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1259|]. (let ((.cse0 (select |v_#memory_int_1259| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1259| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 26 .cse0))) [2019-05-15 10:30:57,170 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:30:57,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:57,201 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:57,203 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:57,203 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:57,204 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:57,211 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:57,211 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1260|]. (let ((.cse0 (select |v_#memory_int_1260| ULTIMATE.start_main_p1))) (and (= 27 .cse0) (= |#memory_int| (store |v_#memory_int_1260| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:57,211 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:30:57,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 16 treesize of output 11 [2019-05-15 10:30:57,262 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:57,264 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:57,264 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:57,264 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:57,271 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:57,271 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1261|]. (let ((.cse0 (select |v_#memory_int_1261| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1261| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 28 .cse0))) [2019-05-15 10:30:57,271 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:30:57,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 16 treesize of output 11 [2019-05-15 10:30:57,304 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:57,306 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:57,306 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:57,306 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:57,314 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:57,314 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1262|]. (let ((.cse0 (select |v_#memory_int_1262| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1262| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 29))) [2019-05-15 10:30:57,314 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:30:57,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:57,348 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:57,350 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:57,350 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:57,350 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:57,358 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:57,358 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1263|]. (let ((.cse0 (select |v_#memory_int_1263| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1263| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 30))) [2019-05-15 10:30:57,358 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:30:57,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 16 treesize of output 11 [2019-05-15 10:30:57,395 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:57,397 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:57,397 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:57,397 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:57,406 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:57,406 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1264|]. (let ((.cse0 (select |v_#memory_int_1264| ULTIMATE.start_main_p1))) (and (= 31 .cse0) (= |#memory_int| (store |v_#memory_int_1264| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:57,406 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:30:57,440 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:57,442 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:57,444 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:57,444 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:57,444 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:57,452 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:57,452 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1265|]. (let ((.cse0 (select |v_#memory_int_1265| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1265| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 32 .cse0))) [2019-05-15 10:30:57,452 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:30:57,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:57,492 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:57,494 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:57,494 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:57,494 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:57,502 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:57,503 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1266|]. (let ((.cse0 (select |v_#memory_int_1266| ULTIMATE.start_main_p1))) (and (= 33 .cse0) (= (store |v_#memory_int_1266| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:57,503 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:30:57,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:57,541 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:57,544 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:57,544 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:57,544 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:57,552 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:57,552 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1267|]. (let ((.cse0 (select |v_#memory_int_1267| ULTIMATE.start_main_p1))) (and (= .cse0 34) (= |#memory_int| (store |v_#memory_int_1267| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:57,552 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:30:57,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 16 treesize of output 11 [2019-05-15 10:30:57,590 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:57,592 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:57,592 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:57,593 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:57,601 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:57,601 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1268|]. (let ((.cse0 (select |v_#memory_int_1268| ULTIMATE.start_main_p1))) (and (= 35 .cse0) (= (store |v_#memory_int_1268| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:57,601 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:30:57,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 16 treesize of output 11 [2019-05-15 10:30:57,639 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:57,641 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:57,642 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:57,642 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:57,650 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:57,650 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1269|]. (let ((.cse0 (select |v_#memory_int_1269| ULTIMATE.start_main_p1))) (and (= 36 .cse0) (= |#memory_int| (store |v_#memory_int_1269| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:57,650 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:30:57,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 16 treesize of output 11 [2019-05-15 10:30:57,691 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:57,693 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:57,693 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:57,693 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:57,700 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:57,700 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1270|]. (let ((.cse0 (select |v_#memory_int_1270| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1270| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 37 .cse0))) [2019-05-15 10:30:57,700 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:30:57,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 16 treesize of output 11 [2019-05-15 10:30:57,743 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:57,745 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:57,745 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:57,745 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:57,752 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:57,753 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1271|]. (let ((.cse0 (select |v_#memory_int_1271| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1271| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 38 .cse0))) [2019-05-15 10:30:57,753 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:30:57,792 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:57,793 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:57,795 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:57,795 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:57,796 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:57,803 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:57,803 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1272|]. (let ((.cse0 (select |v_#memory_int_1272| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1272| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 39 .cse0))) [2019-05-15 10:30:57,803 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:30:57,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:57,844 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:57,846 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:57,847 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:57,847 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:57,854 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:57,854 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1273|]. (let ((.cse0 (select |v_#memory_int_1273| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1273| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 40))) [2019-05-15 10:30:57,854 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:30:57,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:57,896 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:57,898 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:57,898 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:57,898 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:57,904 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:57,905 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1274|]. (let ((.cse0 (select |v_#memory_int_1274| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1274| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 41 .cse0))) [2019-05-15 10:30:57,905 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:30:57,956 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:57,957 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:57,959 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:57,959 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:57,959 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:57,966 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:57,966 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1275|]. (let ((.cse0 (select |v_#memory_int_1275| ULTIMATE.start_main_p1))) (and (= 42 .cse0) (= (store |v_#memory_int_1275| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:57,966 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:30:58,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:58,011 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:58,013 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:58,013 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:58,014 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:58,022 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:58,022 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1276|]. (let ((.cse0 (select |v_#memory_int_1276| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1276| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 43))) [2019-05-15 10:30:58,022 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:30:58,063 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:58,064 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:58,066 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:58,066 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:58,066 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:58,073 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:58,074 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1277|]. (let ((.cse0 (select |v_#memory_int_1277| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1277| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 44))) [2019-05-15 10:30:58,074 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:30:58,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 16 treesize of output 11 [2019-05-15 10:30:58,117 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:58,119 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:58,119 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:58,119 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:58,127 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:58,127 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1278|]. (let ((.cse0 (select |v_#memory_int_1278| ULTIMATE.start_main_p1))) (and (= 45 .cse0) (= (store |v_#memory_int_1278| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:58,127 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:30:58,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:58,174 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:58,176 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:58,176 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:58,176 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:58,184 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:58,184 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1279|]. (let ((.cse0 (select |v_#memory_int_1279| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1279| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 46 .cse0))) [2019-05-15 10:30:58,184 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:30:58,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:58,233 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:58,235 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:58,235 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:58,235 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:58,244 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:58,244 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1280|]. (let ((.cse0 (select |v_#memory_int_1280| ULTIMATE.start_main_p1))) (and (= 47 .cse0) (= (store |v_#memory_int_1280| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:58,244 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:30:58,292 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:58,293 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:58,295 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:58,295 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:58,296 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:58,303 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:58,304 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1281|]. (let ((.cse0 (select |v_#memory_int_1281| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1281| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 48 .cse0))) [2019-05-15 10:30:58,304 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:30:58,345 INFO L273 TraceCheckUtils]: 0: Hoare triple {11284#true} havoc main_p1; {11284#true} is VALID [2019-05-15 10:30:58,346 INFO L273 TraceCheckUtils]: 1: Hoare triple {11284#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {11284#true} is VALID [2019-05-15 10:30:58,346 INFO L273 TraceCheckUtils]: 2: Hoare triple {11284#true} #memory_int := #memory_int[main_p1 := 0]; {11295#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:30:58,347 INFO L273 TraceCheckUtils]: 3: Hoare triple {11295#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11299#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:30:58,347 INFO L273 TraceCheckUtils]: 4: Hoare triple {11299#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11303#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:30:58,348 INFO L273 TraceCheckUtils]: 5: Hoare triple {11303#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11307#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:30:58,348 INFO L273 TraceCheckUtils]: 6: Hoare triple {11307#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11311#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:30:58,349 INFO L273 TraceCheckUtils]: 7: Hoare triple {11311#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11315#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:30:58,349 INFO L273 TraceCheckUtils]: 8: Hoare triple {11315#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11319#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:30:58,350 INFO L273 TraceCheckUtils]: 9: Hoare triple {11319#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11323#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:30:58,351 INFO L273 TraceCheckUtils]: 10: Hoare triple {11323#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11327#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:30:58,351 INFO L273 TraceCheckUtils]: 11: Hoare triple {11327#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11331#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:30:58,352 INFO L273 TraceCheckUtils]: 12: Hoare triple {11331#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11335#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:30:58,353 INFO L273 TraceCheckUtils]: 13: Hoare triple {11335#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11339#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:30:58,354 INFO L273 TraceCheckUtils]: 14: Hoare triple {11339#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11343#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:30:58,355 INFO L273 TraceCheckUtils]: 15: Hoare triple {11343#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11347#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:30:58,355 INFO L273 TraceCheckUtils]: 16: Hoare triple {11347#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11351#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:30:58,356 INFO L273 TraceCheckUtils]: 17: Hoare triple {11351#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11355#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:30:58,357 INFO L273 TraceCheckUtils]: 18: Hoare triple {11355#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11359#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:30:58,358 INFO L273 TraceCheckUtils]: 19: Hoare triple {11359#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11363#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:30:58,359 INFO L273 TraceCheckUtils]: 20: Hoare triple {11363#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11367#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:30:58,359 INFO L273 TraceCheckUtils]: 21: Hoare triple {11367#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11371#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:30:58,360 INFO L273 TraceCheckUtils]: 22: Hoare triple {11371#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11375#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:30:58,361 INFO L273 TraceCheckUtils]: 23: Hoare triple {11375#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11379#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:30:58,362 INFO L273 TraceCheckUtils]: 24: Hoare triple {11379#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11383#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:30:58,362 INFO L273 TraceCheckUtils]: 25: Hoare triple {11383#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11387#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:30:58,363 INFO L273 TraceCheckUtils]: 26: Hoare triple {11387#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11391#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:30:58,364 INFO L273 TraceCheckUtils]: 27: Hoare triple {11391#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11395#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:30:58,365 INFO L273 TraceCheckUtils]: 28: Hoare triple {11395#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11399#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:30:58,365 INFO L273 TraceCheckUtils]: 29: Hoare triple {11399#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11403#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:30:58,366 INFO L273 TraceCheckUtils]: 30: Hoare triple {11403#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11407#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:30:58,367 INFO L273 TraceCheckUtils]: 31: Hoare triple {11407#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11411#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:30:58,368 INFO L273 TraceCheckUtils]: 32: Hoare triple {11411#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11415#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:30:58,368 INFO L273 TraceCheckUtils]: 33: Hoare triple {11415#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11419#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:30:58,369 INFO L273 TraceCheckUtils]: 34: Hoare triple {11419#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11423#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:30:58,370 INFO L273 TraceCheckUtils]: 35: Hoare triple {11423#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11427#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:30:58,371 INFO L273 TraceCheckUtils]: 36: Hoare triple {11427#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11431#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:30:58,372 INFO L273 TraceCheckUtils]: 37: Hoare triple {11431#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11435#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:30:58,373 INFO L273 TraceCheckUtils]: 38: Hoare triple {11435#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11439#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:30:58,374 INFO L273 TraceCheckUtils]: 39: Hoare triple {11439#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11443#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:30:58,375 INFO L273 TraceCheckUtils]: 40: Hoare triple {11443#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11447#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:30:58,376 INFO L273 TraceCheckUtils]: 41: Hoare triple {11447#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11451#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:30:58,376 INFO L273 TraceCheckUtils]: 42: Hoare triple {11451#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11455#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:30:58,377 INFO L273 TraceCheckUtils]: 43: Hoare triple {11455#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11459#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:30:58,378 INFO L273 TraceCheckUtils]: 44: Hoare triple {11459#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11463#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:30:58,379 INFO L273 TraceCheckUtils]: 45: Hoare triple {11463#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11467#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:30:58,380 INFO L273 TraceCheckUtils]: 46: Hoare triple {11467#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11471#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:30:58,380 INFO L273 TraceCheckUtils]: 47: Hoare triple {11471#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11475#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:30:58,381 INFO L273 TraceCheckUtils]: 48: Hoare triple {11475#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11479#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:30:58,382 INFO L273 TraceCheckUtils]: 49: Hoare triple {11479#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11483#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:30:58,383 INFO L273 TraceCheckUtils]: 50: Hoare triple {11483#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11487#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:30:58,384 INFO L273 TraceCheckUtils]: 51: Hoare triple {11487#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11491#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:30:58,384 INFO L273 TraceCheckUtils]: 52: Hoare triple {11491#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} assume !(#memory_int[main_p1] >= 0); {11285#false} is VALID [2019-05-15 10:30:58,389 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:30:58,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:30:58,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-05-15 10:30:58,389 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 53 [2019-05-15 10:30:58,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:30:58,390 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states. [2019-05-15 10:30:58,472 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:30:58,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-05-15 10:30:58,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-05-15 10:30:58,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-05-15 10:30:58,474 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 52 states. [2019-05-15 10:31:04,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:31:04,253 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-05-15 10:31:04,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-05-15 10:31:04,253 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 53 [2019-05-15 10:31:04,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:31:04,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-05-15 10:31:04,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-05-15 10:31:04,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-05-15 10:31:04,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-05-15 10:31:04,255 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states and 56 transitions. [2019-05-15 10:31:04,304 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:04,305 INFO L225 Difference]: With dead ends: 55 [2019-05-15 10:31:04,305 INFO L226 Difference]: Without dead ends: 55 [2019-05-15 10:31:04,305 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-05-15 10:31:04,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-05-15 10:31:04,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-05-15 10:31:04,307 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:31:04,307 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 55 states. [2019-05-15 10:31:04,307 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2019-05-15 10:31:04,307 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2019-05-15 10:31:04,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:31:04,308 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-05-15 10:31:04,308 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-05-15 10:31:04,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:31:04,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:31:04,309 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2019-05-15 10:31:04,309 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2019-05-15 10:31:04,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:31:04,310 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-05-15 10:31:04,310 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-05-15 10:31:04,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:31:04,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:31:04,310 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:31:04,310 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:31:04,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-05-15 10:31:04,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-05-15 10:31:04,311 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-05-15 10:31:04,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:31:04,311 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-05-15 10:31:04,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-05-15 10:31:04,311 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-05-15 10:31:04,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-05-15 10:31:04,312 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:31:04,312 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1, 1] [2019-05-15 10:31:04,312 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:31:04,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:31:04,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1319026888, now seen corresponding path program 50 times [2019-05-15 10:31:04,313 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:31:04,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:31:04,329 WARN L254 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 52 conjunts are in the unsatisfiable core [2019-05-15 10:31:04,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:31:04,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:31:04,414 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:04,414 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:04,419 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:04,420 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:04,420 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:31:04,421 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:04,422 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1282|]. (= |#memory_int| (store |v_#memory_int_1282| ULTIMATE.start_main_p1 0)) [2019-05-15 10:31:04,422 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:31:04,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 16 treesize of output 11 [2019-05-15 10:31:04,434 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:04,436 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:04,436 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:04,437 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:04,445 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:04,445 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1283|]. (let ((.cse0 (select |v_#memory_int_1283| ULTIMATE.start_main_p1))) (and (= 0 .cse0) (= (store |v_#memory_int_1283| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:04,445 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:31:04,456 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:04,457 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:04,459 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:04,459 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:04,460 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:04,468 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:04,469 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1284|]. (let ((.cse0 (select |v_#memory_int_1284| ULTIMATE.start_main_p1))) (and (= .cse0 1) (= (store |v_#memory_int_1284| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:04,469 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:31:04,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 16 treesize of output 11 [2019-05-15 10:31:04,482 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:04,483 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:04,483 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:04,483 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:04,489 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:04,490 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1285|]. (let ((.cse0 (select |v_#memory_int_1285| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1285| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 2 .cse0))) [2019-05-15 10:31:04,490 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:31:04,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 16 treesize of output 11 [2019-05-15 10:31:04,502 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:04,504 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:04,505 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:04,505 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:04,513 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:04,513 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1286|]. (let ((.cse0 (select |v_#memory_int_1286| ULTIMATE.start_main_p1))) (and (= .cse0 3) (= (store |v_#memory_int_1286| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:04,513 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:31:04,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 16 treesize of output 11 [2019-05-15 10:31:04,528 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:04,530 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:04,530 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:04,531 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:04,539 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:04,539 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1287|]. (let ((.cse0 (select |v_#memory_int_1287| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1287| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 4))) [2019-05-15 10:31:04,539 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:31:04,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 16 treesize of output 11 [2019-05-15 10:31:04,553 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:04,556 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:04,556 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:04,556 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:04,564 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:04,565 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1288|]. (let ((.cse0 (select |v_#memory_int_1288| ULTIMATE.start_main_p1))) (and (= 5 .cse0) (= (store |v_#memory_int_1288| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:04,565 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:31:04,580 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:04,581 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:04,583 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:04,584 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:04,584 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:04,592 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:04,592 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1289|]. (let ((.cse0 (select |v_#memory_int_1289| ULTIMATE.start_main_p1))) (and (= 6 .cse0) (= (store |v_#memory_int_1289| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:04,592 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:31:04,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 16 treesize of output 11 [2019-05-15 10:31:04,609 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:04,611 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:04,612 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:04,612 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:04,620 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:04,621 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1290|]. (let ((.cse0 (select |v_#memory_int_1290| ULTIMATE.start_main_p1))) (and (= 7 .cse0) (= (store |v_#memory_int_1290| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:04,621 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:31:04,636 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:04,637 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:04,639 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:04,640 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:04,640 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:04,648 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:04,649 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1291|]. (let ((.cse0 (select |v_#memory_int_1291| ULTIMATE.start_main_p1))) (and (= 8 .cse0) (= (store |v_#memory_int_1291| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:04,649 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:31:04,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:04,668 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:04,671 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:04,671 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:04,671 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:04,678 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:04,678 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1292|]. (let ((.cse0 (select |v_#memory_int_1292| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1292| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 9 .cse0))) [2019-05-15 10:31:04,678 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:31:04,694 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:04,695 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:04,698 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:04,698 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:04,698 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:04,707 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:04,707 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1293|]. (let ((.cse0 (select |v_#memory_int_1293| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1293| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 10))) [2019-05-15 10:31:04,707 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:31:04,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 16 treesize of output 11 [2019-05-15 10:31:04,727 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:04,729 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:04,729 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:04,729 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:04,736 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:04,736 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1294|]. (let ((.cse0 (select |v_#memory_int_1294| ULTIMATE.start_main_p1))) (and (= 11 .cse0) (= (store |v_#memory_int_1294| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:04,736 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:31:04,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:04,756 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:04,758 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:04,758 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:04,759 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:04,766 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:04,766 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1295|]. (let ((.cse0 (select |v_#memory_int_1295| ULTIMATE.start_main_p1))) (and (= 12 .cse0) (= (store |v_#memory_int_1295| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:04,766 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:31:04,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 16 treesize of output 11 [2019-05-15 10:31:04,789 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:04,792 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:04,792 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:04,792 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:04,800 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:04,800 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1296|]. (let ((.cse0 (select |v_#memory_int_1296| ULTIMATE.start_main_p1))) (and (= 13 .cse0) (= (store |v_#memory_int_1296| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:04,801 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:31:04,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 16 treesize of output 11 [2019-05-15 10:31:04,822 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:04,824 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:04,825 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:04,825 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:04,833 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:04,833 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1297|]. (let ((.cse0 (select |v_#memory_int_1297| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1297| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 14))) [2019-05-15 10:31:04,833 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:31:04,856 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:04,857 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:04,859 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:04,860 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:04,860 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:04,868 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:04,868 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1298|]. (let ((.cse0 (select |v_#memory_int_1298| ULTIMATE.start_main_p1))) (and (= 15 .cse0) (= (store |v_#memory_int_1298| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:04,868 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:31:04,890 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:04,891 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:04,894 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:04,894 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:04,894 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:04,903 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:04,903 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1299|]. (let ((.cse0 (select |v_#memory_int_1299| ULTIMATE.start_main_p1))) (and (= .cse0 16) (= (store |v_#memory_int_1299| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:04,903 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:31:04,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 16 treesize of output 11 [2019-05-15 10:31:04,928 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:04,931 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:04,931 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:04,931 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:04,939 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:04,940 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1300|]. (let ((.cse0 (select |v_#memory_int_1300| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1300| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 17 .cse0))) [2019-05-15 10:31:04,940 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:31:04,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 16 treesize of output 11 [2019-05-15 10:31:04,967 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:04,970 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:04,970 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:04,970 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:04,976 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:04,977 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1301|]. (let ((.cse0 (select |v_#memory_int_1301| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1301| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 18))) [2019-05-15 10:31:04,977 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:31:05,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 16 treesize of output 11 [2019-05-15 10:31:05,003 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:05,005 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:05,006 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:05,006 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:05,012 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:05,013 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1302|]. (let ((.cse0 (select |v_#memory_int_1302| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1302| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 19))) [2019-05-15 10:31:05,013 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:31:05,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 16 treesize of output 11 [2019-05-15 10:31:05,049 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:05,052 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:05,052 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:05,053 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:05,061 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:05,061 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1303|]. (let ((.cse0 (select |v_#memory_int_1303| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1303| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 20))) [2019-05-15 10:31:05,061 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:31:05,088 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:05,089 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:05,092 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:05,092 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:05,092 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:05,099 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:05,100 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1304|]. (let ((.cse0 (select |v_#memory_int_1304| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1304| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 21 .cse0))) [2019-05-15 10:31:05,100 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:31:05,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 16 treesize of output 11 [2019-05-15 10:31:05,131 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:05,134 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:05,134 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:05,134 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:05,142 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:05,142 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1305|]. (let ((.cse0 (select |v_#memory_int_1305| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1305| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 22 .cse0))) [2019-05-15 10:31:05,142 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:31:05,170 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:05,171 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:05,173 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:05,173 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:05,174 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:05,180 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:05,181 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1306|]. (let ((.cse0 (select |v_#memory_int_1306| ULTIMATE.start_main_p1))) (and (= 23 .cse0) (= (store |v_#memory_int_1306| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:05,181 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:31:05,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:05,209 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:05,212 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:05,212 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:05,212 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:05,221 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:05,221 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1307|]. (let ((.cse0 (select |v_#memory_int_1307| ULTIMATE.start_main_p1))) (and (= .cse0 24) (= |#memory_int| (store |v_#memory_int_1307| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:05,221 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:31:05,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 16 treesize of output 11 [2019-05-15 10:31:05,255 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:05,258 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:05,258 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:05,259 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:05,267 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:05,267 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1308|]. (let ((.cse0 (select |v_#memory_int_1308| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1308| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 25))) [2019-05-15 10:31:05,267 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:31:05,300 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:05,302 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:05,304 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:05,305 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:05,305 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:05,312 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:05,313 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1309|]. (let ((.cse0 (select |v_#memory_int_1309| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1309| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 26 .cse0))) [2019-05-15 10:31:05,313 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:31:05,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:05,366 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:05,367 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:05,368 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:05,368 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:05,376 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:05,376 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1310|]. (let ((.cse0 (select |v_#memory_int_1310| ULTIMATE.start_main_p1))) (and (= .cse0 27) (= (store |v_#memory_int_1310| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:05,377 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:31:05,411 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:05,412 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:05,415 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:05,416 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:05,416 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:05,425 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:05,425 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1311|]. (let ((.cse0 (select |v_#memory_int_1311| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1311| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 28))) [2019-05-15 10:31:05,425 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:31:05,462 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:05,463 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:05,466 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:05,466 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:05,466 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:05,475 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:05,476 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1312|]. (let ((.cse0 (select |v_#memory_int_1312| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1312| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 29 .cse0))) [2019-05-15 10:31:05,476 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:31:05,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 16 treesize of output 11 [2019-05-15 10:31:05,528 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:05,532 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:05,532 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:05,532 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:05,541 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:05,542 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1313|]. (let ((.cse0 (select |v_#memory_int_1313| ULTIMATE.start_main_p1))) (and (= .cse0 30) (= (store |v_#memory_int_1313| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:05,542 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:31:05,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 16 treesize of output 11 [2019-05-15 10:31:05,680 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:05,685 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:05,685 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:05,685 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:05,692 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:05,693 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1314|]. (let ((.cse0 (select |v_#memory_int_1314| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1314| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 31 .cse0))) [2019-05-15 10:31:05,693 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:31:05,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:05,759 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:05,761 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:05,762 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:05,762 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:05,770 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:05,770 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1315|]. (let ((.cse0 (select |v_#memory_int_1315| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1315| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 32))) [2019-05-15 10:31:05,770 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:31:05,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:05,809 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:05,811 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:05,811 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:05,812 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:05,819 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:05,819 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1316|]. (let ((.cse0 (select |v_#memory_int_1316| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1316| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 33 .cse0))) [2019-05-15 10:31:05,819 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:31:05,854 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:05,856 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:05,858 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:05,858 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:05,859 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:05,867 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:05,867 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1317|]. (let ((.cse0 (select |v_#memory_int_1317| ULTIMATE.start_main_p1))) (and (= 34 .cse0) (= (store |v_#memory_int_1317| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:05,867 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:31:05,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 16 treesize of output 11 [2019-05-15 10:31:05,911 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:05,914 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:05,914 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:05,915 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:05,923 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:05,923 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1318|]. (let ((.cse0 (select |v_#memory_int_1318| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1318| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 35 .cse0))) [2019-05-15 10:31:05,923 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:31:05,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 16 treesize of output 11 [2019-05-15 10:31:05,961 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:05,964 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:05,964 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:05,964 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:05,973 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:05,973 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1319|]. (let ((.cse0 (select |v_#memory_int_1319| ULTIMATE.start_main_p1))) (and (= .cse0 36) (= |#memory_int| (store |v_#memory_int_1319| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:05,973 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:31:06,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:06,017 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:06,018 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:06,019 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:06,019 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:06,026 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:06,026 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1320|]. (let ((.cse0 (select |v_#memory_int_1320| ULTIMATE.start_main_p1))) (and (= .cse0 37) (= (store |v_#memory_int_1320| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:06,026 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:31:06,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 16 treesize of output 11 [2019-05-15 10:31:06,069 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:06,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:06,072 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:06,072 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:06,079 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:06,079 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1321|]. (let ((.cse0 (select |v_#memory_int_1321| ULTIMATE.start_main_p1))) (and (= .cse0 38) (= |#memory_int| (store |v_#memory_int_1321| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:06,079 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:31:06,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 16 treesize of output 11 [2019-05-15 10:31:06,126 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:06,128 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:06,128 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:06,128 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:06,136 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:06,136 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1322|]. (let ((.cse0 (select |v_#memory_int_1322| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1322| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 39 .cse0))) [2019-05-15 10:31:06,136 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:31:06,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 16 treesize of output 11 [2019-05-15 10:31:06,190 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:06,192 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:06,192 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:06,193 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:06,200 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:06,201 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1323|]. (let ((.cse0 (select |v_#memory_int_1323| ULTIMATE.start_main_p1))) (and (= .cse0 40) (= (store |v_#memory_int_1323| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:06,201 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:31:06,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 16 treesize of output 11 [2019-05-15 10:31:06,246 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:06,248 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:06,248 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:06,248 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:06,257 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:06,257 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1324|]. (let ((.cse0 (select |v_#memory_int_1324| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1324| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 41))) [2019-05-15 10:31:06,257 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:31:06,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 16 treesize of output 11 [2019-05-15 10:31:06,302 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:06,304 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:06,304 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:06,305 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:06,313 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:06,313 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1325|]. (let ((.cse0 (select |v_#memory_int_1325| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1325| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 42))) [2019-05-15 10:31:06,313 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:31:06,357 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:06,358 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:06,360 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:06,360 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:06,360 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:06,369 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:06,369 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1326|]. (let ((.cse0 (select |v_#memory_int_1326| ULTIMATE.start_main_p1))) (and (= 43 .cse0) (= (store |v_#memory_int_1326| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:06,369 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:31:06,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 16 treesize of output 11 [2019-05-15 10:31:06,414 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:06,416 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:06,416 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:06,417 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:06,424 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:06,425 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1327|]. (let ((.cse0 (select |v_#memory_int_1327| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1327| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 44 .cse0))) [2019-05-15 10:31:06,425 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:31:06,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 16 treesize of output 11 [2019-05-15 10:31:06,470 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:06,472 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:06,472 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:06,472 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:06,481 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:06,481 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1328|]. (let ((.cse0 (select |v_#memory_int_1328| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1328| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 45))) [2019-05-15 10:31:06,481 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:31:06,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 16 treesize of output 11 [2019-05-15 10:31:06,527 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:06,529 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:06,530 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:06,530 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:06,538 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:06,538 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1329|]. (let ((.cse0 (select |v_#memory_int_1329| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1329| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 46))) [2019-05-15 10:31:06,538 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:31: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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:06,588 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:06,591 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:06,591 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:06,591 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:06,599 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:06,599 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1330|]. (let ((.cse0 (select |v_#memory_int_1330| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1330| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 47 .cse0))) [2019-05-15 10:31:06,599 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:31:06,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 16 treesize of output 11 [2019-05-15 10:31:06,653 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:06,655 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:06,656 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:06,656 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:06,664 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:06,665 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1331|]. (let ((.cse0 (select |v_#memory_int_1331| ULTIMATE.start_main_p1))) (and (= 48 .cse0) (= (store |v_#memory_int_1331| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:06,665 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:31:06,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:06,713 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:06,716 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:06,716 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:06,716 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:06,724 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:06,724 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1332|]. (let ((.cse0 (select |v_#memory_int_1332| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1332| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 49 .cse0))) [2019-05-15 10:31:06,725 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:31:06,767 INFO L273 TraceCheckUtils]: 0: Hoare triple {11714#true} havoc main_p1; {11714#true} is VALID [2019-05-15 10:31:06,768 INFO L273 TraceCheckUtils]: 1: Hoare triple {11714#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {11714#true} is VALID [2019-05-15 10:31:06,769 INFO L273 TraceCheckUtils]: 2: Hoare triple {11714#true} #memory_int := #memory_int[main_p1 := 0]; {11725#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:31:06,769 INFO L273 TraceCheckUtils]: 3: Hoare triple {11725#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11729#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:31:06,770 INFO L273 TraceCheckUtils]: 4: Hoare triple {11729#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11733#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:31:06,771 INFO L273 TraceCheckUtils]: 5: Hoare triple {11733#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11737#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:31:06,772 INFO L273 TraceCheckUtils]: 6: Hoare triple {11737#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11741#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:31:06,773 INFO L273 TraceCheckUtils]: 7: Hoare triple {11741#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11745#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:31:06,773 INFO L273 TraceCheckUtils]: 8: Hoare triple {11745#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11749#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:31:06,774 INFO L273 TraceCheckUtils]: 9: Hoare triple {11749#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11753#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:31:06,775 INFO L273 TraceCheckUtils]: 10: Hoare triple {11753#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11757#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:31:06,776 INFO L273 TraceCheckUtils]: 11: Hoare triple {11757#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11761#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:31:06,777 INFO L273 TraceCheckUtils]: 12: Hoare triple {11761#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11765#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:31:06,778 INFO L273 TraceCheckUtils]: 13: Hoare triple {11765#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11769#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:31:06,778 INFO L273 TraceCheckUtils]: 14: Hoare triple {11769#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11773#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:31:06,779 INFO L273 TraceCheckUtils]: 15: Hoare triple {11773#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11777#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:31:06,780 INFO L273 TraceCheckUtils]: 16: Hoare triple {11777#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11781#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:31:06,781 INFO L273 TraceCheckUtils]: 17: Hoare triple {11781#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11785#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:31:06,782 INFO L273 TraceCheckUtils]: 18: Hoare triple {11785#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11789#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:31:06,782 INFO L273 TraceCheckUtils]: 19: Hoare triple {11789#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11793#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:31:06,783 INFO L273 TraceCheckUtils]: 20: Hoare triple {11793#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11797#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:31:06,784 INFO L273 TraceCheckUtils]: 21: Hoare triple {11797#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11801#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:31:06,785 INFO L273 TraceCheckUtils]: 22: Hoare triple {11801#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11805#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:31:06,786 INFO L273 TraceCheckUtils]: 23: Hoare triple {11805#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11809#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:31:06,786 INFO L273 TraceCheckUtils]: 24: Hoare triple {11809#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11813#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:31:06,787 INFO L273 TraceCheckUtils]: 25: Hoare triple {11813#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11817#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:31:06,788 INFO L273 TraceCheckUtils]: 26: Hoare triple {11817#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11821#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:31:06,789 INFO L273 TraceCheckUtils]: 27: Hoare triple {11821#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11825#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:31:06,790 INFO L273 TraceCheckUtils]: 28: Hoare triple {11825#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11829#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:31:06,791 INFO L273 TraceCheckUtils]: 29: Hoare triple {11829#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11833#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:31:06,791 INFO L273 TraceCheckUtils]: 30: Hoare triple {11833#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11837#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:31:06,792 INFO L273 TraceCheckUtils]: 31: Hoare triple {11837#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11841#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:31:06,793 INFO L273 TraceCheckUtils]: 32: Hoare triple {11841#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11845#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:31:06,794 INFO L273 TraceCheckUtils]: 33: Hoare triple {11845#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11849#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:31:06,795 INFO L273 TraceCheckUtils]: 34: Hoare triple {11849#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11853#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:31:06,796 INFO L273 TraceCheckUtils]: 35: Hoare triple {11853#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11857#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:31:06,796 INFO L273 TraceCheckUtils]: 36: Hoare triple {11857#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11861#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:31:06,797 INFO L273 TraceCheckUtils]: 37: Hoare triple {11861#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11865#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:31:06,798 INFO L273 TraceCheckUtils]: 38: Hoare triple {11865#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11869#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:31:06,799 INFO L273 TraceCheckUtils]: 39: Hoare triple {11869#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11873#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:31:06,800 INFO L273 TraceCheckUtils]: 40: Hoare triple {11873#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11877#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:31:06,800 INFO L273 TraceCheckUtils]: 41: Hoare triple {11877#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11881#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:31:06,801 INFO L273 TraceCheckUtils]: 42: Hoare triple {11881#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11885#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:31:06,802 INFO L273 TraceCheckUtils]: 43: Hoare triple {11885#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11889#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:31:06,803 INFO L273 TraceCheckUtils]: 44: Hoare triple {11889#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11893#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:31:06,804 INFO L273 TraceCheckUtils]: 45: Hoare triple {11893#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11897#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:31:06,805 INFO L273 TraceCheckUtils]: 46: Hoare triple {11897#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11901#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:31:06,806 INFO L273 TraceCheckUtils]: 47: Hoare triple {11901#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11905#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:31:06,807 INFO L273 TraceCheckUtils]: 48: Hoare triple {11905#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11909#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:31:06,807 INFO L273 TraceCheckUtils]: 49: Hoare triple {11909#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11913#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:31:06,808 INFO L273 TraceCheckUtils]: 50: Hoare triple {11913#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11917#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:31:06,809 INFO L273 TraceCheckUtils]: 51: Hoare triple {11917#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11921#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:31:06,810 INFO L273 TraceCheckUtils]: 52: Hoare triple {11921#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11925#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:31:06,810 INFO L273 TraceCheckUtils]: 53: Hoare triple {11925#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} assume !(#memory_int[main_p1] >= 0); {11715#false} is VALID [2019-05-15 10:31:06,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:31:06,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:31:06,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-05-15 10:31:06,816 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 54 [2019-05-15 10:31:06,816 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:31:06,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 53 states. [2019-05-15 10:31:06,868 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:31:06,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-05-15 10:31:06,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-05-15 10:31:06,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-05-15 10:31:06,869 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 53 states. [2019-05-15 10:31:12,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:31:12,931 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-05-15 10:31:12,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-05-15 10:31:12,931 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 54 [2019-05-15 10:31:12,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:31:12,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-05-15 10:31:12,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-05-15 10:31:12,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-05-15 10:31:12,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-05-15 10:31:12,933 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 53 states and 57 transitions. [2019-05-15 10:31:12,982 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:31:12,983 INFO L225 Difference]: With dead ends: 56 [2019-05-15 10:31:12,983 INFO L226 Difference]: Without dead ends: 56 [2019-05-15 10:31:12,984 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-05-15 10:31:12,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-05-15 10:31:12,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-05-15 10:31:12,986 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:31:12,986 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 56 states. [2019-05-15 10:31:12,986 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2019-05-15 10:31:12,986 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2019-05-15 10:31:12,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:31:12,987 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-05-15 10:31:12,987 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-05-15 10:31:12,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:31:12,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:31:12,987 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2019-05-15 10:31:12,987 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2019-05-15 10:31:12,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:31:12,988 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-05-15 10:31:12,988 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-05-15 10:31:12,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:31:12,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:31:12,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:31:12,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:31:12,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-05-15 10:31:12,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-05-15 10:31:12,989 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-05-15 10:31:12,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:31:12,990 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-05-15 10:31:12,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-05-15 10:31:12,990 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-05-15 10:31:12,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-05-15 10:31:12,990 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:31:12,990 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1, 1] [2019-05-15 10:31:12,990 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:31:12,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:31:12,991 INFO L82 PathProgramCache]: Analyzing trace with hash -2059839486, now seen corresponding path program 51 times [2019-05-15 10:31:12,991 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:31:13,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:31:13,010 WARN L254 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 53 conjunts are in the unsatisfiable core [2019-05-15 10:31:13,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:31:13,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:31:13,151 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,151 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 0, result has 100.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:6, output treesize:5 [2019-05-15 10:31:13,158 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:13,158 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1333|]. (= (store |v_#memory_int_1333| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:31:13,158 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:31:13,169 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:13,170 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:13,172 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:13,172 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,173 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:13,181 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:13,181 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1334|]. (let ((.cse0 (select |v_#memory_int_1334| ULTIMATE.start_main_p1))) (and (= 0 .cse0) (= |#memory_int| (store |v_#memory_int_1334| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:13,181 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:31:13,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:13,192 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:13,194 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:13,194 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,195 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:13,202 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:13,202 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1335|]. (let ((.cse0 (select |v_#memory_int_1335| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1335| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 1 .cse0))) [2019-05-15 10:31:13,203 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:31:13,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:13,215 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:13,217 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:13,217 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,217 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:13,225 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:13,225 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1336|]. (let ((.cse0 (select |v_#memory_int_1336| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1336| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 2 .cse0))) [2019-05-15 10:31:13,225 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:31:13,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 16 treesize of output 11 [2019-05-15 10:31:13,239 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:13,241 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:13,241 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,241 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:13,250 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:13,250 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1337|]. (let ((.cse0 (select |v_#memory_int_1337| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1337| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 3 .cse0))) [2019-05-15 10:31:13,250 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:31:13,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 16 treesize of output 11 [2019-05-15 10:31:13,264 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:13,266 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:13,266 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,266 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:13,275 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:13,275 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1338|]. (let ((.cse0 (select |v_#memory_int_1338| ULTIMATE.start_main_p1))) (and (= .cse0 4) (= (store |v_#memory_int_1338| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:13,276 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:31:13,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:13,290 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:13,292 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:13,293 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,293 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:13,300 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:13,301 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1339|]. (let ((.cse0 (select |v_#memory_int_1339| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1339| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 5))) [2019-05-15 10:31:13,301 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:31:13,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 16 treesize of output 11 [2019-05-15 10:31:13,315 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:13,317 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:13,318 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,318 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:13,327 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:13,328 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1340|]. (let ((.cse0 (select |v_#memory_int_1340| ULTIMATE.start_main_p1))) (and (= .cse0 6) (= (store |v_#memory_int_1340| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:13,328 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:31:13,345 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:13,346 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:13,348 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:13,348 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,348 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:13,356 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:13,356 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1341|]. (let ((.cse0 (select |v_#memory_int_1341| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1341| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 7))) [2019-05-15 10:31:13,356 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:31:13,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 16 treesize of output 11 [2019-05-15 10:31:13,374 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:13,377 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:13,377 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,377 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:13,385 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:13,385 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1342|]. (let ((.cse0 (select |v_#memory_int_1342| ULTIMATE.start_main_p1))) (and (= 8 .cse0) (= (store |v_#memory_int_1342| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:13,386 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:31:13,402 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:13,403 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:13,406 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:13,406 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,406 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:13,413 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:13,414 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1343|]. (let ((.cse0 (select |v_#memory_int_1343| ULTIMATE.start_main_p1))) (and (= .cse0 9) (= (store |v_#memory_int_1343| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:13,414 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:31:13,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 16 treesize of output 11 [2019-05-15 10:31:13,432 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:13,435 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:13,435 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,435 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:13,443 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:13,443 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1344|]. (let ((.cse0 (select |v_#memory_int_1344| ULTIMATE.start_main_p1))) (and (= .cse0 10) (= (store |v_#memory_int_1344| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:13,444 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:31:13,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:13,464 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:13,466 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:13,466 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,467 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:13,475 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:13,475 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1345|]. (let ((.cse0 (select |v_#memory_int_1345| ULTIMATE.start_main_p1))) (and (= .cse0 11) (= (store |v_#memory_int_1345| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:13,475 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:31:13,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 16 treesize of output 11 [2019-05-15 10:31:13,496 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:13,498 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:13,499 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,499 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:13,507 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:13,507 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1346|]. (let ((.cse0 (select |v_#memory_int_1346| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1346| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 12))) [2019-05-15 10:31:13,507 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:31:13,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 16 treesize of output 11 [2019-05-15 10:31:13,531 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:13,532 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:13,532 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,532 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:13,540 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:13,540 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1347|]. (let ((.cse0 (select |v_#memory_int_1347| ULTIMATE.start_main_p1))) (and (= 13 .cse0) (= (store |v_#memory_int_1347| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:13,541 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:31:13,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:13,562 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:13,564 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:13,564 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,565 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:13,572 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:13,572 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1348|]. (let ((.cse0 (select |v_#memory_int_1348| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1348| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 14 .cse0))) [2019-05-15 10:31:13,572 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:31:13,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:13,596 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:13,598 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:13,599 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,599 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:13,606 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:13,606 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1349|]. (let ((.cse0 (select |v_#memory_int_1349| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1349| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 15 .cse0))) [2019-05-15 10:31:13,606 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:31:13,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:13,637 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:13,638 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:13,639 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,639 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:13,658 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:13,659 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1350|]. (let ((.cse0 (select |v_#memory_int_1350| ULTIMATE.start_main_p1))) (and (= .cse0 16) (= |#memory_int| (store |v_#memory_int_1350| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:13,659 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:31:13,732 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:13,733 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:13,735 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:13,736 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,736 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:13,742 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:13,742 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1351|]. (let ((.cse0 (select |v_#memory_int_1351| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1351| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 17))) [2019-05-15 10:31:13,743 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:31:13,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 16 treesize of output 11 [2019-05-15 10:31:13,766 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:13,768 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:13,769 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,769 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:13,776 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:13,777 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1352|]. (let ((.cse0 (select |v_#memory_int_1352| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1352| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 18))) [2019-05-15 10:31:13,777 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:31:13,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 16 treesize of output 11 [2019-05-15 10:31:13,801 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:13,803 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:13,803 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,803 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:13,811 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:13,812 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1353|]. (let ((.cse0 (select |v_#memory_int_1353| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1353| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 19 .cse0))) [2019-05-15 10:31:13,812 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:31:13,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 16 treesize of output 11 [2019-05-15 10:31:13,839 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:13,841 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:13,842 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,842 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:13,849 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:13,849 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1354|]. (let ((.cse0 (select |v_#memory_int_1354| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1354| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 20 .cse0))) [2019-05-15 10:31:13,849 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:31:13,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:13,875 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:13,877 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:13,878 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,878 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:13,885 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:13,886 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1355|]. (let ((.cse0 (select |v_#memory_int_1355| ULTIMATE.start_main_p1))) (and (= .cse0 21) (= |#memory_int| (store |v_#memory_int_1355| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:13,886 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:31:13,912 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:13,913 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:13,914 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:13,914 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,915 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [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,921 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1356|]. (let ((.cse0 (select |v_#memory_int_1356| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1356| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 22))) [2019-05-15 10:31:13,921 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:31:13,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 16 treesize of output 11 [2019-05-15 10:31:13,952 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:13,954 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:13,954 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,954 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:13,963 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:13,963 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1357|]. (let ((.cse0 (select |v_#memory_int_1357| ULTIMATE.start_main_p1))) (and (= .cse0 23) (= (store |v_#memory_int_1357| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:13,963 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:31:13,992 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:13,993 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:13,996 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:13,996 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,996 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:14,004 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:14,004 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1358|]. (let ((.cse0 (select |v_#memory_int_1358| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1358| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 24 .cse0))) [2019-05-15 10:31:14,004 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:31:14,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 16 treesize of output 11 [2019-05-15 10:31:14,033 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:14,035 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:14,036 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:14,036 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:14,043 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:14,044 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1359|]. (let ((.cse0 (select |v_#memory_int_1359| ULTIMATE.start_main_p1))) (and (= 25 .cse0) (= (store |v_#memory_int_1359| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:14,044 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:31: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 16 treesize of output 11 [2019-05-15 10:31:14,076 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:14,078 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:14,078 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:14,079 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:14,085 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:14,086 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1360|]. (let ((.cse0 (select |v_#memory_int_1360| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1360| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 26))) [2019-05-15 10:31:14,086 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:31:14,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 16 treesize of output 11 [2019-05-15 10:31:14,116 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:14,118 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:14,119 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:14,119 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:14,129 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:14,129 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1361|]. (let ((.cse0 (select |v_#memory_int_1361| ULTIMATE.start_main_p1))) (and (= 27 .cse0) (= (store |v_#memory_int_1361| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:14,129 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:31:14,161 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:14,162 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:14,164 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:14,164 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:14,164 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:14,172 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:14,173 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1362|]. (let ((.cse0 (select |v_#memory_int_1362| ULTIMATE.start_main_p1))) (and (= 28 .cse0) (= |#memory_int| (store |v_#memory_int_1362| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:14,173 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:31:14,211 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:14,223 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:14,225 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:14,225 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:14,225 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:14,231 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:14,231 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1363|]. (let ((.cse0 (select |v_#memory_int_1363| ULTIMATE.start_main_p1))) (and (= .cse0 29) (= (store |v_#memory_int_1363| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:14,231 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:31:14,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 16 treesize of output 11 [2019-05-15 10:31:14,266 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:14,269 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:14,269 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:14,269 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:14,277 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:14,277 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1364|]. (let ((.cse0 (select |v_#memory_int_1364| ULTIMATE.start_main_p1))) (and (= .cse0 30) (= |#memory_int| (store |v_#memory_int_1364| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:14,277 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:31:14,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 16 treesize of output 11 [2019-05-15 10:31:14,313 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:14,315 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:14,315 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:14,316 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:14,325 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:14,325 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1365|]. (let ((.cse0 (select |v_#memory_int_1365| ULTIMATE.start_main_p1))) (and (= .cse0 31) (= (store |v_#memory_int_1365| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:14,325 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:31:14,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 16 treesize of output 11 [2019-05-15 10:31:14,362 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:14,364 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:14,364 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:14,364 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:14,372 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:14,373 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1366|]. (let ((.cse0 (select |v_#memory_int_1366| ULTIMATE.start_main_p1))) (and (= .cse0 32) (= (store |v_#memory_int_1366| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:14,373 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:31:14,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 16 treesize of output 11 [2019-05-15 10:31:14,411 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:14,413 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:14,413 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:14,413 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:14,421 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:14,421 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1367|]. (let ((.cse0 (select |v_#memory_int_1367| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1367| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 33))) [2019-05-15 10:31:14,421 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:31:14,456 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:14,457 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:14,459 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:14,460 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:14,460 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:14,467 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:14,467 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1368|]. (let ((.cse0 (select |v_#memory_int_1368| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1368| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 34))) [2019-05-15 10:31:14,467 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:31:14,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:14,505 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:14,507 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:14,508 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:14,508 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:14,515 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:14,515 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1369|]. (let ((.cse0 (select |v_#memory_int_1369| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1369| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 35 .cse0))) [2019-05-15 10:31:14,515 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:31:14,563 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:14,564 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:14,566 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:14,566 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:14,566 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:14,573 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:14,573 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1370|]. (let ((.cse0 (select |v_#memory_int_1370| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1370| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 36))) [2019-05-15 10:31:14,574 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:31:14,612 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:14,613 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:14,615 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:14,615 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:14,615 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:14,623 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:14,623 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1371|]. (let ((.cse0 (select |v_#memory_int_1371| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1371| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 37))) [2019-05-15 10:31:14,623 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:31:14,662 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:14,662 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:14,664 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:14,665 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:14,665 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:14,671 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:14,671 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1372|]. (let ((.cse0 (select |v_#memory_int_1372| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1372| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 38))) [2019-05-15 10:31:14,671 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:31:14,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:14,713 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:14,715 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:14,716 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:14,716 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:14,723 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:14,723 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1373|]. (let ((.cse0 (select |v_#memory_int_1373| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1373| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 39 .cse0))) [2019-05-15 10:31:14,724 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:31:14,763 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:14,764 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:14,767 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:14,767 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:14,767 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:14,775 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:14,775 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1374|]. (let ((.cse0 (select |v_#memory_int_1374| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1374| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 40 .cse0))) [2019-05-15 10:31:14,775 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:31:14,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 16 treesize of output 11 [2019-05-15 10:31:14,819 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:14,821 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:14,821 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:14,821 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:14,829 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:14,830 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1375|]. (let ((.cse0 (select |v_#memory_int_1375| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1375| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 41))) [2019-05-15 10:31:14,830 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:31: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 16 treesize of output 11 [2019-05-15 10:31:14,911 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:14,944 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:14,944 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:14,944 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:14,956 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:14,957 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1376|]. (let ((.cse0 (select |v_#memory_int_1376| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1376| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 42 .cse0))) [2019-05-15 10:31:14,957 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:31:15,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 16 treesize of output 11 [2019-05-15 10:31:15,044 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:15,046 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:15,047 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:15,047 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:15,055 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:15,055 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1377|]. (let ((.cse0 (select |v_#memory_int_1377| ULTIMATE.start_main_p1))) (and (= 43 .cse0) (= (store |v_#memory_int_1377| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:15,055 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:31:15,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 16 treesize of output 11 [2019-05-15 10:31:15,099 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:15,101 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:15,101 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:15,101 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:15,109 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:15,110 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1378|]. (let ((.cse0 (select |v_#memory_int_1378| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1378| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 44))) [2019-05-15 10:31:15,110 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:31:15,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:15,159 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:15,161 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:15,161 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:15,161 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:15,169 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:15,169 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1379|]. (let ((.cse0 (select |v_#memory_int_1379| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1379| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 45 .cse0))) [2019-05-15 10:31:15,169 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:31:15,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 16 treesize of output 11 [2019-05-15 10:31:15,218 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:15,220 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:15,220 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:15,220 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:15,228 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:15,228 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1380|]. (let ((.cse0 (select |v_#memory_int_1380| ULTIMATE.start_main_p1))) (and (= .cse0 46) (= (store |v_#memory_int_1380| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:15,229 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:31:15,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 16 treesize of output 11 [2019-05-15 10:31:15,277 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:15,279 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:15,279 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:15,279 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:15,288 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:15,289 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1381|]. (let ((.cse0 (select |v_#memory_int_1381| ULTIMATE.start_main_p1))) (and (= .cse0 47) (= |#memory_int| (store |v_#memory_int_1381| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:15,289 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:31:15,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 16 treesize of output 11 [2019-05-15 10:31:15,338 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:15,340 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:15,340 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:15,340 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:15,348 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:15,349 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1382|]. (let ((.cse0 (select |v_#memory_int_1382| ULTIMATE.start_main_p1))) (and (= .cse0 48) (= |#memory_int| (store |v_#memory_int_1382| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:15,349 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:31:15,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 16 treesize of output 11 [2019-05-15 10:31:15,397 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:15,400 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:15,400 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:15,400 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:15,407 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:15,407 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1383|]. (let ((.cse0 (select |v_#memory_int_1383| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1383| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 49))) [2019-05-15 10:31:15,408 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:31:15,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 16 treesize of output 11 [2019-05-15 10:31:15,459 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:15,461 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:15,461 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:15,461 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:15,470 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:15,470 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1384|]. (let ((.cse0 (select |v_#memory_int_1384| ULTIMATE.start_main_p1))) (and (= 50 .cse0) (= (store |v_#memory_int_1384| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:15,470 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:31:15,515 INFO L273 TraceCheckUtils]: 0: Hoare triple {12152#true} havoc main_p1; {12152#true} is VALID [2019-05-15 10:31:15,515 INFO L273 TraceCheckUtils]: 1: Hoare triple {12152#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {12152#true} is VALID [2019-05-15 10:31:15,517 INFO L273 TraceCheckUtils]: 2: Hoare triple {12152#true} #memory_int := #memory_int[main_p1 := 0]; {12163#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:31:15,517 INFO L273 TraceCheckUtils]: 3: Hoare triple {12163#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12167#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:31:15,518 INFO L273 TraceCheckUtils]: 4: Hoare triple {12167#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12171#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:31:15,518 INFO L273 TraceCheckUtils]: 5: Hoare triple {12171#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12175#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:31:15,519 INFO L273 TraceCheckUtils]: 6: Hoare triple {12175#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12179#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:31:15,519 INFO L273 TraceCheckUtils]: 7: Hoare triple {12179#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12183#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:31:15,520 INFO L273 TraceCheckUtils]: 8: Hoare triple {12183#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12187#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:31:15,521 INFO L273 TraceCheckUtils]: 9: Hoare triple {12187#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12191#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:31:15,521 INFO L273 TraceCheckUtils]: 10: Hoare triple {12191#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12195#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:31:15,522 INFO L273 TraceCheckUtils]: 11: Hoare triple {12195#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12199#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:31:15,523 INFO L273 TraceCheckUtils]: 12: Hoare triple {12199#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12203#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:31:15,524 INFO L273 TraceCheckUtils]: 13: Hoare triple {12203#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12207#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:31:15,525 INFO L273 TraceCheckUtils]: 14: Hoare triple {12207#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12211#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:31:15,526 INFO L273 TraceCheckUtils]: 15: Hoare triple {12211#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12215#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:31:15,526 INFO L273 TraceCheckUtils]: 16: Hoare triple {12215#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12219#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:31:15,527 INFO L273 TraceCheckUtils]: 17: Hoare triple {12219#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12223#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:31:15,528 INFO L273 TraceCheckUtils]: 18: Hoare triple {12223#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12227#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:31:15,529 INFO L273 TraceCheckUtils]: 19: Hoare triple {12227#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12231#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:31:15,530 INFO L273 TraceCheckUtils]: 20: Hoare triple {12231#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12235#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:31:15,530 INFO L273 TraceCheckUtils]: 21: Hoare triple {12235#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12239#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:31:15,531 INFO L273 TraceCheckUtils]: 22: Hoare triple {12239#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12243#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:31:15,532 INFO L273 TraceCheckUtils]: 23: Hoare triple {12243#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12247#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:31:15,533 INFO L273 TraceCheckUtils]: 24: Hoare triple {12247#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12251#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:31:15,534 INFO L273 TraceCheckUtils]: 25: Hoare triple {12251#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12255#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:31:15,534 INFO L273 TraceCheckUtils]: 26: Hoare triple {12255#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12259#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:31:15,535 INFO L273 TraceCheckUtils]: 27: Hoare triple {12259#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12263#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:31:15,536 INFO L273 TraceCheckUtils]: 28: Hoare triple {12263#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12267#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:31:15,537 INFO L273 TraceCheckUtils]: 29: Hoare triple {12267#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12271#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:31:15,538 INFO L273 TraceCheckUtils]: 30: Hoare triple {12271#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12275#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:31:15,539 INFO L273 TraceCheckUtils]: 31: Hoare triple {12275#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12279#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:31:15,539 INFO L273 TraceCheckUtils]: 32: Hoare triple {12279#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12283#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:31:15,540 INFO L273 TraceCheckUtils]: 33: Hoare triple {12283#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12287#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:31:15,541 INFO L273 TraceCheckUtils]: 34: Hoare triple {12287#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12291#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:31:15,542 INFO L273 TraceCheckUtils]: 35: Hoare triple {12291#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12295#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:31:15,543 INFO L273 TraceCheckUtils]: 36: Hoare triple {12295#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12299#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:31:15,543 INFO L273 TraceCheckUtils]: 37: Hoare triple {12299#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12303#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:31:15,544 INFO L273 TraceCheckUtils]: 38: Hoare triple {12303#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12307#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:31:15,545 INFO L273 TraceCheckUtils]: 39: Hoare triple {12307#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12311#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:31:15,546 INFO L273 TraceCheckUtils]: 40: Hoare triple {12311#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12315#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:31:15,547 INFO L273 TraceCheckUtils]: 41: Hoare triple {12315#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12319#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:31:15,548 INFO L273 TraceCheckUtils]: 42: Hoare triple {12319#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12323#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:31:15,548 INFO L273 TraceCheckUtils]: 43: Hoare triple {12323#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12327#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:31:15,549 INFO L273 TraceCheckUtils]: 44: Hoare triple {12327#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12331#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:31:15,550 INFO L273 TraceCheckUtils]: 45: Hoare triple {12331#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12335#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:31:15,551 INFO L273 TraceCheckUtils]: 46: Hoare triple {12335#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12339#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:31:15,552 INFO L273 TraceCheckUtils]: 47: Hoare triple {12339#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12343#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:31:15,552 INFO L273 TraceCheckUtils]: 48: Hoare triple {12343#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12347#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:31:15,553 INFO L273 TraceCheckUtils]: 49: Hoare triple {12347#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12351#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:31:15,554 INFO L273 TraceCheckUtils]: 50: Hoare triple {12351#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12355#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:31:15,555 INFO L273 TraceCheckUtils]: 51: Hoare triple {12355#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12359#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:31:15,556 INFO L273 TraceCheckUtils]: 52: Hoare triple {12359#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12363#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:31:15,556 INFO L273 TraceCheckUtils]: 53: Hoare triple {12363#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12367#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:31:15,557 INFO L273 TraceCheckUtils]: 54: Hoare triple {12367#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} assume !(#memory_int[main_p1] >= 0); {12153#false} is VALID [2019-05-15 10:31:15,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:31:15,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:31:15,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-05-15 10:31:15,563 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 55 [2019-05-15 10:31:15,563 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:31:15,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states. [2019-05-15 10:31:15,611 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:31:15,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-05-15 10:31:15,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-05-15 10:31:15,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-05-15 10:31:15,612 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 54 states. [2019-05-15 10:31:22,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:31:22,629 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-05-15 10:31:22,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-05-15 10:31:22,630 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 55 [2019-05-15 10:31:22,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:31:22,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-05-15 10:31:22,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-05-15 10:31:22,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-05-15 10:31:22,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-05-15 10:31:22,632 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states and 58 transitions. [2019-05-15 10:31:22,693 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:22,694 INFO L225 Difference]: With dead ends: 57 [2019-05-15 10:31:22,695 INFO L226 Difference]: Without dead ends: 57 [2019-05-15 10:31:22,695 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-05-15 10:31:22,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-05-15 10:31:22,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-05-15 10:31:22,697 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:31:22,697 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 57 states. [2019-05-15 10:31:22,697 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2019-05-15 10:31:22,697 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2019-05-15 10:31:22,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:31:22,698 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-05-15 10:31:22,698 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-05-15 10:31:22,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:31:22,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:31:22,699 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2019-05-15 10:31:22,699 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2019-05-15 10:31:22,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:31:22,700 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-05-15 10:31:22,700 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-05-15 10:31:22,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:31:22,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:31:22,701 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:31:22,701 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:31:22,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-05-15 10:31:22,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-05-15 10:31:22,702 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-05-15 10:31:22,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:31:22,702 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-05-15 10:31:22,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-05-15 10:31:22,702 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-05-15 10:31:22,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-05-15 10:31:22,702 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:31:22,703 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1, 1] [2019-05-15 10:31:22,703 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:31:22,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:31:22,703 INFO L82 PathProgramCache]: Analyzing trace with hash 569485320, now seen corresponding path program 52 times [2019-05-15 10:31:22,704 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:31:22,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:31:22,727 WARN L254 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 54 conjunts are in the unsatisfiable core [2019-05-15 10:31:22,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:31:22,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:31:22,774 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:22,775 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:22,781 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:22,781 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:22,782 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:31:22,783 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:22,784 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1385|]. (= |#memory_int| (store |v_#memory_int_1385| ULTIMATE.start_main_p1 0)) [2019-05-15 10:31:22,784 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:31:22,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:22,809 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:22,812 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:22,812 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:22,813 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:22,822 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:22,823 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1386|]. (let ((.cse0 (select |v_#memory_int_1386| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1386| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 0))) [2019-05-15 10:31:22,823 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:31:22,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:22,841 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:22,844 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:22,845 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:22,845 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:22,855 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:22,856 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1387|]. (let ((.cse0 (select |v_#memory_int_1387| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1387| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 1))) [2019-05-15 10:31:22,856 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:31:22,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 16 treesize of output 11 [2019-05-15 10:31:22,871 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:22,874 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:22,875 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:22,875 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:22,883 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:22,884 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1388|]. (let ((.cse0 (select |v_#memory_int_1388| ULTIMATE.start_main_p1))) (and (= 2 .cse0) (= |#memory_int| (store |v_#memory_int_1388| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:22,884 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:31:22,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:22,901 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:22,904 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:22,905 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:22,905 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:22,914 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:22,914 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1389|]. (let ((.cse0 (select |v_#memory_int_1389| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1389| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 3 .cse0))) [2019-05-15 10:31:22,914 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:31:22,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 16 treesize of output 11 [2019-05-15 10:31:22,932 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:22,935 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:22,936 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:22,936 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:22,945 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:22,945 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1390|]. (let ((.cse0 (select |v_#memory_int_1390| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1390| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 4 .cse0))) [2019-05-15 10:31:22,945 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:31: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 16 treesize of output 11 [2019-05-15 10:31:22,964 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:22,967 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:22,968 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:22,968 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:22,978 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:22,979 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1391|]. (let ((.cse0 (select |v_#memory_int_1391| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1391| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 5 .cse0))) [2019-05-15 10:31:22,979 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:31:22,997 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:22,998 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:23,001 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:23,002 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:23,002 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:23,013 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:23,014 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1392|]. (let ((.cse0 (select |v_#memory_int_1392| ULTIMATE.start_main_p1))) (and (= 6 .cse0) (= |#memory_int| (store |v_#memory_int_1392| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:23,014 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:31:23,033 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:23,035 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:23,038 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:23,038 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:23,038 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:23,047 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:23,047 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1393|]. (let ((.cse0 (select |v_#memory_int_1393| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1393| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 7 .cse0))) [2019-05-15 10:31:23,047 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:31:23,069 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:23,071 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:23,074 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:23,074 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:23,074 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:23,083 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:23,084 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1394|]. (let ((.cse0 (select |v_#memory_int_1394| ULTIMATE.start_main_p1))) (and (= .cse0 8) (= |#memory_int| (store |v_#memory_int_1394| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:23,084 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:31:23,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:23,107 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:23,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:23,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:23,112 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:23,122 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:23,122 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1395|]. (let ((.cse0 (select |v_#memory_int_1395| ULTIMATE.start_main_p1))) (and (= 9 .cse0) (= |#memory_int| (store |v_#memory_int_1395| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:23,122 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:31:23,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:23,146 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:23,149 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:23,150 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:23,150 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:23,159 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:23,159 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1396|]. (let ((.cse0 (select |v_#memory_int_1396| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1396| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 10))) [2019-05-15 10:31:23,160 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:31:23,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 16 treesize of output 11 [2019-05-15 10:31:23,205 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:23,208 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:23,208 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:23,209 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:23,219 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:23,219 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1397|]. (let ((.cse0 (select |v_#memory_int_1397| ULTIMATE.start_main_p1))) (and (= .cse0 11) (= |#memory_int| (store |v_#memory_int_1397| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:23,219 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:31:23,244 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:23,264 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:23,278 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:23,278 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:23,278 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:23,286 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:23,287 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1398|]. (let ((.cse0 (select |v_#memory_int_1398| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1398| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 12 .cse0))) [2019-05-15 10:31:23,287 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:31:23,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:23,314 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:23,317 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:23,318 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:23,318 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:23,328 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:23,328 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1399|]. (let ((.cse0 (select |v_#memory_int_1399| ULTIMATE.start_main_p1))) (and (= .cse0 13) (= (store |v_#memory_int_1399| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:23,329 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:31:23,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 16 treesize of output 11 [2019-05-15 10:31:23,357 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:23,360 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:23,361 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:23,361 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:23,369 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:23,369 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1400|]. (let ((.cse0 (select |v_#memory_int_1400| ULTIMATE.start_main_p1))) (and (= 14 .cse0) (= (store |v_#memory_int_1400| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:23,369 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:31:23,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 16 treesize of output 11 [2019-05-15 10:31:23,399 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:23,402 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:23,402 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:23,403 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:23,412 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:23,412 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1401|]. (let ((.cse0 (select |v_#memory_int_1401| ULTIMATE.start_main_p1))) (and (= 15 .cse0) (= (store |v_#memory_int_1401| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:23,412 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:31:23,439 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:23,441 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:23,444 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:23,444 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:23,444 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:23,453 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:23,453 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1402|]. (let ((.cse0 (select |v_#memory_int_1402| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1402| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 16 .cse0))) [2019-05-15 10:31:23,453 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:31:23,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 16 treesize of output 11 [2019-05-15 10:31:23,502 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:23,504 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:23,505 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:23,505 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:23,515 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:23,515 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1403|]. (let ((.cse0 (select |v_#memory_int_1403| ULTIMATE.start_main_p1))) (and (= .cse0 17) (= (store |v_#memory_int_1403| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:23,515 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:31:23,544 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:23,546 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:23,549 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:23,549 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:23,550 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:23,558 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:23,559 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1404|]. (let ((.cse0 (select |v_#memory_int_1404| ULTIMATE.start_main_p1))) (and (= 18 .cse0) (= (store |v_#memory_int_1404| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:23,559 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:31:23,588 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:23,590 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:23,593 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:23,594 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:23,594 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:23,602 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:23,603 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1405|]. (let ((.cse0 (select |v_#memory_int_1405| ULTIMATE.start_main_p1))) (and (= 19 .cse0) (= (store |v_#memory_int_1405| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:23,603 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:31:23,633 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:23,635 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:23,638 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:23,638 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:23,638 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:23,646 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:23,647 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1406|]. (let ((.cse0 (select |v_#memory_int_1406| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1406| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 20))) [2019-05-15 10:31:23,647 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:31:23,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:23,683 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:23,686 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:23,686 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:23,687 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:23,696 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:23,697 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1407|]. (let ((.cse0 (select |v_#memory_int_1407| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1407| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 21))) [2019-05-15 10:31:23,697 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:31:23,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:23,732 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:23,735 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:23,736 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:23,736 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:23,747 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:23,748 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1408|]. (let ((.cse0 (select |v_#memory_int_1408| ULTIMATE.start_main_p1))) (and (= 22 .cse0) (= |#memory_int| (store |v_#memory_int_1408| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:23,748 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:31:23,783 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:23,799 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:23,842 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:23,843 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:23,843 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:23,858 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:23,858 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1409|]. (let ((.cse0 (select |v_#memory_int_1409| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1409| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 23))) [2019-05-15 10:31:23,858 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:31:23,893 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:23,895 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:23,898 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:23,899 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:23,899 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:23,909 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:23,909 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1410|]. (let ((.cse0 (select |v_#memory_int_1410| ULTIMATE.start_main_p1))) (and (= .cse0 24) (= (store |v_#memory_int_1410| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:23,909 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:31:23,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:23,949 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:23,952 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:23,952 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:23,952 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:23,962 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:23,962 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1411|]. (let ((.cse0 (select |v_#memory_int_1411| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1411| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 25))) [2019-05-15 10:31:23,962 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:31:24,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:24,003 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:24,005 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:24,005 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:24,005 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:24,014 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:24,015 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1412|]. (let ((.cse0 (select |v_#memory_int_1412| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1412| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 26))) [2019-05-15 10:31:24,015 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:31:24,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:24,056 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:24,059 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:24,059 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:24,059 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:24,068 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:24,068 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1413|]. (let ((.cse0 (select |v_#memory_int_1413| ULTIMATE.start_main_p1))) (and (= 27 .cse0) (= (store |v_#memory_int_1413| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:24,068 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:31:24,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 16 treesize of output 11 [2019-05-15 10:31:24,110 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:24,113 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:24,113 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:24,114 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:24,123 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:24,123 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1414|]. (let ((.cse0 (select |v_#memory_int_1414| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1414| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 28 .cse0))) [2019-05-15 10:31:24,123 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:31:24,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 16 treesize of output 11 [2019-05-15 10:31:24,164 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:24,167 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:24,168 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:24,168 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:24,177 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:24,177 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1415|]. (let ((.cse0 (select |v_#memory_int_1415| ULTIMATE.start_main_p1))) (and (= .cse0 29) (= |#memory_int| (store |v_#memory_int_1415| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:24,177 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:31:24,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 16 treesize of output 11 [2019-05-15 10:31:24,230 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:24,233 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:24,233 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:24,233 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:24,244 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:24,244 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1416|]. (let ((.cse0 (select |v_#memory_int_1416| ULTIMATE.start_main_p1))) (and (= .cse0 30) (= (store |v_#memory_int_1416| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:24,244 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:31:24,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:24,287 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:24,290 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:24,290 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:24,290 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:24,300 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:24,301 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1417|]. (let ((.cse0 (select |v_#memory_int_1417| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1417| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 31 .cse0))) [2019-05-15 10:31:24,301 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:31:24,342 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:24,343 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:24,346 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:24,347 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:24,347 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:24,357 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:24,358 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1418|]. (let ((.cse0 (select |v_#memory_int_1418| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1418| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 32))) [2019-05-15 10:31:24,358 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:31:24,402 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:24,403 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:24,406 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:24,406 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:24,407 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:24,415 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:24,416 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1419|]. (let ((.cse0 (select |v_#memory_int_1419| ULTIMATE.start_main_p1))) (and (= .cse0 33) (= |#memory_int| (store |v_#memory_int_1419| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:24,416 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:31:24,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 16 treesize of output 11 [2019-05-15 10:31:24,459 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:24,462 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:24,463 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:24,463 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:24,473 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:24,473 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1420|]. (let ((.cse0 (select |v_#memory_int_1420| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1420| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 34 .cse0))) [2019-05-15 10:31:24,473 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:31:24,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 16 treesize of output 11 [2019-05-15 10:31:24,520 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:24,522 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:24,523 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:24,523 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:24,532 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:24,532 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1421|]. (let ((.cse0 (select |v_#memory_int_1421| ULTIMATE.start_main_p1))) (and (= .cse0 35) (= |#memory_int| (store |v_#memory_int_1421| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:24,532 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:31:24,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:24,579 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:24,582 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:24,582 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:24,582 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:24,592 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:24,593 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1422|]. (let ((.cse0 (select |v_#memory_int_1422| ULTIMATE.start_main_p1))) (and (= .cse0 36) (= (store |v_#memory_int_1422| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:24,593 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:31:24,636 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:24,638 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:24,641 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:24,641 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:24,642 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:24,651 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:24,651 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1423|]. (let ((.cse0 (select |v_#memory_int_1423| ULTIMATE.start_main_p1))) (and (= .cse0 37) (= |#memory_int| (store |v_#memory_int_1423| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:24,651 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:31:24,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 16 treesize of output 11 [2019-05-15 10:31:24,701 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:24,703 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:24,703 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:24,704 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:24,713 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:24,713 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1424|]. (let ((.cse0 (select |v_#memory_int_1424| ULTIMATE.start_main_p1))) (and (= .cse0 38) (= |#memory_int| (store |v_#memory_int_1424| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:24,714 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:31:24,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:24,771 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:24,773 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:24,774 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:24,774 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:24,783 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:24,784 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1425|]. (let ((.cse0 (select |v_#memory_int_1425| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1425| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 39 .cse0))) [2019-05-15 10:31:24,784 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:31:24,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 16 treesize of output 11 [2019-05-15 10:31:24,837 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:24,840 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:24,841 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:24,841 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:24,852 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:24,852 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1426|]. (let ((.cse0 (select |v_#memory_int_1426| ULTIMATE.start_main_p1))) (and (= 40 .cse0) (= (store |v_#memory_int_1426| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:24,852 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:31:24,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 16 treesize of output 11 [2019-05-15 10:31:24,905 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:24,908 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:24,908 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:24,909 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:24,919 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:24,920 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1427|]. (let ((.cse0 (select |v_#memory_int_1427| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1427| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 41 .cse0))) [2019-05-15 10:31:24,920 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:31:24,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 16 treesize of output 11 [2019-05-15 10:31:24,972 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:24,976 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:24,976 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:24,976 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:24,988 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:24,988 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1428|]. (let ((.cse0 (select |v_#memory_int_1428| ULTIMATE.start_main_p1))) (and (= 42 .cse0) (= (store |v_#memory_int_1428| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:24,989 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:31:25,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 16 treesize of output 11 [2019-05-15 10:31:25,044 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,048 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:25,049 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,049 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:25,059 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:25,060 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1429|]. (let ((.cse0 (select |v_#memory_int_1429| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1429| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 43))) [2019-05-15 10:31:25,060 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:31:25,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 16 treesize of output 11 [2019-05-15 10:31:25,116 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,119 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:25,119 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,119 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:25,130 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:25,131 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1430|]. (let ((.cse0 (select |v_#memory_int_1430| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1430| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 44))) [2019-05-15 10:31:25,131 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:31:25,187 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:25,189 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,192 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:25,192 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,192 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:25,202 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:25,203 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1431|]. (let ((.cse0 (select |v_#memory_int_1431| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1431| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 45 .cse0))) [2019-05-15 10:31:25,203 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:31:25,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 16 treesize of output 11 [2019-05-15 10:31:25,262 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,265 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:25,265 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,265 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:25,274 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:25,275 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1432|]. (let ((.cse0 (select |v_#memory_int_1432| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1432| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 46))) [2019-05-15 10:31:25,275 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:31:25,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 16 treesize of output 11 [2019-05-15 10:31:25,331 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,334 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:25,335 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,335 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:25,344 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:25,345 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1433|]. (let ((.cse0 (select |v_#memory_int_1433| ULTIMATE.start_main_p1))) (and (= .cse0 47) (= (store |v_#memory_int_1433| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:25,345 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:31:25,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 16 treesize of output 11 [2019-05-15 10:31:25,403 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,406 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:25,406 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,407 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:25,417 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:25,417 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1434|]. (let ((.cse0 (select |v_#memory_int_1434| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1434| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 48))) [2019-05-15 10:31:25,417 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:31:25,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 16 treesize of output 11 [2019-05-15 10:31:25,519 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,521 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:25,521 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,521 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:25,531 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:25,532 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1435|]. (let ((.cse0 (select |v_#memory_int_1435| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1435| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 49))) [2019-05-15 10:31:25,532 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:31:25,594 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:25,596 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,599 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:25,599 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,600 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:25,611 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:25,611 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1436|]. (let ((.cse0 (select |v_#memory_int_1436| ULTIMATE.start_main_p1))) (and (= .cse0 50) (= (store |v_#memory_int_1436| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:25,612 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:31:25,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:25,675 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,678 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:25,679 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,679 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:25,689 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:25,689 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1437|]. (let ((.cse0 (select |v_#memory_int_1437| ULTIMATE.start_main_p1))) (and (= .cse0 51) (= (store |v_#memory_int_1437| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:25,689 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:31:25,749 INFO L273 TraceCheckUtils]: 0: Hoare triple {12598#true} havoc main_p1; {12598#true} is VALID [2019-05-15 10:31:25,749 INFO L273 TraceCheckUtils]: 1: Hoare triple {12598#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {12598#true} is VALID [2019-05-15 10:31:25,750 INFO L273 TraceCheckUtils]: 2: Hoare triple {12598#true} #memory_int := #memory_int[main_p1 := 0]; {12609#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:31:25,751 INFO L273 TraceCheckUtils]: 3: Hoare triple {12609#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12613#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:31:25,751 INFO L273 TraceCheckUtils]: 4: Hoare triple {12613#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12617#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:31:25,752 INFO L273 TraceCheckUtils]: 5: Hoare triple {12617#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12621#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:31:25,753 INFO L273 TraceCheckUtils]: 6: Hoare triple {12621#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12625#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:31:25,753 INFO L273 TraceCheckUtils]: 7: Hoare triple {12625#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12629#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:31:25,754 INFO L273 TraceCheckUtils]: 8: Hoare triple {12629#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12633#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:31:25,755 INFO L273 TraceCheckUtils]: 9: Hoare triple {12633#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12637#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:31:25,756 INFO L273 TraceCheckUtils]: 10: Hoare triple {12637#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12641#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:31:25,757 INFO L273 TraceCheckUtils]: 11: Hoare triple {12641#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12645#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:31:25,758 INFO L273 TraceCheckUtils]: 12: Hoare triple {12645#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12649#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:31:25,759 INFO L273 TraceCheckUtils]: 13: Hoare triple {12649#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12653#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:31:25,760 INFO L273 TraceCheckUtils]: 14: Hoare triple {12653#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12657#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:31:25,761 INFO L273 TraceCheckUtils]: 15: Hoare triple {12657#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12661#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:31:25,762 INFO L273 TraceCheckUtils]: 16: Hoare triple {12661#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12665#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:31:25,763 INFO L273 TraceCheckUtils]: 17: Hoare triple {12665#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12669#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:31:25,764 INFO L273 TraceCheckUtils]: 18: Hoare triple {12669#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12673#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:31:25,765 INFO L273 TraceCheckUtils]: 19: Hoare triple {12673#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12677#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:31:25,766 INFO L273 TraceCheckUtils]: 20: Hoare triple {12677#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12681#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:31:25,767 INFO L273 TraceCheckUtils]: 21: Hoare triple {12681#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12685#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:31:25,768 INFO L273 TraceCheckUtils]: 22: Hoare triple {12685#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12689#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:31:25,769 INFO L273 TraceCheckUtils]: 23: Hoare triple {12689#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12693#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:31:25,770 INFO L273 TraceCheckUtils]: 24: Hoare triple {12693#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12697#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:31:25,771 INFO L273 TraceCheckUtils]: 25: Hoare triple {12697#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12701#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:31:25,772 INFO L273 TraceCheckUtils]: 26: Hoare triple {12701#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12705#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:31:25,773 INFO L273 TraceCheckUtils]: 27: Hoare triple {12705#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12709#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:31:25,775 INFO L273 TraceCheckUtils]: 28: Hoare triple {12709#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12713#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:31:25,775 INFO L273 TraceCheckUtils]: 29: Hoare triple {12713#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12717#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:31:25,776 INFO L273 TraceCheckUtils]: 30: Hoare triple {12717#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12721#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:31:25,777 INFO L273 TraceCheckUtils]: 31: Hoare triple {12721#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12725#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:31:25,779 INFO L273 TraceCheckUtils]: 32: Hoare triple {12725#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12729#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:31:25,780 INFO L273 TraceCheckUtils]: 33: Hoare triple {12729#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12733#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:31:25,781 INFO L273 TraceCheckUtils]: 34: Hoare triple {12733#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12737#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:31:25,782 INFO L273 TraceCheckUtils]: 35: Hoare triple {12737#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12741#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:31:25,783 INFO L273 TraceCheckUtils]: 36: Hoare triple {12741#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12745#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:31:25,784 INFO L273 TraceCheckUtils]: 37: Hoare triple {12745#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12749#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:31:25,785 INFO L273 TraceCheckUtils]: 38: Hoare triple {12749#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12753#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:31:25,786 INFO L273 TraceCheckUtils]: 39: Hoare triple {12753#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12757#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:31:25,787 INFO L273 TraceCheckUtils]: 40: Hoare triple {12757#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12761#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:31:25,788 INFO L273 TraceCheckUtils]: 41: Hoare triple {12761#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12765#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:31:25,789 INFO L273 TraceCheckUtils]: 42: Hoare triple {12765#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12769#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:31:25,790 INFO L273 TraceCheckUtils]: 43: Hoare triple {12769#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12773#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:31:25,791 INFO L273 TraceCheckUtils]: 44: Hoare triple {12773#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12777#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:31:25,792 INFO L273 TraceCheckUtils]: 45: Hoare triple {12777#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12781#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:31:25,793 INFO L273 TraceCheckUtils]: 46: Hoare triple {12781#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12785#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:31:25,794 INFO L273 TraceCheckUtils]: 47: Hoare triple {12785#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12789#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:31:25,796 INFO L273 TraceCheckUtils]: 48: Hoare triple {12789#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12793#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:31:25,797 INFO L273 TraceCheckUtils]: 49: Hoare triple {12793#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12797#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:31:25,797 INFO L273 TraceCheckUtils]: 50: Hoare triple {12797#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12801#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:31:25,798 INFO L273 TraceCheckUtils]: 51: Hoare triple {12801#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12805#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:31:25,799 INFO L273 TraceCheckUtils]: 52: Hoare triple {12805#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12809#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:31:25,801 INFO L273 TraceCheckUtils]: 53: Hoare triple {12809#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12813#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:31:25,802 INFO L273 TraceCheckUtils]: 54: Hoare triple {12813#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12817#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:31:25,802 INFO L273 TraceCheckUtils]: 55: Hoare triple {12817#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} assume !(#memory_int[main_p1] >= 0); {12599#false} is VALID [2019-05-15 10:31:25,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:31:25,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:31:25,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-05-15 10:31:25,809 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 56 [2019-05-15 10:31:25,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:31:25,809 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states. [2019-05-15 10:31:25,868 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:25,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-05-15 10:31:25,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-05-15 10:31:25,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-05-15 10:31:25,870 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 55 states. [2019-05-15 10:31:32,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:31:32,630 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-05-15 10:31:32,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-05-15 10:31:32,630 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 56 [2019-05-15 10:31:32,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:31:32,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-05-15 10:31:32,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-05-15 10:31:32,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-05-15 10:31:32,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-05-15 10:31:32,632 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states and 59 transitions. [2019-05-15 10:31:32,699 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:31:32,700 INFO L225 Difference]: With dead ends: 58 [2019-05-15 10:31:32,700 INFO L226 Difference]: Without dead ends: 58 [2019-05-15 10:31:32,701 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-05-15 10:31:32,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-05-15 10:31:32,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-05-15 10:31:32,703 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:31:32,703 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 58 states. [2019-05-15 10:31:32,703 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2019-05-15 10:31:32,703 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2019-05-15 10:31:32,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:31:32,704 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-05-15 10:31:32,704 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-05-15 10:31:32,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:31:32,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:31:32,705 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2019-05-15 10:31:32,705 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2019-05-15 10:31:32,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:31:32,706 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-05-15 10:31:32,706 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-05-15 10:31:32,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:31:32,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:31:32,706 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:31:32,706 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:31:32,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-05-15 10:31:32,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-05-15 10:31:32,707 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-05-15 10:31:32,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:31:32,707 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-05-15 10:31:32,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-05-15 10:31:32,708 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-05-15 10:31:32,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-05-15 10:31:32,708 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:31:32,708 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1, 1] [2019-05-15 10:31:32,708 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:31:32,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:31:32,709 INFO L82 PathProgramCache]: Analyzing trace with hash 474175682, now seen corresponding path program 53 times [2019-05-15 10:31:32,709 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:31:32,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:31:32,725 WARN L254 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 55 conjunts are in the unsatisfiable core [2019-05-15 10:31:32,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:31:32,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:31:32,772 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:32,772 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:32,780 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:32,780 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:32,780 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:31:32,781 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:32,782 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1438|]. (= (store |v_#memory_int_1438| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:31:32,782 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:31:32,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 16 treesize of output 11 [2019-05-15 10:31:32,794 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:32,796 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:32,796 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:32,797 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:32,805 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:32,805 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1439|]. (let ((.cse0 (select |v_#memory_int_1439| ULTIMATE.start_main_p1))) (and (= .cse0 0) (= (store |v_#memory_int_1439| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:32,805 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:31:32,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:32,816 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:32,818 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:32,818 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:32,818 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:32,826 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:32,826 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1440|]. (let ((.cse0 (select |v_#memory_int_1440| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1440| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 1 .cse0))) [2019-05-15 10:31:32,826 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:31:32,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 16 treesize of output 11 [2019-05-15 10:31:32,839 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:32,840 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:32,840 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:32,840 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:32,848 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:32,848 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1441|]. (let ((.cse0 (select |v_#memory_int_1441| ULTIMATE.start_main_p1))) (and (= .cse0 2) (= (store |v_#memory_int_1441| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:32,848 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:31:32,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:32,859 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:32,861 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:32,861 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:32,862 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:32,869 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:32,869 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1442|]. (let ((.cse0 (select |v_#memory_int_1442| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1442| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 3 .cse0))) [2019-05-15 10:31:32,869 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:31:32,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:32,882 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:32,884 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:32,884 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:32,884 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:32,892 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:32,892 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1443|]. (let ((.cse0 (select |v_#memory_int_1443| ULTIMATE.start_main_p1))) (and (= 4 .cse0) (= |#memory_int| (store |v_#memory_int_1443| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:32,892 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:31:32,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 16 treesize of output 11 [2019-05-15 10:31:32,905 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:32,907 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:32,907 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:32,907 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:32,914 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:32,914 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1444|]. (let ((.cse0 (select |v_#memory_int_1444| ULTIMATE.start_main_p1))) (and (= 5 .cse0) (= |#memory_int| (store |v_#memory_int_1444| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:32,915 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:31:32,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 16 treesize of output 11 [2019-05-15 10:31:32,929 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:32,931 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:32,932 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:32,932 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:32,940 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:32,940 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1445|]. (let ((.cse0 (select |v_#memory_int_1445| ULTIMATE.start_main_p1))) (and (= .cse0 6) (= |#memory_int| (store |v_#memory_int_1445| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:32,940 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:31:32,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 16 treesize of output 11 [2019-05-15 10:31:32,956 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:32,958 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:32,958 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:32,958 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:32,965 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:32,965 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1446|]. (let ((.cse0 (select |v_#memory_int_1446| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1446| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 7))) [2019-05-15 10:31:32,965 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:31:32,981 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:32,982 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:32,984 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:32,984 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:32,985 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:32,992 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:32,992 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1447|]. (let ((.cse0 (select |v_#memory_int_1447| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1447| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 8))) [2019-05-15 10:31:32,992 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:31:33,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 16 treesize of output 11 [2019-05-15 10:31:33,009 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,011 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:33,011 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,011 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:33,018 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:33,019 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1448|]. (let ((.cse0 (select |v_#memory_int_1448| ULTIMATE.start_main_p1))) (and (= 9 .cse0) (= (store |v_#memory_int_1448| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:33,019 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:31:33,035 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:33,036 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,037 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:33,038 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,038 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:33,045 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:33,045 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1449|]. (let ((.cse0 (select |v_#memory_int_1449| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1449| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 10))) [2019-05-15 10:31:33,046 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:31:33,063 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:33,064 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,066 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:33,067 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,067 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:33,074 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:33,074 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1450|]. (let ((.cse0 (select |v_#memory_int_1450| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1450| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 11))) [2019-05-15 10:31:33,075 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:31:33,092 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:33,093 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,095 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:33,096 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,096 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:33,102 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:33,102 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1451|]. (let ((.cse0 (select |v_#memory_int_1451| ULTIMATE.start_main_p1))) (and (= 12 .cse0) (= |#memory_int| (store |v_#memory_int_1451| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:33,102 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:31:33,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:33,123 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,125 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:33,125 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,125 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:33,132 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:33,133 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1452|]. (let ((.cse0 (select |v_#memory_int_1452| ULTIMATE.start_main_p1))) (and (= 13 .cse0) (= (store |v_#memory_int_1452| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:33,133 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:31: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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:33,155 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,157 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:33,157 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,158 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:33,165 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:33,165 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1453|]. (let ((.cse0 (select |v_#memory_int_1453| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1453| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 14))) [2019-05-15 10:31:33,166 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:31:33,187 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:33,188 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,190 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:33,190 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,191 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:33,198 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:33,198 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1454|]. (let ((.cse0 (select |v_#memory_int_1454| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1454| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 15 .cse0))) [2019-05-15 10:31:33,198 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:31:33,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 16 treesize of output 11 [2019-05-15 10:31:33,220 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,222 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:33,222 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,222 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:33,230 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:33,230 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1455|]. (let ((.cse0 (select |v_#memory_int_1455| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1455| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 16))) [2019-05-15 10:31:33,230 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:31:33,253 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:33,254 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,256 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:33,256 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,256 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:33,264 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:33,265 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1456|]. (let ((.cse0 (select |v_#memory_int_1456| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1456| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 17 .cse0))) [2019-05-15 10:31:33,265 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:31:33,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 16 treesize of output 11 [2019-05-15 10:31:33,291 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,293 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:33,293 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,293 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:33,301 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:33,301 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1457|]. (let ((.cse0 (select |v_#memory_int_1457| ULTIMATE.start_main_p1))) (and (= 18 .cse0) (= |#memory_int| (store |v_#memory_int_1457| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:33,301 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:31:33,326 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:33,327 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,329 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:33,329 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,329 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:33,336 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:33,337 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1458|]. (let ((.cse0 (select |v_#memory_int_1458| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1458| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 19))) [2019-05-15 10:31:33,337 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:31:33,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:33,364 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,376 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:33,376 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,376 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:33,381 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:33,381 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1459|]. (let ((.cse0 (select |v_#memory_int_1459| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1459| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 20))) [2019-05-15 10:31:33,381 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:31:33,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 16 treesize of output 11 [2019-05-15 10:31:33,407 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,409 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:33,409 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,410 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:33,417 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:33,417 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1460|]. (let ((.cse0 (select |v_#memory_int_1460| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1460| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 21 .cse0))) [2019-05-15 10:31:33,417 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:31:33,442 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:33,443 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,445 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:33,445 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,445 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:33,453 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:33,453 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1461|]. (let ((.cse0 (select |v_#memory_int_1461| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1461| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 22 .cse0))) [2019-05-15 10:31:33,453 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:31:33,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 16 treesize of output 11 [2019-05-15 10:31:33,480 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,481 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:33,482 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,482 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:33,489 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:33,489 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1462|]. (let ((.cse0 (select |v_#memory_int_1462| ULTIMATE.start_main_p1))) (and (= 23 .cse0) (= (store |v_#memory_int_1462| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:33,489 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:31:33,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 16 treesize of output 11 [2019-05-15 10:31:33,518 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,520 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:33,521 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,521 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:33,528 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:33,528 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1463|]. (let ((.cse0 (select |v_#memory_int_1463| ULTIMATE.start_main_p1))) (and (= 24 .cse0) (= (store |v_#memory_int_1463| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:33,528 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:31:33,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:33,557 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,559 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:33,559 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,559 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:33,565 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:33,565 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1464|]. (let ((.cse0 (select |v_#memory_int_1464| ULTIMATE.start_main_p1))) (and (= .cse0 25) (= (store |v_#memory_int_1464| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:33,565 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:31:33,593 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:33,594 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,596 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:33,596 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,596 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:33,604 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:33,604 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1465|]. (let ((.cse0 (select |v_#memory_int_1465| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1465| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 26))) [2019-05-15 10:31:33,604 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:31:33,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 16 treesize of output 11 [2019-05-15 10:31:33,636 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,638 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:33,638 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,638 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:33,645 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:33,646 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1466|]. (let ((.cse0 (select |v_#memory_int_1466| ULTIMATE.start_main_p1))) (and (= 27 .cse0) (= (store |v_#memory_int_1466| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:33,646 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:31:33,676 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:33,677 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,680 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:33,680 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,680 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:33,687 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:33,688 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1467|]. (let ((.cse0 (select |v_#memory_int_1467| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1467| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 28))) [2019-05-15 10:31:33,688 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:31:33,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 16 treesize of output 11 [2019-05-15 10:31:33,720 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,722 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:33,723 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,723 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:33,730 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:33,730 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1468|]. (let ((.cse0 (select |v_#memory_int_1468| ULTIMATE.start_main_p1))) (and (= .cse0 29) (= (store |v_#memory_int_1468| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:33,730 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:31:33,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 16 treesize of output 11 [2019-05-15 10:31:33,762 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,764 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:33,764 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,765 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:33,772 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:33,772 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1469|]. (let ((.cse0 (select |v_#memory_int_1469| ULTIMATE.start_main_p1))) (and (= .cse0 30) (= |#memory_int| (store |v_#memory_int_1469| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:33,772 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:31:33,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:33,806 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,808 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:33,808 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,808 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:33,816 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:33,816 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1470|]. (let ((.cse0 (select |v_#memory_int_1470| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1470| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 31))) [2019-05-15 10:31:33,817 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:31:33,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 16 treesize of output 11 [2019-05-15 10:31:33,852 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,854 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:33,854 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,855 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:33,863 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:33,863 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1471|]. (let ((.cse0 (select |v_#memory_int_1471| ULTIMATE.start_main_p1))) (and (= 32 .cse0) (= |#memory_int| (store |v_#memory_int_1471| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:33,863 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:31:33,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 16 treesize of output 11 [2019-05-15 10:31:33,902 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,904 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:33,904 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,904 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:33,912 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:33,913 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1472|]. (let ((.cse0 (select |v_#memory_int_1472| ULTIMATE.start_main_p1))) (and (= .cse0 33) (= (store |v_#memory_int_1472| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:33,913 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:31:33,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 16 treesize of output 11 [2019-05-15 10:31:33,950 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,952 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:33,952 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:33,952 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:33,960 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:33,960 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1473|]. (let ((.cse0 (select |v_#memory_int_1473| ULTIMATE.start_main_p1))) (and (= .cse0 34) (= (store |v_#memory_int_1473| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:33,961 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:31:33,998 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:33,999 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,001 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:34,002 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,002 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:34,010 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:34,010 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1474|]. (let ((.cse0 (select |v_#memory_int_1474| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1474| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 35))) [2019-05-15 10:31:34,010 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:31:34,049 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:34,050 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,052 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:34,053 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,053 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:34,061 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:34,061 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1475|]. (let ((.cse0 (select |v_#memory_int_1475| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1475| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 36))) [2019-05-15 10:31:34,061 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:31:34,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:34,100 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,102 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:34,102 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,103 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:34,110 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:34,110 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1476|]. (let ((.cse0 (select |v_#memory_int_1476| ULTIMATE.start_main_p1))) (and (= .cse0 37) (= |#memory_int| (store |v_#memory_int_1476| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:34,110 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:31:34,149 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:34,150 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,152 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:34,152 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,152 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:34,160 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:34,160 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1477|]. (let ((.cse0 (select |v_#memory_int_1477| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1477| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 38))) [2019-05-15 10:31:34,160 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:31:34,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 16 treesize of output 11 [2019-05-15 10:31:34,202 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,204 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:34,204 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,205 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:34,212 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:34,212 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1478|]. (let ((.cse0 (select |v_#memory_int_1478| ULTIMATE.start_main_p1))) (and (= .cse0 39) (= (store |v_#memory_int_1478| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:34,213 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:31:34,255 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:34,256 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,259 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:34,259 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,259 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:34,267 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:34,268 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1479|]. (let ((.cse0 (select |v_#memory_int_1479| ULTIMATE.start_main_p1))) (and (= .cse0 40) (= (store |v_#memory_int_1479| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:34,268 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:31:34,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 16 treesize of output 11 [2019-05-15 10:31:34,312 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,314 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:34,314 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,314 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:34,322 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:34,322 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1480|]. (let ((.cse0 (select |v_#memory_int_1480| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1480| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 41))) [2019-05-15 10:31:34,322 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:31:34,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:34,367 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,369 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:34,369 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,369 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:34,378 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:34,378 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1481|]. (let ((.cse0 (select |v_#memory_int_1481| ULTIMATE.start_main_p1))) (and (= .cse0 42) (= |#memory_int| (store |v_#memory_int_1481| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:34,378 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:31:34,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 16 treesize of output 11 [2019-05-15 10:31:34,424 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,426 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:34,427 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,427 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:34,434 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:34,435 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1482|]. (let ((.cse0 (select |v_#memory_int_1482| ULTIMATE.start_main_p1))) (and (= 43 .cse0) (= |#memory_int| (store |v_#memory_int_1482| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:34,435 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:31:34,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 16 treesize of output 11 [2019-05-15 10:31:34,480 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,482 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:34,483 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,483 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:34,491 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:34,491 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1483|]. (let ((.cse0 (select |v_#memory_int_1483| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1483| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 44 .cse0))) [2019-05-15 10:31:34,491 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:31:34,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 16 treesize of output 11 [2019-05-15 10:31:34,536 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,538 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:34,538 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,539 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:34,546 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:34,546 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1484|]. (let ((.cse0 (select |v_#memory_int_1484| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1484| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 45))) [2019-05-15 10:31:34,546 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:31:34,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:34,593 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,594 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:34,594 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,594 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:34,602 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:34,603 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1485|]. (let ((.cse0 (select |v_#memory_int_1485| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1485| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 46 .cse0))) [2019-05-15 10:31:34,603 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:31:34,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:34,651 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,653 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:34,653 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,654 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:34,662 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:34,662 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1486|]. (let ((.cse0 (select |v_#memory_int_1486| ULTIMATE.start_main_p1))) (and (= 47 .cse0) (= (store |v_#memory_int_1486| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:34,662 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:31:34,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:34,714 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,716 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:34,716 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,716 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:34,724 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:34,724 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1487|]. (let ((.cse0 (select |v_#memory_int_1487| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1487| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 48 .cse0))) [2019-05-15 10:31:34,724 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:31:34,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 16 treesize of output 11 [2019-05-15 10:31:34,775 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,778 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:34,778 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,778 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:34,785 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:34,785 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1488|]. (let ((.cse0 (select |v_#memory_int_1488| ULTIMATE.start_main_p1))) (and (= 49 .cse0) (= (store |v_#memory_int_1488| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:34,785 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:31:34,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:34,836 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,838 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:34,838 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,839 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:34,847 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:34,848 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1489|]. (let ((.cse0 (select |v_#memory_int_1489| ULTIMATE.start_main_p1))) (and (= .cse0 50) (= (store |v_#memory_int_1489| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:34,848 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:31:34,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 16 treesize of output 11 [2019-05-15 10:31:34,904 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,906 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:34,907 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,907 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:34,917 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:34,917 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1490|]. (let ((.cse0 (select |v_#memory_int_1490| ULTIMATE.start_main_p1))) (and (= .cse0 51) (= (store |v_#memory_int_1490| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:34,917 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:31:34,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:34,968 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,971 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:34,971 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,971 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:34,979 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:34,980 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1491|]. (let ((.cse0 (select |v_#memory_int_1491| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1491| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 52 .cse0))) [2019-05-15 10:31:34,980 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:31:35,025 INFO L273 TraceCheckUtils]: 0: Hoare triple {13052#true} havoc main_p1; {13052#true} is VALID [2019-05-15 10:31:35,025 INFO L273 TraceCheckUtils]: 1: Hoare triple {13052#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {13052#true} is VALID [2019-05-15 10:31:35,026 INFO L273 TraceCheckUtils]: 2: Hoare triple {13052#true} #memory_int := #memory_int[main_p1 := 0]; {13063#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:31:35,026 INFO L273 TraceCheckUtils]: 3: Hoare triple {13063#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13067#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:31:35,027 INFO L273 TraceCheckUtils]: 4: Hoare triple {13067#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13071#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:31:35,028 INFO L273 TraceCheckUtils]: 5: Hoare triple {13071#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13075#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:31:35,028 INFO L273 TraceCheckUtils]: 6: Hoare triple {13075#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13079#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:31:35,029 INFO L273 TraceCheckUtils]: 7: Hoare triple {13079#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13083#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:31:35,030 INFO L273 TraceCheckUtils]: 8: Hoare triple {13083#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13087#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:31:35,031 INFO L273 TraceCheckUtils]: 9: Hoare triple {13087#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13091#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:31:35,032 INFO L273 TraceCheckUtils]: 10: Hoare triple {13091#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13095#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:31:35,032 INFO L273 TraceCheckUtils]: 11: Hoare triple {13095#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13099#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:31:35,033 INFO L273 TraceCheckUtils]: 12: Hoare triple {13099#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13103#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:31:35,034 INFO L273 TraceCheckUtils]: 13: Hoare triple {13103#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13107#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:31:35,035 INFO L273 TraceCheckUtils]: 14: Hoare triple {13107#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13111#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:31:35,036 INFO L273 TraceCheckUtils]: 15: Hoare triple {13111#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13115#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:31:35,037 INFO L273 TraceCheckUtils]: 16: Hoare triple {13115#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13119#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:31:35,037 INFO L273 TraceCheckUtils]: 17: Hoare triple {13119#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13123#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:31:35,038 INFO L273 TraceCheckUtils]: 18: Hoare triple {13123#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13127#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:31:35,039 INFO L273 TraceCheckUtils]: 19: Hoare triple {13127#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13131#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:31:35,040 INFO L273 TraceCheckUtils]: 20: Hoare triple {13131#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13135#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:31:35,041 INFO L273 TraceCheckUtils]: 21: Hoare triple {13135#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13139#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:31:35,041 INFO L273 TraceCheckUtils]: 22: Hoare triple {13139#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13143#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:31:35,042 INFO L273 TraceCheckUtils]: 23: Hoare triple {13143#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13147#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:31:35,043 INFO L273 TraceCheckUtils]: 24: Hoare triple {13147#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13151#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:31:35,044 INFO L273 TraceCheckUtils]: 25: Hoare triple {13151#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13155#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:31:35,045 INFO L273 TraceCheckUtils]: 26: Hoare triple {13155#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13159#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:31:35,046 INFO L273 TraceCheckUtils]: 27: Hoare triple {13159#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13163#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:31:35,046 INFO L273 TraceCheckUtils]: 28: Hoare triple {13163#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13167#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:31:35,047 INFO L273 TraceCheckUtils]: 29: Hoare triple {13167#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13171#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:31:35,048 INFO L273 TraceCheckUtils]: 30: Hoare triple {13171#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13175#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:31:35,049 INFO L273 TraceCheckUtils]: 31: Hoare triple {13175#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13179#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:31:35,050 INFO L273 TraceCheckUtils]: 32: Hoare triple {13179#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13183#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:31:35,050 INFO L273 TraceCheckUtils]: 33: Hoare triple {13183#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13187#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:31:35,051 INFO L273 TraceCheckUtils]: 34: Hoare triple {13187#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13191#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:31:35,052 INFO L273 TraceCheckUtils]: 35: Hoare triple {13191#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13195#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:31:35,053 INFO L273 TraceCheckUtils]: 36: Hoare triple {13195#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13199#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:31:35,054 INFO L273 TraceCheckUtils]: 37: Hoare triple {13199#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13203#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:31:35,055 INFO L273 TraceCheckUtils]: 38: Hoare triple {13203#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13207#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:31:35,055 INFO L273 TraceCheckUtils]: 39: Hoare triple {13207#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13211#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:31:35,056 INFO L273 TraceCheckUtils]: 40: Hoare triple {13211#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13215#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:31:35,057 INFO L273 TraceCheckUtils]: 41: Hoare triple {13215#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13219#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:31:35,058 INFO L273 TraceCheckUtils]: 42: Hoare triple {13219#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13223#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:31:35,059 INFO L273 TraceCheckUtils]: 43: Hoare triple {13223#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13227#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:31:35,059 INFO L273 TraceCheckUtils]: 44: Hoare triple {13227#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13231#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:31:35,060 INFO L273 TraceCheckUtils]: 45: Hoare triple {13231#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13235#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:31:35,061 INFO L273 TraceCheckUtils]: 46: Hoare triple {13235#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13239#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:31:35,062 INFO L273 TraceCheckUtils]: 47: Hoare triple {13239#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13243#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:31:35,063 INFO L273 TraceCheckUtils]: 48: Hoare triple {13243#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13247#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:31:35,064 INFO L273 TraceCheckUtils]: 49: Hoare triple {13247#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13251#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:31:35,064 INFO L273 TraceCheckUtils]: 50: Hoare triple {13251#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13255#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:31:35,065 INFO L273 TraceCheckUtils]: 51: Hoare triple {13255#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13259#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:31:35,066 INFO L273 TraceCheckUtils]: 52: Hoare triple {13259#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13263#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:31:35,067 INFO L273 TraceCheckUtils]: 53: Hoare triple {13263#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13267#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:31:35,068 INFO L273 TraceCheckUtils]: 54: Hoare triple {13267#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13271#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:31:35,069 INFO L273 TraceCheckUtils]: 55: Hoare triple {13271#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13275#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:31:35,069 INFO L273 TraceCheckUtils]: 56: Hoare triple {13275#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} assume !(#memory_int[main_p1] >= 0); {13053#false} is VALID [2019-05-15 10:31:35,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:31:35,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:31:35,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-05-15 10:31:35,075 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 57 [2019-05-15 10:31:35,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:31:35,076 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 56 states. [2019-05-15 10:31:35,125 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:31:35,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-05-15 10:31:35,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-05-15 10:31:35,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-05-15 10:31:35,126 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 56 states. [2019-05-15 10:31:41,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:31:41,935 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-05-15 10:31:41,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-05-15 10:31:41,935 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 57 [2019-05-15 10:31:41,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:31:41,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-05-15 10:31:41,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-05-15 10:31:41,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-05-15 10:31:41,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-05-15 10:31:41,937 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 56 states and 60 transitions. [2019-05-15 10:31:41,988 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:41,989 INFO L225 Difference]: With dead ends: 59 [2019-05-15 10:31:41,989 INFO L226 Difference]: Without dead ends: 59 [2019-05-15 10:31:41,990 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-05-15 10:31:41,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-05-15 10:31:41,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-05-15 10:31:41,991 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:31:41,991 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 59 states. [2019-05-15 10:31:41,991 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2019-05-15 10:31:41,992 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2019-05-15 10:31:41,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:31:41,992 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-05-15 10:31:41,992 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-05-15 10:31:41,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:31:41,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:31:41,993 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2019-05-15 10:31:41,993 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2019-05-15 10:31:41,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:31:41,993 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-05-15 10:31:41,993 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-05-15 10:31:41,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:31:41,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:31:41,994 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:31:41,994 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:31:41,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-05-15 10:31:41,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-05-15 10:31:41,994 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-05-15 10:31:41,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:31:41,995 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-05-15 10:31:41,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-05-15 10:31:41,995 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-05-15 10:31:41,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-05-15 10:31:41,995 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:31:41,995 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1, 1] [2019-05-15 10:31:41,995 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:31:41,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:31:41,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1814544200, now seen corresponding path program 54 times [2019-05-15 10:31:41,996 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:31:42,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:31:42,013 WARN L254 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 56 conjunts are in the unsatisfiable core [2019-05-15 10:31:42,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:31:42,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:31:42,112 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:42,112 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:42,114 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:42,115 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:42,115 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:31:42,116 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:42,116 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1492|]. (= |#memory_int| (store |v_#memory_int_1492| ULTIMATE.start_main_p1 0)) [2019-05-15 10:31:42,116 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:31:42,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 16 treesize of output 11 [2019-05-15 10:31:42,127 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:42,129 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:42,130 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:42,130 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:42,138 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:42,138 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1493|]. (let ((.cse0 (select |v_#memory_int_1493| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1493| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 0))) [2019-05-15 10:31:42,139 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:31:42,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 16 treesize of output 11 [2019-05-15 10:31:42,152 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:42,154 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:42,154 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:42,154 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:42,163 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:42,163 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1494|]. (let ((.cse0 (select |v_#memory_int_1494| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1494| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 1 .cse0))) [2019-05-15 10:31:42,163 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:31:42,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 16 treesize of output 11 [2019-05-15 10:31:42,184 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:42,186 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:42,186 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:42,186 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:42,194 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:42,195 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1495|]. (let ((.cse0 (select |v_#memory_int_1495| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1495| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 2 .cse0))) [2019-05-15 10:31:42,195 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:31:42,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:42,209 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:42,211 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:42,211 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:42,211 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:42,219 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:42,220 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1496|]. (let ((.cse0 (select |v_#memory_int_1496| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1496| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 3 .cse0))) [2019-05-15 10:31:42,220 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:31: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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:42,234 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:42,236 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:42,236 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:42,237 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:42,244 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:42,245 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1497|]. (let ((.cse0 (select |v_#memory_int_1497| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1497| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 4 .cse0))) [2019-05-15 10:31:42,245 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:31:42,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 16 treesize of output 11 [2019-05-15 10:31:42,258 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:42,260 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:42,261 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:42,261 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:42,269 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:42,269 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1498|]. (let ((.cse0 (select |v_#memory_int_1498| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1498| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 5))) [2019-05-15 10:31:42,269 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:31:42,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 16 treesize of output 11 [2019-05-15 10:31:42,285 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:42,288 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:42,288 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:42,288 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:42,296 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:42,296 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1499|]. (let ((.cse0 (select |v_#memory_int_1499| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1499| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 6))) [2019-05-15 10:31:42,297 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:31:42,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 16 treesize of output 11 [2019-05-15 10:31:42,313 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:42,314 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:42,315 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:42,315 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:42,322 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:42,322 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1500|]. (let ((.cse0 (select |v_#memory_int_1500| ULTIMATE.start_main_p1))) (and (= .cse0 7) (= (store |v_#memory_int_1500| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:42,322 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:31:42,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 16 treesize of output 11 [2019-05-15 10:31:42,340 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:42,342 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:42,342 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:42,342 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:42,350 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:42,350 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1501|]. (let ((.cse0 (select |v_#memory_int_1501| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1501| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 8))) [2019-05-15 10:31:42,350 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:31:42,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 16 treesize of output 11 [2019-05-15 10:31:42,371 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:42,373 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:42,373 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:42,373 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:42,381 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:42,381 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1502|]. (let ((.cse0 (select |v_#memory_int_1502| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1502| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 9 .cse0))) [2019-05-15 10:31:42,381 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:31:42,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:42,400 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:42,402 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:42,402 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:42,402 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:42,411 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:42,411 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1503|]. (let ((.cse0 (select |v_#memory_int_1503| ULTIMATE.start_main_p1))) (and (= .cse0 10) (= (store |v_#memory_int_1503| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:42,411 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:31:42,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:42,431 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:42,446 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:42,446 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:42,446 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:42,452 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:42,453 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1504|]. (let ((.cse0 (select |v_#memory_int_1504| ULTIMATE.start_main_p1))) (and (= .cse0 11) (= (store |v_#memory_int_1504| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:42,453 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:31:42,472 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:42,474 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:42,476 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:42,476 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:42,476 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:42,484 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:42,485 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1505|]. (let ((.cse0 (select |v_#memory_int_1505| ULTIMATE.start_main_p1))) (and (= 12 .cse0) (= (store |v_#memory_int_1505| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:42,485 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:31:42,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 16 treesize of output 11 [2019-05-15 10:31:42,506 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:42,508 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:42,509 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:42,509 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:42,517 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:42,517 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1506|]. (let ((.cse0 (select |v_#memory_int_1506| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1506| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 13 .cse0))) [2019-05-15 10:31:42,517 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:31:42,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:42,538 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:42,541 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:42,541 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:42,541 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:42,549 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:42,549 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1507|]. (let ((.cse0 (select |v_#memory_int_1507| ULTIMATE.start_main_p1))) (and (= 14 .cse0) (= |#memory_int| (store |v_#memory_int_1507| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:42,549 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:31:42,570 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:42,572 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:42,574 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:42,574 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:42,574 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:42,581 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:42,582 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1508|]. (let ((.cse0 (select |v_#memory_int_1508| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1508| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 15))) [2019-05-15 10:31:42,582 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:31:42,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:42,604 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:42,607 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:42,607 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:42,607 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:42,614 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:42,615 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1509|]. (let ((.cse0 (select |v_#memory_int_1509| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1509| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 16))) [2019-05-15 10:31:42,615 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:31:42,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 16 treesize of output 11 [2019-05-15 10:31:42,639 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:42,641 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:42,642 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:42,642 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:42,651 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:42,652 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1510|]. (let ((.cse0 (select |v_#memory_int_1510| ULTIMATE.start_main_p1))) (and (= .cse0 17) (= (store |v_#memory_int_1510| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:42,652 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:31:42,675 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:42,676 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:42,678 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:42,679 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:42,679 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:42,686 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:42,686 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1511|]. (let ((.cse0 (select |v_#memory_int_1511| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1511| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 18))) [2019-05-15 10:31:42,687 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:31:42,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:42,715 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:42,717 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:42,718 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:42,718 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:42,727 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:42,727 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1512|]. (let ((.cse0 (select |v_#memory_int_1512| ULTIMATE.start_main_p1))) (and (= .cse0 19) (= |#memory_int| (store |v_#memory_int_1512| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:42,727 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:31:42,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 16 treesize of output 11 [2019-05-15 10:31:42,753 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:42,756 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:42,756 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:42,756 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:42,764 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:42,765 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1513|]. (let ((.cse0 (select |v_#memory_int_1513| ULTIMATE.start_main_p1))) (and (= 20 .cse0) (= |#memory_int| (store |v_#memory_int_1513| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:42,765 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:31:42,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 16 treesize of output 11 [2019-05-15 10:31:42,792 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:42,795 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:42,795 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:42,795 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:42,803 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:42,804 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1514|]. (let ((.cse0 (select |v_#memory_int_1514| ULTIMATE.start_main_p1))) (and (= 21 .cse0) (= (store |v_#memory_int_1514| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:42,804 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:31:42,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:42,834 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:42,836 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:42,836 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:42,837 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:42,844 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:42,844 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1515|]. (let ((.cse0 (select |v_#memory_int_1515| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1515| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 22 .cse0))) [2019-05-15 10:31:42,844 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:31:42,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 16 treesize of output 11 [2019-05-15 10:31:42,873 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:42,876 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:42,876 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:42,876 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:42,884 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:42,885 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1516|]. (let ((.cse0 (select |v_#memory_int_1516| ULTIMATE.start_main_p1))) (and (= .cse0 23) (= (store |v_#memory_int_1516| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:42,885 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:31:42,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:42,916 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:42,918 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:42,919 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:42,919 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:42,928 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:42,928 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1517|]. (let ((.cse0 (select |v_#memory_int_1517| ULTIMATE.start_main_p1))) (and (= .cse0 24) (= (store |v_#memory_int_1517| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:42,928 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:31:42,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 16 treesize of output 11 [2019-05-15 10:31:42,958 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:42,960 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:42,961 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:42,961 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:42,969 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:42,969 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1518|]. (let ((.cse0 (select |v_#memory_int_1518| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1518| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 25))) [2019-05-15 10:31:42,970 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:31:43,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 16 treesize of output 11 [2019-05-15 10:31:43,003 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:43,005 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:43,006 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:43,006 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:43,013 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:43,013 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1519|]. (let ((.cse0 (select |v_#memory_int_1519| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1519| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 26 .cse0))) [2019-05-15 10:31:43,013 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:31:43,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 16 treesize of output 11 [2019-05-15 10:31:43,045 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:43,048 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:43,048 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:43,048 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:43,056 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:43,057 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1520|]. (let ((.cse0 (select |v_#memory_int_1520| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1520| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 27))) [2019-05-15 10:31:43,057 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:31:43,088 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:43,090 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:43,092 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:43,093 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:43,093 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:43,100 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:43,100 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1521|]. (let ((.cse0 (select |v_#memory_int_1521| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1521| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 28 .cse0))) [2019-05-15 10:31:43,101 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:31:43,135 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:43,137 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:43,139 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:43,139 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:43,139 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:43,146 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:43,147 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1522|]. (let ((.cse0 (select |v_#memory_int_1522| ULTIMATE.start_main_p1))) (and (= 29 .cse0) (= |#memory_int| (store |v_#memory_int_1522| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:43,147 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:31:43,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 16 treesize of output 11 [2019-05-15 10:31:43,181 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:43,184 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:43,184 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:43,184 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:43,192 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:43,192 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1523|]. (let ((.cse0 (select |v_#memory_int_1523| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1523| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 30))) [2019-05-15 10:31:43,192 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:31:43,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 16 treesize of output 11 [2019-05-15 10:31:43,229 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:43,231 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:43,232 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:43,232 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:43,239 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:43,239 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1524|]. (let ((.cse0 (select |v_#memory_int_1524| ULTIMATE.start_main_p1))) (and (= .cse0 31) (= (store |v_#memory_int_1524| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:43,239 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:31:43,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:43,280 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:43,282 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:43,282 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:43,283 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:43,290 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:43,290 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1525|]. (let ((.cse0 (select |v_#memory_int_1525| ULTIMATE.start_main_p1))) (and (= .cse0 32) (= (store |v_#memory_int_1525| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:43,290 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:31:43,325 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:43,326 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:43,328 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:43,329 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:43,329 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:43,337 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:43,338 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1526|]. (let ((.cse0 (select |v_#memory_int_1526| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1526| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 33))) [2019-05-15 10:31:43,338 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:31:43,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:43,377 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:43,379 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:43,380 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:43,380 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:43,388 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:43,388 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1527|]. (let ((.cse0 (select |v_#memory_int_1527| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1527| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 34))) [2019-05-15 10:31:43,389 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:31:43,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 16 treesize of output 11 [2019-05-15 10:31:43,427 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:43,430 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:43,430 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:43,430 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:43,438 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:43,438 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1528|]. (let ((.cse0 (select |v_#memory_int_1528| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1528| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 35 .cse0))) [2019-05-15 10:31:43,439 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:31:43,476 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:43,478 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:43,480 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:43,480 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:43,481 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:43,487 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:43,488 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1529|]. (let ((.cse0 (select |v_#memory_int_1529| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1529| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 36))) [2019-05-15 10:31:43,488 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:31:43,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 16 treesize of output 11 [2019-05-15 10:31:43,528 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:43,530 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:43,530 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:43,531 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:43,539 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:43,539 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1530|]. (let ((.cse0 (select |v_#memory_int_1530| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1530| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 37 .cse0))) [2019-05-15 10:31:43,539 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:31:43,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 16 treesize of output 11 [2019-05-15 10:31:43,583 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:43,586 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:43,586 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:43,586 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:43,593 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:43,593 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1531|]. (let ((.cse0 (select |v_#memory_int_1531| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1531| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 38))) [2019-05-15 10:31:43,593 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:31:43,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 16 treesize of output 11 [2019-05-15 10:31:43,636 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:43,639 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:43,639 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:43,639 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:43,647 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:43,647 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1532|]. (let ((.cse0 (select |v_#memory_int_1532| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1532| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 39))) [2019-05-15 10:31:43,647 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:31:43,690 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:43,692 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:43,694 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:43,695 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:43,695 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:43,703 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:43,704 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1533|]. (let ((.cse0 (select |v_#memory_int_1533| ULTIMATE.start_main_p1))) (and (= .cse0 40) (= (store |v_#memory_int_1533| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:43,704 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:31:43,748 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:43,749 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:43,752 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:43,752 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:43,752 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:43,761 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:43,761 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1534|]. (let ((.cse0 (select |v_#memory_int_1534| ULTIMATE.start_main_p1))) (and (= .cse0 41) (= (store |v_#memory_int_1534| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:43,761 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:31:43,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:43,806 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:43,809 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:43,809 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:43,810 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:43,818 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:43,818 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1535|]. (let ((.cse0 (select |v_#memory_int_1535| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1535| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 42))) [2019-05-15 10:31:43,818 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:31:43,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:43,866 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:43,868 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:43,869 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:43,869 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:43,878 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:43,878 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1536|]. (let ((.cse0 (select |v_#memory_int_1536| ULTIMATE.start_main_p1))) (and (= 43 .cse0) (= (store |v_#memory_int_1536| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:43,878 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:31:43,924 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:43,925 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:43,928 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:43,928 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:43,928 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:43,937 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:43,937 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1537|]. (let ((.cse0 (select |v_#memory_int_1537| ULTIMATE.start_main_p1))) (and (= 44 .cse0) (= |#memory_int| (store |v_#memory_int_1537| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:43,937 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:31:43,982 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:43,983 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:43,986 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:43,986 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:43,986 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:43,992 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:43,993 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1538|]. (let ((.cse0 (select |v_#memory_int_1538| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1538| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 45))) [2019-05-15 10:31:43,993 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:31:44,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 16 treesize of output 11 [2019-05-15 10:31:44,042 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,045 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:44,045 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,045 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:44,053 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:44,054 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1539|]. (let ((.cse0 (select |v_#memory_int_1539| ULTIMATE.start_main_p1))) (and (= .cse0 46) (= (store |v_#memory_int_1539| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:44,054 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:31:44,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:44,101 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,103 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:44,104 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,104 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:44,112 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:44,113 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1540|]. (let ((.cse0 (select |v_#memory_int_1540| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1540| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 47 .cse0))) [2019-05-15 10:31:44,113 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:31:44,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 16 treesize of output 11 [2019-05-15 10:31:44,163 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,166 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:44,166 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,166 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:44,177 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:44,177 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1541|]. (let ((.cse0 (select |v_#memory_int_1541| ULTIMATE.start_main_p1))) (and (= 48 .cse0) (= (store |v_#memory_int_1541| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:44,178 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:31: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 16 treesize of output 11 [2019-05-15 10:31:44,230 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,232 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:44,233 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,233 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:44,241 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:44,241 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1542|]. (let ((.cse0 (select |v_#memory_int_1542| ULTIMATE.start_main_p1))) (and (= .cse0 49) (= (store |v_#memory_int_1542| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:44,241 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:31:44,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:44,291 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,293 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:44,294 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,294 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:44,302 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:44,302 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1543|]. (let ((.cse0 (select |v_#memory_int_1543| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1543| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 50))) [2019-05-15 10:31:44,302 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:31:44,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 16 treesize of output 11 [2019-05-15 10:31:44,355 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,358 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:44,358 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,358 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:44,367 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:44,367 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1544|]. (let ((.cse0 (select |v_#memory_int_1544| ULTIMATE.start_main_p1))) (and (= .cse0 51) (= (store |v_#memory_int_1544| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:44,368 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:31:44,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 16 treesize of output 11 [2019-05-15 10:31:44,424 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,427 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:44,427 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,427 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:44,436 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:44,436 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1545|]. (let ((.cse0 (select |v_#memory_int_1545| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1545| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 52))) [2019-05-15 10:31:44,436 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:31:44,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:44,492 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,495 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:44,495 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,495 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:44,502 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:44,503 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1546|]. (let ((.cse0 (select |v_#memory_int_1546| ULTIMATE.start_main_p1))) (and (= .cse0 53) (= (store |v_#memory_int_1546| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:44,503 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:31:44,554 INFO L273 TraceCheckUtils]: 0: Hoare triple {13514#true} havoc main_p1; {13514#true} is VALID [2019-05-15 10:31:44,554 INFO L273 TraceCheckUtils]: 1: Hoare triple {13514#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {13514#true} is VALID [2019-05-15 10:31:44,555 INFO L273 TraceCheckUtils]: 2: Hoare triple {13514#true} #memory_int := #memory_int[main_p1 := 0]; {13525#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:31:44,556 INFO L273 TraceCheckUtils]: 3: Hoare triple {13525#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13529#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:31:44,557 INFO L273 TraceCheckUtils]: 4: Hoare triple {13529#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13533#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:31:44,557 INFO L273 TraceCheckUtils]: 5: Hoare triple {13533#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13537#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:31:44,558 INFO L273 TraceCheckUtils]: 6: Hoare triple {13537#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13541#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:31:44,559 INFO L273 TraceCheckUtils]: 7: Hoare triple {13541#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13545#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:31:44,560 INFO L273 TraceCheckUtils]: 8: Hoare triple {13545#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13549#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:31:44,561 INFO L273 TraceCheckUtils]: 9: Hoare triple {13549#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13553#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:31:44,562 INFO L273 TraceCheckUtils]: 10: Hoare triple {13553#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13557#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:31:44,563 INFO L273 TraceCheckUtils]: 11: Hoare triple {13557#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13561#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:31:44,564 INFO L273 TraceCheckUtils]: 12: Hoare triple {13561#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13565#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:31:44,565 INFO L273 TraceCheckUtils]: 13: Hoare triple {13565#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13569#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:31:44,566 INFO L273 TraceCheckUtils]: 14: Hoare triple {13569#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13573#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:31:44,566 INFO L273 TraceCheckUtils]: 15: Hoare triple {13573#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13577#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:31:44,567 INFO L273 TraceCheckUtils]: 16: Hoare triple {13577#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13581#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:31:44,568 INFO L273 TraceCheckUtils]: 17: Hoare triple {13581#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13585#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:31:44,569 INFO L273 TraceCheckUtils]: 18: Hoare triple {13585#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13589#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:31:44,571 INFO L273 TraceCheckUtils]: 19: Hoare triple {13589#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13593#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:31:44,572 INFO L273 TraceCheckUtils]: 20: Hoare triple {13593#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13597#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:31:44,572 INFO L273 TraceCheckUtils]: 21: Hoare triple {13597#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13601#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:31:44,573 INFO L273 TraceCheckUtils]: 22: Hoare triple {13601#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13605#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:31:44,574 INFO L273 TraceCheckUtils]: 23: Hoare triple {13605#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13609#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:31:44,575 INFO L273 TraceCheckUtils]: 24: Hoare triple {13609#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13613#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:31:44,577 INFO L273 TraceCheckUtils]: 25: Hoare triple {13613#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13617#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:31:44,577 INFO L273 TraceCheckUtils]: 26: Hoare triple {13617#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13621#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:31:44,578 INFO L273 TraceCheckUtils]: 27: Hoare triple {13621#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13625#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:31:44,579 INFO L273 TraceCheckUtils]: 28: Hoare triple {13625#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13629#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:31:44,580 INFO L273 TraceCheckUtils]: 29: Hoare triple {13629#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13633#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:31:44,582 INFO L273 TraceCheckUtils]: 30: Hoare triple {13633#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13637#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:31:44,582 INFO L273 TraceCheckUtils]: 31: Hoare triple {13637#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13641#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:31:44,583 INFO L273 TraceCheckUtils]: 32: Hoare triple {13641#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13645#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:31:44,584 INFO L273 TraceCheckUtils]: 33: Hoare triple {13645#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13649#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:31:44,585 INFO L273 TraceCheckUtils]: 34: Hoare triple {13649#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13653#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:31:44,586 INFO L273 TraceCheckUtils]: 35: Hoare triple {13653#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13657#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:31:44,587 INFO L273 TraceCheckUtils]: 36: Hoare triple {13657#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13661#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:31:44,588 INFO L273 TraceCheckUtils]: 37: Hoare triple {13661#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13665#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:31:44,589 INFO L273 TraceCheckUtils]: 38: Hoare triple {13665#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13669#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:31:44,590 INFO L273 TraceCheckUtils]: 39: Hoare triple {13669#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13673#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:31:44,591 INFO L273 TraceCheckUtils]: 40: Hoare triple {13673#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13677#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:31:44,592 INFO L273 TraceCheckUtils]: 41: Hoare triple {13677#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13681#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:31:44,593 INFO L273 TraceCheckUtils]: 42: Hoare triple {13681#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13685#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:31:44,594 INFO L273 TraceCheckUtils]: 43: Hoare triple {13685#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13689#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:31:44,595 INFO L273 TraceCheckUtils]: 44: Hoare triple {13689#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13693#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:31:44,597 INFO L273 TraceCheckUtils]: 45: Hoare triple {13693#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13697#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:31:44,598 INFO L273 TraceCheckUtils]: 46: Hoare triple {13697#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13701#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:31:44,598 INFO L273 TraceCheckUtils]: 47: Hoare triple {13701#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13705#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:31:44,599 INFO L273 TraceCheckUtils]: 48: Hoare triple {13705#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13709#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:31:44,600 INFO L273 TraceCheckUtils]: 49: Hoare triple {13709#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13713#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:31:44,601 INFO L273 TraceCheckUtils]: 50: Hoare triple {13713#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13717#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:31:44,602 INFO L273 TraceCheckUtils]: 51: Hoare triple {13717#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13721#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:31:44,603 INFO L273 TraceCheckUtils]: 52: Hoare triple {13721#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13725#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:31:44,603 INFO L273 TraceCheckUtils]: 53: Hoare triple {13725#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13729#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:31:44,604 INFO L273 TraceCheckUtils]: 54: Hoare triple {13729#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13733#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:31:44,605 INFO L273 TraceCheckUtils]: 55: Hoare triple {13733#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13737#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:31:44,606 INFO L273 TraceCheckUtils]: 56: Hoare triple {13737#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13741#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:31:44,607 INFO L273 TraceCheckUtils]: 57: Hoare triple {13741#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} assume !(#memory_int[main_p1] >= 0); {13515#false} is VALID [2019-05-15 10:31:44,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:31:44,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:31:44,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-05-15 10:31:44,614 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 58 [2019-05-15 10:31:44,614 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:31:44,614 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 57 states. [2019-05-15 10:31:44,667 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:44,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-05-15 10:31:44,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-05-15 10:31:44,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-05-15 10:31:44,669 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 57 states. [2019-05-15 10:31:51,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:31:51,837 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-05-15 10:31:51,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-05-15 10:31:51,837 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 58 [2019-05-15 10:31:51,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:31:51,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-05-15 10:31:51,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2019-05-15 10:31:51,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-05-15 10:31:51,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2019-05-15 10:31:51,839 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 57 states and 61 transitions. [2019-05-15 10:31:51,925 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:31:51,926 INFO L225 Difference]: With dead ends: 60 [2019-05-15 10:31:51,926 INFO L226 Difference]: Without dead ends: 60 [2019-05-15 10:31:51,926 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-05-15 10:31:51,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-05-15 10:31:51,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-05-15 10:31:51,928 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:31:51,928 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 60 states. [2019-05-15 10:31:51,928 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2019-05-15 10:31:51,928 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2019-05-15 10:31:51,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:31:51,929 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-05-15 10:31:51,929 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-05-15 10:31:51,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:31:51,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:31:51,929 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2019-05-15 10:31:51,930 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2019-05-15 10:31:51,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:31:51,930 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-05-15 10:31:51,931 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-05-15 10:31:51,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:31:51,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:31:51,931 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:31:51,931 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:31:51,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-05-15 10:31:51,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-05-15 10:31:51,932 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-05-15 10:31:51,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:31:51,932 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-05-15 10:31:51,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-05-15 10:31:51,932 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-05-15 10:31:51,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-05-15 10:31:51,933 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:31:51,933 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1, 1] [2019-05-15 10:31:51,933 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:31:51,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:31:51,933 INFO L82 PathProgramCache]: Analyzing trace with hash 416295298, now seen corresponding path program 55 times [2019-05-15 10:31:51,934 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:31:51,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:31:51,951 WARN L254 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 57 conjunts are in the unsatisfiable core [2019-05-15 10:31:51,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:31:51,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:31:52,000 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:52,000 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,002 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:52,003 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,003 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:31:52,005 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:52,005 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1547|]. (= |#memory_int| (store |v_#memory_int_1547| ULTIMATE.start_main_p1 0)) [2019-05-15 10:31:52,005 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:31:52,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:52,016 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,018 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:52,019 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,019 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:52,027 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:52,027 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1548|]. (let ((.cse0 (select |v_#memory_int_1548| ULTIMATE.start_main_p1))) (and (= .cse0 0) (= (store |v_#memory_int_1548| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:52,027 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:31:52,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:52,038 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,040 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:52,041 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,041 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:52,048 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:52,049 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1549|]. (let ((.cse0 (select |v_#memory_int_1549| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1549| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 1 .cse0))) [2019-05-15 10:31:52,049 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:31:52,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 16 treesize of output 11 [2019-05-15 10:31:52,062 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,064 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:52,065 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,065 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:52,073 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:52,073 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1550|]. (let ((.cse0 (select |v_#memory_int_1550| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1550| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 2))) [2019-05-15 10:31:52,073 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:31:52,086 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:52,087 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,089 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:52,089 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,089 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:52,096 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:52,097 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1551|]. (let ((.cse0 (select |v_#memory_int_1551| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1551| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 3))) [2019-05-15 10:31:52,097 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:31:52,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 16 treesize of output 11 [2019-05-15 10:31:52,110 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,113 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 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 1 xjuncts. [2019-05-15 10:31:52,113 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:52,121 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:52,121 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1552|]. (let ((.cse0 (select |v_#memory_int_1552| ULTIMATE.start_main_p1))) (and (= 4 .cse0) (= (store |v_#memory_int_1552| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:52,121 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:31:52,135 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:52,136 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,138 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:52,138 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,139 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:52,146 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:52,146 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1553|]. (let ((.cse0 (select |v_#memory_int_1553| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1553| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 5))) [2019-05-15 10:31:52,147 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:31:52,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 16 treesize of output 11 [2019-05-15 10:31:52,163 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,165 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:52,165 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,165 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:52,174 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:52,174 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1554|]. (let ((.cse0 (select |v_#memory_int_1554| ULTIMATE.start_main_p1))) (and (= 6 .cse0) (= |#memory_int| (store |v_#memory_int_1554| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:52,174 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:31:52,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 16 treesize of output 11 [2019-05-15 10:31:52,291 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,324 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:52,324 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,325 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:52,338 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:52,338 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1555|]. (let ((.cse0 (select |v_#memory_int_1555| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1555| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 7))) [2019-05-15 10:31:52,339 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:31:52,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 16 treesize of output 11 [2019-05-15 10:31:52,532 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,534 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:52,534 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,535 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:52,543 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:52,543 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1556|]. (let ((.cse0 (select |v_#memory_int_1556| ULTIMATE.start_main_p1))) (and (= 8 .cse0) (= (store |v_#memory_int_1556| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:52,543 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:31:52,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:52,563 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,565 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:52,565 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,566 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:52,573 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:52,573 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1557|]. (let ((.cse0 (select |v_#memory_int_1557| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1557| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 9 .cse0))) [2019-05-15 10:31:52,573 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:31:52,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:52,591 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,593 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:52,594 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,594 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:52,600 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:52,600 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1558|]. (let ((.cse0 (select |v_#memory_int_1558| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1558| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 10))) [2019-05-15 10:31:52,600 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:31:52,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 16 treesize of output 11 [2019-05-15 10:31:52,621 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,623 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:52,623 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,624 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:52,631 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:52,632 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1559|]. (let ((.cse0 (select |v_#memory_int_1559| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1559| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 11))) [2019-05-15 10:31:52,632 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:31:52,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 16 treesize of output 11 [2019-05-15 10:31:52,652 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,654 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:52,654 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,655 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:52,662 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:52,662 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1560|]. (let ((.cse0 (select |v_#memory_int_1560| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1560| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 12 .cse0))) [2019-05-15 10:31:52,662 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:31:52,682 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:52,683 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,685 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:52,686 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,686 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:52,694 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:52,694 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1561|]. (let ((.cse0 (select |v_#memory_int_1561| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1561| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 13 .cse0))) [2019-05-15 10:31:52,694 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:31:52,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 16 treesize of output 11 [2019-05-15 10:31:52,716 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,718 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:52,719 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,719 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:52,727 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:52,727 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1562|]. (let ((.cse0 (select |v_#memory_int_1562| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1562| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 14))) [2019-05-15 10:31:52,727 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:31:52,750 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:52,751 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,754 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:52,754 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,754 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:52,762 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:52,762 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1563|]. (let ((.cse0 (select |v_#memory_int_1563| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1563| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 15 .cse0))) [2019-05-15 10:31:52,762 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:31:52,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 16 treesize of output 11 [2019-05-15 10:31:52,786 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,788 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:52,788 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,789 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:52,797 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:52,797 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1564|]. (let ((.cse0 (select |v_#memory_int_1564| ULTIMATE.start_main_p1))) (and (= 16 .cse0) (= |#memory_int| (store |v_#memory_int_1564| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:52,797 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:31:52,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 16 treesize of output 11 [2019-05-15 10:31:52,823 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,825 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:52,825 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,826 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:52,833 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:52,833 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1565|]. (let ((.cse0 (select |v_#memory_int_1565| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1565| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 17))) [2019-05-15 10:31:52,833 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:31:52,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 16 treesize of output 11 [2019-05-15 10:31:52,861 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,863 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:52,863 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,863 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:52,871 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:52,871 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1566|]. (let ((.cse0 (select |v_#memory_int_1566| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1566| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 18 .cse0))) [2019-05-15 10:31:52,872 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:31:52,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:52,898 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,900 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:52,900 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,900 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:52,907 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:52,907 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1567|]. (let ((.cse0 (select |v_#memory_int_1567| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1567| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 19))) [2019-05-15 10:31:52,907 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:31:52,934 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:52,935 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,937 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:52,938 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,938 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:52,946 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:52,946 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1568|]. (let ((.cse0 (select |v_#memory_int_1568| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1568| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 20))) [2019-05-15 10:31:52,946 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:31:52,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 16 treesize of output 11 [2019-05-15 10:31:52,972 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,975 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:52,975 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:52,975 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:52,983 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:52,983 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1569|]. (let ((.cse0 (select |v_#memory_int_1569| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1569| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 21))) [2019-05-15 10:31:52,983 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:31:53,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:53,012 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,014 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:53,014 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,014 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:53,023 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:53,023 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1570|]. (let ((.cse0 (select |v_#memory_int_1570| ULTIMATE.start_main_p1))) (and (= .cse0 22) (= (store |v_#memory_int_1570| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:53,023 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:31:53,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 16 treesize of output 11 [2019-05-15 10:31:53,052 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,054 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:53,055 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,055 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:53,062 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:53,062 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1571|]. (let ((.cse0 (select |v_#memory_int_1571| ULTIMATE.start_main_p1))) (and (= .cse0 23) (= (store |v_#memory_int_1571| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:53,062 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:31:53,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:53,091 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,093 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:53,093 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,093 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:53,101 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:53,102 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1572|]. (let ((.cse0 (select |v_#memory_int_1572| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1572| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 24 .cse0))) [2019-05-15 10:31:53,102 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:31:53,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 16 treesize of output 11 [2019-05-15 10:31:53,132 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,134 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:53,134 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,134 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:53,141 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:53,142 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1573|]. (let ((.cse0 (select |v_#memory_int_1573| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1573| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 25 .cse0))) [2019-05-15 10:31:53,142 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:31:53,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 16 treesize of output 11 [2019-05-15 10:31:53,172 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,174 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:53,175 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,175 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:53,183 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:53,183 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1574|]. (let ((.cse0 (select |v_#memory_int_1574| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1574| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 26))) [2019-05-15 10:31:53,183 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:31:53,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:53,216 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,218 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:53,218 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,219 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:53,227 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:53,227 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1575|]. (let ((.cse0 (select |v_#memory_int_1575| ULTIMATE.start_main_p1))) (and (= 27 .cse0) (= (store |v_#memory_int_1575| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:53,228 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:31:53,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 16 treesize of output 11 [2019-05-15 10:31:53,260 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,262 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:53,263 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,263 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:53,271 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:53,272 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1576|]. (let ((.cse0 (select |v_#memory_int_1576| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1576| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 28 .cse0))) [2019-05-15 10:31:53,272 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:31:53,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 16 treesize of output 11 [2019-05-15 10:31:53,306 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,308 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:53,308 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,308 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:53,315 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:53,315 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1577|]. (let ((.cse0 (select |v_#memory_int_1577| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1577| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 29))) [2019-05-15 10:31:53,315 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:31:53,348 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:53,349 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,352 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:53,352 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,352 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:53,360 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:53,360 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1578|]. (let ((.cse0 (select |v_#memory_int_1578| ULTIMATE.start_main_p1))) (and (= 30 .cse0) (= (store |v_#memory_int_1578| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:53,360 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:31:53,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 16 treesize of output 11 [2019-05-15 10:31:53,397 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,400 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:53,400 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,400 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:53,408 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:53,408 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1579|]. (let ((.cse0 (select |v_#memory_int_1579| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1579| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 31 .cse0))) [2019-05-15 10:31:53,409 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:31:53,444 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:53,445 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,447 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:53,448 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,448 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:53,456 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:53,456 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1580|]. (let ((.cse0 (select |v_#memory_int_1580| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1580| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 32 .cse0))) [2019-05-15 10:31:53,457 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:31:53,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 16 treesize of output 11 [2019-05-15 10:31:53,494 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,496 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:53,497 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,497 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:53,506 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:53,506 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1581|]. (let ((.cse0 (select |v_#memory_int_1581| ULTIMATE.start_main_p1))) (and (= .cse0 33) (= (store |v_#memory_int_1581| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:53,506 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:31:53,545 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:53,546 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,549 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:53,549 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,549 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:53,557 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:53,557 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1582|]. (let ((.cse0 (select |v_#memory_int_1582| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1582| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 34))) [2019-05-15 10:31:53,557 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:31:53,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 16 treesize of output 11 [2019-05-15 10:31:53,598 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,600 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:53,600 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,601 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:53,609 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:53,610 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1583|]. (let ((.cse0 (select |v_#memory_int_1583| ULTIMATE.start_main_p1))) (and (= 35 .cse0) (= (store |v_#memory_int_1583| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:53,610 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:31:53,648 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:53,649 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,652 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:53,652 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,652 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:53,660 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:53,660 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1584|]. (let ((.cse0 (select |v_#memory_int_1584| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1584| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 36 .cse0))) [2019-05-15 10:31:53,661 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:31:53,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 16 treesize of output 11 [2019-05-15 10:31:53,704 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,706 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:53,706 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,707 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:53,714 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:53,714 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1585|]. (let ((.cse0 (select |v_#memory_int_1585| ULTIMATE.start_main_p1))) (and (= 37 .cse0) (= (store |v_#memory_int_1585| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:53,714 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:31:53,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 16 treesize of output 11 [2019-05-15 10:31:53,754 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,756 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:53,757 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,757 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:53,764 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:53,764 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1586|]. (let ((.cse0 (select |v_#memory_int_1586| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1586| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 38))) [2019-05-15 10:31:53,764 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:31:53,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:53,808 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,811 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:53,811 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,812 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:53,820 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:53,820 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1587|]. (let ((.cse0 (select |v_#memory_int_1587| ULTIMATE.start_main_p1))) (and (= 39 .cse0) (= (store |v_#memory_int_1587| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:53,820 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:31:53,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:53,865 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,868 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:53,868 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,868 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:53,877 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:53,877 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1588|]. (let ((.cse0 (select |v_#memory_int_1588| ULTIMATE.start_main_p1))) (and (= 40 .cse0) (= (store |v_#memory_int_1588| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:53,877 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:31:53,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:53,921 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,923 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:53,924 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,924 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:53,932 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:53,932 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1589|]. (let ((.cse0 (select |v_#memory_int_1589| ULTIMATE.start_main_p1))) (and (= .cse0 41) (= |#memory_int| (store |v_#memory_int_1589| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:53,932 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:31:53,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:53,978 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,980 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:53,981 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:53,981 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:53,989 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:53,990 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1590|]. (let ((.cse0 (select |v_#memory_int_1590| ULTIMATE.start_main_p1))) (and (= 42 .cse0) (= |#memory_int| (store |v_#memory_int_1590| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:53,990 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:31:54,038 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:54,039 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,041 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:54,042 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,042 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:54,051 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:54,051 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1591|]. (let ((.cse0 (select |v_#memory_int_1591| ULTIMATE.start_main_p1))) (and (= .cse0 43) (= (store |v_#memory_int_1591| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:54,051 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:31:54,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:54,100 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,103 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:54,103 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,103 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:54,111 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:54,111 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1592|]. (let ((.cse0 (select |v_#memory_int_1592| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1592| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 44))) [2019-05-15 10:31:54,111 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:31:54,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:54,159 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,162 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:54,162 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,162 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:54,171 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:54,172 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1593|]. (let ((.cse0 (select |v_#memory_int_1593| ULTIMATE.start_main_p1))) (and (= 45 .cse0) (= |#memory_int| (store |v_#memory_int_1593| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:54,172 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:31:54,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 16 treesize of output 11 [2019-05-15 10:31:54,223 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,225 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:54,225 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,226 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:54,233 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:54,233 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1594|]. (let ((.cse0 (select |v_#memory_int_1594| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1594| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 46))) [2019-05-15 10:31:54,233 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:31: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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:54,306 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,310 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:54,310 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,310 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:54,318 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:54,318 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1595|]. (let ((.cse0 (select |v_#memory_int_1595| ULTIMATE.start_main_p1))) (and (= .cse0 47) (= (store |v_#memory_int_1595| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:54,318 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:31:54,367 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:54,368 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,371 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:54,371 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,371 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:54,381 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:54,382 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1596|]. (let ((.cse0 (select |v_#memory_int_1596| ULTIMATE.start_main_p1))) (and (= 48 .cse0) (= (store |v_#memory_int_1596| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:54,382 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:31:54,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 16 treesize of output 11 [2019-05-15 10:31:54,433 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,435 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:54,436 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,436 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:54,444 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:54,444 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1597|]. (let ((.cse0 (select |v_#memory_int_1597| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1597| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 49))) [2019-05-15 10:31:54,444 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:31:54,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 16 treesize of output 11 [2019-05-15 10:31:54,498 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,500 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:54,500 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,501 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:54,507 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:54,507 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1598|]. (let ((.cse0 (select |v_#memory_int_1598| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1598| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 50))) [2019-05-15 10:31:54,508 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:31:54,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:54,561 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,564 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:54,564 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,564 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:54,572 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:54,572 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1599|]. (let ((.cse0 (select |v_#memory_int_1599| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1599| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 51 .cse0))) [2019-05-15 10:31:54,573 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:31:54,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:54,626 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,629 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:54,629 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,629 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:54,638 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:54,638 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1600|]. (let ((.cse0 (select |v_#memory_int_1600| ULTIMATE.start_main_p1))) (and (= 52 .cse0) (= (store |v_#memory_int_1600| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:54,638 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:31:54,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 16 treesize of output 11 [2019-05-15 10:31:54,694 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,697 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:54,697 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,697 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:54,706 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:54,706 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1601|]. (let ((.cse0 (select |v_#memory_int_1601| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1601| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 53 .cse0))) [2019-05-15 10:31:54,706 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:31:54,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:54,759 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,762 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:54,762 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,762 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:54,771 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:54,771 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1602|]. (let ((.cse0 (select |v_#memory_int_1602| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1602| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 54))) [2019-05-15 10:31:54,771 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:31:54,818 INFO L273 TraceCheckUtils]: 0: Hoare triple {13984#true} havoc main_p1; {13984#true} is VALID [2019-05-15 10:31:54,818 INFO L273 TraceCheckUtils]: 1: Hoare triple {13984#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {13984#true} is VALID [2019-05-15 10:31:54,819 INFO L273 TraceCheckUtils]: 2: Hoare triple {13984#true} #memory_int := #memory_int[main_p1 := 0]; {13995#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:31:54,820 INFO L273 TraceCheckUtils]: 3: Hoare triple {13995#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13999#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:31:54,820 INFO L273 TraceCheckUtils]: 4: Hoare triple {13999#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14003#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:31:54,821 INFO L273 TraceCheckUtils]: 5: Hoare triple {14003#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14007#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:31:54,821 INFO L273 TraceCheckUtils]: 6: Hoare triple {14007#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14011#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:31:54,822 INFO L273 TraceCheckUtils]: 7: Hoare triple {14011#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14015#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:31:54,822 INFO L273 TraceCheckUtils]: 8: Hoare triple {14015#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14019#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:31:54,823 INFO L273 TraceCheckUtils]: 9: Hoare triple {14019#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14023#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:31:54,824 INFO L273 TraceCheckUtils]: 10: Hoare triple {14023#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14027#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:31:54,825 INFO L273 TraceCheckUtils]: 11: Hoare triple {14027#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14031#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:31:54,825 INFO L273 TraceCheckUtils]: 12: Hoare triple {14031#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14035#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:31:54,826 INFO L273 TraceCheckUtils]: 13: Hoare triple {14035#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14039#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:31:54,827 INFO L273 TraceCheckUtils]: 14: Hoare triple {14039#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14043#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:31:54,828 INFO L273 TraceCheckUtils]: 15: Hoare triple {14043#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14047#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:31:54,829 INFO L273 TraceCheckUtils]: 16: Hoare triple {14047#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14051#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:31:54,829 INFO L273 TraceCheckUtils]: 17: Hoare triple {14051#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14055#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:31:54,830 INFO L273 TraceCheckUtils]: 18: Hoare triple {14055#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14059#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:31:54,831 INFO L273 TraceCheckUtils]: 19: Hoare triple {14059#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14063#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:31:54,832 INFO L273 TraceCheckUtils]: 20: Hoare triple {14063#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14067#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:31:54,833 INFO L273 TraceCheckUtils]: 21: Hoare triple {14067#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14071#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:31:54,833 INFO L273 TraceCheckUtils]: 22: Hoare triple {14071#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14075#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:31:54,834 INFO L273 TraceCheckUtils]: 23: Hoare triple {14075#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14079#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:31:54,835 INFO L273 TraceCheckUtils]: 24: Hoare triple {14079#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14083#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:31:54,836 INFO L273 TraceCheckUtils]: 25: Hoare triple {14083#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14087#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:31:54,837 INFO L273 TraceCheckUtils]: 26: Hoare triple {14087#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14091#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:31:54,838 INFO L273 TraceCheckUtils]: 27: Hoare triple {14091#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14095#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:31:54,838 INFO L273 TraceCheckUtils]: 28: Hoare triple {14095#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14099#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:31:54,839 INFO L273 TraceCheckUtils]: 29: Hoare triple {14099#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14103#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:31:54,840 INFO L273 TraceCheckUtils]: 30: Hoare triple {14103#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14107#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:31:54,841 INFO L273 TraceCheckUtils]: 31: Hoare triple {14107#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14111#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:31:54,842 INFO L273 TraceCheckUtils]: 32: Hoare triple {14111#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14115#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:31:54,842 INFO L273 TraceCheckUtils]: 33: Hoare triple {14115#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14119#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:31:54,843 INFO L273 TraceCheckUtils]: 34: Hoare triple {14119#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14123#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:31:54,844 INFO L273 TraceCheckUtils]: 35: Hoare triple {14123#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14127#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:31:54,845 INFO L273 TraceCheckUtils]: 36: Hoare triple {14127#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14131#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:31:54,846 INFO L273 TraceCheckUtils]: 37: Hoare triple {14131#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14135#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:31:54,847 INFO L273 TraceCheckUtils]: 38: Hoare triple {14135#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14139#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:31:54,847 INFO L273 TraceCheckUtils]: 39: Hoare triple {14139#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14143#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:31:54,848 INFO L273 TraceCheckUtils]: 40: Hoare triple {14143#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14147#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:31:54,849 INFO L273 TraceCheckUtils]: 41: Hoare triple {14147#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14151#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:31:54,850 INFO L273 TraceCheckUtils]: 42: Hoare triple {14151#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14155#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:31:54,851 INFO L273 TraceCheckUtils]: 43: Hoare triple {14155#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14159#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:31:54,851 INFO L273 TraceCheckUtils]: 44: Hoare triple {14159#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14163#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:31:54,852 INFO L273 TraceCheckUtils]: 45: Hoare triple {14163#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14167#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:31:54,853 INFO L273 TraceCheckUtils]: 46: Hoare triple {14167#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14171#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:31:54,854 INFO L273 TraceCheckUtils]: 47: Hoare triple {14171#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14175#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:31:54,855 INFO L273 TraceCheckUtils]: 48: Hoare triple {14175#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14179#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:31:54,856 INFO L273 TraceCheckUtils]: 49: Hoare triple {14179#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14183#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:31:54,856 INFO L273 TraceCheckUtils]: 50: Hoare triple {14183#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14187#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:31:54,857 INFO L273 TraceCheckUtils]: 51: Hoare triple {14187#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14191#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:31:54,858 INFO L273 TraceCheckUtils]: 52: Hoare triple {14191#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14195#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:31:54,859 INFO L273 TraceCheckUtils]: 53: Hoare triple {14195#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14199#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:31:54,860 INFO L273 TraceCheckUtils]: 54: Hoare triple {14199#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14203#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:31:54,860 INFO L273 TraceCheckUtils]: 55: Hoare triple {14203#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14207#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:31:54,861 INFO L273 TraceCheckUtils]: 56: Hoare triple {14207#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14211#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:31:54,862 INFO L273 TraceCheckUtils]: 57: Hoare triple {14211#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14215#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:31:54,863 INFO L273 TraceCheckUtils]: 58: Hoare triple {14215#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} assume !(#memory_int[main_p1] >= 0); {13985#false} is VALID [2019-05-15 10:31:54,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:31:54,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:31:54,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-05-15 10:31:54,870 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 59 [2019-05-15 10:31:54,870 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:31:54,870 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 58 states. [2019-05-15 10:31:54,919 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:31:54,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-05-15 10:31:54,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-05-15 10:31:54,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-05-15 10:31:54,921 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 58 states. [2019-05-15 10:32:02,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:32:02,254 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-05-15 10:32:02,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-05-15 10:32:02,255 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 59 [2019-05-15 10:32:02,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:32:02,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-05-15 10:32:02,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2019-05-15 10:32:02,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-05-15 10:32:02,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2019-05-15 10:32:02,256 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 58 states and 62 transitions. [2019-05-15 10:32:02,319 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:32:02,320 INFO L225 Difference]: With dead ends: 61 [2019-05-15 10:32:02,320 INFO L226 Difference]: Without dead ends: 61 [2019-05-15 10:32:02,321 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-05-15 10:32:02,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-05-15 10:32:02,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-05-15 10:32:02,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:32:02,323 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 61 states. [2019-05-15 10:32:02,323 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 61 states. [2019-05-15 10:32:02,323 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 61 states. [2019-05-15 10:32:02,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:32:02,324 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-05-15 10:32:02,324 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-05-15 10:32:02,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:32:02,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:32:02,324 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 61 states. [2019-05-15 10:32:02,324 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 61 states. [2019-05-15 10:32:02,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:32:02,325 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-05-15 10:32:02,325 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-05-15 10:32:02,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:32:02,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:32:02,325 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:32:02,325 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:32:02,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-05-15 10:32:02,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-05-15 10:32:02,326 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-05-15 10:32:02,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:32:02,327 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-05-15 10:32:02,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-05-15 10:32:02,327 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-05-15 10:32:02,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-05-15 10:32:02,327 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:32:02,327 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1, 1] [2019-05-15 10:32:02,328 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:32:02,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:32:02,328 INFO L82 PathProgramCache]: Analyzing trace with hash 20252296, now seen corresponding path program 56 times [2019-05-15 10:32:02,328 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:32:02,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:32:02,358 WARN L254 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 58 conjunts are in the unsatisfiable core [2019-05-15 10:32:02,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:32:02,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:32:02,385 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:02,385 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:02,387 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:02,388 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:02,388 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:32:02,389 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:02,389 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1603|]. (= |#memory_int| (store |v_#memory_int_1603| ULTIMATE.start_main_p1 0)) [2019-05-15 10:32:02,389 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:32:02,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 16 treesize of output 11 [2019-05-15 10:32:02,401 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:02,403 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:02,403 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:02,403 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:02,411 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:02,411 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1604|]. (let ((.cse0 (select |v_#memory_int_1604| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1604| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 0 .cse0))) [2019-05-15 10:32:02,411 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:32:02,422 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:02,423 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:02,425 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:02,425 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:02,425 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:02,434 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:02,434 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1605|]. (let ((.cse0 (select |v_#memory_int_1605| ULTIMATE.start_main_p1))) (and (= .cse0 1) (= (store |v_#memory_int_1605| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:02,434 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:32:02,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 16 treesize of output 11 [2019-05-15 10:32:02,459 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:02,460 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:02,460 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:02,461 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:02,467 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:02,468 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1606|]. (let ((.cse0 (select |v_#memory_int_1606| ULTIMATE.start_main_p1))) (and (= .cse0 2) (= |#memory_int| (store |v_#memory_int_1606| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:02,468 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:32:02,480 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:02,481 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:02,483 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:02,483 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:02,483 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:02,489 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:02,490 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1607|]. (let ((.cse0 (select |v_#memory_int_1607| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1607| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 3))) [2019-05-15 10:32:02,490 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:32:02,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 16 treesize of output 11 [2019-05-15 10:32:02,504 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:02,506 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:02,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:02,507 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:02,514 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:02,515 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1608|]. (let ((.cse0 (select |v_#memory_int_1608| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1608| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 4))) [2019-05-15 10:32:02,515 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:32:02,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 16 treesize of output 11 [2019-05-15 10:32:02,531 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:02,533 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:02,533 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:02,534 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:02,540 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:02,541 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1609|]. (let ((.cse0 (select |v_#memory_int_1609| ULTIMATE.start_main_p1))) (and (= 5 .cse0) (= |#memory_int| (store |v_#memory_int_1609| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:02,541 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:32:02,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 16 treesize of output 11 [2019-05-15 10:32:02,556 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:02,558 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:02,558 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:02,558 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:02,566 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:02,566 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1610|]. (let ((.cse0 (select |v_#memory_int_1610| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1610| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 6 .cse0))) [2019-05-15 10:32:02,566 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:32:02,581 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:02,582 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:02,584 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:02,584 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:02,585 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:02,594 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:02,594 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1611|]. (let ((.cse0 (select |v_#memory_int_1611| ULTIMATE.start_main_p1))) (and (= .cse0 7) (= |#memory_int| (store |v_#memory_int_1611| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:02,594 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:32:02,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 16 treesize of output 11 [2019-05-15 10:32:02,614 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:02,616 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:02,616 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:02,616 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:02,624 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:02,624 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1612|]. (let ((.cse0 (select |v_#memory_int_1612| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1612| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 8 .cse0))) [2019-05-15 10:32:02,625 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:32:02,643 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:02,650 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:02,652 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:02,652 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:02,652 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:02,658 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:02,658 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1613|]. (let ((.cse0 (select |v_#memory_int_1613| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1613| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 9 .cse0))) [2019-05-15 10:32:02,658 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:32:02,675 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:02,676 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:02,678 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:02,679 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:02,679 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:02,687 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:02,687 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1614|]. (let ((.cse0 (select |v_#memory_int_1614| ULTIMATE.start_main_p1))) (and (= 10 .cse0) (= (store |v_#memory_int_1614| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:02,687 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:32:02,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 16 treesize of output 11 [2019-05-15 10:32:02,710 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:02,712 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:02,712 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:02,712 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:02,719 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:02,719 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1615|]. (let ((.cse0 (select |v_#memory_int_1615| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1615| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 11 .cse0))) [2019-05-15 10:32:02,719 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:32:02,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:02,738 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:02,741 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:02,741 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:02,741 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:02,749 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:02,749 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1616|]. (let ((.cse0 (select |v_#memory_int_1616| ULTIMATE.start_main_p1))) (and (= 12 .cse0) (= |#memory_int| (store |v_#memory_int_1616| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:02,749 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:32:02,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:02,768 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:02,771 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:02,771 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:02,771 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:02,779 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:02,779 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1617|]. (let ((.cse0 (select |v_#memory_int_1617| ULTIMATE.start_main_p1))) (and (= .cse0 13) (= (store |v_#memory_int_1617| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:02,779 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:32:02,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 16 treesize of output 11 [2019-05-15 10:32:02,801 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:02,803 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:02,803 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:02,803 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:02,811 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:02,811 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1618|]. (let ((.cse0 (select |v_#memory_int_1618| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1618| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 14))) [2019-05-15 10:32:02,811 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:32:02,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:02,834 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:02,836 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:02,836 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:02,836 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:02,844 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:02,844 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1619|]. (let ((.cse0 (select |v_#memory_int_1619| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1619| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 15))) [2019-05-15 10:32:02,844 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:32:02,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 16 treesize of output 11 [2019-05-15 10:32:02,868 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:02,870 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:02,871 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:02,871 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:02,879 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:02,879 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1620|]. (let ((.cse0 (select |v_#memory_int_1620| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1620| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 16))) [2019-05-15 10:32:02,879 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:32:02,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:02,907 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:02,909 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:02,909 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:02,909 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:02,916 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:02,916 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1621|]. (let ((.cse0 (select |v_#memory_int_1621| ULTIMATE.start_main_p1))) (and (= 17 .cse0) (= (store |v_#memory_int_1621| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:02,916 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:32:02,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:02,941 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:02,943 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:02,943 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:02,943 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:02,952 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:02,952 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1622|]. (let ((.cse0 (select |v_#memory_int_1622| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1622| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 18))) [2019-05-15 10:32:02,952 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:32:02,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:02,977 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:02,979 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:02,979 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:02,979 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:02,987 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:02,987 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1623|]. (let ((.cse0 (select |v_#memory_int_1623| ULTIMATE.start_main_p1))) (and (= .cse0 19) (= |#memory_int| (store |v_#memory_int_1623| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:02,988 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:32:03,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:03,014 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:03,017 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:03,017 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:03,017 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:03,026 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:03,027 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1624|]. (let ((.cse0 (select |v_#memory_int_1624| ULTIMATE.start_main_p1))) (and (= .cse0 20) (= (store |v_#memory_int_1624| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:03,027 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:32:03,053 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:03,054 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:03,056 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:03,057 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:03,057 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:03,065 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:03,065 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1625|]. (let ((.cse0 (select |v_#memory_int_1625| ULTIMATE.start_main_p1))) (and (= 21 .cse0) (= (store |v_#memory_int_1625| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:03,065 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:32:03,092 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:03,093 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:03,095 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:03,096 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:03,096 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:03,103 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:03,104 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1626|]. (let ((.cse0 (select |v_#memory_int_1626| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1626| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 22 .cse0))) [2019-05-15 10:32:03,104 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:32:03,129 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:03,130 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:03,133 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:03,133 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:03,133 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:03,141 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:03,141 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1627|]. (let ((.cse0 (select |v_#memory_int_1627| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1627| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 23 .cse0))) [2019-05-15 10:32:03,141 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:32:03,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 16 treesize of output 11 [2019-05-15 10:32:03,172 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:03,174 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:03,174 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:03,174 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:03,182 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:03,182 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1628|]. (let ((.cse0 (select |v_#memory_int_1628| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1628| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 24 .cse0))) [2019-05-15 10:32:03,183 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:32:03,215 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:03,216 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:03,218 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:03,218 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:03,219 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:03,226 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:03,226 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1629|]. (let ((.cse0 (select |v_#memory_int_1629| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1629| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 25))) [2019-05-15 10:32:03,226 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:32:03,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:03,259 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:03,261 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:03,262 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:03,262 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:03,270 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:03,270 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1630|]. (let ((.cse0 (select |v_#memory_int_1630| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1630| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 26))) [2019-05-15 10:32:03,270 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:32:03,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 16 treesize of output 11 [2019-05-15 10:32:03,303 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:03,306 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:03,306 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:03,306 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:03,312 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:03,313 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1631|]. (let ((.cse0 (select |v_#memory_int_1631| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1631| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 27))) [2019-05-15 10:32:03,313 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:32:03,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 16 treesize of output 11 [2019-05-15 10:32:03,345 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:03,347 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:03,348 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:03,348 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:03,356 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:03,356 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1632|]. (let ((.cse0 (select |v_#memory_int_1632| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1632| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 28))) [2019-05-15 10:32:03,356 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:32:03,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 16 treesize of output 11 [2019-05-15 10:32:03,389 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:03,392 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:03,392 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:03,392 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:03,399 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:03,400 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1633|]. (let ((.cse0 (select |v_#memory_int_1633| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1633| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 29))) [2019-05-15 10:32:03,400 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:32:03,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 16 treesize of output 11 [2019-05-15 10:32:03,432 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:03,434 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:03,434 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:03,434 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:03,442 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:03,442 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1634|]. (let ((.cse0 (select |v_#memory_int_1634| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1634| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 30))) [2019-05-15 10:32:03,442 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:32:03,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 16 treesize of output 11 [2019-05-15 10:32:03,476 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:03,478 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:03,479 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:03,479 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:03,488 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:03,489 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1635|]. (let ((.cse0 (select |v_#memory_int_1635| ULTIMATE.start_main_p1))) (and (= .cse0 31) (= |#memory_int| (store |v_#memory_int_1635| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:03,489 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:32: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 16 treesize of output 11 [2019-05-15 10:32:03,528 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:03,530 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:03,531 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:03,531 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:03,539 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:03,539 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1636|]. (let ((.cse0 (select |v_#memory_int_1636| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1636| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 32 .cse0))) [2019-05-15 10:32:03,539 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:32:03,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:03,578 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:03,581 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:03,581 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:03,581 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:03,589 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:03,589 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1637|]. (let ((.cse0 (select |v_#memory_int_1637| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1637| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 33 .cse0))) [2019-05-15 10:32:03,589 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:32:03,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:03,626 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:03,628 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:03,628 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:03,628 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:03,636 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:03,636 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1638|]. (let ((.cse0 (select |v_#memory_int_1638| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1638| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 34))) [2019-05-15 10:32:03,636 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:32:03,675 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:03,676 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:03,678 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:03,678 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:03,679 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:03,685 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:03,686 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1639|]. (let ((.cse0 (select |v_#memory_int_1639| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1639| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 35))) [2019-05-15 10:32:03,686 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:32:03,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 16 treesize of output 11 [2019-05-15 10:32:03,725 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:03,727 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:03,728 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:03,728 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:03,735 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:03,735 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1640|]. (let ((.cse0 (select |v_#memory_int_1640| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1640| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 36 .cse0))) [2019-05-15 10:32:03,735 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:32:03,790 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:03,791 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:03,793 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:03,794 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:03,794 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:03,802 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:03,802 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1641|]. (let ((.cse0 (select |v_#memory_int_1641| ULTIMATE.start_main_p1))) (and (= 37 .cse0) (= (store |v_#memory_int_1641| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:03,802 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:32:03,846 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:03,847 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:03,849 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:03,850 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:03,850 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:03,858 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:03,858 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1642|]. (let ((.cse0 (select |v_#memory_int_1642| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1642| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 38 .cse0))) [2019-05-15 10:32:03,858 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:32:03,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 16 treesize of output 11 [2019-05-15 10:32:03,900 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:03,902 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:03,902 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:03,902 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:03,910 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:03,911 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1643|]. (let ((.cse0 (select |v_#memory_int_1643| ULTIMATE.start_main_p1))) (and (= 39 .cse0) (= |#memory_int| (store |v_#memory_int_1643| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:03,911 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:32:03,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 16 treesize of output 11 [2019-05-15 10:32:03,956 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:03,959 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:03,959 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:03,959 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:03,968 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:03,968 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1644|]. (let ((.cse0 (select |v_#memory_int_1644| ULTIMATE.start_main_p1))) (and (= .cse0 40) (= (store |v_#memory_int_1644| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:03,968 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:32:04,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 16 treesize of output 11 [2019-05-15 10:32:04,013 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:04,015 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:04,016 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:04,016 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:04,024 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:04,025 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1645|]. (let ((.cse0 (select |v_#memory_int_1645| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1645| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 41))) [2019-05-15 10:32:04,025 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:32:04,072 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:04,073 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:04,075 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:04,076 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:04,076 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:04,084 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:04,084 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1646|]. (let ((.cse0 (select |v_#memory_int_1646| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1646| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 42 .cse0))) [2019-05-15 10:32:04,084 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:32:04,129 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:04,130 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:04,132 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:04,132 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:04,133 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:04,140 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:04,140 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1647|]. (let ((.cse0 (select |v_#memory_int_1647| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1647| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 43 .cse0))) [2019-05-15 10:32:04,140 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:32:04,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 16 treesize of output 11 [2019-05-15 10:32:04,187 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:04,189 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:04,190 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:04,190 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:04,198 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:04,198 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1648|]. (let ((.cse0 (select |v_#memory_int_1648| ULTIMATE.start_main_p1))) (and (= .cse0 44) (= (store |v_#memory_int_1648| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:04,199 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:32:04,244 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:04,245 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:04,248 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:04,248 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:04,248 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:04,257 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:04,257 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1649|]. (let ((.cse0 (select |v_#memory_int_1649| ULTIMATE.start_main_p1))) (and (= .cse0 45) (= (store |v_#memory_int_1649| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:04,257 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:32:04,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 16 treesize of output 11 [2019-05-15 10:32:04,306 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:04,308 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:04,308 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:04,309 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:04,317 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:04,318 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1650|]. (let ((.cse0 (select |v_#memory_int_1650| ULTIMATE.start_main_p1))) (and (= 46 .cse0) (= (store |v_#memory_int_1650| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:04,318 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:32:04,366 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:04,367 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:04,369 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:04,370 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:04,370 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:04,378 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:04,378 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1651|]. (let ((.cse0 (select |v_#memory_int_1651| ULTIMATE.start_main_p1))) (and (= .cse0 47) (= (store |v_#memory_int_1651| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:04,379 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:32: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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:04,429 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:04,432 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:04,432 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:04,433 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:04,440 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:04,441 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1652|]. (let ((.cse0 (select |v_#memory_int_1652| ULTIMATE.start_main_p1))) (and (= 48 .cse0) (= (store |v_#memory_int_1652| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:04,441 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:32:04,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 16 treesize of output 11 [2019-05-15 10:32:04,497 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:04,499 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:04,500 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:04,500 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:04,507 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:04,508 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1653|]. (let ((.cse0 (select |v_#memory_int_1653| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1653| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 49 .cse0))) [2019-05-15 10:32:04,508 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:32:04,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 16 treesize of output 11 [2019-05-15 10:32:04,570 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:04,572 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:04,573 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:04,573 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:04,580 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:04,580 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1654|]. (let ((.cse0 (select |v_#memory_int_1654| ULTIMATE.start_main_p1))) (and (= .cse0 50) (= (store |v_#memory_int_1654| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:04,581 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:32:04,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 16 treesize of output 11 [2019-05-15 10:32:04,631 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:04,633 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:04,633 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:04,634 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:04,640 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:04,640 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1655|]. (let ((.cse0 (select |v_#memory_int_1655| ULTIMATE.start_main_p1))) (and (= .cse0 51) (= (store |v_#memory_int_1655| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:04,641 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:32:04,691 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:04,692 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:04,694 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:04,694 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:04,695 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:04,702 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:04,702 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1656|]. (let ((.cse0 (select |v_#memory_int_1656| ULTIMATE.start_main_p1))) (and (= 52 .cse0) (= |#memory_int| (store |v_#memory_int_1656| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:04,702 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:32:04,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 16 treesize of output 11 [2019-05-15 10:32:04,752 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:04,754 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:04,754 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:04,754 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:04,762 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:04,763 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1657|]. (let ((.cse0 (select |v_#memory_int_1657| ULTIMATE.start_main_p1))) (and (= .cse0 53) (= (store |v_#memory_int_1657| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:04,763 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:32:04,814 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:04,815 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:04,817 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:04,818 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:04,818 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:04,826 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:04,826 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1658|]. (let ((.cse0 (select |v_#memory_int_1658| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1658| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 54))) [2019-05-15 10:32:04,826 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:32:04,878 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:04,879 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:04,881 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:04,882 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:04,882 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:04,890 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:04,890 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1659|]. (let ((.cse0 (select |v_#memory_int_1659| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1659| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 55 .cse0))) [2019-05-15 10:32:04,890 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:32:04,939 INFO L273 TraceCheckUtils]: 0: Hoare triple {14462#true} havoc main_p1; {14462#true} is VALID [2019-05-15 10:32:04,939 INFO L273 TraceCheckUtils]: 1: Hoare triple {14462#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {14462#true} is VALID [2019-05-15 10:32:04,940 INFO L273 TraceCheckUtils]: 2: Hoare triple {14462#true} #memory_int := #memory_int[main_p1 := 0]; {14473#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:32:04,941 INFO L273 TraceCheckUtils]: 3: Hoare triple {14473#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14477#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:32:04,942 INFO L273 TraceCheckUtils]: 4: Hoare triple {14477#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14481#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:32:04,942 INFO L273 TraceCheckUtils]: 5: Hoare triple {14481#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14485#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:32:04,943 INFO L273 TraceCheckUtils]: 6: Hoare triple {14485#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14489#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:32:04,944 INFO L273 TraceCheckUtils]: 7: Hoare triple {14489#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14493#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:32:04,945 INFO L273 TraceCheckUtils]: 8: Hoare triple {14493#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14497#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:32:04,946 INFO L273 TraceCheckUtils]: 9: Hoare triple {14497#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14501#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:32:04,946 INFO L273 TraceCheckUtils]: 10: Hoare triple {14501#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14505#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:32:04,947 INFO L273 TraceCheckUtils]: 11: Hoare triple {14505#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14509#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:32:04,948 INFO L273 TraceCheckUtils]: 12: Hoare triple {14509#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14513#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:32:04,949 INFO L273 TraceCheckUtils]: 13: Hoare triple {14513#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14517#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:32:04,950 INFO L273 TraceCheckUtils]: 14: Hoare triple {14517#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14521#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:32:04,950 INFO L273 TraceCheckUtils]: 15: Hoare triple {14521#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14525#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:32:04,951 INFO L273 TraceCheckUtils]: 16: Hoare triple {14525#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14529#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:32:04,952 INFO L273 TraceCheckUtils]: 17: Hoare triple {14529#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14533#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:32:04,953 INFO L273 TraceCheckUtils]: 18: Hoare triple {14533#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14537#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:32:04,953 INFO L273 TraceCheckUtils]: 19: Hoare triple {14537#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14541#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:32:04,954 INFO L273 TraceCheckUtils]: 20: Hoare triple {14541#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14545#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:32:04,955 INFO L273 TraceCheckUtils]: 21: Hoare triple {14545#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14549#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:32:04,956 INFO L273 TraceCheckUtils]: 22: Hoare triple {14549#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14553#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:32:04,956 INFO L273 TraceCheckUtils]: 23: Hoare triple {14553#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14557#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:32:04,957 INFO L273 TraceCheckUtils]: 24: Hoare triple {14557#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14561#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:32:04,958 INFO L273 TraceCheckUtils]: 25: Hoare triple {14561#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14565#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:32:04,959 INFO L273 TraceCheckUtils]: 26: Hoare triple {14565#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14569#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:32:04,960 INFO L273 TraceCheckUtils]: 27: Hoare triple {14569#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14573#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:32:04,960 INFO L273 TraceCheckUtils]: 28: Hoare triple {14573#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14577#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:32:04,961 INFO L273 TraceCheckUtils]: 29: Hoare triple {14577#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14581#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:32:04,962 INFO L273 TraceCheckUtils]: 30: Hoare triple {14581#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14585#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:32:04,963 INFO L273 TraceCheckUtils]: 31: Hoare triple {14585#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14589#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:32:04,964 INFO L273 TraceCheckUtils]: 32: Hoare triple {14589#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14593#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:32:04,964 INFO L273 TraceCheckUtils]: 33: Hoare triple {14593#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14597#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:32:04,965 INFO L273 TraceCheckUtils]: 34: Hoare triple {14597#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14601#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:32:04,966 INFO L273 TraceCheckUtils]: 35: Hoare triple {14601#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14605#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:32:04,967 INFO L273 TraceCheckUtils]: 36: Hoare triple {14605#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14609#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:32:04,968 INFO L273 TraceCheckUtils]: 37: Hoare triple {14609#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14613#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:32:04,968 INFO L273 TraceCheckUtils]: 38: Hoare triple {14613#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14617#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:32:04,969 INFO L273 TraceCheckUtils]: 39: Hoare triple {14617#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14621#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:32:04,970 INFO L273 TraceCheckUtils]: 40: Hoare triple {14621#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14625#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:32:04,971 INFO L273 TraceCheckUtils]: 41: Hoare triple {14625#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14629#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:32:04,972 INFO L273 TraceCheckUtils]: 42: Hoare triple {14629#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14633#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:32:04,972 INFO L273 TraceCheckUtils]: 43: Hoare triple {14633#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14637#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:32:04,973 INFO L273 TraceCheckUtils]: 44: Hoare triple {14637#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14641#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:32:04,974 INFO L273 TraceCheckUtils]: 45: Hoare triple {14641#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14645#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:32:04,975 INFO L273 TraceCheckUtils]: 46: Hoare triple {14645#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14649#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:32:04,976 INFO L273 TraceCheckUtils]: 47: Hoare triple {14649#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14653#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:32:04,976 INFO L273 TraceCheckUtils]: 48: Hoare triple {14653#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14657#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:32:04,977 INFO L273 TraceCheckUtils]: 49: Hoare triple {14657#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14661#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:32:04,978 INFO L273 TraceCheckUtils]: 50: Hoare triple {14661#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14665#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:32:04,979 INFO L273 TraceCheckUtils]: 51: Hoare triple {14665#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14669#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:32:04,980 INFO L273 TraceCheckUtils]: 52: Hoare triple {14669#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14673#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:32:04,980 INFO L273 TraceCheckUtils]: 53: Hoare triple {14673#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14677#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:32:04,981 INFO L273 TraceCheckUtils]: 54: Hoare triple {14677#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14681#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:32:04,982 INFO L273 TraceCheckUtils]: 55: Hoare triple {14681#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14685#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:32:04,983 INFO L273 TraceCheckUtils]: 56: Hoare triple {14685#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14689#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:32:04,984 INFO L273 TraceCheckUtils]: 57: Hoare triple {14689#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14693#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:32:04,985 INFO L273 TraceCheckUtils]: 58: Hoare triple {14693#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14697#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:32:04,985 INFO L273 TraceCheckUtils]: 59: Hoare triple {14697#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} assume !(#memory_int[main_p1] >= 0); {14463#false} is VALID [2019-05-15 10:32:04,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:32:04,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:32:04,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-05-15 10:32:04,991 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 60 [2019-05-15 10:32:04,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:32:04,992 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 59 states. [2019-05-15 10:32:05,042 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:32:05,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-05-15 10:32:05,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-05-15 10:32:05,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-05-15 10:32:05,043 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 59 states. [2019-05-15 10:32:12,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:32:12,119 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-05-15 10:32:12,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-05-15 10:32:12,120 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 60 [2019-05-15 10:32:12,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:32:12,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-05-15 10:32:12,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-05-15 10:32:12,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-05-15 10:32:12,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-05-15 10:32:12,121 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 59 states and 63 transitions. [2019-05-15 10:32:12,282 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:32:12,283 INFO L225 Difference]: With dead ends: 62 [2019-05-15 10:32:12,283 INFO L226 Difference]: Without dead ends: 62 [2019-05-15 10:32:12,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-05-15 10:32:12,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-05-15 10:32:12,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-05-15 10:32:12,285 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:32:12,285 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 62 states. [2019-05-15 10:32:12,286 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 62 states. [2019-05-15 10:32:12,286 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 62 states. [2019-05-15 10:32:12,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:32:12,287 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-05-15 10:32:12,287 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-05-15 10:32:12,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:32:12,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:32:12,287 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 62 states. [2019-05-15 10:32:12,287 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 62 states. [2019-05-15 10:32:12,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:32:12,288 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-05-15 10:32:12,288 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-05-15 10:32:12,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:32:12,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:32:12,289 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:32:12,289 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:32:12,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-05-15 10:32:12,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-05-15 10:32:12,290 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-05-15 10:32:12,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:32:12,290 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-05-15 10:32:12,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-05-15 10:32:12,290 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-05-15 10:32:12,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-05-15 10:32:12,290 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:32:12,291 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1, 1] [2019-05-15 10:32:12,291 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:32:12,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:32:12,291 INFO L82 PathProgramCache]: Analyzing trace with hash 627821122, now seen corresponding path program 57 times [2019-05-15 10:32:12,292 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:32:12,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:32:12,323 WARN L254 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 59 conjunts are in the unsatisfiable core [2019-05-15 10:32:12,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:32:12,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:32:12,351 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:12,351 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:12,353 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:12,353 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:12,353 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:32:12,357 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:12,357 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1660|]. (= (store |v_#memory_int_1660| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:32:12,357 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:32:12,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:12,383 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:12,387 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:12,387 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:12,387 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:12,393 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:12,394 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1661|]. (let ((.cse0 (select |v_#memory_int_1661| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1661| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 0 .cse0))) [2019-05-15 10:32:12,394 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:32:12,427 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:12,428 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:12,430 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:12,430 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:12,430 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:12,438 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:12,438 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1662|]. (let ((.cse0 (select |v_#memory_int_1662| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1662| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 1 .cse0))) [2019-05-15 10:32:12,438 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:32:12,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 16 treesize of output 11 [2019-05-15 10:32:12,495 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:12,502 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:12,502 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:12,502 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:12,508 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:12,508 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1663|]. (let ((.cse0 (select |v_#memory_int_1663| ULTIMATE.start_main_p1))) (and (= .cse0 2) (= (store |v_#memory_int_1663| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:12,509 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:32:12,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 16 treesize of output 11 [2019-05-15 10:32:12,521 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:12,523 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:12,524 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:12,524 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:12,532 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:12,532 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1664|]. (let ((.cse0 (select |v_#memory_int_1664| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1664| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 3))) [2019-05-15 10:32:12,532 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:32:12,545 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:12,546 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:12,548 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:12,549 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:12,549 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:12,556 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:12,556 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1665|]. (let ((.cse0 (select |v_#memory_int_1665| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1665| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 4))) [2019-05-15 10:32:12,557 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:32:12,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 16 treesize of output 11 [2019-05-15 10:32:12,584 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:12,586 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:12,586 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:12,586 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:12,594 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:12,594 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1666|]. (let ((.cse0 (select |v_#memory_int_1666| ULTIMATE.start_main_p1))) (and (= 5 .cse0) (= (store |v_#memory_int_1666| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:12,594 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:32:12,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 16 treesize of output 11 [2019-05-15 10:32:12,609 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:12,611 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:12,611 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:12,611 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:12,619 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:12,619 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1667|]. (let ((.cse0 (select |v_#memory_int_1667| ULTIMATE.start_main_p1))) (and (= 6 .cse0) (= |#memory_int| (store |v_#memory_int_1667| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:12,619 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:32:12,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 16 treesize of output 11 [2019-05-15 10:32:12,635 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:12,637 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:12,637 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:12,637 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:12,645 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:12,645 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1668|]. (let ((.cse0 (select |v_#memory_int_1668| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1668| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 7))) [2019-05-15 10:32:12,645 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:32:12,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [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,663 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:12,664 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:12,664 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:12,671 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:12,671 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1669|]. (let ((.cse0 (select |v_#memory_int_1669| ULTIMATE.start_main_p1))) (and (= 8 .cse0) (= (store |v_#memory_int_1669| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:12,671 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:32:12,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 16 treesize of output 11 [2019-05-15 10:32:12,719 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:12,727 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:12,727 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:12,727 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:12,733 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:12,734 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1670|]. (let ((.cse0 (select |v_#memory_int_1670| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1670| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 9 .cse0))) [2019-05-15 10:32:12,734 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:32:12,912 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:12,927 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:12,961 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:12,961 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:12,961 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:12,974 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:12,974 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1671|]. (let ((.cse0 (select |v_#memory_int_1671| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1671| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 10))) [2019-05-15 10:32:12,975 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:32:13,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 16 treesize of output 11 [2019-05-15 10:32:13,098 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,100 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:13,100 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,100 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:13,108 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:13,109 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1672|]. (let ((.cse0 (select |v_#memory_int_1672| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1672| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 11 .cse0))) [2019-05-15 10:32:13,109 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:32:13,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 16 treesize of output 11 [2019-05-15 10:32:13,127 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,129 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:13,129 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,130 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:13,137 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:13,137 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1673|]. (let ((.cse0 (select |v_#memory_int_1673| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1673| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 12))) [2019-05-15 10:32:13,137 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:32:13,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:13,157 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,159 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:13,160 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,160 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:13,167 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:13,168 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1674|]. (let ((.cse0 (select |v_#memory_int_1674| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1674| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 13))) [2019-05-15 10:32:13,168 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:32:13,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:13,192 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,194 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:13,194 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,194 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:13,202 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:13,202 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1675|]. (let ((.cse0 (select |v_#memory_int_1675| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1675| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 14))) [2019-05-15 10:32:13,202 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:32:13,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 16 treesize of output 11 [2019-05-15 10:32:13,223 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,225 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:13,226 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,226 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:13,233 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:13,234 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1676|]. (let ((.cse0 (select |v_#memory_int_1676| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1676| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 15))) [2019-05-15 10:32:13,234 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:32:13,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 16 treesize of output 11 [2019-05-15 10:32:13,258 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,260 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:13,260 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,260 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:13,268 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:13,268 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1677|]. (let ((.cse0 (select |v_#memory_int_1677| ULTIMATE.start_main_p1))) (and (= .cse0 16) (= (store |v_#memory_int_1677| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:13,268 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:32:13,292 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:13,293 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,295 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:13,296 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,296 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:13,303 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:13,303 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1678|]. (let ((.cse0 (select |v_#memory_int_1678| ULTIMATE.start_main_p1))) (and (= .cse0 17) (= (store |v_#memory_int_1678| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:13,303 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:32:13,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 16 treesize of output 11 [2019-05-15 10:32:13,328 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,330 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:13,331 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,331 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:13,338 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:13,338 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1679|]. (let ((.cse0 (select |v_#memory_int_1679| ULTIMATE.start_main_p1))) (and (= .cse0 18) (= (store |v_#memory_int_1679| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:13,338 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:32:13,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 16 treesize of output 11 [2019-05-15 10:32:13,362 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,364 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:13,364 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,364 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:13,371 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:13,372 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1680|]. (let ((.cse0 (select |v_#memory_int_1680| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1680| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 19))) [2019-05-15 10:32:13,372 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:32:13,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 16 treesize of output 11 [2019-05-15 10:32:13,398 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,400 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:13,400 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,401 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:13,410 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:13,410 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1681|]. (let ((.cse0 (select |v_#memory_int_1681| ULTIMATE.start_main_p1))) (and (= .cse0 20) (= (store |v_#memory_int_1681| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:13,410 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:32:13,436 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:13,437 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,439 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:13,439 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,440 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:13,447 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:13,447 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1682|]. (let ((.cse0 (select |v_#memory_int_1682| ULTIMATE.start_main_p1))) (and (= .cse0 21) (= (store |v_#memory_int_1682| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:13,448 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:32:13,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 16 treesize of output 11 [2019-05-15 10:32:13,476 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,478 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:13,478 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,478 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:13,486 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:13,486 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1683|]. (let ((.cse0 (select |v_#memory_int_1683| ULTIMATE.start_main_p1))) (and (= 22 .cse0) (= (store |v_#memory_int_1683| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:13,486 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:32: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 16 treesize of output 11 [2019-05-15 10:32:13,518 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,520 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:13,521 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,521 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:13,529 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:13,529 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1684|]. (let ((.cse0 (select |v_#memory_int_1684| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1684| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 23))) [2019-05-15 10:32:13,529 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:32:13,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:13,559 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,561 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:13,561 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,562 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:13,571 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:13,571 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1685|]. (let ((.cse0 (select |v_#memory_int_1685| ULTIMATE.start_main_p1))) (and (= .cse0 24) (= (store |v_#memory_int_1685| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:13,572 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:32:13,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:13,603 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,605 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:13,605 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,605 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:13,613 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:13,613 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1686|]. (let ((.cse0 (select |v_#memory_int_1686| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1686| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 25 .cse0))) [2019-05-15 10:32:13,613 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:32:13,643 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:13,644 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,646 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:13,647 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,647 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:13,655 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:13,655 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1687|]. (let ((.cse0 (select |v_#memory_int_1687| ULTIMATE.start_main_p1))) (and (= 26 .cse0) (= (store |v_#memory_int_1687| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:13,655 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:32:13,685 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:13,686 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,688 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:13,689 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,689 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:13,696 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:13,696 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1688|]. (let ((.cse0 (select |v_#memory_int_1688| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1688| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 27))) [2019-05-15 10:32:13,696 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:32:13,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 16 treesize of output 11 [2019-05-15 10:32:13,732 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,734 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:13,734 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,734 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:13,742 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:13,742 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1689|]. (let ((.cse0 (select |v_#memory_int_1689| ULTIMATE.start_main_p1))) (and (= .cse0 28) (= (store |v_#memory_int_1689| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:13,742 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:32:13,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 16 treesize of output 11 [2019-05-15 10:32:13,778 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,780 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:13,780 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,781 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:13,788 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:13,788 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1690|]. (let ((.cse0 (select |v_#memory_int_1690| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1690| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 29 .cse0))) [2019-05-15 10:32:13,788 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:32:13,822 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:13,823 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,825 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:13,825 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,825 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:13,833 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:13,833 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1691|]. (let ((.cse0 (select |v_#memory_int_1691| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1691| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 30 .cse0))) [2019-05-15 10:32:13,833 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:32:13,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 16 treesize of output 11 [2019-05-15 10:32:13,870 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,873 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:13,873 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,873 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:13,880 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:13,881 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1692|]. (let ((.cse0 (select |v_#memory_int_1692| ULTIMATE.start_main_p1))) (and (= 31 .cse0) (= (store |v_#memory_int_1692| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:13,881 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:32:13,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:13,917 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,920 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:13,920 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,920 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:13,928 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:13,928 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1693|]. (let ((.cse0 (select |v_#memory_int_1693| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1693| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 32 .cse0))) [2019-05-15 10:32:13,928 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:32:13,965 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:13,966 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,969 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:13,969 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:13,969 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:13,977 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:13,977 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1694|]. (let ((.cse0 (select |v_#memory_int_1694| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1694| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 33 .cse0))) [2019-05-15 10:32:13,977 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:32:14,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:14,017 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:14,020 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:14,020 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:14,020 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:14,028 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:14,028 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1695|]. (let ((.cse0 (select |v_#memory_int_1695| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1695| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 34))) [2019-05-15 10:32:14,029 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:32:14,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 16 treesize of output 11 [2019-05-15 10:32:14,067 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:14,069 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:14,069 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:14,069 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:14,077 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:14,077 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1696|]. (let ((.cse0 (select |v_#memory_int_1696| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1696| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 35 .cse0))) [2019-05-15 10:32:14,078 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:32:14,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 16 treesize of output 11 [2019-05-15 10:32:14,117 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:14,120 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:14,120 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:14,120 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:14,128 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:14,129 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1697|]. (let ((.cse0 (select |v_#memory_int_1697| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1697| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 36 .cse0))) [2019-05-15 10:32:14,129 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:32:14,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 16 treesize of output 11 [2019-05-15 10:32:14,183 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:14,185 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:14,185 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:14,185 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:14,194 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:14,194 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1698|]. (let ((.cse0 (select |v_#memory_int_1698| ULTIMATE.start_main_p1))) (and (= .cse0 37) (= (store |v_#memory_int_1698| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:14,194 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:32:14,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 16 treesize of output 11 [2019-05-15 10:32:14,231 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:14,233 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:14,234 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:14,234 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:14,243 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:14,243 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1699|]. (let ((.cse0 (select |v_#memory_int_1699| ULTIMATE.start_main_p1))) (and (= 38 .cse0) (= (store |v_#memory_int_1699| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:14,243 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:32:14,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 16 treesize of output 11 [2019-05-15 10:32:14,288 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:14,290 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:14,290 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:14,291 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:14,299 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:14,299 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1700|]. (let ((.cse0 (select |v_#memory_int_1700| ULTIMATE.start_main_p1))) (and (= .cse0 39) (= (store |v_#memory_int_1700| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:14,299 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:32:14,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:14,341 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:14,343 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:14,343 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:14,343 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:14,351 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:14,351 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1701|]. (let ((.cse0 (select |v_#memory_int_1701| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1701| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 40 .cse0))) [2019-05-15 10:32:14,351 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:32:14,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 16 treesize of output 11 [2019-05-15 10:32:14,394 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:14,396 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:14,397 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:14,397 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:14,404 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:14,404 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1702|]. (let ((.cse0 (select |v_#memory_int_1702| ULTIMATE.start_main_p1))) (and (= .cse0 41) (= (store |v_#memory_int_1702| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:14,404 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:32:14,446 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:14,447 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:14,449 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:14,449 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:14,449 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:14,457 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:14,457 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1703|]. (let ((.cse0 (select |v_#memory_int_1703| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1703| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 42))) [2019-05-15 10:32:14,457 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:32:14,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 16 treesize of output 11 [2019-05-15 10:32:14,504 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:14,506 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:14,507 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:14,507 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:14,517 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:14,517 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1704|]. (let ((.cse0 (select |v_#memory_int_1704| ULTIMATE.start_main_p1))) (and (= 43 .cse0) (= (store |v_#memory_int_1704| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:14,517 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:32:14,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:14,561 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:14,563 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:14,564 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:14,564 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:14,572 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:14,572 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1705|]. (let ((.cse0 (select |v_#memory_int_1705| ULTIMATE.start_main_p1))) (and (= 44 .cse0) (= |#memory_int| (store |v_#memory_int_1705| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:14,572 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:32:14,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 16 treesize of output 11 [2019-05-15 10:32:14,617 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:14,619 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:14,619 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:14,620 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:14,628 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:14,629 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1706|]. (let ((.cse0 (select |v_#memory_int_1706| ULTIMATE.start_main_p1))) (and (= 45 .cse0) (= (store |v_#memory_int_1706| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:14,629 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:32:14,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:14,674 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:14,676 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:14,676 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:14,676 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:14,684 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:14,685 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1707|]. (let ((.cse0 (select |v_#memory_int_1707| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1707| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 46 .cse0))) [2019-05-15 10:32:14,685 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:32:14,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 16 treesize of output 11 [2019-05-15 10:32:14,732 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:14,734 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:14,734 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:14,734 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:14,741 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:14,742 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1708|]. (let ((.cse0 (select |v_#memory_int_1708| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1708| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 47 .cse0))) [2019-05-15 10:32:14,742 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:32:14,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 16 treesize of output 11 [2019-05-15 10:32:14,789 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:14,791 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 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 1 xjuncts. [2019-05-15 10:32:14,791 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:14,799 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:14,799 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1709|]. (let ((.cse0 (select |v_#memory_int_1709| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1709| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 48))) [2019-05-15 10:32:14,799 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:32:14,849 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:14,850 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:14,852 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:14,852 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:14,852 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:14,860 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:14,861 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1710|]. (let ((.cse0 (select |v_#memory_int_1710| ULTIMATE.start_main_p1))) (and (= 49 .cse0) (= |#memory_int| (store |v_#memory_int_1710| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:14,861 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:32:14,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 16 treesize of output 11 [2019-05-15 10:32:14,911 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:14,913 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:14,913 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:14,913 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:14,920 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:14,920 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1711|]. (let ((.cse0 (select |v_#memory_int_1711| ULTIMATE.start_main_p1))) (and (= 50 .cse0) (= |#memory_int| (store |v_#memory_int_1711| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:14,920 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:32:14,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 16 treesize of output 11 [2019-05-15 10:32:14,969 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:14,971 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:14,971 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:14,972 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:14,980 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:14,980 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1712|]. (let ((.cse0 (select |v_#memory_int_1712| ULTIMATE.start_main_p1))) (and (= .cse0 51) (= (store |v_#memory_int_1712| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:14,980 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:32:15,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 16 treesize of output 11 [2019-05-15 10:32:15,029 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:15,031 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:15,031 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:15,031 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:15,039 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:15,039 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1713|]. (let ((.cse0 (select |v_#memory_int_1713| ULTIMATE.start_main_p1))) (and (= 52 .cse0) (= |#memory_int| (store |v_#memory_int_1713| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:15,039 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:32:15,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:15,091 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:15,094 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:15,094 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:15,094 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:15,102 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:15,102 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1714|]. (let ((.cse0 (select |v_#memory_int_1714| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1714| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 53))) [2019-05-15 10:32:15,102 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:32:15,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:15,154 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:15,156 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:15,156 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:15,156 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:15,163 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:15,163 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1715|]. (let ((.cse0 (select |v_#memory_int_1715| ULTIMATE.start_main_p1))) (and (= 54 .cse0) (= (store |v_#memory_int_1715| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:15,164 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:32:15,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 16 treesize of output 11 [2019-05-15 10:32:15,218 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:15,220 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:15,220 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:15,220 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:15,229 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:15,229 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1716|]. (let ((.cse0 (select |v_#memory_int_1716| ULTIMATE.start_main_p1))) (and (= 55 .cse0) (= (store |v_#memory_int_1716| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:15,229 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:32:15,280 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:15,281 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:15,283 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:15,284 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:15,284 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:15,292 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:15,292 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1717|]. (let ((.cse0 (select |v_#memory_int_1717| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1717| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 56))) [2019-05-15 10:32:15,292 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:32:15,345 INFO L273 TraceCheckUtils]: 0: Hoare triple {14948#true} havoc main_p1; {14948#true} is VALID [2019-05-15 10:32:15,346 INFO L273 TraceCheckUtils]: 1: Hoare triple {14948#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {14948#true} is VALID [2019-05-15 10:32:15,346 INFO L273 TraceCheckUtils]: 2: Hoare triple {14948#true} #memory_int := #memory_int[main_p1 := 0]; {14959#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:32:15,347 INFO L273 TraceCheckUtils]: 3: Hoare triple {14959#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14963#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:32:15,348 INFO L273 TraceCheckUtils]: 4: Hoare triple {14963#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14967#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:32:15,349 INFO L273 TraceCheckUtils]: 5: Hoare triple {14967#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14971#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:32:15,350 INFO L273 TraceCheckUtils]: 6: Hoare triple {14971#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14975#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:32:15,350 INFO L273 TraceCheckUtils]: 7: Hoare triple {14975#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14979#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:32:15,351 INFO L273 TraceCheckUtils]: 8: Hoare triple {14979#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14983#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:32:15,352 INFO L273 TraceCheckUtils]: 9: Hoare triple {14983#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14987#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:32:15,353 INFO L273 TraceCheckUtils]: 10: Hoare triple {14987#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14991#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:32:15,354 INFO L273 TraceCheckUtils]: 11: Hoare triple {14991#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14995#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:32:15,354 INFO L273 TraceCheckUtils]: 12: Hoare triple {14995#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14999#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:32:15,355 INFO L273 TraceCheckUtils]: 13: Hoare triple {14999#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15003#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:32:15,356 INFO L273 TraceCheckUtils]: 14: Hoare triple {15003#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15007#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:32:15,357 INFO L273 TraceCheckUtils]: 15: Hoare triple {15007#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15011#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:32:15,358 INFO L273 TraceCheckUtils]: 16: Hoare triple {15011#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15015#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:32:15,358 INFO L273 TraceCheckUtils]: 17: Hoare triple {15015#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15019#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:32:15,359 INFO L273 TraceCheckUtils]: 18: Hoare triple {15019#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15023#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:32:15,360 INFO L273 TraceCheckUtils]: 19: Hoare triple {15023#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15027#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:32:15,361 INFO L273 TraceCheckUtils]: 20: Hoare triple {15027#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15031#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:32:15,362 INFO L273 TraceCheckUtils]: 21: Hoare triple {15031#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15035#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:32:15,362 INFO L273 TraceCheckUtils]: 22: Hoare triple {15035#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15039#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:32:15,363 INFO L273 TraceCheckUtils]: 23: Hoare triple {15039#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15043#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:32:15,364 INFO L273 TraceCheckUtils]: 24: Hoare triple {15043#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15047#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:32:15,365 INFO L273 TraceCheckUtils]: 25: Hoare triple {15047#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15051#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:32:15,366 INFO L273 TraceCheckUtils]: 26: Hoare triple {15051#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15055#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:32:15,366 INFO L273 TraceCheckUtils]: 27: Hoare triple {15055#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15059#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:32:15,367 INFO L273 TraceCheckUtils]: 28: Hoare triple {15059#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15063#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:32:15,368 INFO L273 TraceCheckUtils]: 29: Hoare triple {15063#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15067#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:32:15,369 INFO L273 TraceCheckUtils]: 30: Hoare triple {15067#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15071#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:32:15,370 INFO L273 TraceCheckUtils]: 31: Hoare triple {15071#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15075#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:32:15,370 INFO L273 TraceCheckUtils]: 32: Hoare triple {15075#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15079#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:32:15,371 INFO L273 TraceCheckUtils]: 33: Hoare triple {15079#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15083#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:32:15,372 INFO L273 TraceCheckUtils]: 34: Hoare triple {15083#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15087#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:32:15,373 INFO L273 TraceCheckUtils]: 35: Hoare triple {15087#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15091#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:32:15,374 INFO L273 TraceCheckUtils]: 36: Hoare triple {15091#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15095#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:32:15,374 INFO L273 TraceCheckUtils]: 37: Hoare triple {15095#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15099#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:32:15,375 INFO L273 TraceCheckUtils]: 38: Hoare triple {15099#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15103#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:32:15,376 INFO L273 TraceCheckUtils]: 39: Hoare triple {15103#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15107#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:32:15,377 INFO L273 TraceCheckUtils]: 40: Hoare triple {15107#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15111#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:32:15,378 INFO L273 TraceCheckUtils]: 41: Hoare triple {15111#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15115#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:32:15,378 INFO L273 TraceCheckUtils]: 42: Hoare triple {15115#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15119#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:32:15,379 INFO L273 TraceCheckUtils]: 43: Hoare triple {15119#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15123#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:32:15,380 INFO L273 TraceCheckUtils]: 44: Hoare triple {15123#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15127#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:32:15,381 INFO L273 TraceCheckUtils]: 45: Hoare triple {15127#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15131#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:32:15,382 INFO L273 TraceCheckUtils]: 46: Hoare triple {15131#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15135#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:32:15,382 INFO L273 TraceCheckUtils]: 47: Hoare triple {15135#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15139#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:32:15,383 INFO L273 TraceCheckUtils]: 48: Hoare triple {15139#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15143#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:32:15,384 INFO L273 TraceCheckUtils]: 49: Hoare triple {15143#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15147#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:32:15,385 INFO L273 TraceCheckUtils]: 50: Hoare triple {15147#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15151#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:32:15,386 INFO L273 TraceCheckUtils]: 51: Hoare triple {15151#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15155#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:32:15,386 INFO L273 TraceCheckUtils]: 52: Hoare triple {15155#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15159#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:32:15,387 INFO L273 TraceCheckUtils]: 53: Hoare triple {15159#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15163#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:32:15,388 INFO L273 TraceCheckUtils]: 54: Hoare triple {15163#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15167#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:32:15,389 INFO L273 TraceCheckUtils]: 55: Hoare triple {15167#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15171#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:32:15,390 INFO L273 TraceCheckUtils]: 56: Hoare triple {15171#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15175#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:32:15,390 INFO L273 TraceCheckUtils]: 57: Hoare triple {15175#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15179#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:32:15,391 INFO L273 TraceCheckUtils]: 58: Hoare triple {15179#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15183#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:32:15,392 INFO L273 TraceCheckUtils]: 59: Hoare triple {15183#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15187#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:32:15,393 INFO L273 TraceCheckUtils]: 60: Hoare triple {15187#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} assume !(#memory_int[main_p1] >= 0); {14949#false} is VALID [2019-05-15 10:32:15,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:32:15,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:32:15,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-05-15 10:32:15,400 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 61 [2019-05-15 10:32:15,401 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:32:15,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 60 states. [2019-05-15 10:32:15,457 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:32:15,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-05-15 10:32:15,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-05-15 10:32:15,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-05-15 10:32:15,458 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 60 states. [2019-05-15 10:32:22,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:32:22,870 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-05-15 10:32:22,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-05-15 10:32:22,870 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 61 [2019-05-15 10:32:22,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:32:22,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-05-15 10:32:22,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2019-05-15 10:32:22,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-05-15 10:32:22,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2019-05-15 10:32:22,872 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 60 states and 64 transitions. [2019-05-15 10:32:22,923 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:22,924 INFO L225 Difference]: With dead ends: 63 [2019-05-15 10:32:22,925 INFO L226 Difference]: Without dead ends: 63 [2019-05-15 10:32:22,925 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-05-15 10:32:22,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-05-15 10:32:22,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-05-15 10:32:22,926 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:32:22,926 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 63 states. [2019-05-15 10:32:22,927 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 63 states. [2019-05-15 10:32:22,927 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 63 states. [2019-05-15 10:32:22,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:32:22,927 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-05-15 10:32:22,927 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-05-15 10:32:22,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:32:22,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:32:22,928 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 63 states. [2019-05-15 10:32:22,928 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 63 states. [2019-05-15 10:32:22,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:32:22,928 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-05-15 10:32:22,928 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-05-15 10:32:22,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:32:22,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:32:22,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:32:22,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:32:22,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-05-15 10:32:22,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-05-15 10:32:22,930 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-05-15 10:32:22,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:32:22,930 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-05-15 10:32:22,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-05-15 10:32:22,930 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-05-15 10:32:22,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-05-15 10:32:22,930 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:32:22,930 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1, 1] [2019-05-15 10:32:22,930 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:32:22,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:32:22,931 INFO L82 PathProgramCache]: Analyzing trace with hash -2012381752, now seen corresponding path program 58 times [2019-05-15 10:32:22,931 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:32:22,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:32:22,955 WARN L254 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 60 conjunts are in the unsatisfiable core [2019-05-15 10:32:22,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:32:22,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:32:22,983 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:22,984 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:22,986 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:22,986 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:22,986 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:32:22,988 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:22,988 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1718|]. (= |#memory_int| (store |v_#memory_int_1718| ULTIMATE.start_main_p1 0)) [2019-05-15 10:32:22,988 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:32:22,998 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:22,998 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:23,000 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:23,001 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:23,001 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:23,009 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:23,009 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1719|]. (let ((.cse0 (select |v_#memory_int_1719| ULTIMATE.start_main_p1))) (and (= 0 .cse0) (= (store |v_#memory_int_1719| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:23,009 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:32:23,020 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:23,021 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:23,023 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:23,023 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:23,024 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:23,031 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:23,031 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1720|]. (let ((.cse0 (select |v_#memory_int_1720| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1720| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 1))) [2019-05-15 10:32:23,031 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:32:23,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:23,043 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:23,045 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:23,045 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:23,046 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:23,053 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:23,054 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1721|]. (let ((.cse0 (select |v_#memory_int_1721| ULTIMATE.start_main_p1))) (and (= 2 .cse0) (= (store |v_#memory_int_1721| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:23,054 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:32:23,065 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:23,066 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:23,068 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:23,069 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:23,069 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:23,076 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:23,077 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1722|]. (let ((.cse0 (select |v_#memory_int_1722| ULTIMATE.start_main_p1))) (and (= 3 .cse0) (= (store |v_#memory_int_1722| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:23,077 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:32:23,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:23,090 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:23,092 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:23,092 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:23,092 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:23,100 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:23,100 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1723|]. (let ((.cse0 (select |v_#memory_int_1723| ULTIMATE.start_main_p1))) (and (= 4 .cse0) (= |#memory_int| (store |v_#memory_int_1723| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:23,100 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:32:23,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:23,114 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:23,116 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:23,116 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:23,116 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:23,124 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:23,124 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1724|]. (let ((.cse0 (select |v_#memory_int_1724| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1724| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 5))) [2019-05-15 10:32:23,124 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:32:23,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:23,138 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:23,140 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:23,140 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:23,140 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:23,147 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:23,147 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1725|]. (let ((.cse0 (select |v_#memory_int_1725| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1725| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 6 .cse0))) [2019-05-15 10:32:23,147 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:32:23,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 16 treesize of output 11 [2019-05-15 10:32:23,163 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:23,165 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:23,165 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:23,165 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:23,171 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:23,171 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1726|]. (let ((.cse0 (select |v_#memory_int_1726| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1726| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 7 .cse0))) [2019-05-15 10:32:23,172 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:32:23,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 16 treesize of output 11 [2019-05-15 10:32:23,187 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:23,189 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:23,189 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:23,189 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:23,196 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:23,197 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1727|]. (let ((.cse0 (select |v_#memory_int_1727| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1727| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 8))) [2019-05-15 10:32:23,197 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:32:23,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 16 treesize of output 11 [2019-05-15 10:32:23,214 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:23,216 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:23,216 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:23,217 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:23,223 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:23,224 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1728|]. (let ((.cse0 (select |v_#memory_int_1728| ULTIMATE.start_main_p1))) (and (= .cse0 9) (= |#memory_int| (store |v_#memory_int_1728| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:23,224 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:32:23,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:23,310 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:23,345 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:23,345 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:23,346 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:23,360 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:23,361 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1729|]. (let ((.cse0 (select |v_#memory_int_1729| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1729| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 10 .cse0))) [2019-05-15 10:32:23,361 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:32:23,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 16 treesize of output 11 [2019-05-15 10:32:23,826 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:23,828 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:23,828 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:23,828 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:23,836 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:23,836 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1730|]. (let ((.cse0 (select |v_#memory_int_1730| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1730| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 11))) [2019-05-15 10:32:23,836 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:32:23,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 16 treesize of output 11 [2019-05-15 10:32:23,856 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:23,858 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:23,858 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:23,858 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:23,866 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:23,866 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1731|]. (let ((.cse0 (select |v_#memory_int_1731| ULTIMATE.start_main_p1))) (and (= .cse0 12) (= (store |v_#memory_int_1731| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:23,866 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:32:23,886 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:23,887 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:23,888 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:23,889 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:23,889 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:23,896 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:23,897 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1732|]. (let ((.cse0 (select |v_#memory_int_1732| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1732| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 13 .cse0))) [2019-05-15 10:32:23,897 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:32:23,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:23,916 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:23,918 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:23,919 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:23,919 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:23,926 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:23,926 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1733|]. (let ((.cse0 (select |v_#memory_int_1733| ULTIMATE.start_main_p1))) (and (= 14 .cse0) (= |#memory_int| (store |v_#memory_int_1733| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:23,926 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:32:23,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:23,948 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:23,950 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:23,950 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:23,950 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:23,957 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:23,957 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1734|]. (let ((.cse0 (select |v_#memory_int_1734| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1734| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 15))) [2019-05-15 10:32:23,958 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:32:23,982 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:23,983 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:23,985 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:23,985 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:23,985 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:23,993 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:23,993 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1735|]. (let ((.cse0 (select |v_#memory_int_1735| ULTIMATE.start_main_p1))) (and (= .cse0 16) (= |#memory_int| (store |v_#memory_int_1735| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:23,993 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:32:24,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:24,026 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:24,028 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:24,028 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:24,028 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:24,035 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:24,035 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1736|]. (let ((.cse0 (select |v_#memory_int_1736| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1736| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 17 .cse0))) [2019-05-15 10:32:24,036 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:32: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 16 treesize of output 11 [2019-05-15 10:32:24,058 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:24,060 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:24,060 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:24,060 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:24,068 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:24,068 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1737|]. (let ((.cse0 (select |v_#memory_int_1737| ULTIMATE.start_main_p1))) (and (= .cse0 18) (= (store |v_#memory_int_1737| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:24,068 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:32:24,092 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:24,093 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:24,095 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:24,095 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:24,096 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:24,103 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:24,103 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1738|]. (let ((.cse0 (select |v_#memory_int_1738| ULTIMATE.start_main_p1))) (and (= 19 .cse0) (= (store |v_#memory_int_1738| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:24,103 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:32:24,127 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:24,128 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:24,130 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:24,130 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:24,130 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:24,138 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:24,138 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1739|]. (let ((.cse0 (select |v_#memory_int_1739| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1739| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 20))) [2019-05-15 10:32:24,138 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:32:24,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 16 treesize of output 11 [2019-05-15 10:32:24,164 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:24,166 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:24,167 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:24,167 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:24,176 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:24,176 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1740|]. (let ((.cse0 (select |v_#memory_int_1740| ULTIMATE.start_main_p1))) (and (= .cse0 21) (= (store |v_#memory_int_1740| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:24,176 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:32:24,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 16 treesize of output 11 [2019-05-15 10:32:24,202 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:24,204 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:24,205 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:24,205 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:24,212 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:24,213 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1741|]. (let ((.cse0 (select |v_#memory_int_1741| ULTIMATE.start_main_p1))) (and (= 22 .cse0) (= (store |v_#memory_int_1741| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:24,213 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:32:24,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:24,241 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:24,243 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:24,243 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:24,243 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:24,250 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:24,251 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1742|]. (let ((.cse0 (select |v_#memory_int_1742| ULTIMATE.start_main_p1))) (and (= .cse0 23) (= |#memory_int| (store |v_#memory_int_1742| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:24,251 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:32:24,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:24,279 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:24,282 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:24,282 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:24,282 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:24,291 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:24,292 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1743|]. (let ((.cse0 (select |v_#memory_int_1743| ULTIMATE.start_main_p1))) (and (= .cse0 24) (= |#memory_int| (store |v_#memory_int_1743| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:24,292 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:32:24,320 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:24,321 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:24,323 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:24,323 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:24,323 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:24,330 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:24,330 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1744|]. (let ((.cse0 (select |v_#memory_int_1744| ULTIMATE.start_main_p1))) (and (= .cse0 25) (= |#memory_int| (store |v_#memory_int_1744| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:24,330 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:32:24,375 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:24,375 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:24,377 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:24,377 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:24,377 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:24,386 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:24,386 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1745|]. (let ((.cse0 (select |v_#memory_int_1745| ULTIMATE.start_main_p1))) (and (= .cse0 26) (= (store |v_#memory_int_1745| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:24,386 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:32:24,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:24,417 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:24,419 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:24,419 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:24,419 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:24,426 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:24,426 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1746|]. (let ((.cse0 (select |v_#memory_int_1746| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1746| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 27 .cse0))) [2019-05-15 10:32:24,426 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:32:24,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 16 treesize of output 11 [2019-05-15 10:32:24,459 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:24,461 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:24,461 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:24,461 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:24,468 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:24,469 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1747|]. (let ((.cse0 (select |v_#memory_int_1747| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1747| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 28))) [2019-05-15 10:32:24,469 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:32:24,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:24,499 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:24,501 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:24,501 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:24,502 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:24,509 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:24,509 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1748|]. (let ((.cse0 (select |v_#memory_int_1748| ULTIMATE.start_main_p1))) (and (= .cse0 29) (= |#memory_int| (store |v_#memory_int_1748| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:24,510 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:32:24,541 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:24,542 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:24,544 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:24,544 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:24,544 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:24,552 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:24,552 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1749|]. (let ((.cse0 (select |v_#memory_int_1749| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1749| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 30 .cse0))) [2019-05-15 10:32:24,552 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:32:24,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:24,586 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:24,588 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:24,589 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:24,589 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:24,596 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:24,596 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1750|]. (let ((.cse0 (select |v_#memory_int_1750| ULTIMATE.start_main_p1))) (and (= 31 .cse0) (= (store |v_#memory_int_1750| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:24,597 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:32:24,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 16 treesize of output 11 [2019-05-15 10:32:24,631 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:24,633 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:24,633 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:24,633 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:24,640 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:24,641 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1751|]. (let ((.cse0 (select |v_#memory_int_1751| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1751| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 32 .cse0))) [2019-05-15 10:32:24,641 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:32:24,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:24,675 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:24,677 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:24,678 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:24,678 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:24,685 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:24,685 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1752|]. (let ((.cse0 (select |v_#memory_int_1752| ULTIMATE.start_main_p1))) (and (= 33 .cse0) (= (store |v_#memory_int_1752| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:24,685 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:32:24,721 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:24,722 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:24,724 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:24,724 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:24,725 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:24,732 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:24,732 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1753|]. (let ((.cse0 (select |v_#memory_int_1753| ULTIMATE.start_main_p1))) (and (= 34 .cse0) (= |#memory_int| (store |v_#memory_int_1753| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:24,732 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:32:24,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:24,770 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:24,773 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:24,773 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:24,773 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:24,780 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:24,781 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1754|]. (let ((.cse0 (select |v_#memory_int_1754| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1754| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 35))) [2019-05-15 10:32:24,781 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:32:24,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 16 treesize of output 11 [2019-05-15 10:32:24,819 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:24,821 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:24,821 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:24,821 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:24,829 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:24,829 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1755|]. (let ((.cse0 (select |v_#memory_int_1755| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1755| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 36))) [2019-05-15 10:32:24,829 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:32:24,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 16 treesize of output 11 [2019-05-15 10:32:24,871 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:24,873 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:24,873 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:24,873 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:24,880 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:24,881 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1756|]. (let ((.cse0 (select |v_#memory_int_1756| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1756| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 37))) [2019-05-15 10:32:24,881 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:32:24,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 16 treesize of output 11 [2019-05-15 10:32:24,921 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:24,924 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:24,924 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:24,924 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:24,931 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:24,931 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1757|]. (let ((.cse0 (select |v_#memory_int_1757| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1757| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 38 .cse0))) [2019-05-15 10:32:24,932 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:32:24,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:24,976 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:24,979 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:24,979 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:24,979 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:24,987 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:24,987 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1758|]. (let ((.cse0 (select |v_#memory_int_1758| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1758| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 39 .cse0))) [2019-05-15 10:32:24,987 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:32:25,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 16 treesize of output 11 [2019-05-15 10:32:25,031 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:25,033 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:25,033 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:25,033 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:25,040 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:25,040 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1759|]. (let ((.cse0 (select |v_#memory_int_1759| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1759| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 40 .cse0))) [2019-05-15 10:32:25,041 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:32:25,081 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:25,082 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:25,084 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:25,084 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:25,084 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:25,091 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:25,092 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1760|]. (let ((.cse0 (select |v_#memory_int_1760| ULTIMATE.start_main_p1))) (and (= 41 .cse0) (= (store |v_#memory_int_1760| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:25,092 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:32:25,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 16 treesize of output 11 [2019-05-15 10:32:25,134 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:25,136 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:25,136 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:25,136 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:25,144 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:25,144 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1761|]. (let ((.cse0 (select |v_#memory_int_1761| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1761| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 42 .cse0))) [2019-05-15 10:32:25,144 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:32:25,187 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:25,188 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:25,190 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:25,190 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:25,190 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:25,198 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:25,198 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1762|]. (let ((.cse0 (select |v_#memory_int_1762| ULTIMATE.start_main_p1))) (and (= .cse0 43) (= |#memory_int| (store |v_#memory_int_1762| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:25,198 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:32:25,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:25,244 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:25,246 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:25,246 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:25,247 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:25,254 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:25,255 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1763|]. (let ((.cse0 (select |v_#memory_int_1763| ULTIMATE.start_main_p1))) (and (= 44 .cse0) (= (store |v_#memory_int_1763| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:25,255 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:32:25,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:25,299 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:25,301 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:25,301 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:25,301 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:25,309 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:25,309 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1764|]. (let ((.cse0 (select |v_#memory_int_1764| ULTIMATE.start_main_p1))) (and (= 45 .cse0) (= (store |v_#memory_int_1764| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:25,309 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:32:25,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 16 treesize of output 11 [2019-05-15 10:32:25,356 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:25,358 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:25,358 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:25,358 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:25,365 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:25,365 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1765|]. (let ((.cse0 (select |v_#memory_int_1765| ULTIMATE.start_main_p1))) (and (= 46 .cse0) (= |#memory_int| (store |v_#memory_int_1765| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:25,365 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:32:25,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 16 treesize of output 11 [2019-05-15 10:32:25,414 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:25,416 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:25,416 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:25,416 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:25,423 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:25,424 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1766|]. (let ((.cse0 (select |v_#memory_int_1766| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1766| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 47 .cse0))) [2019-05-15 10:32:25,424 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:32:25,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 16 treesize of output 11 [2019-05-15 10:32:25,471 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:25,473 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:25,474 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:25,474 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:25,481 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:25,481 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1767|]. (let ((.cse0 (select |v_#memory_int_1767| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1767| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 48))) [2019-05-15 10:32:25,482 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:32:25,533 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:25,534 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:25,536 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:25,536 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:25,536 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:25,544 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:25,544 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1768|]. (let ((.cse0 (select |v_#memory_int_1768| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1768| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 49 .cse0))) [2019-05-15 10:32:25,544 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:32:25,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 16 treesize of output 11 [2019-05-15 10:32:25,597 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:25,599 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:25,599 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:25,599 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:25,607 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:25,607 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1769|]. (let ((.cse0 (select |v_#memory_int_1769| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1769| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 50 .cse0))) [2019-05-15 10:32:25,607 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:32:25,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:25,658 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:25,660 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:25,661 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:25,661 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:25,668 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:25,668 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1770|]. (let ((.cse0 (select |v_#memory_int_1770| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1770| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 51 .cse0))) [2019-05-15 10:32:25,669 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:32:25,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 16 treesize of output 11 [2019-05-15 10:32:25,720 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:25,722 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:25,723 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:25,723 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:25,729 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:25,729 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1771|]. (let ((.cse0 (select |v_#memory_int_1771| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1771| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 52))) [2019-05-15 10:32:25,729 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:32:25,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:25,781 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:25,783 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:25,784 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:25,784 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:25,791 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:25,791 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1772|]. (let ((.cse0 (select |v_#memory_int_1772| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1772| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 53))) [2019-05-15 10:32:25,791 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:32:25,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:25,844 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:25,846 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32: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:32:25,847 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:25,855 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:25,855 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1773|]. (let ((.cse0 (select |v_#memory_int_1773| ULTIMATE.start_main_p1))) (and (= 54 .cse0) (= |#memory_int| (store |v_#memory_int_1773| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:25,855 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:32:25,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:25,909 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:25,911 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:25,911 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:25,911 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:25,918 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:25,918 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1774|]. (let ((.cse0 (select |v_#memory_int_1774| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1774| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 55))) [2019-05-15 10:32:25,918 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:32:25,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 16 treesize of output 11 [2019-05-15 10:32:25,975 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:25,978 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:25,978 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:25,978 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:25,987 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:25,987 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1775|]. (let ((.cse0 (select |v_#memory_int_1775| ULTIMATE.start_main_p1))) (and (= 56 .cse0) (= (store |v_#memory_int_1775| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:25,987 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:32:26,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:26,040 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:26,042 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:26,042 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:26,042 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:26,051 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:26,052 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1776|]. (let ((.cse0 (select |v_#memory_int_1776| ULTIMATE.start_main_p1))) (and (= 57 .cse0) (= |#memory_int| (store |v_#memory_int_1776| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:26,052 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:32:26,102 INFO L273 TraceCheckUtils]: 0: Hoare triple {15442#true} havoc main_p1; {15442#true} is VALID [2019-05-15 10:32:26,102 INFO L273 TraceCheckUtils]: 1: Hoare triple {15442#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {15442#true} is VALID [2019-05-15 10:32:26,103 INFO L273 TraceCheckUtils]: 2: Hoare triple {15442#true} #memory_int := #memory_int[main_p1 := 0]; {15453#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:32:26,104 INFO L273 TraceCheckUtils]: 3: Hoare triple {15453#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15457#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:32:26,104 INFO L273 TraceCheckUtils]: 4: Hoare triple {15457#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15461#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:32:26,105 INFO L273 TraceCheckUtils]: 5: Hoare triple {15461#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15465#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:32:26,105 INFO L273 TraceCheckUtils]: 6: Hoare triple {15465#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15469#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:32:26,106 INFO L273 TraceCheckUtils]: 7: Hoare triple {15469#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15473#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:32:26,107 INFO L273 TraceCheckUtils]: 8: Hoare triple {15473#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15477#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:32:26,107 INFO L273 TraceCheckUtils]: 9: Hoare triple {15477#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15481#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:32:26,108 INFO L273 TraceCheckUtils]: 10: Hoare triple {15481#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15485#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:32:26,109 INFO L273 TraceCheckUtils]: 11: Hoare triple {15485#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15489#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:32:26,110 INFO L273 TraceCheckUtils]: 12: Hoare triple {15489#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15493#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:32:26,110 INFO L273 TraceCheckUtils]: 13: Hoare triple {15493#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15497#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:32:26,111 INFO L273 TraceCheckUtils]: 14: Hoare triple {15497#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15501#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:32:26,112 INFO L273 TraceCheckUtils]: 15: Hoare triple {15501#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15505#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:32:26,113 INFO L273 TraceCheckUtils]: 16: Hoare triple {15505#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15509#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:32:26,113 INFO L273 TraceCheckUtils]: 17: Hoare triple {15509#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15513#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:32:26,114 INFO L273 TraceCheckUtils]: 18: Hoare triple {15513#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15517#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:32:26,115 INFO L273 TraceCheckUtils]: 19: Hoare triple {15517#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15521#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:32:26,116 INFO L273 TraceCheckUtils]: 20: Hoare triple {15521#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15525#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:32:26,116 INFO L273 TraceCheckUtils]: 21: Hoare triple {15525#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15529#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:32:26,117 INFO L273 TraceCheckUtils]: 22: Hoare triple {15529#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15533#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:32:26,118 INFO L273 TraceCheckUtils]: 23: Hoare triple {15533#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15537#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:32:26,119 INFO L273 TraceCheckUtils]: 24: Hoare triple {15537#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15541#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:32:26,119 INFO L273 TraceCheckUtils]: 25: Hoare triple {15541#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15545#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:32:26,120 INFO L273 TraceCheckUtils]: 26: Hoare triple {15545#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15549#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:32:26,121 INFO L273 TraceCheckUtils]: 27: Hoare triple {15549#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15553#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:32:26,122 INFO L273 TraceCheckUtils]: 28: Hoare triple {15553#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15557#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:32:26,122 INFO L273 TraceCheckUtils]: 29: Hoare triple {15557#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15561#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:32:26,123 INFO L273 TraceCheckUtils]: 30: Hoare triple {15561#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15565#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:32:26,124 INFO L273 TraceCheckUtils]: 31: Hoare triple {15565#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15569#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:32:26,125 INFO L273 TraceCheckUtils]: 32: Hoare triple {15569#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15573#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:32:26,126 INFO L273 TraceCheckUtils]: 33: Hoare triple {15573#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15577#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:32:26,126 INFO L273 TraceCheckUtils]: 34: Hoare triple {15577#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15581#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:32:26,127 INFO L273 TraceCheckUtils]: 35: Hoare triple {15581#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15585#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:32:26,128 INFO L273 TraceCheckUtils]: 36: Hoare triple {15585#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15589#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:32:26,129 INFO L273 TraceCheckUtils]: 37: Hoare triple {15589#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15593#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:32:26,129 INFO L273 TraceCheckUtils]: 38: Hoare triple {15593#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15597#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:32:26,130 INFO L273 TraceCheckUtils]: 39: Hoare triple {15597#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15601#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:32:26,131 INFO L273 TraceCheckUtils]: 40: Hoare triple {15601#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15605#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:32:26,132 INFO L273 TraceCheckUtils]: 41: Hoare triple {15605#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15609#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:32:26,133 INFO L273 TraceCheckUtils]: 42: Hoare triple {15609#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15613#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:32:26,133 INFO L273 TraceCheckUtils]: 43: Hoare triple {15613#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15617#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:32:26,134 INFO L273 TraceCheckUtils]: 44: Hoare triple {15617#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15621#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:32:26,135 INFO L273 TraceCheckUtils]: 45: Hoare triple {15621#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15625#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:32:26,136 INFO L273 TraceCheckUtils]: 46: Hoare triple {15625#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15629#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:32:26,136 INFO L273 TraceCheckUtils]: 47: Hoare triple {15629#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15633#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:32:26,137 INFO L273 TraceCheckUtils]: 48: Hoare triple {15633#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15637#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:32:26,138 INFO L273 TraceCheckUtils]: 49: Hoare triple {15637#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15641#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:32:26,139 INFO L273 TraceCheckUtils]: 50: Hoare triple {15641#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15645#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:32:26,139 INFO L273 TraceCheckUtils]: 51: Hoare triple {15645#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15649#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:32:26,140 INFO L273 TraceCheckUtils]: 52: Hoare triple {15649#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15653#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:32:26,141 INFO L273 TraceCheckUtils]: 53: Hoare triple {15653#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15657#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:32:26,142 INFO L273 TraceCheckUtils]: 54: Hoare triple {15657#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15661#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:32:26,143 INFO L273 TraceCheckUtils]: 55: Hoare triple {15661#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15665#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:32:26,143 INFO L273 TraceCheckUtils]: 56: Hoare triple {15665#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15669#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:32:26,144 INFO L273 TraceCheckUtils]: 57: Hoare triple {15669#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15673#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:32:26,145 INFO L273 TraceCheckUtils]: 58: Hoare triple {15673#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15677#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:32:26,146 INFO L273 TraceCheckUtils]: 59: Hoare triple {15677#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15681#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:32:26,147 INFO L273 TraceCheckUtils]: 60: Hoare triple {15681#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15685#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:32:26,147 INFO L273 TraceCheckUtils]: 61: Hoare triple {15685#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} assume !(#memory_int[main_p1] >= 0); {15443#false} is VALID [2019-05-15 10:32:26,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:32:26,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:32:26,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-05-15 10:32:26,155 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 62 [2019-05-15 10:32:26,155 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:32:26,155 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 61 states. [2019-05-15 10:32:26,208 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:32:26,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-05-15 10:32:26,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-05-15 10:32:26,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-05-15 10:32:26,209 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 61 states. [2019-05-15 10:32:33,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:32:33,767 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-05-15 10:32:33,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-05-15 10:32:33,767 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 62 [2019-05-15 10:32:33,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:32:33,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-05-15 10:32:33,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2019-05-15 10:32:33,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-05-15 10:32:33,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2019-05-15 10:32:33,770 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 61 states and 65 transitions. [2019-05-15 10:32:33,822 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:32:33,823 INFO L225 Difference]: With dead ends: 64 [2019-05-15 10:32:33,823 INFO L226 Difference]: Without dead ends: 64 [2019-05-15 10:32:33,823 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-05-15 10:32:33,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-05-15 10:32:33,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-05-15 10:32:33,824 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:32:33,824 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 64 states. [2019-05-15 10:32:33,824 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2019-05-15 10:32:33,825 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2019-05-15 10:32:33,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:32:33,825 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-05-15 10:32:33,826 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-05-15 10:32:33,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:32:33,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:32:33,826 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2019-05-15 10:32:33,826 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2019-05-15 10:32:33,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:32:33,827 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-05-15 10:32:33,827 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-05-15 10:32:33,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:32:33,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:32:33,828 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:32:33,828 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:32:33,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-05-15 10:32:33,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-05-15 10:32:33,828 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-05-15 10:32:33,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:32:33,829 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-05-15 10:32:33,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-05-15 10:32:33,829 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-05-15 10:32:33,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-05-15 10:32:33,829 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:32:33,829 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1, 1] [2019-05-15 10:32:33,830 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:32:33,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:32:33,830 INFO L82 PathProgramCache]: Analyzing trace with hash 2040675074, now seen corresponding path program 59 times [2019-05-15 10:32:33,830 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:32:33,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:32:33,866 WARN L254 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 61 conjunts are in the unsatisfiable core [2019-05-15 10:32:33,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:32:33,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:32:33,950 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:33,950 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:33,952 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:33,953 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:33,953 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:32:33,954 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:33,954 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1777|]. (= (store |v_#memory_int_1777| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:32:33,955 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:32:33,964 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:33,965 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:33,967 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:33,967 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:33,967 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:33,975 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:33,975 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1778|]. (let ((.cse0 (select |v_#memory_int_1778| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1778| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 0))) [2019-05-15 10:32:33,975 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:32:33,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:33,987 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:33,989 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:33,989 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:33,989 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:33,997 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:33,998 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1779|]. (let ((.cse0 (select |v_#memory_int_1779| ULTIMATE.start_main_p1))) (and (= .cse0 1) (= (store |v_#memory_int_1779| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:33,998 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:32:34,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 16 treesize of output 11 [2019-05-15 10:32:34,009 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,011 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:34,011 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,011 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:34,019 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:34,019 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1780|]. (let ((.cse0 (select |v_#memory_int_1780| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1780| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 2 .cse0))) [2019-05-15 10:32:34,020 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:32:34,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 16 treesize of output 11 [2019-05-15 10:32:34,035 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,037 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:34,037 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,038 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:34,046 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:34,046 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1781|]. (let ((.cse0 (select |v_#memory_int_1781| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1781| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 3 .cse0))) [2019-05-15 10:32:34,046 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:32:34,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 16 treesize of output 11 [2019-05-15 10:32:34,058 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,060 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:34,061 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,061 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:34,068 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:34,068 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1782|]. (let ((.cse0 (select |v_#memory_int_1782| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1782| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 4))) [2019-05-15 10:32:34,068 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:32:34,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 16 treesize of output 11 [2019-05-15 10:32:34,083 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,085 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:34,085 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,086 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:34,093 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:34,093 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1783|]. (let ((.cse0 (select |v_#memory_int_1783| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1783| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 5))) [2019-05-15 10:32:34,093 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:32:34,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:34,108 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,110 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:34,110 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,111 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:34,119 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:34,119 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1784|]. (let ((.cse0 (select |v_#memory_int_1784| ULTIMATE.start_main_p1))) (and (= .cse0 6) (= |#memory_int| (store |v_#memory_int_1784| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:34,119 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:32:34,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:34,135 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,137 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:34,137 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,137 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:34,146 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:34,146 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1785|]. (let ((.cse0 (select |v_#memory_int_1785| ULTIMATE.start_main_p1))) (and (= .cse0 7) (= (store |v_#memory_int_1785| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:34,146 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:32:34,161 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:34,162 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,164 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:34,165 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,165 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:34,172 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:34,172 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1786|]. (let ((.cse0 (select |v_#memory_int_1786| ULTIMATE.start_main_p1))) (and (= .cse0 8) (= (store |v_#memory_int_1786| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:34,172 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:32:34,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 16 treesize of output 11 [2019-05-15 10:32:34,189 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,191 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:34,192 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,192 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:34,200 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:34,200 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1787|]. (let ((.cse0 (select |v_#memory_int_1787| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1787| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 9 .cse0))) [2019-05-15 10:32:34,200 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [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,220 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:34,220 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,220 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:34,228 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:34,228 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1788|]. (let ((.cse0 (select |v_#memory_int_1788| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1788| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 10))) [2019-05-15 10:32:34,229 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:32:34,246 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:34,247 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,249 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:34,249 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,249 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:34,256 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:34,257 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1789|]. (let ((.cse0 (select |v_#memory_int_1789| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1789| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 11))) [2019-05-15 10:32:34,257 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:32:34,277 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:34,278 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,280 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:34,280 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,280 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:34,287 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:34,287 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1790|]. (let ((.cse0 (select |v_#memory_int_1790| ULTIMATE.start_main_p1))) (and (= 12 .cse0) (= |#memory_int| (store |v_#memory_int_1790| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:34,287 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:32:34,307 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:34,308 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,311 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:34,311 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,311 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:34,318 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:34,319 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1791|]. (let ((.cse0 (select |v_#memory_int_1791| ULTIMATE.start_main_p1))) (and (= .cse0 13) (= (store |v_#memory_int_1791| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:34,319 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:32:34,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:34,341 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,343 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:34,343 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,343 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:34,352 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:34,352 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1792|]. (let ((.cse0 (select |v_#memory_int_1792| ULTIMATE.start_main_p1))) (and (= .cse0 14) (= (store |v_#memory_int_1792| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:34,352 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:32:34,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 16 treesize of output 11 [2019-05-15 10:32:34,374 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,376 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:34,377 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,377 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:34,384 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:34,385 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1793|]. (let ((.cse0 (select |v_#memory_int_1793| ULTIMATE.start_main_p1))) (and (= 15 .cse0) (= |#memory_int| (store |v_#memory_int_1793| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:34,385 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:32:34,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 16 treesize of output 11 [2019-05-15 10:32:34,407 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,410 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:34,410 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,410 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:34,418 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:34,418 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1794|]. (let ((.cse0 (select |v_#memory_int_1794| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1794| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 16 .cse0))) [2019-05-15 10:32:34,418 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:32:34,442 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:34,443 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,445 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:34,445 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,446 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:34,454 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:34,454 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1795|]. (let ((.cse0 (select |v_#memory_int_1795| ULTIMATE.start_main_p1))) (and (= .cse0 17) (= (store |v_#memory_int_1795| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:34,454 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:32:34,476 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:34,477 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,479 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:34,479 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,479 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:34,487 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:34,487 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1796|]. (let ((.cse0 (select |v_#memory_int_1796| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1796| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 18 .cse0))) [2019-05-15 10:32:34,487 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:32:34,511 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:34,512 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,514 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:34,514 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,514 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:34,521 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:34,521 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1797|]. (let ((.cse0 (select |v_#memory_int_1797| ULTIMATE.start_main_p1))) (and (= .cse0 19) (= (store |v_#memory_int_1797| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:34,521 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:32:34,566 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:34,580 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,619 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:34,619 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,619 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:34,629 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:34,629 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1798|]. (let ((.cse0 (select |v_#memory_int_1798| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1798| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 20))) [2019-05-15 10:32:34,629 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:32:34,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 16 treesize of output 11 [2019-05-15 10:32:34,860 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,861 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:34,861 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,862 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:34,869 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:34,869 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1799|]. (let ((.cse0 (select |v_#memory_int_1799| ULTIMATE.start_main_p1))) (and (= .cse0 21) (= (store |v_#memory_int_1799| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:34,870 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:32:34,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:34,896 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,898 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:34,899 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,899 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:34,905 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:34,905 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1800|]. (let ((.cse0 (select |v_#memory_int_1800| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1800| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 22 .cse0))) [2019-05-15 10:32:34,905 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:32:34,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 16 treesize of output 11 [2019-05-15 10:32:34,932 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,934 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:34,934 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,935 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:34,942 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:34,942 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1801|]. (let ((.cse0 (select |v_#memory_int_1801| ULTIMATE.start_main_p1))) (and (= 23 .cse0) (= (store |v_#memory_int_1801| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:34,942 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:32:34,972 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:34,973 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,975 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:34,975 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:34,975 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:34,985 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:34,985 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1802|]. (let ((.cse0 (select |v_#memory_int_1802| ULTIMATE.start_main_p1))) (and (= .cse0 24) (= (store |v_#memory_int_1802| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:34,985 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:32:35,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:35,017 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:35,019 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:35,019 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:35,019 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:35,027 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:35,027 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1803|]. (let ((.cse0 (select |v_#memory_int_1803| ULTIMATE.start_main_p1))) (and (= 25 .cse0) (= |#memory_int| (store |v_#memory_int_1803| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:35,027 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:32:35,056 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:35,057 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:35,059 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:35,060 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:35,060 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:35,067 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:35,068 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1804|]. (let ((.cse0 (select |v_#memory_int_1804| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1804| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 26 .cse0))) [2019-05-15 10:32:35,068 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:32:35,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 16 treesize of output 11 [2019-05-15 10:32:35,099 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:35,101 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:35,102 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:35,102 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:35,110 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:35,110 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1805|]. (let ((.cse0 (select |v_#memory_int_1805| ULTIMATE.start_main_p1))) (and (= 27 .cse0) (= |#memory_int| (store |v_#memory_int_1805| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:35,110 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:32:35,140 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:35,141 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:35,143 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:35,143 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:35,143 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:35,151 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:35,151 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1806|]. (let ((.cse0 (select |v_#memory_int_1806| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1806| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 28))) [2019-05-15 10:32:35,151 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:32:35,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 16 treesize of output 11 [2019-05-15 10:32:35,184 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:35,186 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:35,187 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:35,187 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:35,195 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:35,196 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1807|]. (let ((.cse0 (select |v_#memory_int_1807| ULTIMATE.start_main_p1))) (and (= .cse0 29) (= |#memory_int| (store |v_#memory_int_1807| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:35,196 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:32:35,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 16 treesize of output 11 [2019-05-15 10:32:35,230 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:35,233 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:35,233 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:35,233 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:35,240 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:35,241 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1808|]. (let ((.cse0 (select |v_#memory_int_1808| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1808| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 30))) [2019-05-15 10:32:35,241 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:32:35,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 16 treesize of output 11 [2019-05-15 10:32:35,276 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:35,278 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:35,279 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:35,279 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:35,287 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:35,287 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1809|]. (let ((.cse0 (select |v_#memory_int_1809| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1809| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 31))) [2019-05-15 10:32:35,287 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:32:35,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 16 treesize of output 11 [2019-05-15 10:32:35,325 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:35,327 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:35,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:35,327 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:35,335 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:35,336 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1810|]. (let ((.cse0 (select |v_#memory_int_1810| ULTIMATE.start_main_p1))) (and (= .cse0 32) (= (store |v_#memory_int_1810| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:35,336 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:32:35,372 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:35,373 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:35,375 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:35,375 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:35,375 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:35,382 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:35,382 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1811|]. (let ((.cse0 (select |v_#memory_int_1811| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1811| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 33 .cse0))) [2019-05-15 10:32:35,382 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:32:35,422 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:35,423 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:35,425 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:35,425 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:35,426 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:35,433 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:35,433 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1812|]. (let ((.cse0 (select |v_#memory_int_1812| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1812| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 34 .cse0))) [2019-05-15 10:32:35,434 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:32:35,472 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:35,473 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:35,475 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:35,476 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:35,476 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:35,483 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:35,483 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1813|]. (let ((.cse0 (select |v_#memory_int_1813| ULTIMATE.start_main_p1))) (and (= .cse0 35) (= (store |v_#memory_int_1813| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:35,483 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:32:35,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:35,520 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:35,522 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:35,522 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:35,523 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:35,530 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:35,530 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1814|]. (let ((.cse0 (select |v_#memory_int_1814| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1814| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 36))) [2019-05-15 10:32:35,530 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:32:35,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 16 treesize of output 11 [2019-05-15 10:32:35,574 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:35,575 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:35,575 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:35,575 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:35,581 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:35,581 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1815|]. (let ((.cse0 (select |v_#memory_int_1815| ULTIMATE.start_main_p1))) (and (= .cse0 37) (= |#memory_int| (store |v_#memory_int_1815| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:35,581 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:32:35,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:35,620 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:35,623 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:35,623 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:35,623 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:35,631 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:35,631 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1816|]. (let ((.cse0 (select |v_#memory_int_1816| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1816| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 38 .cse0))) [2019-05-15 10:32:35,631 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:32:35,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:35,674 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:35,676 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:35,676 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:35,676 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:35,685 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:35,685 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1817|]. (let ((.cse0 (select |v_#memory_int_1817| ULTIMATE.start_main_p1))) (and (= .cse0 39) (= (store |v_#memory_int_1817| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:35,685 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:32:35,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 16 treesize of output 11 [2019-05-15 10:32:35,743 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:35,780 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:35,780 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:35,781 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:35,794 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:35,795 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1818|]. (let ((.cse0 (select |v_#memory_int_1818| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1818| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 40 .cse0))) [2019-05-15 10:32:35,795 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:32:35,909 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:35,910 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:35,912 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:35,912 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:35,912 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:35,921 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:35,921 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1819|]. (let ((.cse0 (select |v_#memory_int_1819| ULTIMATE.start_main_p1))) (and (= 41 .cse0) (= |#memory_int| (store |v_#memory_int_1819| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:35,921 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:32:35,965 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:35,966 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:35,969 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:35,969 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:35,969 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:35,976 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:35,976 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1820|]. (let ((.cse0 (select |v_#memory_int_1820| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1820| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 42))) [2019-05-15 10:32:35,977 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:32:36,020 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:36,021 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:36,023 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:36,023 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:36,023 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:36,031 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:36,031 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1821|]. (let ((.cse0 (select |v_#memory_int_1821| ULTIMATE.start_main_p1))) (and (= 43 .cse0) (= (store |v_#memory_int_1821| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:36,031 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:32:36,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 16 treesize of output 11 [2019-05-15 10:32:36,077 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:36,080 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:36,080 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:36,080 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:36,087 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:36,087 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1822|]. (let ((.cse0 (select |v_#memory_int_1822| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1822| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 44))) [2019-05-15 10:32:36,087 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:32:36,136 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:36,137 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:36,139 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:36,140 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:36,140 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:36,148 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:36,148 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1823|]. (let ((.cse0 (select |v_#memory_int_1823| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1823| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 45 .cse0))) [2019-05-15 10:32:36,148 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:32:36,196 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:36,197 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:36,199 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:36,200 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:36,200 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:36,207 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:36,208 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1824|]. (let ((.cse0 (select |v_#memory_int_1824| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1824| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 46))) [2019-05-15 10:32:36,208 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:32:36,253 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:36,254 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:36,256 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:36,256 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:36,257 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:36,264 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:36,264 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1825|]. (let ((.cse0 (select |v_#memory_int_1825| ULTIMATE.start_main_p1))) (and (= .cse0 47) (= |#memory_int| (store |v_#memory_int_1825| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:36,264 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:32:36,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:36,311 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:36,313 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:36,314 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:36,314 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:36,322 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:36,322 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1826|]. (let ((.cse0 (select |v_#memory_int_1826| ULTIMATE.start_main_p1))) (and (= 48 .cse0) (= |#memory_int| (store |v_#memory_int_1826| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:36,323 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:32:36,371 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:36,372 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:36,374 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:36,375 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:36,375 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:36,382 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:36,383 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1827|]. (let ((.cse0 (select |v_#memory_int_1827| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1827| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 49 .cse0))) [2019-05-15 10:32:36,383 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:32:36,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:36,433 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:36,435 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:36,435 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:36,435 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:36,443 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:36,443 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1828|]. (let ((.cse0 (select |v_#memory_int_1828| ULTIMATE.start_main_p1))) (and (= 50 .cse0) (= (store |v_#memory_int_1828| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:36,443 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:32:36,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 16 treesize of output 11 [2019-05-15 10:32:36,493 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:36,495 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:36,496 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:36,496 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:36,503 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:36,504 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1829|]. (let ((.cse0 (select |v_#memory_int_1829| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1829| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 51 .cse0))) [2019-05-15 10:32:36,504 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:32:36,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 16 treesize of output 11 [2019-05-15 10:32:36,556 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:36,558 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:36,558 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:36,559 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:36,566 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:36,566 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1830|]. (let ((.cse0 (select |v_#memory_int_1830| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1830| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 52 .cse0))) [2019-05-15 10:32:36,566 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:32:36,626 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:36,627 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:36,629 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:36,629 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:36,629 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:36,637 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:36,638 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1831|]. (let ((.cse0 (select |v_#memory_int_1831| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1831| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 53))) [2019-05-15 10:32:36,638 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:32:36,694 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:36,695 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:36,697 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:36,697 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:36,697 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:36,706 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:36,706 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1832|]. (let ((.cse0 (select |v_#memory_int_1832| ULTIMATE.start_main_p1))) (and (= 54 .cse0) (= |#memory_int| (store |v_#memory_int_1832| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:36,706 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:32:36,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 16 treesize of output 11 [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,765 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:36,766 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:36,766 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:36,774 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:36,774 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1833|]. (let ((.cse0 (select |v_#memory_int_1833| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1833| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 55 .cse0))) [2019-05-15 10:32:36,774 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:32:36,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:36,830 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:36,832 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:36,833 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:36,833 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:36,841 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:36,841 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1834|]. (let ((.cse0 (select |v_#memory_int_1834| ULTIMATE.start_main_p1))) (and (= .cse0 56) (= |#memory_int| (store |v_#memory_int_1834| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:36,841 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:32:36,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 16 treesize of output 11 [2019-05-15 10:32:36,900 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:36,902 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:36,902 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:36,902 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:36,910 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:36,910 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1835|]. (let ((.cse0 (select |v_#memory_int_1835| ULTIMATE.start_main_p1))) (and (= .cse0 57) (= (store |v_#memory_int_1835| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:36,910 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:32:36,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:36,968 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:36,970 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:36,970 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:36,971 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:36,979 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:36,979 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1836|]. (let ((.cse0 (select |v_#memory_int_1836| ULTIMATE.start_main_p1))) (and (= 58 .cse0) (= (store |v_#memory_int_1836| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:36,980 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:32:37,032 INFO L273 TraceCheckUtils]: 0: Hoare triple {15944#true} havoc main_p1; {15944#true} is VALID [2019-05-15 10:32:37,032 INFO L273 TraceCheckUtils]: 1: Hoare triple {15944#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {15944#true} is VALID [2019-05-15 10:32:37,033 INFO L273 TraceCheckUtils]: 2: Hoare triple {15944#true} #memory_int := #memory_int[main_p1 := 0]; {15955#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:32:37,034 INFO L273 TraceCheckUtils]: 3: Hoare triple {15955#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15959#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:32:37,034 INFO L273 TraceCheckUtils]: 4: Hoare triple {15959#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15963#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:32:37,035 INFO L273 TraceCheckUtils]: 5: Hoare triple {15963#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15967#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:32:37,036 INFO L273 TraceCheckUtils]: 6: Hoare triple {15967#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15971#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:32:37,037 INFO L273 TraceCheckUtils]: 7: Hoare triple {15971#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15975#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:32:37,038 INFO L273 TraceCheckUtils]: 8: Hoare triple {15975#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15979#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:32:37,038 INFO L273 TraceCheckUtils]: 9: Hoare triple {15979#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15983#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:32:37,039 INFO L273 TraceCheckUtils]: 10: Hoare triple {15983#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15987#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:32:37,040 INFO L273 TraceCheckUtils]: 11: Hoare triple {15987#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15991#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:32:37,041 INFO L273 TraceCheckUtils]: 12: Hoare triple {15991#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15995#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:32:37,042 INFO L273 TraceCheckUtils]: 13: Hoare triple {15995#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15999#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:32:37,042 INFO L273 TraceCheckUtils]: 14: Hoare triple {15999#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16003#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:32:37,043 INFO L273 TraceCheckUtils]: 15: Hoare triple {16003#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16007#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:32:37,044 INFO L273 TraceCheckUtils]: 16: Hoare triple {16007#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16011#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:32:37,045 INFO L273 TraceCheckUtils]: 17: Hoare triple {16011#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16015#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:32:37,046 INFO L273 TraceCheckUtils]: 18: Hoare triple {16015#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16019#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:32:37,046 INFO L273 TraceCheckUtils]: 19: Hoare triple {16019#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16023#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:32:37,047 INFO L273 TraceCheckUtils]: 20: Hoare triple {16023#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16027#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:32:37,048 INFO L273 TraceCheckUtils]: 21: Hoare triple {16027#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16031#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:32:37,049 INFO L273 TraceCheckUtils]: 22: Hoare triple {16031#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16035#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:32:37,050 INFO L273 TraceCheckUtils]: 23: Hoare triple {16035#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16039#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:32:37,051 INFO L273 TraceCheckUtils]: 24: Hoare triple {16039#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16043#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:32:37,051 INFO L273 TraceCheckUtils]: 25: Hoare triple {16043#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16047#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:32:37,052 INFO L273 TraceCheckUtils]: 26: Hoare triple {16047#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16051#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:32:37,053 INFO L273 TraceCheckUtils]: 27: Hoare triple {16051#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16055#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:32:37,054 INFO L273 TraceCheckUtils]: 28: Hoare triple {16055#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16059#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:32:37,055 INFO L273 TraceCheckUtils]: 29: Hoare triple {16059#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16063#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:32:37,055 INFO L273 TraceCheckUtils]: 30: Hoare triple {16063#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16067#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:32:37,056 INFO L273 TraceCheckUtils]: 31: Hoare triple {16067#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16071#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:32:37,057 INFO L273 TraceCheckUtils]: 32: Hoare triple {16071#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16075#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:32:37,058 INFO L273 TraceCheckUtils]: 33: Hoare triple {16075#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16079#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:32:37,059 INFO L273 TraceCheckUtils]: 34: Hoare triple {16079#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16083#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:32:37,059 INFO L273 TraceCheckUtils]: 35: Hoare triple {16083#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16087#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:32:37,060 INFO L273 TraceCheckUtils]: 36: Hoare triple {16087#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16091#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:32:37,061 INFO L273 TraceCheckUtils]: 37: Hoare triple {16091#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16095#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:32:37,062 INFO L273 TraceCheckUtils]: 38: Hoare triple {16095#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16099#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:32:37,063 INFO L273 TraceCheckUtils]: 39: Hoare triple {16099#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16103#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:32:37,063 INFO L273 TraceCheckUtils]: 40: Hoare triple {16103#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16107#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:32:37,064 INFO L273 TraceCheckUtils]: 41: Hoare triple {16107#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16111#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:32:37,065 INFO L273 TraceCheckUtils]: 42: Hoare triple {16111#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16115#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:32:37,066 INFO L273 TraceCheckUtils]: 43: Hoare triple {16115#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16119#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:32:37,067 INFO L273 TraceCheckUtils]: 44: Hoare triple {16119#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16123#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:32:37,067 INFO L273 TraceCheckUtils]: 45: Hoare triple {16123#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16127#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:32:37,068 INFO L273 TraceCheckUtils]: 46: Hoare triple {16127#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16131#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:32:37,069 INFO L273 TraceCheckUtils]: 47: Hoare triple {16131#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16135#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:32:37,070 INFO L273 TraceCheckUtils]: 48: Hoare triple {16135#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16139#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:32:37,071 INFO L273 TraceCheckUtils]: 49: Hoare triple {16139#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16143#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:32:37,071 INFO L273 TraceCheckUtils]: 50: Hoare triple {16143#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16147#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:32:37,072 INFO L273 TraceCheckUtils]: 51: Hoare triple {16147#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16151#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:32:37,073 INFO L273 TraceCheckUtils]: 52: Hoare triple {16151#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16155#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:32:37,074 INFO L273 TraceCheckUtils]: 53: Hoare triple {16155#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16159#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:32:37,075 INFO L273 TraceCheckUtils]: 54: Hoare triple {16159#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16163#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:32:37,075 INFO L273 TraceCheckUtils]: 55: Hoare triple {16163#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16167#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:32:37,076 INFO L273 TraceCheckUtils]: 56: Hoare triple {16167#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16171#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:32:37,077 INFO L273 TraceCheckUtils]: 57: Hoare triple {16171#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16175#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:32:37,078 INFO L273 TraceCheckUtils]: 58: Hoare triple {16175#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16179#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:32:37,079 INFO L273 TraceCheckUtils]: 59: Hoare triple {16179#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16183#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:32:37,079 INFO L273 TraceCheckUtils]: 60: Hoare triple {16183#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16187#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:32:37,080 INFO L273 TraceCheckUtils]: 61: Hoare triple {16187#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16191#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:32:37,081 INFO L273 TraceCheckUtils]: 62: Hoare triple {16191#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} assume !(#memory_int[main_p1] >= 0); {15945#false} is VALID [2019-05-15 10:32:37,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:32:37,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:32:37,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-05-15 10:32:37,088 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 63 [2019-05-15 10:32:37,089 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:32:37,089 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 62 states. [2019-05-15 10:32:37,142 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:32:37,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-05-15 10:32:37,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-05-15 10:32:37,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-05-15 10:32:37,143 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 62 states. [2019-05-15 10:32:45,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:32:45,146 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-05-15 10:32:45,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-05-15 10:32:45,146 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 63 [2019-05-15 10:32:45,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:32:45,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-05-15 10:32:45,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2019-05-15 10:32:45,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-05-15 10:32:45,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2019-05-15 10:32:45,148 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 62 states and 66 transitions. [2019-05-15 10:32:45,211 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:45,212 INFO L225 Difference]: With dead ends: 65 [2019-05-15 10:32:45,213 INFO L226 Difference]: Without dead ends: 65 [2019-05-15 10:32:45,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-05-15 10:32:45,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-05-15 10:32:45,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-05-15 10:32:45,214 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:32:45,214 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 65 states. [2019-05-15 10:32:45,215 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 65 states. [2019-05-15 10:32:45,215 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 65 states. [2019-05-15 10:32:45,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:32:45,215 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-05-15 10:32:45,215 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-05-15 10:32:45,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:32:45,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:32:45,216 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 65 states. [2019-05-15 10:32:45,216 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 65 states. [2019-05-15 10:32:45,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:32:45,216 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-05-15 10:32:45,216 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-05-15 10:32:45,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:32:45,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:32:45,217 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:32:45,217 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:32:45,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-05-15 10:32:45,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-05-15 10:32:45,217 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-05-15 10:32:45,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:32:45,218 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-05-15 10:32:45,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-05-15 10:32:45,218 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-05-15 10:32:45,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-05-15 10:32:45,218 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:32:45,218 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1, 1] [2019-05-15 10:32:45,218 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:32:45,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:32:45,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1163582200, now seen corresponding path program 60 times [2019-05-15 10:32:45,219 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:32:45,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:32:45,254 WARN L254 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 62 conjunts are in the unsatisfiable core [2019-05-15 10:32:45,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:32:45,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:32:45,373 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:45,374 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:45,375 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:45,376 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:45,376 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:32:45,378 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:45,378 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1837|]. (= (store |v_#memory_int_1837| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:32:45,379 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:32:45,390 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:45,391 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:45,393 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:45,393 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:45,393 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:45,401 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:45,401 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1838|]. (let ((.cse0 (select |v_#memory_int_1838| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1838| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 0))) [2019-05-15 10:32:45,401 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:32:45,411 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:45,412 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:45,414 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:45,414 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:45,414 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:45,421 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:45,422 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1839|]. (let ((.cse0 (select |v_#memory_int_1839| ULTIMATE.start_main_p1))) (and (= 1 .cse0) (= |#memory_int| (store |v_#memory_int_1839| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:45,422 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:32:45,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:45,433 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:45,435 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:45,435 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:45,435 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:45,443 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:45,443 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1840|]. (let ((.cse0 (select |v_#memory_int_1840| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1840| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 2 .cse0))) [2019-05-15 10:32:45,444 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:32:45,456 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:45,463 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:45,465 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:45,465 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:45,465 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:45,471 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:45,471 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1841|]. (let ((.cse0 (select |v_#memory_int_1841| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1841| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 3))) [2019-05-15 10:32:45,471 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:32:45,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 16 treesize of output 11 [2019-05-15 10:32:45,484 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:45,486 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:45,487 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:45,487 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:45,494 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:45,495 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1842|]. (let ((.cse0 (select |v_#memory_int_1842| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1842| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 4 .cse0))) [2019-05-15 10:32:45,495 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:32:45,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 16 treesize of output 11 [2019-05-15 10:32:45,508 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:45,510 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:45,510 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:45,510 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:45,518 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:45,518 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1843|]. (let ((.cse0 (select |v_#memory_int_1843| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1843| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 5 .cse0))) [2019-05-15 10:32:45,518 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:32:45,533 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:45,534 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:45,536 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:45,536 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:45,537 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:45,544 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:45,544 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1844|]. (let ((.cse0 (select |v_#memory_int_1844| ULTIMATE.start_main_p1))) (and (= .cse0 6) (= (store |v_#memory_int_1844| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:45,545 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:32:45,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:45,561 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:45,563 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:45,563 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:45,564 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:45,571 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:45,572 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1845|]. (let ((.cse0 (select |v_#memory_int_1845| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1845| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 7))) [2019-05-15 10:32:45,572 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:32:45,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 16 treesize of output 11 [2019-05-15 10:32:45,588 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:45,590 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:45,590 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:45,591 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:45,598 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:45,599 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1846|]. (let ((.cse0 (select |v_#memory_int_1846| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1846| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 8 .cse0))) [2019-05-15 10:32:45,599 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:32:45,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 16 treesize of output 11 [2019-05-15 10:32:45,615 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:45,617 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:45,617 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:45,618 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:45,625 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:45,626 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1847|]. (let ((.cse0 (select |v_#memory_int_1847| ULTIMATE.start_main_p1))) (and (= 9 .cse0) (= (store |v_#memory_int_1847| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:45,626 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:32:45,642 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:45,643 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:45,646 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:45,646 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:45,646 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:45,654 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:45,654 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1848|]. (let ((.cse0 (select |v_#memory_int_1848| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1848| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 10 .cse0))) [2019-05-15 10:32:45,654 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:32:45,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:45,673 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:45,675 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:45,675 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:45,675 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:45,685 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:45,685 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1849|]. (let ((.cse0 (select |v_#memory_int_1849| ULTIMATE.start_main_p1))) (and (= .cse0 11) (= (store |v_#memory_int_1849| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:45,685 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:32:45,704 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:45,705 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:45,707 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:45,707 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:45,707 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:45,715 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:45,715 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1850|]. (let ((.cse0 (select |v_#memory_int_1850| ULTIMATE.start_main_p1))) (and (= .cse0 12) (= (store |v_#memory_int_1850| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:45,715 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:32:45,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 16 treesize of output 11 [2019-05-15 10:32:45,737 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:45,739 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:45,739 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:45,739 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:45,748 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:45,748 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1851|]. (let ((.cse0 (select |v_#memory_int_1851| ULTIMATE.start_main_p1))) (and (= .cse0 13) (= (store |v_#memory_int_1851| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:45,748 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:32:45,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:45,770 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:45,772 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:45,772 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:45,772 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:45,780 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:45,780 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1852|]. (let ((.cse0 (select |v_#memory_int_1852| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1852| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 14))) [2019-05-15 10:32:45,780 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:32:45,803 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:45,804 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:45,806 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:45,807 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:45,807 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:45,814 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:45,814 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1853|]. (let ((.cse0 (select |v_#memory_int_1853| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1853| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 15))) [2019-05-15 10:32:45,814 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:32:45,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 16 treesize of output 11 [2019-05-15 10:32:45,837 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:45,839 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:45,839 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:45,840 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:45,848 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:45,848 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1854|]. (let ((.cse0 (select |v_#memory_int_1854| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1854| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 16))) [2019-05-15 10:32:45,848 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:32:45,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 16 treesize of output 11 [2019-05-15 10:32:45,871 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:45,873 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:45,873 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:45,873 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:45,881 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:45,882 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1855|]. (let ((.cse0 (select |v_#memory_int_1855| ULTIMATE.start_main_p1))) (and (= .cse0 17) (= (store |v_#memory_int_1855| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:45,882 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:32:45,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:45,906 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:45,908 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:45,908 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:45,909 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:45,916 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:45,916 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1856|]. (let ((.cse0 (select |v_#memory_int_1856| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1856| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 18))) [2019-05-15 10:32:45,916 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:32:45,941 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:45,942 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:45,944 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:45,945 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:45,945 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:45,953 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:45,953 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1857|]. (let ((.cse0 (select |v_#memory_int_1857| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1857| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 19))) [2019-05-15 10:32:45,953 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:32:45,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:45,987 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:46,035 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:46,035 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:46,035 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:46,050 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:46,051 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1858|]. (let ((.cse0 (select |v_#memory_int_1858| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1858| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 20))) [2019-05-15 10:32:46,051 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:32:46,756 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:46,766 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:46,805 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:46,805 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:46,806 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:46,817 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:46,817 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1859|]. (let ((.cse0 (select |v_#memory_int_1859| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1859| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 21 .cse0))) [2019-05-15 10:32:46,817 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:32:47,532 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:47,545 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:47,587 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:47,587 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:47,588 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:47,599 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:47,599 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1860|]. (let ((.cse0 (select |v_#memory_int_1860| ULTIMATE.start_main_p1))) (and (= .cse0 22) (= (store |v_#memory_int_1860| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:47,600 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:32:48,367 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:48,380 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:48,410 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:48,410 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:48,411 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:48,422 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:48,422 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1861|]. (let ((.cse0 (select |v_#memory_int_1861| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1861| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 23))) [2019-05-15 10:32:48,422 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:32:49,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:49,081 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:49,082 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:49,083 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:49,083 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:49,090 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:49,090 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1862|]. (let ((.cse0 (select |v_#memory_int_1862| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1862| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 24))) [2019-05-15 10:32:49,090 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:32:49,119 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:49,120 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:49,122 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:49,122 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:49,122 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:49,130 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:49,131 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1863|]. (let ((.cse0 (select |v_#memory_int_1863| ULTIMATE.start_main_p1))) (and (= .cse0 25) (= (store |v_#memory_int_1863| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:49,131 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:32:49,159 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:49,160 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:49,162 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:49,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:49,163 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:49,169 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:49,169 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1864|]. (let ((.cse0 (select |v_#memory_int_1864| ULTIMATE.start_main_p1))) (and (= .cse0 26) (= |#memory_int| (store |v_#memory_int_1864| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:49,169 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:32:49,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:49,200 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:49,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:49,202 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:49,203 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:49,210 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:49,210 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1865|]. (let ((.cse0 (select |v_#memory_int_1865| ULTIMATE.start_main_p1))) (and (= .cse0 27) (= (store |v_#memory_int_1865| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:49,211 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:32:49,241 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:49,242 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:49,244 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:49,244 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:49,245 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:49,252 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:49,252 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1866|]. (let ((.cse0 (select |v_#memory_int_1866| ULTIMATE.start_main_p1))) (and (= .cse0 28) (= |#memory_int| (store |v_#memory_int_1866| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:49,253 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:32:49,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 16 treesize of output 11 [2019-05-15 10:32:49,285 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:49,287 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:49,287 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:49,287 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:49,293 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:49,293 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1867|]. (let ((.cse0 (select |v_#memory_int_1867| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1867| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 29))) [2019-05-15 10:32:49,293 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:32:49,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 16 treesize of output 11 [2019-05-15 10:32:49,328 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:49,330 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:49,330 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:49,330 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:49,338 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:49,338 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1868|]. (let ((.cse0 (select |v_#memory_int_1868| ULTIMATE.start_main_p1))) (and (= 30 .cse0) (= (store |v_#memory_int_1868| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:49,338 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:32:49,371 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:49,372 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:49,374 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:49,375 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:49,375 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:49,383 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:49,383 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1869|]. (let ((.cse0 (select |v_#memory_int_1869| ULTIMATE.start_main_p1))) (and (= .cse0 31) (= |#memory_int| (store |v_#memory_int_1869| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:49,383 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:32:49,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:49,421 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:49,423 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:49,423 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:49,424 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:49,431 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:49,431 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1870|]. (let ((.cse0 (select |v_#memory_int_1870| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1870| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 32))) [2019-05-15 10:32:49,431 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:32:49,467 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:49,469 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:49,471 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:49,471 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:49,471 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:49,480 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:49,480 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1871|]. (let ((.cse0 (select |v_#memory_int_1871| ULTIMATE.start_main_p1))) (and (= .cse0 33) (= |#memory_int| (store |v_#memory_int_1871| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:49,481 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:32:49,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:49,517 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:49,520 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:49,520 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:49,520 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:49,528 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:49,529 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1872|]. (let ((.cse0 (select |v_#memory_int_1872| ULTIMATE.start_main_p1))) (and (= 34 .cse0) (= (store |v_#memory_int_1872| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:49,529 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:32:49,566 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:49,567 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:49,570 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:49,570 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:49,570 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:49,578 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:49,578 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1873|]. (let ((.cse0 (select |v_#memory_int_1873| ULTIMATE.start_main_p1))) (and (= 35 .cse0) (= (store |v_#memory_int_1873| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:49,579 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:32:49,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:49,620 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:49,623 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:49,623 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:49,623 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:49,631 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:49,631 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1874|]. (let ((.cse0 (select |v_#memory_int_1874| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1874| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 36))) [2019-05-15 10:32:49,631 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:32:49,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 16 treesize of output 11 [2019-05-15 10:32:49,689 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:49,731 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:49,731 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:49,732 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:49,748 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:49,748 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1875|]. (let ((.cse0 (select |v_#memory_int_1875| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1875| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 37 .cse0))) [2019-05-15 10:32:49,748 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:32:50,808 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:50,821 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:50,859 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:50,859 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:50,860 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:50,873 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:50,873 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1876|]. (let ((.cse0 (select |v_#memory_int_1876| ULTIMATE.start_main_p1))) (and (= 38 .cse0) (= |#memory_int| (store |v_#memory_int_1876| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:50,874 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:32:51,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:51,985 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:52,021 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:52,021 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:52,022 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:52,034 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:52,034 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1877|]. (let ((.cse0 (select |v_#memory_int_1877| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1877| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 39))) [2019-05-15 10:32:52,034 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:32:52,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 16 treesize of output 11 [2019-05-15 10:32:52,432 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:52,434 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:52,434 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:52,435 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:52,443 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:52,443 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1878|]. (let ((.cse0 (select |v_#memory_int_1878| ULTIMATE.start_main_p1))) (and (= .cse0 40) (= |#memory_int| (store |v_#memory_int_1878| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:52,444 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:32:52,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 16 treesize of output 11 [2019-05-15 10:32:52,488 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:52,490 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:52,491 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:52,491 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:52,499 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:52,499 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1879|]. (let ((.cse0 (select |v_#memory_int_1879| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1879| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 41 .cse0))) [2019-05-15 10:32:52,499 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:32:52,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 16 treesize of output 11 [2019-05-15 10:32:52,544 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:52,546 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:52,546 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:52,546 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:52,554 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:52,555 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1880|]. (let ((.cse0 (select |v_#memory_int_1880| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1880| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 42))) [2019-05-15 10:32:52,555 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:32:52,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:52,603 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:52,605 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:52,606 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:52,606 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:52,614 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:52,614 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1881|]. (let ((.cse0 (select |v_#memory_int_1881| ULTIMATE.start_main_p1))) (and (= .cse0 43) (= (store |v_#memory_int_1881| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:52,614 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:32:52,662 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:52,663 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:52,665 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:52,666 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:52,666 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:52,675 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:52,675 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1882|]. (let ((.cse0 (select |v_#memory_int_1882| ULTIMATE.start_main_p1))) (and (= 44 .cse0) (= (store |v_#memory_int_1882| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:52,675 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:32:52,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 16 treesize of output 11 [2019-05-15 10:32:52,727 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:52,729 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:52,729 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:52,729 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:52,736 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:52,736 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1883|]. (let ((.cse0 (select |v_#memory_int_1883| ULTIMATE.start_main_p1))) (and (= 45 .cse0) (= |#memory_int| (store |v_#memory_int_1883| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:52,736 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:32:52,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 16 treesize of output 11 [2019-05-15 10:32:52,784 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:52,786 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:52,787 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:52,787 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:52,796 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:52,796 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1884|]. (let ((.cse0 (select |v_#memory_int_1884| ULTIMATE.start_main_p1))) (and (= .cse0 46) (= (store |v_#memory_int_1884| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:52,796 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:32:52,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:52,846 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:52,848 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:52,848 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:52,848 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:52,856 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:52,857 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1885|]. (let ((.cse0 (select |v_#memory_int_1885| ULTIMATE.start_main_p1))) (and (= .cse0 47) (= (store |v_#memory_int_1885| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:52,857 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:32:52,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 16 treesize of output 11 [2019-05-15 10:32:52,905 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:52,907 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:52,908 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:52,908 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:52,915 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:52,915 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1886|]. (let ((.cse0 (select |v_#memory_int_1886| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1886| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 48 .cse0))) [2019-05-15 10:32:52,915 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:32:52,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 16 treesize of output 11 [2019-05-15 10:32:52,967 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:52,969 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:52,970 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:52,970 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:52,977 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:52,978 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1887|]. (let ((.cse0 (select |v_#memory_int_1887| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1887| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 49 .cse0))) [2019-05-15 10:32:52,978 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:32:53,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 16 treesize of output 11 [2019-05-15 10:32:53,049 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,052 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32: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:32:53,053 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:53,059 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:53,059 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1888|]. (let ((.cse0 (select |v_#memory_int_1888| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1888| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 50))) [2019-05-15 10:32:53,059 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:32:53,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:53,110 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,112 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:53,112 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,112 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:53,120 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:53,120 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1889|]. (let ((.cse0 (select |v_#memory_int_1889| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1889| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 51))) [2019-05-15 10:32:53,120 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:32:53,174 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:53,175 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,176 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:53,176 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,176 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:53,183 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:53,183 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1890|]. (let ((.cse0 (select |v_#memory_int_1890| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1890| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 52))) [2019-05-15 10:32:53,183 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:32:53,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 16 treesize of output 11 [2019-05-15 10:32:53,239 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,241 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:53,241 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,242 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:53,248 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:53,249 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1891|]. (let ((.cse0 (select |v_#memory_int_1891| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1891| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 53))) [2019-05-15 10:32:53,249 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:32:53,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:53,300 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,303 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:53,303 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,303 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:53,311 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:53,311 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1892|]. (let ((.cse0 (select |v_#memory_int_1892| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1892| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 54))) [2019-05-15 10:32:53,311 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:32:53,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:53,375 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,377 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:53,377 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,378 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:53,385 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:53,386 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1893|]. (let ((.cse0 (select |v_#memory_int_1893| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1893| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 55))) [2019-05-15 10:32:53,386 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:32:53,440 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:53,441 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,443 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:53,443 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,443 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:53,451 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:53,451 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1894|]. (let ((.cse0 (select |v_#memory_int_1894| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1894| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 56))) [2019-05-15 10:32:53,451 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:32:53,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 16 treesize of output 11 [2019-05-15 10:32:53,508 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,510 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:53,511 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,511 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:53,519 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:53,519 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1895|]. (let ((.cse0 (select |v_#memory_int_1895| ULTIMATE.start_main_p1))) (and (= .cse0 57) (= |#memory_int| (store |v_#memory_int_1895| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:53,520 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:32:53,575 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:53,576 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,578 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:53,578 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,578 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:53,586 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:53,586 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1896|]. (let ((.cse0 (select |v_#memory_int_1896| ULTIMATE.start_main_p1))) (and (= .cse0 58) (= |#memory_int| (store |v_#memory_int_1896| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:53,586 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:32:53,642 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:53,643 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,645 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:53,645 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,646 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:53,653 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:53,654 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1897|]. (let ((.cse0 (select |v_#memory_int_1897| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1897| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 59))) [2019-05-15 10:32:53,654 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:32:53,710 INFO L273 TraceCheckUtils]: 0: Hoare triple {16454#true} havoc main_p1; {16454#true} is VALID [2019-05-15 10:32:53,711 INFO L273 TraceCheckUtils]: 1: Hoare triple {16454#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {16454#true} is VALID [2019-05-15 10:32:53,711 INFO L273 TraceCheckUtils]: 2: Hoare triple {16454#true} #memory_int := #memory_int[main_p1 := 0]; {16465#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:32:53,712 INFO L273 TraceCheckUtils]: 3: Hoare triple {16465#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16469#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:32:53,712 INFO L273 TraceCheckUtils]: 4: Hoare triple {16469#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16473#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:32:53,713 INFO L273 TraceCheckUtils]: 5: Hoare triple {16473#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16477#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:32:53,714 INFO L273 TraceCheckUtils]: 6: Hoare triple {16477#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16481#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:32:53,715 INFO L273 TraceCheckUtils]: 7: Hoare triple {16481#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16485#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:32:53,715 INFO L273 TraceCheckUtils]: 8: Hoare triple {16485#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16489#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:32:53,716 INFO L273 TraceCheckUtils]: 9: Hoare triple {16489#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16493#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:32:53,717 INFO L273 TraceCheckUtils]: 10: Hoare triple {16493#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16497#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:32:53,718 INFO L273 TraceCheckUtils]: 11: Hoare triple {16497#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16501#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:32:53,719 INFO L273 TraceCheckUtils]: 12: Hoare triple {16501#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16505#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:32:53,720 INFO L273 TraceCheckUtils]: 13: Hoare triple {16505#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16509#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:32:53,720 INFO L273 TraceCheckUtils]: 14: Hoare triple {16509#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16513#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:32:53,721 INFO L273 TraceCheckUtils]: 15: Hoare triple {16513#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16517#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:32:53,722 INFO L273 TraceCheckUtils]: 16: Hoare triple {16517#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16521#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:32:53,723 INFO L273 TraceCheckUtils]: 17: Hoare triple {16521#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16525#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:32:53,724 INFO L273 TraceCheckUtils]: 18: Hoare triple {16525#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16529#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:32:53,724 INFO L273 TraceCheckUtils]: 19: Hoare triple {16529#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16533#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:32:53,725 INFO L273 TraceCheckUtils]: 20: Hoare triple {16533#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16537#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:32:53,726 INFO L273 TraceCheckUtils]: 21: Hoare triple {16537#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16541#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:32:53,727 INFO L273 TraceCheckUtils]: 22: Hoare triple {16541#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16545#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:32:53,728 INFO L273 TraceCheckUtils]: 23: Hoare triple {16545#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16549#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:32:53,728 INFO L273 TraceCheckUtils]: 24: Hoare triple {16549#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16553#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:32:53,729 INFO L273 TraceCheckUtils]: 25: Hoare triple {16553#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16557#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:32:53,730 INFO L273 TraceCheckUtils]: 26: Hoare triple {16557#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16561#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:32:53,731 INFO L273 TraceCheckUtils]: 27: Hoare triple {16561#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16565#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:32:53,732 INFO L273 TraceCheckUtils]: 28: Hoare triple {16565#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16569#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:32:53,740 INFO L273 TraceCheckUtils]: 29: Hoare triple {16569#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16573#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:32:53,741 INFO L273 TraceCheckUtils]: 30: Hoare triple {16573#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16577#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:32:53,741 INFO L273 TraceCheckUtils]: 31: Hoare triple {16577#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16581#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:32:53,742 INFO L273 TraceCheckUtils]: 32: Hoare triple {16581#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16585#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:32:53,742 INFO L273 TraceCheckUtils]: 33: Hoare triple {16585#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16589#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:32:53,743 INFO L273 TraceCheckUtils]: 34: Hoare triple {16589#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16593#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:32:53,744 INFO L273 TraceCheckUtils]: 35: Hoare triple {16593#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16597#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:32:53,744 INFO L273 TraceCheckUtils]: 36: Hoare triple {16597#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16601#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:32:53,745 INFO L273 TraceCheckUtils]: 37: Hoare triple {16601#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16605#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:32:53,746 INFO L273 TraceCheckUtils]: 38: Hoare triple {16605#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16609#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:32:53,747 INFO L273 TraceCheckUtils]: 39: Hoare triple {16609#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16613#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:32:53,748 INFO L273 TraceCheckUtils]: 40: Hoare triple {16613#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16617#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:32:53,749 INFO L273 TraceCheckUtils]: 41: Hoare triple {16617#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16621#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:32:53,749 INFO L273 TraceCheckUtils]: 42: Hoare triple {16621#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16625#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:32:53,750 INFO L273 TraceCheckUtils]: 43: Hoare triple {16625#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16629#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:32:53,751 INFO L273 TraceCheckUtils]: 44: Hoare triple {16629#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16633#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:32:53,752 INFO L273 TraceCheckUtils]: 45: Hoare triple {16633#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16637#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:32:53,753 INFO L273 TraceCheckUtils]: 46: Hoare triple {16637#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16641#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:32:53,753 INFO L273 TraceCheckUtils]: 47: Hoare triple {16641#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16645#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:32:53,754 INFO L273 TraceCheckUtils]: 48: Hoare triple {16645#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16649#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:32:53,755 INFO L273 TraceCheckUtils]: 49: Hoare triple {16649#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16653#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:32:53,756 INFO L273 TraceCheckUtils]: 50: Hoare triple {16653#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16657#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:32:53,757 INFO L273 TraceCheckUtils]: 51: Hoare triple {16657#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16661#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:32:53,757 INFO L273 TraceCheckUtils]: 52: Hoare triple {16661#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16665#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:32:53,758 INFO L273 TraceCheckUtils]: 53: Hoare triple {16665#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16669#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:32:53,759 INFO L273 TraceCheckUtils]: 54: Hoare triple {16669#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16673#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:32:53,760 INFO L273 TraceCheckUtils]: 55: Hoare triple {16673#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16677#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:32:53,761 INFO L273 TraceCheckUtils]: 56: Hoare triple {16677#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16681#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:32:53,761 INFO L273 TraceCheckUtils]: 57: Hoare triple {16681#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16685#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:32:53,762 INFO L273 TraceCheckUtils]: 58: Hoare triple {16685#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16689#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:32:53,763 INFO L273 TraceCheckUtils]: 59: Hoare triple {16689#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16693#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:32:53,764 INFO L273 TraceCheckUtils]: 60: Hoare triple {16693#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16697#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:32:53,765 INFO L273 TraceCheckUtils]: 61: Hoare triple {16697#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16701#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:32:53,765 INFO L273 TraceCheckUtils]: 62: Hoare triple {16701#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16705#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:32:53,766 INFO L273 TraceCheckUtils]: 63: Hoare triple {16705#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} assume !(#memory_int[main_p1] >= 0); {16455#false} is VALID [2019-05-15 10:32:53,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:32:53,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:32:53,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-05-15 10:32:53,774 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 64 [2019-05-15 10:32:53,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:32:53,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 63 states. [2019-05-15 10:32:53,848 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:53,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-05-15 10:32:53,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-05-15 10:32:53,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-05-15 10:32:53,850 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 63 states. [2019-05-15 10:33:01,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:33:01,934 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-05-15 10:33:01,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-05-15 10:33:01,934 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 64 [2019-05-15 10:33:01,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:33:01,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-05-15 10:33:01,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-05-15 10:33:01,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-05-15 10:33:01,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-05-15 10:33:01,936 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 63 states and 67 transitions. [2019-05-15 10:33:01,992 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:33:01,993 INFO L225 Difference]: With dead ends: 66 [2019-05-15 10:33:01,993 INFO L226 Difference]: Without dead ends: 66 [2019-05-15 10:33:01,994 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-05-15 10:33:01,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-05-15 10:33:01,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-05-15 10:33:01,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:33:01,996 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 66 states. [2019-05-15 10:33:01,996 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 66 states. [2019-05-15 10:33:01,996 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 66 states. [2019-05-15 10:33:01,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:33:01,997 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-05-15 10:33:01,997 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-05-15 10:33:01,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:33:01,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:33:01,997 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 66 states. [2019-05-15 10:33:01,997 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 66 states. [2019-05-15 10:33:01,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:33:01,998 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-05-15 10:33:01,998 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-05-15 10:33:01,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:33:01,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:33:01,999 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:33:01,999 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:33:01,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-05-15 10:33:01,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-05-15 10:33:02,000 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-05-15 10:33:02,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:33:02,000 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-05-15 10:33:02,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-05-15 10:33:02,000 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-05-15 10:33:02,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-05-15 10:33:02,000 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:33:02,000 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1, 1] [2019-05-15 10:33:02,001 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:33:02,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:33:02,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1711309886, now seen corresponding path program 61 times [2019-05-15 10:33:02,002 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:33:02,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:33:02,037 WARN L254 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 63 conjunts are in the unsatisfiable core [2019-05-15 10:33:02,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:33:02,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:33:02,120 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:02,120 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,127 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:02,127 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,127 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:33:02,129 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:02,129 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1898|]. (= (store |v_#memory_int_1898| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:33:02,129 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:33:02,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 16 treesize of output 11 [2019-05-15 10:33:02,140 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,142 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:02,143 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,143 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:02,151 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:02,151 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1899|]. (let ((.cse0 (select |v_#memory_int_1899| ULTIMATE.start_main_p1))) (and (= .cse0 0) (= (store |v_#memory_int_1899| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:02,151 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:33:02,160 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:02,161 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,163 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:02,164 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,164 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:02,170 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:02,171 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1900|]. (let ((.cse0 (select |v_#memory_int_1900| ULTIMATE.start_main_p1))) (and (= 1 .cse0) (= |#memory_int| (store |v_#memory_int_1900| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:02,171 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:33:02,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 16 treesize of output 11 [2019-05-15 10:33:02,187 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,189 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:02,189 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,189 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:02,195 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:02,195 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1901|]. (let ((.cse0 (select |v_#memory_int_1901| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1901| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 2 .cse0))) [2019-05-15 10:33:02,195 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:33:02,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:02,207 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,209 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:02,209 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,209 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:02,217 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:02,218 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1902|]. (let ((.cse0 (select |v_#memory_int_1902| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1902| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 3))) [2019-05-15 10:33:02,218 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:33:02,231 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:02,232 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,234 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:02,234 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,234 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:02,243 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:02,243 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1903|]. (let ((.cse0 (select |v_#memory_int_1903| ULTIMATE.start_main_p1))) (and (= 4 .cse0) (= |#memory_int| (store |v_#memory_int_1903| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:02,243 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:33: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 16 treesize of output 11 [2019-05-15 10:33:02,258 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,260 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:02,260 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,260 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:02,268 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:02,268 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1904|]. (let ((.cse0 (select |v_#memory_int_1904| ULTIMATE.start_main_p1))) (and (= .cse0 5) (= (store |v_#memory_int_1904| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:02,268 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:33:02,282 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:02,283 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,285 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:02,285 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,286 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:02,292 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:02,292 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1905|]. (let ((.cse0 (select |v_#memory_int_1905| ULTIMATE.start_main_p1))) (and (= 6 .cse0) (= (store |v_#memory_int_1905| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:02,293 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:33:02,307 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:02,321 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,323 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:02,323 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,323 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:02,330 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:02,330 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1906|]. (let ((.cse0 (select |v_#memory_int_1906| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1906| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 7 .cse0))) [2019-05-15 10:33:02,331 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:33:02,345 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:02,346 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,348 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:02,349 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,349 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:02,356 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:02,357 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1907|]. (let ((.cse0 (select |v_#memory_int_1907| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1907| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 8 .cse0))) [2019-05-15 10:33:02,357 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:33:02,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:02,377 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,379 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:02,379 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,379 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:02,387 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:02,387 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1908|]. (let ((.cse0 (select |v_#memory_int_1908| ULTIMATE.start_main_p1))) (and (= 9 .cse0) (= (store |v_#memory_int_1908| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:02,387 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:33:02,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 16 treesize of output 11 [2019-05-15 10:33:02,406 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,408 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:02,408 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,408 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:02,415 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:02,416 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1909|]. (let ((.cse0 (select |v_#memory_int_1909| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1909| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 10 .cse0))) [2019-05-15 10:33:02,416 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:33:02,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 16 treesize of output 11 [2019-05-15 10:33:02,435 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,438 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:02,438 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,438 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:02,447 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:02,447 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1910|]. (let ((.cse0 (select |v_#memory_int_1910| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1910| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 11 .cse0))) [2019-05-15 10:33:02,447 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:33:02,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:02,468 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,470 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:02,471 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,471 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:02,479 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:02,479 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1911|]. (let ((.cse0 (select |v_#memory_int_1911| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1911| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 12))) [2019-05-15 10:33:02,479 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:33:02,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:02,499 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,501 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:02,501 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,501 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:02,509 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:02,509 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1912|]. (let ((.cse0 (select |v_#memory_int_1912| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1912| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 13 .cse0))) [2019-05-15 10:33:02,509 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:33:02,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:02,529 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,531 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:02,532 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,532 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:02,539 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:02,539 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1913|]. (let ((.cse0 (select |v_#memory_int_1913| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1913| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 14))) [2019-05-15 10:33:02,539 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [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,565 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:02,566 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,566 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:02,572 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:02,572 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1914|]. (let ((.cse0 (select |v_#memory_int_1914| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1914| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 15 .cse0))) [2019-05-15 10:33:02,572 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:33:02,594 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:02,595 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,597 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:02,598 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,598 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:02,607 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:02,607 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1915|]. (let ((.cse0 (select |v_#memory_int_1915| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1915| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 16))) [2019-05-15 10:33:02,607 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:33:02,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:02,632 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,634 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:02,634 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,634 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:02,642 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:02,642 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1916|]. (let ((.cse0 (select |v_#memory_int_1916| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1916| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 17))) [2019-05-15 10:33:02,642 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:33:02,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 16 treesize of output 11 [2019-05-15 10:33:02,667 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,669 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:02,670 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,670 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:02,679 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:02,679 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1917|]. (let ((.cse0 (select |v_#memory_int_1917| ULTIMATE.start_main_p1))) (and (= 18 .cse0) (= (store |v_#memory_int_1917| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:02,679 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:33: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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:02,704 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,706 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:02,706 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,707 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:02,715 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:02,715 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1918|]. (let ((.cse0 (select |v_#memory_int_1918| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1918| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 19 .cse0))) [2019-05-15 10:33:02,715 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:33:02,740 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:02,741 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,743 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:02,744 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,744 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:02,751 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:02,752 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1919|]. (let ((.cse0 (select |v_#memory_int_1919| ULTIMATE.start_main_p1))) (and (= .cse0 20) (= (store |v_#memory_int_1919| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:02,752 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:33:02,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:02,781 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,784 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:02,784 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,784 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:02,791 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:02,791 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1920|]. (let ((.cse0 (select |v_#memory_int_1920| ULTIMATE.start_main_p1))) (and (= 21 .cse0) (= |#memory_int| (store |v_#memory_int_1920| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:02,791 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:33:02,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 16 treesize of output 11 [2019-05-15 10:33:02,820 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,823 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:02,823 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,823 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:02,831 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:02,832 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1921|]. (let ((.cse0 (select |v_#memory_int_1921| ULTIMATE.start_main_p1))) (and (= .cse0 22) (= |#memory_int| (store |v_#memory_int_1921| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:02,832 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:33:02,861 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:02,862 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,865 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:02,865 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,865 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:02,872 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:02,872 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1922|]. (let ((.cse0 (select |v_#memory_int_1922| ULTIMATE.start_main_p1))) (and (= 23 .cse0) (= |#memory_int| (store |v_#memory_int_1922| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:02,873 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:33:02,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 16 treesize of output 11 [2019-05-15 10:33:02,903 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,905 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:02,905 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,905 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:02,914 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:02,914 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1923|]. (let ((.cse0 (select |v_#memory_int_1923| ULTIMATE.start_main_p1))) (and (= 24 .cse0) (= |#memory_int| (store |v_#memory_int_1923| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:02,914 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:33:02,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:02,945 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,947 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:02,947 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,948 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:02,956 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:02,956 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1924|]. (let ((.cse0 (select |v_#memory_int_1924| ULTIMATE.start_main_p1))) (and (= 25 .cse0) (= |#memory_int| (store |v_#memory_int_1924| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:02,956 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:33:02,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:02,991 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,994 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:02,994 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:02,994 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:03,002 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:03,002 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1925|]. (let ((.cse0 (select |v_#memory_int_1925| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1925| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 26))) [2019-05-15 10:33:03,002 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:33:03,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:03,040 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:03,052 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:03,052 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:03,052 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:03,059 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:03,059 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1926|]. (let ((.cse0 (select |v_#memory_int_1926| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1926| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 27))) [2019-05-15 10:33:03,060 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:33:03,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:03,090 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:03,092 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:03,092 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:03,093 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:03,100 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:03,100 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1927|]. (let ((.cse0 (select |v_#memory_int_1927| ULTIMATE.start_main_p1))) (and (= .cse0 28) (= (store |v_#memory_int_1927| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:03,100 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:33:03,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:03,135 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:03,137 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:03,137 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:03,137 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:03,145 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:03,146 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1928|]. (let ((.cse0 (select |v_#memory_int_1928| ULTIMATE.start_main_p1))) (and (= 29 .cse0) (= (store |v_#memory_int_1928| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:03,146 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:33:03,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:03,180 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:03,182 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:03,182 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:03,182 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:03,189 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:03,189 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1929|]. (let ((.cse0 (select |v_#memory_int_1929| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1929| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 30))) [2019-05-15 10:33:03,189 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:33:03,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:03,225 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:03,227 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:03,227 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:03,227 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:03,235 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:03,236 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1930|]. (let ((.cse0 (select |v_#memory_int_1930| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1930| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 31 .cse0))) [2019-05-15 10:33:03,236 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:33:03,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 16 treesize of output 11 [2019-05-15 10:33:03,284 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:03,286 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:03,286 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:03,286 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:03,294 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:03,295 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1931|]. (let ((.cse0 (select |v_#memory_int_1931| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1931| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 32 .cse0))) [2019-05-15 10:33:03,295 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:33:03,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:03,351 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:03,352 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:03,352 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:03,352 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:03,359 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:03,359 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1932|]. (let ((.cse0 (select |v_#memory_int_1932| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1932| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 33 .cse0))) [2019-05-15 10:33:03,359 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:33:03,407 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:03,408 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:03,410 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:03,410 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:03,410 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:03,418 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:03,418 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1933|]. (let ((.cse0 (select |v_#memory_int_1933| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1933| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 34 .cse0))) [2019-05-15 10:33:03,419 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:33:03,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 16 treesize of output 11 [2019-05-15 10:33:03,462 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:03,464 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:03,465 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:03,465 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:03,472 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:03,473 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1934|]. (let ((.cse0 (select |v_#memory_int_1934| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1934| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 35))) [2019-05-15 10:33:03,473 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:33:03,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 16 treesize of output 11 [2019-05-15 10:33:03,513 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:03,515 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:03,515 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:03,515 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:03,523 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:03,524 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1935|]. (let ((.cse0 (select |v_#memory_int_1935| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1935| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 36 .cse0))) [2019-05-15 10:33:03,524 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:33:03,563 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:03,564 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:03,566 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:03,566 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:03,566 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:03,574 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:03,575 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1936|]. (let ((.cse0 (select |v_#memory_int_1936| ULTIMATE.start_main_p1))) (and (= 37 .cse0) (= |#memory_int| (store |v_#memory_int_1936| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:03,575 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:33:03,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 16 treesize of output 11 [2019-05-15 10:33:03,615 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:03,617 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:03,617 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:03,617 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:03,625 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:03,626 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1937|]. (let ((.cse0 (select |v_#memory_int_1937| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1937| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 38 .cse0))) [2019-05-15 10:33:03,626 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:33:03,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:03,668 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:03,670 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:03,671 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:03,671 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:03,679 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:03,679 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1938|]. (let ((.cse0 (select |v_#memory_int_1938| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1938| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 39))) [2019-05-15 10:33:03,679 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:33:03,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:03,721 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:03,723 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:03,723 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:03,723 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:03,732 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:03,732 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1939|]. (let ((.cse0 (select |v_#memory_int_1939| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1939| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 40))) [2019-05-15 10:33:03,732 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:33:03,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:03,774 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:03,777 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:03,777 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:03,777 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:03,786 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:03,786 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1940|]. (let ((.cse0 (select |v_#memory_int_1940| ULTIMATE.start_main_p1))) (and (= .cse0 41) (= (store |v_#memory_int_1940| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:03,786 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:33:03,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:03,830 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:03,832 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:03,833 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:03,833 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:03,841 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:03,842 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1941|]. (let ((.cse0 (select |v_#memory_int_1941| ULTIMATE.start_main_p1))) (and (= 42 .cse0) (= (store |v_#memory_int_1941| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:03,842 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:33:03,885 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:03,886 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:03,888 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:03,889 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:03,889 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:03,898 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:03,898 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1942|]. (let ((.cse0 (select |v_#memory_int_1942| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1942| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 43 .cse0))) [2019-05-15 10:33:03,898 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:33:03,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 16 treesize of output 11 [2019-05-15 10:33:03,943 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:03,945 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:03,945 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:03,946 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:03,953 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:03,953 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1943|]. (let ((.cse0 (select |v_#memory_int_1943| ULTIMATE.start_main_p1))) (and (= .cse0 44) (= |#memory_int| (store |v_#memory_int_1943| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:03,954 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:33:03,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:04,000 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:04,002 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:04,002 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:04,003 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:04,010 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:04,011 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1944|]. (let ((.cse0 (select |v_#memory_int_1944| ULTIMATE.start_main_p1))) (and (= .cse0 45) (= (store |v_#memory_int_1944| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:04,011 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:33:04,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:04,063 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:04,065 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:04,065 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:04,066 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:04,075 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:04,075 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1945|]. (let ((.cse0 (select |v_#memory_int_1945| ULTIMATE.start_main_p1))) (and (= 46 .cse0) (= (store |v_#memory_int_1945| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:04,075 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:33:04,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:04,123 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:04,125 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:04,125 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:04,125 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:04,134 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:04,134 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1946|]. (let ((.cse0 (select |v_#memory_int_1946| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1946| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 47 .cse0))) [2019-05-15 10:33:04,134 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:33:04,178 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:04,179 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:04,181 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:04,182 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:04,182 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:04,190 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:04,190 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1947|]. (let ((.cse0 (select |v_#memory_int_1947| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1947| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 48 .cse0))) [2019-05-15 10:33:04,190 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:33:04,242 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:04,243 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:04,245 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:04,246 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:04,246 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:04,254 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:04,254 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1948|]. (let ((.cse0 (select |v_#memory_int_1948| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1948| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 49 .cse0))) [2019-05-15 10:33:04,254 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:33:04,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 16 treesize of output 11 [2019-05-15 10:33:04,303 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:04,305 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:04,305 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:04,305 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:04,312 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:04,312 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1949|]. (let ((.cse0 (select |v_#memory_int_1949| ULTIMATE.start_main_p1))) (and (= 50 .cse0) (= |#memory_int| (store |v_#memory_int_1949| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:04,312 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:33:04,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:04,364 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:04,366 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:04,366 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:04,367 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:04,373 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:04,374 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1950|]. (let ((.cse0 (select |v_#memory_int_1950| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1950| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 51))) [2019-05-15 10:33:04,374 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:33:04,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 16 treesize of output 11 [2019-05-15 10:33:04,427 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:04,429 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:04,430 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:04,430 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:04,438 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:04,438 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1951|]. (let ((.cse0 (select |v_#memory_int_1951| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1951| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 52))) [2019-05-15 10:33:04,439 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:33:04,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:04,492 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:04,495 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:04,495 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:04,495 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:04,503 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:04,504 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1952|]. (let ((.cse0 (select |v_#memory_int_1952| ULTIMATE.start_main_p1))) (and (= 53 .cse0) (= |#memory_int| (store |v_#memory_int_1952| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:04,504 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:33:04,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:04,560 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:04,562 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:04,563 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:04,563 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:04,570 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:04,570 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1953|]. (let ((.cse0 (select |v_#memory_int_1953| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1953| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 54))) [2019-05-15 10:33:04,570 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:33:04,626 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:04,627 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:04,629 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:04,630 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:04,630 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:04,638 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:04,638 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1954|]. (let ((.cse0 (select |v_#memory_int_1954| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1954| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 55 .cse0))) [2019-05-15 10:33:04,638 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:33:04,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:04,696 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:04,698 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:04,699 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:04,699 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:04,707 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:04,707 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1955|]. (let ((.cse0 (select |v_#memory_int_1955| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1955| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 56))) [2019-05-15 10:33:04,707 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:33:04,768 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:04,769 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:04,771 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:04,772 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:04,772 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:04,780 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:04,781 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1956|]. (let ((.cse0 (select |v_#memory_int_1956| ULTIMATE.start_main_p1))) (and (= .cse0 57) (= |#memory_int| (store |v_#memory_int_1956| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:04,781 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:33:04,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:04,841 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:04,843 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:04,843 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:04,843 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:04,852 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:04,852 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1957|]. (let ((.cse0 (select |v_#memory_int_1957| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1957| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 58))) [2019-05-15 10:33:04,852 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:33:04,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:04,909 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:04,911 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:04,911 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:04,912 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:04,919 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:04,919 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1958|]. (let ((.cse0 (select |v_#memory_int_1958| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1958| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 59 .cse0))) [2019-05-15 10:33:04,920 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:33:04,980 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:04,982 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:04,984 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:04,985 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:04,985 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:04,994 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:04,995 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1959|]. (let ((.cse0 (select |v_#memory_int_1959| ULTIMATE.start_main_p1))) (and (= 60 .cse0) (= |#memory_int| (store |v_#memory_int_1959| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:04,995 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:33:05,045 INFO L273 TraceCheckUtils]: 0: Hoare triple {16972#true} havoc main_p1; {16972#true} is VALID [2019-05-15 10:33:05,046 INFO L273 TraceCheckUtils]: 1: Hoare triple {16972#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {16972#true} is VALID [2019-05-15 10:33:05,046 INFO L273 TraceCheckUtils]: 2: Hoare triple {16972#true} #memory_int := #memory_int[main_p1 := 0]; {16983#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:33:05,047 INFO L273 TraceCheckUtils]: 3: Hoare triple {16983#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16987#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:33:05,047 INFO L273 TraceCheckUtils]: 4: Hoare triple {16987#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16991#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:33:05,048 INFO L273 TraceCheckUtils]: 5: Hoare triple {16991#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16995#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:33:05,048 INFO L273 TraceCheckUtils]: 6: Hoare triple {16995#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16999#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:33:05,049 INFO L273 TraceCheckUtils]: 7: Hoare triple {16999#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17003#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:33:05,049 INFO L273 TraceCheckUtils]: 8: Hoare triple {17003#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17007#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:33:05,050 INFO L273 TraceCheckUtils]: 9: Hoare triple {17007#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17011#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:33:05,051 INFO L273 TraceCheckUtils]: 10: Hoare triple {17011#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17015#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:33:05,052 INFO L273 TraceCheckUtils]: 11: Hoare triple {17015#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17019#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:33:05,052 INFO L273 TraceCheckUtils]: 12: Hoare triple {17019#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17023#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:33:05,053 INFO L273 TraceCheckUtils]: 13: Hoare triple {17023#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17027#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:33:05,054 INFO L273 TraceCheckUtils]: 14: Hoare triple {17027#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17031#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:33:05,055 INFO L273 TraceCheckUtils]: 15: Hoare triple {17031#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17035#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:33:05,056 INFO L273 TraceCheckUtils]: 16: Hoare triple {17035#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17039#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:33:05,056 INFO L273 TraceCheckUtils]: 17: Hoare triple {17039#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17043#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:33:05,057 INFO L273 TraceCheckUtils]: 18: Hoare triple {17043#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17047#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:33:05,058 INFO L273 TraceCheckUtils]: 19: Hoare triple {17047#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17051#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:33:05,059 INFO L273 TraceCheckUtils]: 20: Hoare triple {17051#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17055#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:33:05,060 INFO L273 TraceCheckUtils]: 21: Hoare triple {17055#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17059#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:33:05,060 INFO L273 TraceCheckUtils]: 22: Hoare triple {17059#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17063#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:33:05,061 INFO L273 TraceCheckUtils]: 23: Hoare triple {17063#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17067#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:33:05,062 INFO L273 TraceCheckUtils]: 24: Hoare triple {17067#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17071#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:33:05,063 INFO L273 TraceCheckUtils]: 25: Hoare triple {17071#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17075#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:33:05,064 INFO L273 TraceCheckUtils]: 26: Hoare triple {17075#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17079#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:33:05,064 INFO L273 TraceCheckUtils]: 27: Hoare triple {17079#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17083#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:33:05,065 INFO L273 TraceCheckUtils]: 28: Hoare triple {17083#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17087#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:33:05,066 INFO L273 TraceCheckUtils]: 29: Hoare triple {17087#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17091#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:33:05,067 INFO L273 TraceCheckUtils]: 30: Hoare triple {17091#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17095#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:33:05,068 INFO L273 TraceCheckUtils]: 31: Hoare triple {17095#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17099#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:33:05,068 INFO L273 TraceCheckUtils]: 32: Hoare triple {17099#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17103#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:33:05,069 INFO L273 TraceCheckUtils]: 33: Hoare triple {17103#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17107#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:33:05,070 INFO L273 TraceCheckUtils]: 34: Hoare triple {17107#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17111#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:33:05,071 INFO L273 TraceCheckUtils]: 35: Hoare triple {17111#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17115#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:33:05,072 INFO L273 TraceCheckUtils]: 36: Hoare triple {17115#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17119#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:33:05,072 INFO L273 TraceCheckUtils]: 37: Hoare triple {17119#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17123#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:33:05,073 INFO L273 TraceCheckUtils]: 38: Hoare triple {17123#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17127#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:33:05,074 INFO L273 TraceCheckUtils]: 39: Hoare triple {17127#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17131#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:33:05,075 INFO L273 TraceCheckUtils]: 40: Hoare triple {17131#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17135#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:33:05,076 INFO L273 TraceCheckUtils]: 41: Hoare triple {17135#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17139#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:33:05,076 INFO L273 TraceCheckUtils]: 42: Hoare triple {17139#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17143#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:33:05,077 INFO L273 TraceCheckUtils]: 43: Hoare triple {17143#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17147#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:33:05,078 INFO L273 TraceCheckUtils]: 44: Hoare triple {17147#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17151#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:33:05,079 INFO L273 TraceCheckUtils]: 45: Hoare triple {17151#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17155#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:33:05,080 INFO L273 TraceCheckUtils]: 46: Hoare triple {17155#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17159#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:33:05,080 INFO L273 TraceCheckUtils]: 47: Hoare triple {17159#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17163#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:33:05,081 INFO L273 TraceCheckUtils]: 48: Hoare triple {17163#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17167#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:33:05,082 INFO L273 TraceCheckUtils]: 49: Hoare triple {17167#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17171#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:33:05,083 INFO L273 TraceCheckUtils]: 50: Hoare triple {17171#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17175#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:33:05,084 INFO L273 TraceCheckUtils]: 51: Hoare triple {17175#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17179#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:33:05,085 INFO L273 TraceCheckUtils]: 52: Hoare triple {17179#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17183#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:33:05,085 INFO L273 TraceCheckUtils]: 53: Hoare triple {17183#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17187#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:33:05,086 INFO L273 TraceCheckUtils]: 54: Hoare triple {17187#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17191#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:33:05,087 INFO L273 TraceCheckUtils]: 55: Hoare triple {17191#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17195#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:33:05,088 INFO L273 TraceCheckUtils]: 56: Hoare triple {17195#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17199#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:33:05,089 INFO L273 TraceCheckUtils]: 57: Hoare triple {17199#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17203#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:33:05,089 INFO L273 TraceCheckUtils]: 58: Hoare triple {17203#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17207#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:33:05,090 INFO L273 TraceCheckUtils]: 59: Hoare triple {17207#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17211#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:33:05,091 INFO L273 TraceCheckUtils]: 60: Hoare triple {17211#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17215#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:33:05,092 INFO L273 TraceCheckUtils]: 61: Hoare triple {17215#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17219#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:33:05,093 INFO L273 TraceCheckUtils]: 62: Hoare triple {17219#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17223#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:33:05,093 INFO L273 TraceCheckUtils]: 63: Hoare triple {17223#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17227#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:33:05,094 INFO L273 TraceCheckUtils]: 64: Hoare triple {17227#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} assume !(#memory_int[main_p1] >= 0); {16973#false} is VALID [2019-05-15 10:33:05,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:33:05,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:33:05,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-05-15 10:33:05,101 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 65 [2019-05-15 10:33:05,101 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:33:05,101 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 64 states. [2019-05-15 10:33:05,155 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:33:05,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-05-15 10:33:05,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-05-15 10:33:05,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-05-15 10:33:05,156 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 64 states. [2019-05-15 10:33:13,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:33:13,215 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-05-15 10:33:13,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-05-15 10:33:13,215 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 65 [2019-05-15 10:33:13,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:33:13,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-05-15 10:33:13,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-05-15 10:33:13,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-05-15 10:33:13,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-05-15 10:33:13,217 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 64 states and 68 transitions. [2019-05-15 10:33:13,270 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:13,271 INFO L225 Difference]: With dead ends: 67 [2019-05-15 10:33:13,271 INFO L226 Difference]: Without dead ends: 67 [2019-05-15 10:33:13,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-05-15 10:33:13,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-05-15 10:33:13,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-05-15 10:33:13,273 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:33:13,273 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 67 states. [2019-05-15 10:33:13,273 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 67 states. [2019-05-15 10:33:13,273 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 67 states. [2019-05-15 10:33:13,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:33:13,274 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-05-15 10:33:13,274 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-05-15 10:33:13,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:33:13,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:33:13,275 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 67 states. [2019-05-15 10:33:13,275 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 67 states. [2019-05-15 10:33:13,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:33:13,275 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-05-15 10:33:13,276 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-05-15 10:33:13,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:33:13,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:33:13,276 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:33:13,276 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:33:13,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-05-15 10:33:13,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-05-15 10:33:13,277 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-05-15 10:33:13,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:33:13,277 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-05-15 10:33:13,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-05-15 10:33:13,277 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-05-15 10:33:13,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-05-15 10:33:13,278 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:33:13,278 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1, 1] [2019-05-15 10:33:13,278 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:33:13,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:33:13,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1510998968, now seen corresponding path program 62 times [2019-05-15 10:33:13,279 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:33:13,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:33:13,305 WARN L254 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 64 conjunts are in the unsatisfiable core [2019-05-15 10:33:13,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:33:13,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:33:13,343 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:13,343 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:13,345 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:13,345 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:13,346 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:33:13,347 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:13,347 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1960|]. (= (store |v_#memory_int_1960| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:33:13,347 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:33:13,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 16 treesize of output 11 [2019-05-15 10:33:13,356 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:13,358 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:13,358 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:13,358 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:13,366 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:13,366 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1961|]. (let ((.cse0 (select |v_#memory_int_1961| ULTIMATE.start_main_p1))) (and (= .cse0 0) (= (store |v_#memory_int_1961| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:13,366 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:33:13,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:13,377 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:13,379 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:13,379 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:13,379 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:13,387 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:13,387 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1962|]. (let ((.cse0 (select |v_#memory_int_1962| ULTIMATE.start_main_p1))) (and (= .cse0 1) (= (store |v_#memory_int_1962| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:13,387 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:33:13,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:13,399 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:13,401 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:13,401 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:13,401 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:13,408 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:13,408 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1963|]. (let ((.cse0 (select |v_#memory_int_1963| ULTIMATE.start_main_p1))) (and (= 2 .cse0) (= |#memory_int| (store |v_#memory_int_1963| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:13,408 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:33:13,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:13,422 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:13,423 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:13,424 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:13,424 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:13,431 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:13,431 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1964|]. (let ((.cse0 (select |v_#memory_int_1964| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1964| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 3))) [2019-05-15 10:33:13,431 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:33:13,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:13,444 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:13,446 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:13,446 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:13,446 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:13,454 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:13,454 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1965|]. (let ((.cse0 (select |v_#memory_int_1965| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1965| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 4))) [2019-05-15 10:33:13,454 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:33:13,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:13,467 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:13,469 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:13,469 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:13,469 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:13,476 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:13,476 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1966|]. (let ((.cse0 (select |v_#memory_int_1966| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1966| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 5 .cse0))) [2019-05-15 10:33:13,476 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:33:13,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:13,492 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:13,494 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:13,494 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:13,494 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:13,501 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:13,501 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1967|]. (let ((.cse0 (select |v_#memory_int_1967| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1967| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 6 .cse0))) [2019-05-15 10:33:13,501 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:33:13,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 16 treesize of output 11 [2019-05-15 10:33:13,523 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:13,529 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:13,529 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:13,529 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:13,535 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:13,535 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1968|]. (let ((.cse0 (select |v_#memory_int_1968| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1968| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 7))) [2019-05-15 10:33:13,535 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:33:13,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:13,550 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:13,552 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:13,552 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:13,552 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:13,559 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:13,559 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1969|]. (let ((.cse0 (select |v_#memory_int_1969| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1969| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 8))) [2019-05-15 10:33:13,559 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:33:13,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:13,578 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:13,580 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:13,580 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:13,580 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:13,588 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:13,588 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1970|]. (let ((.cse0 (select |v_#memory_int_1970| ULTIMATE.start_main_p1))) (and (= .cse0 9) (= (store |v_#memory_int_1970| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:13,588 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:33:13,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 16 treesize of output 11 [2019-05-15 10:33:13,606 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:13,608 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:13,608 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:13,608 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:13,614 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:13,614 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1971|]. (let ((.cse0 (select |v_#memory_int_1971| ULTIMATE.start_main_p1))) (and (= 10 .cse0) (= (store |v_#memory_int_1971| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:13,614 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:33:13,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 16 treesize of output 11 [2019-05-15 10:33:13,631 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:13,633 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:13,633 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:13,633 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:13,641 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:13,642 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1972|]. (let ((.cse0 (select |v_#memory_int_1972| ULTIMATE.start_main_p1))) (and (= .cse0 11) (= (store |v_#memory_int_1972| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:13,642 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:33:13,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:13,661 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:13,663 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:13,663 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:13,663 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:13,671 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:13,671 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1973|]. (let ((.cse0 (select |v_#memory_int_1973| ULTIMATE.start_main_p1))) (and (= .cse0 12) (= (store |v_#memory_int_1973| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:13,671 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:33:13,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 16 treesize of output 11 [2019-05-15 10:33:13,690 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:13,692 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:13,692 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:13,692 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:13,700 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:13,701 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1974|]. (let ((.cse0 (select |v_#memory_int_1974| ULTIMATE.start_main_p1))) (and (= 13 .cse0) (= (store |v_#memory_int_1974| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:13,701 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:33:13,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:13,721 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:13,723 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:13,723 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:13,723 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:13,730 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:13,731 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1975|]. (let ((.cse0 (select |v_#memory_int_1975| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1975| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 14 .cse0))) [2019-05-15 10:33:13,731 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:33:13,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 16 treesize of output 11 [2019-05-15 10:33:13,751 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:13,753 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:13,754 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:13,754 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:13,759 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:13,759 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1976|]. (let ((.cse0 (select |v_#memory_int_1976| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1976| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 15 .cse0))) [2019-05-15 10:33:13,759 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:33:13,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 16 treesize of output 11 [2019-05-15 10:33:13,782 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:13,784 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:13,785 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:13,785 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:13,792 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:13,792 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1977|]. (let ((.cse0 (select |v_#memory_int_1977| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1977| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 16))) [2019-05-15 10:33:13,792 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:33:13,816 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:13,816 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:13,818 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:13,819 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:13,819 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:13,826 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:13,826 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1978|]. (let ((.cse0 (select |v_#memory_int_1978| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1978| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 17 .cse0))) [2019-05-15 10:33:13,827 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:33:13,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 16 treesize of output 11 [2019-05-15 10:33:13,852 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:13,854 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:13,854 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:13,855 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:13,861 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:13,862 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1979|]. (let ((.cse0 (select |v_#memory_int_1979| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1979| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 18 .cse0))) [2019-05-15 10:33:13,862 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:33:13,885 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:13,886 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:13,888 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:13,889 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:13,889 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:13,895 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:13,895 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1980|]. (let ((.cse0 (select |v_#memory_int_1980| ULTIMATE.start_main_p1))) (and (= .cse0 19) (= (store |v_#memory_int_1980| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:13,895 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:33:13,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:13,920 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:13,922 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:13,922 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:13,922 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:13,929 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:13,930 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1981|]. (let ((.cse0 (select |v_#memory_int_1981| ULTIMATE.start_main_p1))) (and (= 20 .cse0) (= (store |v_#memory_int_1981| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:13,930 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:33:13,956 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:13,957 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:13,959 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:13,959 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:13,959 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:13,966 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:13,966 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1982|]. (let ((.cse0 (select |v_#memory_int_1982| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1982| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 21))) [2019-05-15 10:33:13,966 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:33:13,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:13,992 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:13,994 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:13,995 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:13,995 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:14,002 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:14,002 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1983|]. (let ((.cse0 (select |v_#memory_int_1983| ULTIMATE.start_main_p1))) (and (= .cse0 22) (= (store |v_#memory_int_1983| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:14,002 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:33:14,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:14,028 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:14,030 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:14,031 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:14,031 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:14,038 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:14,038 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1984|]. (let ((.cse0 (select |v_#memory_int_1984| ULTIMATE.start_main_p1))) (and (= .cse0 23) (= (store |v_#memory_int_1984| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:14,038 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:33:14,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 16 treesize of output 11 [2019-05-15 10:33:14,067 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:14,069 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:14,069 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:14,069 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:14,076 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:14,076 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1985|]. (let ((.cse0 (select |v_#memory_int_1985| ULTIMATE.start_main_p1))) (and (= .cse0 24) (= |#memory_int| (store |v_#memory_int_1985| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:14,076 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:33:14,105 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:14,106 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:14,108 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:14,108 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:14,108 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:14,114 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:14,114 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1986|]. (let ((.cse0 (select |v_#memory_int_1986| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1986| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 25))) [2019-05-15 10:33:14,114 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:33:14,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 16 treesize of output 11 [2019-05-15 10:33:14,144 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:14,146 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:14,146 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:14,147 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:14,154 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:14,154 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1987|]. (let ((.cse0 (select |v_#memory_int_1987| ULTIMATE.start_main_p1))) (and (= .cse0 26) (= (store |v_#memory_int_1987| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:14,154 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:33:14,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 16 treesize of output 11 [2019-05-15 10:33:14,184 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:14,186 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:14,187 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:14,187 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:14,194 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:14,194 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1988|]. (let ((.cse0 (select |v_#memory_int_1988| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1988| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 27 .cse0))) [2019-05-15 10:33:14,194 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:33:14,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:14,225 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:14,227 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:14,227 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:14,227 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:14,235 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:14,235 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1989|]. (let ((.cse0 (select |v_#memory_int_1989| ULTIMATE.start_main_p1))) (and (= 28 .cse0) (= |#memory_int| (store |v_#memory_int_1989| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:14,235 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:33:14,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 16 treesize of output 11 [2019-05-15 10:33:14,266 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:14,268 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:14,268 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:14,268 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:14,276 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:14,276 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1990|]. (let ((.cse0 (select |v_#memory_int_1990| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1990| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 29))) [2019-05-15 10:33:14,276 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:33:14,309 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:14,310 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:14,312 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:14,313 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:14,313 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:14,321 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:14,321 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1991|]. (let ((.cse0 (select |v_#memory_int_1991| ULTIMATE.start_main_p1))) (and (= 30 .cse0) (= (store |v_#memory_int_1991| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:14,321 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:33:14,353 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:14,354 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:14,356 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:14,356 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:14,357 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:14,364 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:14,364 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1992|]. (let ((.cse0 (select |v_#memory_int_1992| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1992| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 31))) [2019-05-15 10:33:14,364 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:33:14,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:14,399 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:14,404 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:14,404 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:14,404 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:14,410 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:14,410 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1993|]. (let ((.cse0 (select |v_#memory_int_1993| ULTIMATE.start_main_p1))) (and (= .cse0 32) (= (store |v_#memory_int_1993| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:14,410 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:33:14,444 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:14,445 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:14,447 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:14,448 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:14,448 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:14,455 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:14,456 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1994|]. (let ((.cse0 (select |v_#memory_int_1994| ULTIMATE.start_main_p1))) (and (= .cse0 33) (= (store |v_#memory_int_1994| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:14,456 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:33:14,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 16 treesize of output 11 [2019-05-15 10:33:14,493 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:14,495 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:14,495 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:14,496 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:14,503 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:14,503 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1995|]. (let ((.cse0 (select |v_#memory_int_1995| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1995| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 34 .cse0))) [2019-05-15 10:33:14,503 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:33:14,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 16 treesize of output 11 [2019-05-15 10:33:14,544 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:14,546 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:14,546 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:14,546 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:14,555 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:14,555 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1996|]. (let ((.cse0 (select |v_#memory_int_1996| ULTIMATE.start_main_p1))) (and (= 35 .cse0) (= (store |v_#memory_int_1996| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:14,556 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:33:14,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:14,592 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:14,594 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:14,595 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:14,595 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:14,602 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:14,602 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1997|]. (let ((.cse0 (select |v_#memory_int_1997| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1997| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 36 .cse0))) [2019-05-15 10:33:14,602 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:33:14,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:14,642 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:14,644 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:14,645 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:14,645 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:14,652 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:14,653 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1998|]. (let ((.cse0 (select |v_#memory_int_1998| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1998| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 37))) [2019-05-15 10:33:14,653 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:33:14,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 16 treesize of output 11 [2019-05-15 10:33:14,694 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:14,696 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:14,696 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:14,696 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:14,704 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:14,704 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1999|]. (let ((.cse0 (select |v_#memory_int_1999| ULTIMATE.start_main_p1))) (and (= 38 .cse0) (= (store |v_#memory_int_1999| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:14,704 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:33:14,746 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:14,747 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:14,749 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:14,749 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:14,749 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:14,757 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:14,757 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2000|]. (let ((.cse0 (select |v_#memory_int_2000| ULTIMATE.start_main_p1))) (and (= 39 .cse0) (= (store |v_#memory_int_2000| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:14,757 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:33:14,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:14,802 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:14,804 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:14,804 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:14,804 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:14,812 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:14,812 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2001|]. (let ((.cse0 (select |v_#memory_int_2001| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2001| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 40 .cse0))) [2019-05-15 10:33:14,812 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:33:14,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 16 treesize of output 11 [2019-05-15 10:33:14,856 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:14,858 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:14,858 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:14,858 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:14,866 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:14,866 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2002|]. (let ((.cse0 (select |v_#memory_int_2002| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2002| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 41 .cse0))) [2019-05-15 10:33:14,866 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:33:14,909 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:14,910 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:14,912 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:14,912 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:14,912 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:14,919 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:14,919 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2003|]. (let ((.cse0 (select |v_#memory_int_2003| ULTIMATE.start_main_p1))) (and (= .cse0 42) (= |#memory_int| (store |v_#memory_int_2003| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:14,919 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:33:14,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 16 treesize of output 11 [2019-05-15 10:33:14,963 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:14,965 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:14,965 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:14,965 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:14,974 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:14,974 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2004|]. (let ((.cse0 (select |v_#memory_int_2004| ULTIMATE.start_main_p1))) (and (= 43 .cse0) (= (store |v_#memory_int_2004| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:14,974 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:33:15,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:15,018 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:15,020 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:15,020 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,020 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:15,028 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:15,028 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2005|]. (let ((.cse0 (select |v_#memory_int_2005| ULTIMATE.start_main_p1))) (and (= 44 .cse0) (= (store |v_#memory_int_2005| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:15,028 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:33:15,072 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:15,073 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:15,075 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:15,075 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,075 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:15,083 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:15,083 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2006|]. (let ((.cse0 (select |v_#memory_int_2006| ULTIMATE.start_main_p1))) (and (= 45 .cse0) (= |#memory_int| (store |v_#memory_int_2006| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:15,083 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:33:15,127 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:15,128 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:15,130 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:15,130 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,130 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:15,139 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:15,139 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2007|]. (let ((.cse0 (select |v_#memory_int_2007| ULTIMATE.start_main_p1))) (and (= .cse0 46) (= |#memory_int| (store |v_#memory_int_2007| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:15,139 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:33:15,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 16 treesize of output 11 [2019-05-15 10:33:15,187 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:15,189 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:15,189 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,189 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:15,196 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:15,196 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2008|]. (let ((.cse0 (select |v_#memory_int_2008| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2008| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 47 .cse0))) [2019-05-15 10:33:15,196 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:33:15,244 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:15,245 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:15,247 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:15,247 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,247 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:15,254 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:15,254 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2009|]. (let ((.cse0 (select |v_#memory_int_2009| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2009| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 48 .cse0))) [2019-05-15 10:33:15,254 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:33:15,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 16 treesize of output 11 [2019-05-15 10:33:15,305 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:15,307 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:15,307 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,307 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:15,315 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:15,315 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2010|]. (let ((.cse0 (select |v_#memory_int_2010| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2010| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 49))) [2019-05-15 10:33:15,315 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:33:15,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:15,363 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:15,365 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:15,365 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,365 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, 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_#memory_int_2011|]. (let ((.cse0 (select |v_#memory_int_2011| ULTIMATE.start_main_p1))) (and (= 50 .cse0) (= (store |v_#memory_int_2011| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:15,373 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:33:15,422 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:15,423 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:15,425 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:15,426 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,426 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:15,435 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:15,435 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2012|]. (let ((.cse0 (select |v_#memory_int_2012| ULTIMATE.start_main_p1))) (and (= .cse0 51) (= (store |v_#memory_int_2012| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:15,435 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:33:15,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 16 treesize of output 11 [2019-05-15 10:33:15,487 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:15,489 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:15,489 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,490 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:15,497 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:15,497 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2013|]. (let ((.cse0 (select |v_#memory_int_2013| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2013| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 52 .cse0))) [2019-05-15 10:33:15,497 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:33:15,547 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:15,548 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:15,551 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:15,551 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,551 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:15,558 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:15,559 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2014|]. (let ((.cse0 (select |v_#memory_int_2014| ULTIMATE.start_main_p1))) (and (= 53 .cse0) (= (store |v_#memory_int_2014| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:15,559 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:33:15,612 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:15,613 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:15,615 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:15,616 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,616 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:15,624 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:15,624 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2015|]. (let ((.cse0 (select |v_#memory_int_2015| ULTIMATE.start_main_p1))) (and (= 54 .cse0) (= (store |v_#memory_int_2015| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:15,624 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:33: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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:15,678 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:15,680 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:15,680 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,680 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:15,688 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:15,689 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2016|]. (let ((.cse0 (select |v_#memory_int_2016| ULTIMATE.start_main_p1))) (and (= 55 .cse0) (= |#memory_int| (store |v_#memory_int_2016| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:15,689 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:33:15,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:15,742 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:15,744 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:15,744 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,744 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:15,752 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:15,752 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2017|]. (let ((.cse0 (select |v_#memory_int_2017| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2017| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 56 .cse0))) [2019-05-15 10:33:15,752 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:33:15,808 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:15,809 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:15,811 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:15,811 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,811 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:15,820 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:15,820 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2018|]. (let ((.cse0 (select |v_#memory_int_2018| ULTIMATE.start_main_p1))) (and (= 57 .cse0) (= |#memory_int| (store |v_#memory_int_2018| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:15,820 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:33:15,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:15,877 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:15,879 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:15,879 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,879 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:15,887 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:15,887 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2019|]. (let ((.cse0 (select |v_#memory_int_2019| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2019| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 58))) [2019-05-15 10:33:15,887 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:33:15,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 16 treesize of output 11 [2019-05-15 10:33:15,944 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:15,947 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:15,947 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,947 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:15,955 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:15,955 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2020|]. (let ((.cse0 (select |v_#memory_int_2020| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2020| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 59 .cse0))) [2019-05-15 10:33:15,955 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:33:16,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:16,015 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,017 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:16,018 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,018 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:16,025 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:16,025 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2021|]. (let ((.cse0 (select |v_#memory_int_2021| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2021| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 60))) [2019-05-15 10:33:16,026 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:33:16,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 16 treesize of output 11 [2019-05-15 10:33:16,084 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,086 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:16,087 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,087 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:16,094 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:16,095 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2022|]. (let ((.cse0 (select |v_#memory_int_2022| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2022| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 61 .cse0))) [2019-05-15 10:33:16,095 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:33:16,147 INFO L273 TraceCheckUtils]: 0: Hoare triple {17498#true} havoc main_p1; {17498#true} is VALID [2019-05-15 10:33:16,147 INFO L273 TraceCheckUtils]: 1: Hoare triple {17498#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {17498#true} is VALID [2019-05-15 10:33:16,148 INFO L273 TraceCheckUtils]: 2: Hoare triple {17498#true} #memory_int := #memory_int[main_p1 := 0]; {17509#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:33:16,149 INFO L273 TraceCheckUtils]: 3: Hoare triple {17509#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17513#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:33:16,149 INFO L273 TraceCheckUtils]: 4: Hoare triple {17513#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17517#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:33:16,150 INFO L273 TraceCheckUtils]: 5: Hoare triple {17517#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17521#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:33:16,150 INFO L273 TraceCheckUtils]: 6: Hoare triple {17521#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17525#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:33:16,151 INFO L273 TraceCheckUtils]: 7: Hoare triple {17525#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17529#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:33:16,151 INFO L273 TraceCheckUtils]: 8: Hoare triple {17529#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17533#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:33:16,152 INFO L273 TraceCheckUtils]: 9: Hoare triple {17533#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17537#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:33:16,152 INFO L273 TraceCheckUtils]: 10: Hoare triple {17537#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17541#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:33:16,153 INFO L273 TraceCheckUtils]: 11: Hoare triple {17541#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17545#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:33:16,154 INFO L273 TraceCheckUtils]: 12: Hoare triple {17545#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17549#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:33:16,155 INFO L273 TraceCheckUtils]: 13: Hoare triple {17549#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17553#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:33:16,155 INFO L273 TraceCheckUtils]: 14: Hoare triple {17553#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17557#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:33:16,156 INFO L273 TraceCheckUtils]: 15: Hoare triple {17557#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17561#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:33:16,157 INFO L273 TraceCheckUtils]: 16: Hoare triple {17561#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17565#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:33:16,158 INFO L273 TraceCheckUtils]: 17: Hoare triple {17565#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17569#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:33:16,158 INFO L273 TraceCheckUtils]: 18: Hoare triple {17569#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17573#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:33:16,159 INFO L273 TraceCheckUtils]: 19: Hoare triple {17573#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17577#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:33:16,160 INFO L273 TraceCheckUtils]: 20: Hoare triple {17577#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17581#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:33:16,161 INFO L273 TraceCheckUtils]: 21: Hoare triple {17581#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17585#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:33:16,161 INFO L273 TraceCheckUtils]: 22: Hoare triple {17585#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17589#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:33:16,162 INFO L273 TraceCheckUtils]: 23: Hoare triple {17589#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17593#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:33:16,163 INFO L273 TraceCheckUtils]: 24: Hoare triple {17593#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17597#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:33:16,164 INFO L273 TraceCheckUtils]: 25: Hoare triple {17597#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17601#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:33:16,164 INFO L273 TraceCheckUtils]: 26: Hoare triple {17601#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17605#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:33:16,165 INFO L273 TraceCheckUtils]: 27: Hoare triple {17605#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17609#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:33:16,166 INFO L273 TraceCheckUtils]: 28: Hoare triple {17609#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17613#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:33:16,167 INFO L273 TraceCheckUtils]: 29: Hoare triple {17613#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17617#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:33:16,167 INFO L273 TraceCheckUtils]: 30: Hoare triple {17617#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17621#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:33:16,168 INFO L273 TraceCheckUtils]: 31: Hoare triple {17621#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17625#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:33:16,169 INFO L273 TraceCheckUtils]: 32: Hoare triple {17625#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17629#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:33:16,170 INFO L273 TraceCheckUtils]: 33: Hoare triple {17629#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17633#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:33:16,170 INFO L273 TraceCheckUtils]: 34: Hoare triple {17633#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17637#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:33:16,171 INFO L273 TraceCheckUtils]: 35: Hoare triple {17637#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17641#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:33:16,172 INFO L273 TraceCheckUtils]: 36: Hoare triple {17641#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17645#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:33:16,173 INFO L273 TraceCheckUtils]: 37: Hoare triple {17645#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17649#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:33:16,173 INFO L273 TraceCheckUtils]: 38: Hoare triple {17649#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17653#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:33:16,174 INFO L273 TraceCheckUtils]: 39: Hoare triple {17653#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17657#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:33:16,175 INFO L273 TraceCheckUtils]: 40: Hoare triple {17657#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17661#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:33:16,176 INFO L273 TraceCheckUtils]: 41: Hoare triple {17661#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17665#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:33:16,176 INFO L273 TraceCheckUtils]: 42: Hoare triple {17665#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17669#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:33:16,177 INFO L273 TraceCheckUtils]: 43: Hoare triple {17669#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17673#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:33:16,178 INFO L273 TraceCheckUtils]: 44: Hoare triple {17673#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17677#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:33:16,179 INFO L273 TraceCheckUtils]: 45: Hoare triple {17677#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17681#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:33:16,179 INFO L273 TraceCheckUtils]: 46: Hoare triple {17681#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17685#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:33:16,180 INFO L273 TraceCheckUtils]: 47: Hoare triple {17685#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17689#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:33:16,181 INFO L273 TraceCheckUtils]: 48: Hoare triple {17689#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17693#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:33:16,182 INFO L273 TraceCheckUtils]: 49: Hoare triple {17693#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17697#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:33:16,182 INFO L273 TraceCheckUtils]: 50: Hoare triple {17697#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17701#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:33:16,183 INFO L273 TraceCheckUtils]: 51: Hoare triple {17701#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17705#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:33:16,184 INFO L273 TraceCheckUtils]: 52: Hoare triple {17705#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17709#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:33:16,185 INFO L273 TraceCheckUtils]: 53: Hoare triple {17709#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17713#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:33:16,185 INFO L273 TraceCheckUtils]: 54: Hoare triple {17713#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17717#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:33:16,186 INFO L273 TraceCheckUtils]: 55: Hoare triple {17717#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17721#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:33:16,187 INFO L273 TraceCheckUtils]: 56: Hoare triple {17721#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17725#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:33:16,188 INFO L273 TraceCheckUtils]: 57: Hoare triple {17725#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17729#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:33:16,188 INFO L273 TraceCheckUtils]: 58: Hoare triple {17729#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17733#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:33:16,189 INFO L273 TraceCheckUtils]: 59: Hoare triple {17733#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17737#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:33:16,190 INFO L273 TraceCheckUtils]: 60: Hoare triple {17737#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17741#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:33:16,191 INFO L273 TraceCheckUtils]: 61: Hoare triple {17741#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17745#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:33:16,191 INFO L273 TraceCheckUtils]: 62: Hoare triple {17745#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17749#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:33:16,192 INFO L273 TraceCheckUtils]: 63: Hoare triple {17749#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17753#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:33:16,193 INFO L273 TraceCheckUtils]: 64: Hoare triple {17753#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17757#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:33:16,194 INFO L273 TraceCheckUtils]: 65: Hoare triple {17757#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} assume !(#memory_int[main_p1] >= 0); {17499#false} is VALID [2019-05-15 10:33:16,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:33:16,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:33:16,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-05-15 10:33:16,201 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 66 [2019-05-15 10:33:16,201 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:33:16,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 65 states. [2019-05-15 10:33:16,253 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:33:16,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-05-15 10:33:16,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-05-15 10:33:16,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-05-15 10:33:16,254 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 65 states. [2019-05-15 10:33:24,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:33:24,426 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-05-15 10:33:24,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-05-15 10:33:24,426 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 66 [2019-05-15 10:33:24,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:33:24,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-05-15 10:33:24,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-05-15 10:33:24,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-05-15 10:33:24,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-05-15 10:33:24,428 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 65 states and 69 transitions. [2019-05-15 10:33:24,483 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:33:24,484 INFO L225 Difference]: With dead ends: 68 [2019-05-15 10:33:24,484 INFO L226 Difference]: Without dead ends: 68 [2019-05-15 10:33:24,485 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-05-15 10:33:24,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-05-15 10:33:24,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-05-15 10:33:24,486 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:33:24,486 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 68 states. [2019-05-15 10:33:24,486 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 68 states. [2019-05-15 10:33:24,487 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 68 states. [2019-05-15 10:33:24,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:33:24,487 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-05-15 10:33:24,488 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-05-15 10:33:24,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:33:24,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:33:24,488 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 68 states. [2019-05-15 10:33:24,488 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 68 states. [2019-05-15 10:33:24,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:33:24,489 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-05-15 10:33:24,489 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-05-15 10:33:24,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:33:24,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:33:24,489 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:33:24,489 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:33:24,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-05-15 10:33:24,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-05-15 10:33:24,490 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-05-15 10:33:24,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:33:24,490 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-05-15 10:33:24,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-05-15 10:33:24,490 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-05-15 10:33:24,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-05-15 10:33:24,490 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:33:24,490 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1, 1] [2019-05-15 10:33:24,491 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:33:24,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:33:24,491 INFO L82 PathProgramCache]: Analyzing trace with hash 403672194, now seen corresponding path program 63 times [2019-05-15 10:33:24,491 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:33:24,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:33:24,526 WARN L254 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 65 conjunts are in the unsatisfiable core [2019-05-15 10:33:24,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:33:24,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:33:24,602 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:24,602 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:24,604 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:24,604 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:24,605 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:33:24,606 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:24,606 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2023|]. (= |#memory_int| (store |v_#memory_int_2023| ULTIMATE.start_main_p1 0)) [2019-05-15 10:33:24,607 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:33:24,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 16 treesize of output 11 [2019-05-15 10:33:24,619 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:24,620 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:24,621 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:24,621 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:24,629 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:24,629 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2024|]. (let ((.cse0 (select |v_#memory_int_2024| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2024| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 0 .cse0))) [2019-05-15 10:33:24,629 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:33:24,639 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:24,640 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:24,642 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:24,642 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:24,642 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:24,649 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:24,649 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2025|]. (let ((.cse0 (select |v_#memory_int_2025| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2025| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 1 .cse0))) [2019-05-15 10:33:24,649 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:33:24,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:24,661 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:24,663 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:24,663 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:24,664 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:24,671 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:24,671 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2026|]. (let ((.cse0 (select |v_#memory_int_2026| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2026| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 2 .cse0))) [2019-05-15 10:33:24,671 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:33:24,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 16 treesize of output 11 [2019-05-15 10:33:24,684 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:24,686 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:24,686 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:24,687 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:24,694 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:24,694 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2027|]. (let ((.cse0 (select |v_#memory_int_2027| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2027| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 3 .cse0))) [2019-05-15 10:33:24,694 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:33:24,705 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:24,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:24,708 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:24,708 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:24,708 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:24,716 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:24,716 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2028|]. (let ((.cse0 (select |v_#memory_int_2028| ULTIMATE.start_main_p1))) (and (= 4 .cse0) (= (store |v_#memory_int_2028| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:24,716 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:33:24,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:24,731 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:24,732 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:24,733 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:24,733 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:24,741 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:24,742 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2029|]. (let ((.cse0 (select |v_#memory_int_2029| ULTIMATE.start_main_p1))) (and (= 5 .cse0) (= |#memory_int| (store |v_#memory_int_2029| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:24,742 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:33:24,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:24,756 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:24,758 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:24,758 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:24,758 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:24,765 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:24,765 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2030|]. (let ((.cse0 (select |v_#memory_int_2030| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2030| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 6 .cse0))) [2019-05-15 10:33:24,765 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:33:24,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 16 treesize of output 11 [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,782 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:24,782 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:24,782 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:24,789 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:24,790 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2031|]. (let ((.cse0 (select |v_#memory_int_2031| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2031| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 7 .cse0))) [2019-05-15 10:33:24,790 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:33:24,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:24,806 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:24,808 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:24,808 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:24,808 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:24,816 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:24,816 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2032|]. (let ((.cse0 (select |v_#memory_int_2032| ULTIMATE.start_main_p1))) (and (= 8 .cse0) (= (store |v_#memory_int_2032| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:24,816 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:33:24,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:24,834 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:24,836 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:24,836 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:24,836 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:24,843 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:24,844 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2033|]. (let ((.cse0 (select |v_#memory_int_2033| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2033| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 9))) [2019-05-15 10:33:24,844 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:33:24,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 16 treesize of output 11 [2019-05-15 10:33:24,861 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:24,863 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:24,863 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:24,863 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:24,871 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:24,871 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2034|]. (let ((.cse0 (select |v_#memory_int_2034| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2034| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 10 .cse0))) [2019-05-15 10:33:24,871 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:33:24,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:24,888 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:24,890 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:24,890 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:24,890 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:24,898 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:24,898 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2035|]. (let ((.cse0 (select |v_#memory_int_2035| ULTIMATE.start_main_p1))) (and (= .cse0 11) (= (store |v_#memory_int_2035| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:24,898 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:33:24,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:24,917 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:24,919 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:24,919 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:24,919 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:24,925 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:24,926 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2036|]. (let ((.cse0 (select |v_#memory_int_2036| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2036| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 12 .cse0))) [2019-05-15 10:33:24,926 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:33:24,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 16 treesize of output 11 [2019-05-15 10:33:24,946 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:24,948 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:24,948 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:24,948 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:24,956 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:24,956 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2037|]. (let ((.cse0 (select |v_#memory_int_2037| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2037| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 13 .cse0))) [2019-05-15 10:33:24,956 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:33:24,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:24,978 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:24,980 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:24,980 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:24,980 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:24,987 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:24,988 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2038|]. (let ((.cse0 (select |v_#memory_int_2038| ULTIMATE.start_main_p1))) (and (= 14 .cse0) (= (store |v_#memory_int_2038| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:24,988 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:33:25,006 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:25,007 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:25,009 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:25,009 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:25,009 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:25,017 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:25,017 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2039|]. (let ((.cse0 (select |v_#memory_int_2039| ULTIMATE.start_main_p1))) (and (= 15 .cse0) (= |#memory_int| (store |v_#memory_int_2039| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:25,017 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:33:25,038 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:25,039 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:25,041 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:25,041 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:25,041 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:25,048 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:25,048 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2040|]. (let ((.cse0 (select |v_#memory_int_2040| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2040| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 16 .cse0))) [2019-05-15 10:33:25,048 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:33:25,070 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:25,071 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:25,073 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:25,073 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:25,073 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:25,080 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:25,080 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2041|]. (let ((.cse0 (select |v_#memory_int_2041| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2041| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 17))) [2019-05-15 10:33:25,081 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:33:25,104 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:25,104 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:25,106 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:25,107 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:25,107 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:25,114 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:25,114 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2042|]. (let ((.cse0 (select |v_#memory_int_2042| ULTIMATE.start_main_p1))) (and (= .cse0 18) (= |#memory_int| (store |v_#memory_int_2042| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:25,114 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:33:25,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:25,138 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:25,140 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:25,141 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:25,141 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:25,148 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:25,148 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2043|]. (let ((.cse0 (select |v_#memory_int_2043| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2043| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 19 .cse0))) [2019-05-15 10:33:25,148 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:33:25,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:25,174 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:25,176 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:25,176 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:25,176 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:25,183 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:25,184 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2044|]. (let ((.cse0 (select |v_#memory_int_2044| ULTIMATE.start_main_p1))) (and (= .cse0 20) (= (store |v_#memory_int_2044| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:25,184 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:33:25,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 16 treesize of output 11 [2019-05-15 10:33:25,210 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:25,212 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:25,212 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:25,212 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:25,219 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:25,219 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2045|]. (let ((.cse0 (select |v_#memory_int_2045| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2045| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 21 .cse0))) [2019-05-15 10:33:25,220 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:33:25,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 16 treesize of output 11 [2019-05-15 10:33:25,249 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:25,250 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:25,250 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:25,250 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:25,257 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:25,257 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2046|]. (let ((.cse0 (select |v_#memory_int_2046| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2046| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 22))) [2019-05-15 10:33:25,257 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:33:25,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 16 treesize of output 11 [2019-05-15 10:33:25,285 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:25,287 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:25,287 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:25,287 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:25,293 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:25,293 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2047|]. (let ((.cse0 (select |v_#memory_int_2047| ULTIMATE.start_main_p1))) (and (= 23 .cse0) (= |#memory_int| (store |v_#memory_int_2047| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:25,293 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:33:25,319 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:25,320 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:25,322 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:25,323 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:25,323 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:25,330 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:25,330 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2048|]. (let ((.cse0 (select |v_#memory_int_2048| ULTIMATE.start_main_p1))) (and (= 24 .cse0) (= |#memory_int| (store |v_#memory_int_2048| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:25,330 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:33:25,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:25,359 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:25,361 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:25,362 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:25,362 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:25,369 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:25,369 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2049|]. (let ((.cse0 (select |v_#memory_int_2049| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2049| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 25 .cse0))) [2019-05-15 10:33:25,369 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:33:25,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:25,400 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:25,402 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:25,403 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:25,403 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:25,409 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:25,409 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2050|]. (let ((.cse0 (select |v_#memory_int_2050| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2050| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 26 .cse0))) [2019-05-15 10:33:25,410 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:33:25,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:25,439 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:25,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:25,441 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:25,441 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:25,448 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:25,448 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2051|]. (let ((.cse0 (select |v_#memory_int_2051| ULTIMATE.start_main_p1))) (and (= 27 .cse0) (= (store |v_#memory_int_2051| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:25,448 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:33:25,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 16 treesize of output 11 [2019-05-15 10:33:25,480 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:25,482 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:25,482 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:25,483 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:25,490 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:25,490 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2052|]. (let ((.cse0 (select |v_#memory_int_2052| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2052| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 28 .cse0))) [2019-05-15 10:33:25,490 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:33:25,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 16 treesize of output 11 [2019-05-15 10:33:25,521 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:25,523 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:25,523 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:25,524 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:25,531 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:25,531 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2053|]. (let ((.cse0 (select |v_#memory_int_2053| ULTIMATE.start_main_p1))) (and (= 29 .cse0) (= (store |v_#memory_int_2053| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:25,531 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:33:25,563 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:25,564 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:25,566 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:25,566 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:25,566 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:25,573 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:25,573 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2054|]. (let ((.cse0 (select |v_#memory_int_2054| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2054| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 30 .cse0))) [2019-05-15 10:33:25,573 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:33:25,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 16 treesize of output 11 [2019-05-15 10:33:25,636 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:25,638 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:25,638 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:25,639 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:25,646 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:25,646 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2055|]. (let ((.cse0 (select |v_#memory_int_2055| ULTIMATE.start_main_p1))) (and (= 31 .cse0) (= |#memory_int| (store |v_#memory_int_2055| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:25,646 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:33:25,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:25,681 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:25,683 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:25,683 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:25,683 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:25,690 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:25,691 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2056|]. (let ((.cse0 (select |v_#memory_int_2056| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2056| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 32 .cse0))) [2019-05-15 10:33:25,691 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:33:25,725 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:25,726 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:25,728 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:25,728 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:25,728 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:25,735 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:25,736 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2057|]. (let ((.cse0 (select |v_#memory_int_2057| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2057| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 33 .cse0))) [2019-05-15 10:33:25,736 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:33:25,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:25,770 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:25,772 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:25,772 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:25,772 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:25,781 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:25,781 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2058|]. (let ((.cse0 (select |v_#memory_int_2058| ULTIMATE.start_main_p1))) (and (= 34 .cse0) (= |#memory_int| (store |v_#memory_int_2058| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:25,781 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:33:25,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 16 treesize of output 11 [2019-05-15 10:33:25,818 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:25,820 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:25,821 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:25,821 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:25,828 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:25,829 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2059|]. (let ((.cse0 (select |v_#memory_int_2059| ULTIMATE.start_main_p1))) (and (= 35 .cse0) (= (store |v_#memory_int_2059| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:25,829 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:33:25,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:25,867 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:25,869 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:25,869 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:25,869 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:25,877 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:25,877 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2060|]. (let ((.cse0 (select |v_#memory_int_2060| ULTIMATE.start_main_p1))) (and (= .cse0 36) (= |#memory_int| (store |v_#memory_int_2060| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:25,878 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:33:25,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 16 treesize of output 11 [2019-05-15 10:33:25,914 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:25,916 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:25,916 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:25,917 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:25,925 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:25,925 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2061|]. (let ((.cse0 (select |v_#memory_int_2061| ULTIMATE.start_main_p1))) (and (= .cse0 37) (= (store |v_#memory_int_2061| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:25,925 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:33:25,964 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:25,965 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:25,967 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:25,967 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:25,967 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:25,974 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:25,975 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2062|]. (let ((.cse0 (select |v_#memory_int_2062| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2062| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 38))) [2019-05-15 10:33:25,975 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:33:26,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:26,018 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:26,020 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:26,020 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:26,020 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:26,028 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:26,028 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2063|]. (let ((.cse0 (select |v_#memory_int_2063| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2063| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 39))) [2019-05-15 10:33:26,028 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:33:26,070 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:26,071 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:26,073 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:26,073 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:26,073 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:26,080 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:26,081 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2064|]. (let ((.cse0 (select |v_#memory_int_2064| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2064| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 40 .cse0))) [2019-05-15 10:33:26,081 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:33:26,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 16 treesize of output 11 [2019-05-15 10:33:26,124 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:26,126 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:26,126 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:26,126 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:26,134 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:26,134 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2065|]. (let ((.cse0 (select |v_#memory_int_2065| ULTIMATE.start_main_p1))) (and (= 41 .cse0) (= (store |v_#memory_int_2065| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:26,134 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:33:26,175 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:26,176 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:26,178 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:26,178 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:26,178 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:26,186 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:26,186 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2066|]. (let ((.cse0 (select |v_#memory_int_2066| ULTIMATE.start_main_p1))) (and (= 42 .cse0) (= (store |v_#memory_int_2066| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:26,186 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:33:26,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 16 treesize of output 11 [2019-05-15 10:33:26,230 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:26,232 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:26,232 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:26,232 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:26,240 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:26,240 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2067|]. (let ((.cse0 (select |v_#memory_int_2067| ULTIMATE.start_main_p1))) (and (= 43 .cse0) (= (store |v_#memory_int_2067| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:26,240 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:33:26,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 16 treesize of output 11 [2019-05-15 10:33:26,285 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:26,287 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:26,287 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:26,287 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:26,295 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:26,295 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2068|]. (let ((.cse0 (select |v_#memory_int_2068| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2068| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 44 .cse0))) [2019-05-15 10:33:26,295 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:33:26,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:26,341 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:26,343 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:26,343 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:26,344 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:26,351 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:26,351 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2069|]. (let ((.cse0 (select |v_#memory_int_2069| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2069| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 45 .cse0))) [2019-05-15 10:33:26,352 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:33:26,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 16 treesize of output 11 [2019-05-15 10:33:26,397 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:26,399 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:26,399 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:26,399 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:26,407 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:26,407 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2070|]. (let ((.cse0 (select |v_#memory_int_2070| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2070| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 46))) [2019-05-15 10:33:26,407 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:33:26,454 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:26,455 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:26,457 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:26,457 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:26,457 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:26,465 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:26,465 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2071|]. (let ((.cse0 (select |v_#memory_int_2071| ULTIMATE.start_main_p1))) (and (= .cse0 47) (= (store |v_#memory_int_2071| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:26,465 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:33:26,514 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:26,515 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:26,518 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:26,518 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:26,518 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:26,526 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:26,526 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2072|]. (let ((.cse0 (select |v_#memory_int_2072| ULTIMATE.start_main_p1))) (and (= .cse0 48) (= (store |v_#memory_int_2072| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:26,526 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:33:26,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:26,587 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:26,589 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:26,589 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:26,589 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:26,596 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:26,597 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2073|]. (let ((.cse0 (select |v_#memory_int_2073| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2073| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 49))) [2019-05-15 10:33:26,597 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:33:26,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:26,642 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:26,644 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:26,644 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:26,644 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:26,652 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:26,652 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2074|]. (let ((.cse0 (select |v_#memory_int_2074| ULTIMATE.start_main_p1))) (and (= .cse0 50) (= (store |v_#memory_int_2074| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:26,652 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:33:26,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:26,702 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:26,704 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:26,704 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:26,704 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:26,711 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:26,711 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2075|]. (let ((.cse0 (select |v_#memory_int_2075| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2075| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 51 .cse0))) [2019-05-15 10:33:26,712 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:33:26,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 16 treesize of output 11 [2019-05-15 10:33:26,762 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:26,764 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:26,764 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:26,764 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:26,770 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:26,771 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2076|]. (let ((.cse0 (select |v_#memory_int_2076| ULTIMATE.start_main_p1))) (and (= 52 .cse0) (= (store |v_#memory_int_2076| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:26,771 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:33:26,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 16 treesize of output 11 [2019-05-15 10:33:26,819 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:26,821 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:26,821 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:26,821 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:26,829 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:26,829 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2077|]. (let ((.cse0 (select |v_#memory_int_2077| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2077| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 53))) [2019-05-15 10:33:26,829 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:33:26,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 16 treesize of output 11 [2019-05-15 10:33:26,880 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:26,881 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:26,882 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:26,882 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:26,890 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:26,890 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2078|]. (let ((.cse0 (select |v_#memory_int_2078| ULTIMATE.start_main_p1))) (and (= .cse0 54) (= (store |v_#memory_int_2078| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:26,890 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:33:26,939 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:26,940 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:26,942 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:26,942 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:26,942 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:26,950 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:26,950 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2079|]. (let ((.cse0 (select |v_#memory_int_2079| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2079| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 55 .cse0))) [2019-05-15 10:33:26,950 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:33:27,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:27,002 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:27,004 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:27,004 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:27,004 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:27,011 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:27,012 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2080|]. (let ((.cse0 (select |v_#memory_int_2080| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2080| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 56))) [2019-05-15 10:33:27,012 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:33:27,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:27,063 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:27,065 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:27,065 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:27,065 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:27,072 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:27,072 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2081|]. (let ((.cse0 (select |v_#memory_int_2081| ULTIMATE.start_main_p1))) (and (= 57 .cse0) (= |#memory_int| (store |v_#memory_int_2081| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:27,072 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:33:27,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 16 treesize of output 11 [2019-05-15 10:33:27,127 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:27,128 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:27,129 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:27,129 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:27,136 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:27,136 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2082|]. (let ((.cse0 (select |v_#memory_int_2082| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2082| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 58 .cse0))) [2019-05-15 10:33:27,137 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:33:27,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:27,207 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:27,208 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:27,208 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:27,209 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:27,216 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:27,216 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2083|]. (let ((.cse0 (select |v_#memory_int_2083| ULTIMATE.start_main_p1))) (and (= .cse0 59) (= |#memory_int| (store |v_#memory_int_2083| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:27,217 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:33:27,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 16 treesize of output 11 [2019-05-15 10:33:27,274 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:27,276 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:27,276 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:27,277 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:27,285 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:27,285 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2084|]. (let ((.cse0 (select |v_#memory_int_2084| ULTIMATE.start_main_p1))) (and (= .cse0 60) (= (store |v_#memory_int_2084| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:27,285 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:33:27,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 16 treesize of output 11 [2019-05-15 10:33:27,344 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:27,346 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:27,346 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:27,346 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:27,353 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:27,353 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2085|]. (let ((.cse0 (select |v_#memory_int_2085| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2085| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 61 .cse0))) [2019-05-15 10:33:27,353 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:33:27,407 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:27,408 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:27,409 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:27,410 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:27,410 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:27,417 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:27,417 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2086|]. (let ((.cse0 (select |v_#memory_int_2086| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2086| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 62 .cse0))) [2019-05-15 10:33:27,417 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:33:27,468 INFO L273 TraceCheckUtils]: 0: Hoare triple {18032#true} havoc main_p1; {18032#true} is VALID [2019-05-15 10:33:27,469 INFO L273 TraceCheckUtils]: 1: Hoare triple {18032#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {18032#true} is VALID [2019-05-15 10:33:27,469 INFO L273 TraceCheckUtils]: 2: Hoare triple {18032#true} #memory_int := #memory_int[main_p1 := 0]; {18043#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:33:27,469 INFO L273 TraceCheckUtils]: 3: Hoare triple {18043#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18047#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:33:27,470 INFO L273 TraceCheckUtils]: 4: Hoare triple {18047#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18051#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:33:27,471 INFO L273 TraceCheckUtils]: 5: Hoare triple {18051#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18055#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:33:27,472 INFO L273 TraceCheckUtils]: 6: Hoare triple {18055#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18059#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:33:27,472 INFO L273 TraceCheckUtils]: 7: Hoare triple {18059#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18063#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:33:27,473 INFO L273 TraceCheckUtils]: 8: Hoare triple {18063#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18067#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:33:27,474 INFO L273 TraceCheckUtils]: 9: Hoare triple {18067#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18071#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:33:27,474 INFO L273 TraceCheckUtils]: 10: Hoare triple {18071#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18075#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:33:27,475 INFO L273 TraceCheckUtils]: 11: Hoare triple {18075#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18079#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:33:27,476 INFO L273 TraceCheckUtils]: 12: Hoare triple {18079#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18083#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:33:27,477 INFO L273 TraceCheckUtils]: 13: Hoare triple {18083#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18087#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:33:27,477 INFO L273 TraceCheckUtils]: 14: Hoare triple {18087#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18091#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:33:27,478 INFO L273 TraceCheckUtils]: 15: Hoare triple {18091#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18095#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:33:27,479 INFO L273 TraceCheckUtils]: 16: Hoare triple {18095#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18099#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:33:27,480 INFO L273 TraceCheckUtils]: 17: Hoare triple {18099#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18103#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:33:27,480 INFO L273 TraceCheckUtils]: 18: Hoare triple {18103#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18107#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:33:27,481 INFO L273 TraceCheckUtils]: 19: Hoare triple {18107#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18111#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:33:27,482 INFO L273 TraceCheckUtils]: 20: Hoare triple {18111#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18115#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:33:27,483 INFO L273 TraceCheckUtils]: 21: Hoare triple {18115#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18119#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:33:27,483 INFO L273 TraceCheckUtils]: 22: Hoare triple {18119#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18123#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:33:27,484 INFO L273 TraceCheckUtils]: 23: Hoare triple {18123#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18127#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:33:27,485 INFO L273 TraceCheckUtils]: 24: Hoare triple {18127#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18131#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:33:27,486 INFO L273 TraceCheckUtils]: 25: Hoare triple {18131#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18135#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:33:27,486 INFO L273 TraceCheckUtils]: 26: Hoare triple {18135#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18139#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:33:27,487 INFO L273 TraceCheckUtils]: 27: Hoare triple {18139#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18143#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:33:27,488 INFO L273 TraceCheckUtils]: 28: Hoare triple {18143#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18147#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:33:27,489 INFO L273 TraceCheckUtils]: 29: Hoare triple {18147#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18151#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:33:27,489 INFO L273 TraceCheckUtils]: 30: Hoare triple {18151#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18155#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:33:27,490 INFO L273 TraceCheckUtils]: 31: Hoare triple {18155#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18159#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:33:27,491 INFO L273 TraceCheckUtils]: 32: Hoare triple {18159#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18163#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:33:27,492 INFO L273 TraceCheckUtils]: 33: Hoare triple {18163#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18167#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:33:27,492 INFO L273 TraceCheckUtils]: 34: Hoare triple {18167#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18171#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:33:27,493 INFO L273 TraceCheckUtils]: 35: Hoare triple {18171#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18175#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:33:27,494 INFO L273 TraceCheckUtils]: 36: Hoare triple {18175#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18179#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:33:27,495 INFO L273 TraceCheckUtils]: 37: Hoare triple {18179#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18183#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:33:27,495 INFO L273 TraceCheckUtils]: 38: Hoare triple {18183#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18187#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:33:27,496 INFO L273 TraceCheckUtils]: 39: Hoare triple {18187#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18191#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:33:27,497 INFO L273 TraceCheckUtils]: 40: Hoare triple {18191#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18195#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:33:27,498 INFO L273 TraceCheckUtils]: 41: Hoare triple {18195#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18199#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:33:27,498 INFO L273 TraceCheckUtils]: 42: Hoare triple {18199#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18203#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:33:27,499 INFO L273 TraceCheckUtils]: 43: Hoare triple {18203#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18207#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:33:27,500 INFO L273 TraceCheckUtils]: 44: Hoare triple {18207#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18211#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:33:27,501 INFO L273 TraceCheckUtils]: 45: Hoare triple {18211#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18215#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:33:27,501 INFO L273 TraceCheckUtils]: 46: Hoare triple {18215#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18219#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:33:27,502 INFO L273 TraceCheckUtils]: 47: Hoare triple {18219#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18223#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:33:27,503 INFO L273 TraceCheckUtils]: 48: Hoare triple {18223#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18227#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:33:27,504 INFO L273 TraceCheckUtils]: 49: Hoare triple {18227#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18231#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:33:27,504 INFO L273 TraceCheckUtils]: 50: Hoare triple {18231#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18235#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:33:27,505 INFO L273 TraceCheckUtils]: 51: Hoare triple {18235#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18239#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:33:27,506 INFO L273 TraceCheckUtils]: 52: Hoare triple {18239#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18243#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:33:27,507 INFO L273 TraceCheckUtils]: 53: Hoare triple {18243#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18247#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:33:27,507 INFO L273 TraceCheckUtils]: 54: Hoare triple {18247#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18251#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:33:27,508 INFO L273 TraceCheckUtils]: 55: Hoare triple {18251#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18255#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:33:27,509 INFO L273 TraceCheckUtils]: 56: Hoare triple {18255#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18259#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:33:27,510 INFO L273 TraceCheckUtils]: 57: Hoare triple {18259#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18263#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:33:27,510 INFO L273 TraceCheckUtils]: 58: Hoare triple {18263#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18267#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:33:27,511 INFO L273 TraceCheckUtils]: 59: Hoare triple {18267#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18271#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:33:27,512 INFO L273 TraceCheckUtils]: 60: Hoare triple {18271#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18275#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:33:27,513 INFO L273 TraceCheckUtils]: 61: Hoare triple {18275#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18279#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:33:27,513 INFO L273 TraceCheckUtils]: 62: Hoare triple {18279#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18283#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:33:27,514 INFO L273 TraceCheckUtils]: 63: Hoare triple {18283#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18287#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:33:27,515 INFO L273 TraceCheckUtils]: 64: Hoare triple {18287#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18291#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:33:27,516 INFO L273 TraceCheckUtils]: 65: Hoare triple {18291#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18295#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:33:27,516 INFO L273 TraceCheckUtils]: 66: Hoare triple {18295#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} assume !(#memory_int[main_p1] >= 0); {18033#false} is VALID [2019-05-15 10:33:27,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:33:27,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:33:27,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-05-15 10:33:27,524 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 67 [2019-05-15 10:33:27,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:33:27,524 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 66 states. [2019-05-15 10:33:27,578 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:33:27,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-05-15 10:33:27,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-05-15 10:33:27,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-05-15 10:33:27,580 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 66 states. [2019-05-15 10:33:35,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:33:35,961 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-05-15 10:33:35,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-05-15 10:33:35,961 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 67 [2019-05-15 10:33:35,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:33:35,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-05-15 10:33:35,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-05-15 10:33:35,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-05-15 10:33:35,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-05-15 10:33:35,964 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 66 states and 70 transitions. [2019-05-15 10:33:36,018 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:36,020 INFO L225 Difference]: With dead ends: 69 [2019-05-15 10:33:36,020 INFO L226 Difference]: Without dead ends: 69 [2019-05-15 10:33:36,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-05-15 10:33:36,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-05-15 10:33:36,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-05-15 10:33:36,023 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:33:36,023 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 69 states. [2019-05-15 10:33:36,023 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 69 states. [2019-05-15 10:33:36,023 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 69 states. [2019-05-15 10:33:36,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:33:36,024 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-05-15 10:33:36,024 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-05-15 10:33:36,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:33:36,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:33:36,024 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 69 states. [2019-05-15 10:33:36,025 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 69 states. [2019-05-15 10:33:36,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:33:36,025 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-05-15 10:33:36,026 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-05-15 10:33:36,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:33:36,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:33:36,026 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:33:36,026 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:33:36,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-05-15 10:33:36,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-05-15 10:33:36,027 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-05-15 10:33:36,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:33:36,027 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-05-15 10:33:36,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-05-15 10:33:36,028 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-05-15 10:33:36,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-05-15 10:33:36,028 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:33:36,028 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1, 1] [2019-05-15 10:33:36,028 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:33:36,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:33:36,029 INFO L82 PathProgramCache]: Analyzing trace with hash -371063928, now seen corresponding path program 64 times [2019-05-15 10:33:36,029 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:33:36,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:33:36,055 WARN L254 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 66 conjunts are in the unsatisfiable core [2019-05-15 10:33:36,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:33:36,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:33:36,090 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:36,090 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,092 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:36,092 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,093 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:33:36,094 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:36,094 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2087|]. (= (store |v_#memory_int_2087| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:33:36,094 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:33:36,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 16 treesize of output 11 [2019-05-15 10:33:36,104 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,106 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:36,106 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,106 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:36,114 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:36,114 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2088|]. (let ((.cse0 (select |v_#memory_int_2088| ULTIMATE.start_main_p1))) (and (= 0 .cse0) (= (store |v_#memory_int_2088| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:36,114 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:33:36,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:36,123 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,125 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:36,125 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,125 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:36,132 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:36,132 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2089|]. (let ((.cse0 (select |v_#memory_int_2089| ULTIMATE.start_main_p1))) (and (= .cse0 1) (= (store |v_#memory_int_2089| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:36,133 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:33:36,142 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:36,143 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,145 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:36,145 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,145 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:36,153 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:36,153 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2090|]. (let ((.cse0 (select |v_#memory_int_2090| ULTIMATE.start_main_p1))) (and (= .cse0 2) (= (store |v_#memory_int_2090| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:36,153 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:33:36,164 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:36,165 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,167 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:36,167 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,167 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:36,174 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:36,175 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2091|]. (let ((.cse0 (select |v_#memory_int_2091| ULTIMATE.start_main_p1))) (and (= 3 .cse0) (= |#memory_int| (store |v_#memory_int_2091| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:36,175 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:33:36,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:36,186 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,188 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:36,188 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,188 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:36,195 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:36,195 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2092|]. (let ((.cse0 (select |v_#memory_int_2092| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2092| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 4 .cse0))) [2019-05-15 10:33:36,196 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:33:36,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:36,208 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,210 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:36,210 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,211 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:36,218 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:36,218 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2093|]. (let ((.cse0 (select |v_#memory_int_2093| ULTIMATE.start_main_p1))) (and (= .cse0 5) (= (store |v_#memory_int_2093| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:36,218 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:33:36,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 16 treesize of output 11 [2019-05-15 10:33:36,231 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,233 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:36,233 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,233 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:36,240 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:36,241 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2094|]. (let ((.cse0 (select |v_#memory_int_2094| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2094| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 6 .cse0))) [2019-05-15 10:33:36,241 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:33:36,255 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:36,256 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,258 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:36,258 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,258 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:36,265 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:36,266 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2095|]. (let ((.cse0 (select |v_#memory_int_2095| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2095| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 7 .cse0))) [2019-05-15 10:33:36,266 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:33:36,281 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:36,282 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,284 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:36,284 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,284 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:36,292 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:36,292 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2096|]. (let ((.cse0 (select |v_#memory_int_2096| ULTIMATE.start_main_p1))) (and (= 8 .cse0) (= |#memory_int| (store |v_#memory_int_2096| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:36,292 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:33:36,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:36,307 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,309 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:36,309 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,310 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:36,315 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:36,315 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2097|]. (let ((.cse0 (select |v_#memory_int_2097| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2097| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 9 .cse0))) [2019-05-15 10:33:36,316 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:33:36,333 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:36,334 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,336 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:36,336 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,336 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:36,344 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:36,344 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2098|]. (let ((.cse0 (select |v_#memory_int_2098| ULTIMATE.start_main_p1))) (and (= 10 .cse0) (= (store |v_#memory_int_2098| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:36,344 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:33:36,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:36,361 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,363 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:36,363 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,364 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:36,371 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:36,371 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2099|]. (let ((.cse0 (select |v_#memory_int_2099| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2099| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 11))) [2019-05-15 10:33:36,371 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:33:36,390 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:36,391 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,393 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:36,393 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,393 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:36,401 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:36,401 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2100|]. (let ((.cse0 (select |v_#memory_int_2100| ULTIMATE.start_main_p1))) (and (= 12 .cse0) (= (store |v_#memory_int_2100| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:36,401 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:33:36,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:36,422 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,424 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:36,424 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,424 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:36,431 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:36,431 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2101|]. (let ((.cse0 (select |v_#memory_int_2101| ULTIMATE.start_main_p1))) (and (= 13 .cse0) (= (store |v_#memory_int_2101| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:36,431 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:33:36,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 16 treesize of output 11 [2019-05-15 10:33:36,450 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,452 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:36,452 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,452 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:36,458 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:36,458 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2102|]. (let ((.cse0 (select |v_#memory_int_2102| ULTIMATE.start_main_p1))) (and (= 14 .cse0) (= (store |v_#memory_int_2102| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:36,458 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:33:36,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:36,478 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,480 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:36,481 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,481 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:36,487 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:36,488 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2103|]. (let ((.cse0 (select |v_#memory_int_2103| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2103| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 15 .cse0))) [2019-05-15 10:33:36,488 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:33:36,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:36,509 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,511 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:36,511 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,511 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:36,519 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:36,519 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2104|]. (let ((.cse0 (select |v_#memory_int_2104| ULTIMATE.start_main_p1))) (and (= 16 .cse0) (= |#memory_int| (store |v_#memory_int_2104| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:36,519 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:33:36,541 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:36,541 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,543 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:36,544 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,544 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:36,551 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:36,551 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2105|]. (let ((.cse0 (select |v_#memory_int_2105| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2105| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 17 .cse0))) [2019-05-15 10:33:36,551 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:33:36,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:36,579 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,581 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:36,582 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,582 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:36,589 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:36,589 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2106|]. (let ((.cse0 (select |v_#memory_int_2106| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2106| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 18 .cse0))) [2019-05-15 10:33:36,589 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:33:36,626 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:36,626 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,628 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:36,629 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,629 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:36,636 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:36,636 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2107|]. (let ((.cse0 (select |v_#memory_int_2107| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2107| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 19 .cse0))) [2019-05-15 10:33:36,636 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:33:36,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 16 treesize of output 11 [2019-05-15 10:33:36,660 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,662 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:36,662 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,662 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:36,668 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:36,668 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2108|]. (let ((.cse0 (select |v_#memory_int_2108| ULTIMATE.start_main_p1))) (and (= 20 .cse0) (= |#memory_int| (store |v_#memory_int_2108| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:36,668 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:33:36,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 16 treesize of output 11 [2019-05-15 10:33:36,693 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,695 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:36,696 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,696 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:36,705 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:36,705 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2109|]. (let ((.cse0 (select |v_#memory_int_2109| ULTIMATE.start_main_p1))) (and (= 21 .cse0) (= (store |v_#memory_int_2109| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:36,705 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:33:36,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:36,730 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,732 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:36,732 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,733 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:36,740 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:36,740 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2110|]. (let ((.cse0 (select |v_#memory_int_2110| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2110| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 22))) [2019-05-15 10:33:36,740 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:33:36,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:36,768 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,770 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:36,770 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,770 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:36,777 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:36,777 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2111|]. (let ((.cse0 (select |v_#memory_int_2111| ULTIMATE.start_main_p1))) (and (= 23 .cse0) (= (store |v_#memory_int_2111| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:36,777 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:33:36,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 16 treesize of output 11 [2019-05-15 10:33:36,805 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,807 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:36,807 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,807 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:36,814 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:36,815 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2112|]. (let ((.cse0 (select |v_#memory_int_2112| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2112| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 24))) [2019-05-15 10:33:36,815 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:33:36,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 16 treesize of output 11 [2019-05-15 10:33:36,843 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,845 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:36,845 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,845 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:36,852 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:36,852 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2113|]. (let ((.cse0 (select |v_#memory_int_2113| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2113| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 25 .cse0))) [2019-05-15 10:33:36,852 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:33:36,880 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:36,881 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,883 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:36,883 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,884 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:36,891 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:36,891 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2114|]. (let ((.cse0 (select |v_#memory_int_2114| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2114| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 26 .cse0))) [2019-05-15 10:33:36,891 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:33:36,922 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:36,923 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,925 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:36,925 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,925 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:36,933 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:36,933 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2115|]. (let ((.cse0 (select |v_#memory_int_2115| ULTIMATE.start_main_p1))) (and (= 27 .cse0) (= (store |v_#memory_int_2115| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:36,933 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:33:36,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 16 treesize of output 11 [2019-05-15 10:33:36,963 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,965 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:36,965 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:36,965 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:36,972 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:36,972 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2116|]. (let ((.cse0 (select |v_#memory_int_2116| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2116| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 28))) [2019-05-15 10:33:36,973 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:33:37,005 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:37,006 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:37,008 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:37,008 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:37,008 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:37,015 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:37,015 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2117|]. (let ((.cse0 (select |v_#memory_int_2117| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2117| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 29 .cse0))) [2019-05-15 10:33:37,015 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:33:37,063 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:37,064 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:37,066 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:37,066 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:37,066 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:37,073 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:37,074 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2118|]. (let ((.cse0 (select |v_#memory_int_2118| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2118| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 30))) [2019-05-15 10:33:37,074 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:33:37,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 16 treesize of output 11 [2019-05-15 10:33:37,110 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:37,112 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:37,112 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:37,112 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:37,121 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:37,121 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2119|]. (let ((.cse0 (select |v_#memory_int_2119| ULTIMATE.start_main_p1))) (and (= 31 .cse0) (= (store |v_#memory_int_2119| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:37,121 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:33:37,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 16 treesize of output 11 [2019-05-15 10:33:37,154 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:37,156 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:37,157 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:37,157 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:37,164 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:37,164 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2120|]. (let ((.cse0 (select |v_#memory_int_2120| ULTIMATE.start_main_p1))) (and (= .cse0 32) (= (store |v_#memory_int_2120| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:37,165 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:33:37,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:37,201 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:37,203 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:37,203 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:37,203 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:37,210 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:37,210 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2121|]. (let ((.cse0 (select |v_#memory_int_2121| ULTIMATE.start_main_p1))) (and (= 33 .cse0) (= (store |v_#memory_int_2121| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:37,210 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:33:37,246 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:37,247 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:37,249 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:37,249 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:37,249 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:37,256 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:37,256 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2122|]. (let ((.cse0 (select |v_#memory_int_2122| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2122| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 34 .cse0))) [2019-05-15 10:33:37,257 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:33:37,292 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:37,293 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:37,295 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:37,295 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:37,295 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:37,302 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:37,303 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2123|]. (let ((.cse0 (select |v_#memory_int_2123| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2123| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 35 .cse0))) [2019-05-15 10:33:37,303 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:33:37,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:37,340 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:37,342 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:37,343 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:37,343 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:37,350 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:37,350 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2124|]. (let ((.cse0 (select |v_#memory_int_2124| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2124| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 36))) [2019-05-15 10:33:37,351 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:33:37,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 16 treesize of output 11 [2019-05-15 10:33:37,388 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:37,389 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:37,390 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:37,390 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:37,398 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:37,398 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2125|]. (let ((.cse0 (select |v_#memory_int_2125| ULTIMATE.start_main_p1))) (and (= 37 .cse0) (= (store |v_#memory_int_2125| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:37,398 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:33:37,436 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:37,437 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:37,439 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:37,439 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:37,439 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:37,447 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:37,448 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2126|]. (let ((.cse0 (select |v_#memory_int_2126| ULTIMATE.start_main_p1))) (and (= .cse0 38) (= (store |v_#memory_int_2126| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:37,448 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:33:37,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 16 treesize of output 11 [2019-05-15 10:33:37,487 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:37,489 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:37,489 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:37,489 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:37,497 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:37,497 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2127|]. (let ((.cse0 (select |v_#memory_int_2127| ULTIMATE.start_main_p1))) (and (= 39 .cse0) (= |#memory_int| (store |v_#memory_int_2127| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:37,497 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:33:37,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:37,538 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:37,540 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:37,540 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:37,540 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:37,547 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:37,548 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2128|]. (let ((.cse0 (select |v_#memory_int_2128| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2128| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 40 .cse0))) [2019-05-15 10:33:37,548 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:33:37,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 16 treesize of output 11 [2019-05-15 10:33:37,588 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:37,590 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:37,590 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:37,591 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:37,597 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:37,598 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2129|]. (let ((.cse0 (select |v_#memory_int_2129| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2129| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 41))) [2019-05-15 10:33:37,598 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:33:37,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 16 treesize of output 11 [2019-05-15 10:33:37,641 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:37,643 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:37,643 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:37,644 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:37,650 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:37,651 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2130|]. (let ((.cse0 (select |v_#memory_int_2130| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2130| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 42))) [2019-05-15 10:33:37,651 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:33:37,694 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:37,695 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:37,697 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:37,697 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:37,697 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:37,704 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:37,704 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2131|]. (let ((.cse0 (select |v_#memory_int_2131| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2131| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 43 .cse0))) [2019-05-15 10:33:37,704 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:33:37,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 16 treesize of output 11 [2019-05-15 10:33:37,750 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:37,752 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:37,752 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:37,752 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:37,759 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:37,760 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2132|]. (let ((.cse0 (select |v_#memory_int_2132| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2132| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 44 .cse0))) [2019-05-15 10:33:37,760 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:33:37,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 16 treesize of output 11 [2019-05-15 10:33:37,803 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:37,805 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:37,806 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:37,806 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:37,812 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:37,813 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2133|]. (let ((.cse0 (select |v_#memory_int_2133| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2133| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 45 .cse0))) [2019-05-15 10:33:37,813 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:33:37,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 16 treesize of output 11 [2019-05-15 10:33:37,860 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:37,862 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:37,863 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:37,863 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:37,870 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:37,870 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2134|]. (let ((.cse0 (select |v_#memory_int_2134| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2134| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 46 .cse0))) [2019-05-15 10:33:37,870 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:33:37,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:37,918 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:37,920 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:37,920 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:37,920 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:37,928 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:37,928 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2135|]. (let ((.cse0 (select |v_#memory_int_2135| ULTIMATE.start_main_p1))) (and (= 47 .cse0) (= (store |v_#memory_int_2135| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:37,928 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:33:37,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:37,976 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:37,978 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:37,979 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:37,979 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:37,986 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:37,986 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2136|]. (let ((.cse0 (select |v_#memory_int_2136| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2136| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 48 .cse0))) [2019-05-15 10:33:37,987 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:33:38,035 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:38,036 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:38,038 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:38,039 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,039 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:38,046 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:38,046 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2137|]. (let ((.cse0 (select |v_#memory_int_2137| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2137| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 49))) [2019-05-15 10:33:38,046 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:33:38,092 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:38,093 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:38,095 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:38,095 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,095 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:38,103 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:38,103 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2138|]. (let ((.cse0 (select |v_#memory_int_2138| ULTIMATE.start_main_p1))) (and (= 50 .cse0) (= |#memory_int| (store |v_#memory_int_2138| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:38,103 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:33:38,152 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:38,153 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:38,155 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:38,155 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,155 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:38,163 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:38,163 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2139|]. (let ((.cse0 (select |v_#memory_int_2139| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2139| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 51 .cse0))) [2019-05-15 10:33:38,163 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:33:38,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 16 treesize of output 11 [2019-05-15 10:33:38,237 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:38,251 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:38,251 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,252 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:38,257 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:38,257 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2140|]. (let ((.cse0 (select |v_#memory_int_2140| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2140| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 52 .cse0))) [2019-05-15 10:33:38,257 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:33:38,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:38,307 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:38,309 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:38,309 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,309 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:38,316 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:38,316 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2141|]. (let ((.cse0 (select |v_#memory_int_2141| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2141| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 53 .cse0))) [2019-05-15 10:33:38,316 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:33:38,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 16 treesize of output 11 [2019-05-15 10:33:38,371 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:38,373 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:38,374 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,374 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:38,381 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:38,381 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2142|]. (let ((.cse0 (select |v_#memory_int_2142| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2142| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 54 .cse0))) [2019-05-15 10:33:38,381 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:33:38,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 16 treesize of output 11 [2019-05-15 10:33:38,435 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:38,437 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:38,437 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,438 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:38,445 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:38,445 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2143|]. (let ((.cse0 (select |v_#memory_int_2143| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2143| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 55 .cse0))) [2019-05-15 10:33:38,445 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:33:38,500 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:38,501 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:38,503 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:38,503 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,503 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:38,511 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:38,511 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2144|]. (let ((.cse0 (select |v_#memory_int_2144| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2144| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 56 .cse0))) [2019-05-15 10:33:38,511 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:33:38,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 16 treesize of output 11 [2019-05-15 10:33:38,598 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:38,600 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:38,600 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,601 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:38,608 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:38,608 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2145|]. (let ((.cse0 (select |v_#memory_int_2145| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2145| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 57 .cse0))) [2019-05-15 10:33:38,608 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:33:38,662 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:38,663 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:38,665 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:38,666 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,666 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:38,674 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:38,674 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2146|]. (let ((.cse0 (select |v_#memory_int_2146| ULTIMATE.start_main_p1))) (and (= 58 .cse0) (= (store |v_#memory_int_2146| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:38,675 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:33:38,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:38,731 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:38,733 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:38,733 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,733 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:38,740 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:38,740 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2147|]. (let ((.cse0 (select |v_#memory_int_2147| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2147| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 59 .cse0))) [2019-05-15 10:33:38,740 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:33:38,799 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:38,800 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:38,802 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:38,802 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,802 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:38,810 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:38,810 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2148|]. (let ((.cse0 (select |v_#memory_int_2148| ULTIMATE.start_main_p1))) (and (= 60 .cse0) (= (store |v_#memory_int_2148| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:38,810 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:33:38,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 16 treesize of output 11 [2019-05-15 10:33:38,871 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:38,873 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:38,873 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,874 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:38,881 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:38,881 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2149|]. (let ((.cse0 (select |v_#memory_int_2149| ULTIMATE.start_main_p1))) (and (= .cse0 61) (= |#memory_int| (store |v_#memory_int_2149| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:38,881 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:33: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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:38,939 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:38,941 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:38,941 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,941 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:38,949 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:38,949 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2150|]. (let ((.cse0 (select |v_#memory_int_2150| ULTIMATE.start_main_p1))) (and (= .cse0 62) (= (store |v_#memory_int_2150| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:38,949 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:33:39,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 16 treesize of output 11 [2019-05-15 10:33:39,009 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:39,011 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:39,012 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:39,012 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:39,020 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:39,020 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2151|]. (let ((.cse0 (select |v_#memory_int_2151| ULTIMATE.start_main_p1))) (and (= 63 .cse0) (= (store |v_#memory_int_2151| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:39,020 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 64) [2019-05-15 10:33:39,074 INFO L273 TraceCheckUtils]: 0: Hoare triple {18574#true} havoc main_p1; {18574#true} is VALID [2019-05-15 10:33:39,075 INFO L273 TraceCheckUtils]: 1: Hoare triple {18574#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {18574#true} is VALID [2019-05-15 10:33:39,075 INFO L273 TraceCheckUtils]: 2: Hoare triple {18574#true} #memory_int := #memory_int[main_p1 := 0]; {18585#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:33:39,076 INFO L273 TraceCheckUtils]: 3: Hoare triple {18585#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18589#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:33:39,077 INFO L273 TraceCheckUtils]: 4: Hoare triple {18589#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18593#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:33:39,078 INFO L273 TraceCheckUtils]: 5: Hoare triple {18593#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18597#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:33:39,078 INFO L273 TraceCheckUtils]: 6: Hoare triple {18597#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18601#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:33:39,079 INFO L273 TraceCheckUtils]: 7: Hoare triple {18601#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18605#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:33:39,080 INFO L273 TraceCheckUtils]: 8: Hoare triple {18605#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18609#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:33:39,081 INFO L273 TraceCheckUtils]: 9: Hoare triple {18609#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18613#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:33:39,082 INFO L273 TraceCheckUtils]: 10: Hoare triple {18613#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18617#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:33:39,082 INFO L273 TraceCheckUtils]: 11: Hoare triple {18617#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18621#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:33:39,083 INFO L273 TraceCheckUtils]: 12: Hoare triple {18621#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18625#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:33:39,084 INFO L273 TraceCheckUtils]: 13: Hoare triple {18625#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18629#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:33:39,085 INFO L273 TraceCheckUtils]: 14: Hoare triple {18629#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18633#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:33:39,085 INFO L273 TraceCheckUtils]: 15: Hoare triple {18633#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18637#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:33:39,086 INFO L273 TraceCheckUtils]: 16: Hoare triple {18637#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18641#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:33:39,087 INFO L273 TraceCheckUtils]: 17: Hoare triple {18641#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18645#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:33:39,087 INFO L273 TraceCheckUtils]: 18: Hoare triple {18645#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18649#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:33:39,088 INFO L273 TraceCheckUtils]: 19: Hoare triple {18649#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18653#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:33:39,089 INFO L273 TraceCheckUtils]: 20: Hoare triple {18653#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18657#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:33:39,090 INFO L273 TraceCheckUtils]: 21: Hoare triple {18657#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18661#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:33:39,091 INFO L273 TraceCheckUtils]: 22: Hoare triple {18661#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18665#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:33:39,091 INFO L273 TraceCheckUtils]: 23: Hoare triple {18665#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18669#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:33:39,092 INFO L273 TraceCheckUtils]: 24: Hoare triple {18669#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18673#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:33:39,093 INFO L273 TraceCheckUtils]: 25: Hoare triple {18673#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18677#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:33:39,094 INFO L273 TraceCheckUtils]: 26: Hoare triple {18677#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18681#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:33:39,094 INFO L273 TraceCheckUtils]: 27: Hoare triple {18681#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18685#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:33:39,095 INFO L273 TraceCheckUtils]: 28: Hoare triple {18685#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18689#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:33:39,096 INFO L273 TraceCheckUtils]: 29: Hoare triple {18689#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18693#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:33:39,097 INFO L273 TraceCheckUtils]: 30: Hoare triple {18693#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18697#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:33:39,097 INFO L273 TraceCheckUtils]: 31: Hoare triple {18697#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18701#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:33:39,098 INFO L273 TraceCheckUtils]: 32: Hoare triple {18701#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18705#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:33:39,099 INFO L273 TraceCheckUtils]: 33: Hoare triple {18705#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18709#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:33:39,100 INFO L273 TraceCheckUtils]: 34: Hoare triple {18709#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18713#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:33:39,100 INFO L273 TraceCheckUtils]: 35: Hoare triple {18713#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18717#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:33:39,101 INFO L273 TraceCheckUtils]: 36: Hoare triple {18717#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18721#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:33:39,102 INFO L273 TraceCheckUtils]: 37: Hoare triple {18721#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18725#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:33:39,103 INFO L273 TraceCheckUtils]: 38: Hoare triple {18725#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18729#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:33:39,103 INFO L273 TraceCheckUtils]: 39: Hoare triple {18729#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18733#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:33:39,104 INFO L273 TraceCheckUtils]: 40: Hoare triple {18733#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18737#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:33:39,106 INFO L273 TraceCheckUtils]: 41: Hoare triple {18737#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18741#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:33:39,107 INFO L273 TraceCheckUtils]: 42: Hoare triple {18741#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18745#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:33:39,107 INFO L273 TraceCheckUtils]: 43: Hoare triple {18745#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18749#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:33:39,108 INFO L273 TraceCheckUtils]: 44: Hoare triple {18749#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18753#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:33:39,108 INFO L273 TraceCheckUtils]: 45: Hoare triple {18753#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18757#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:33:39,109 INFO L273 TraceCheckUtils]: 46: Hoare triple {18757#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18761#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:33:39,109 INFO L273 TraceCheckUtils]: 47: Hoare triple {18761#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18765#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:33:39,110 INFO L273 TraceCheckUtils]: 48: Hoare triple {18765#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18769#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:33:39,113 INFO L273 TraceCheckUtils]: 49: Hoare triple {18769#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18773#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:33:39,114 INFO L273 TraceCheckUtils]: 50: Hoare triple {18773#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18777#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:33:39,114 INFO L273 TraceCheckUtils]: 51: Hoare triple {18777#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18781#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:33:39,115 INFO L273 TraceCheckUtils]: 52: Hoare triple {18781#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18785#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:33:39,115 INFO L273 TraceCheckUtils]: 53: Hoare triple {18785#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18789#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:33:39,116 INFO L273 TraceCheckUtils]: 54: Hoare triple {18789#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18793#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:33:39,116 INFO L273 TraceCheckUtils]: 55: Hoare triple {18793#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18797#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:33:39,117 INFO L273 TraceCheckUtils]: 56: Hoare triple {18797#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18801#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:33:39,118 INFO L273 TraceCheckUtils]: 57: Hoare triple {18801#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18805#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:33:39,118 INFO L273 TraceCheckUtils]: 58: Hoare triple {18805#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18809#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:33:39,119 INFO L273 TraceCheckUtils]: 59: Hoare triple {18809#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18813#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:33:39,120 INFO L273 TraceCheckUtils]: 60: Hoare triple {18813#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18817#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:33:39,121 INFO L273 TraceCheckUtils]: 61: Hoare triple {18817#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18821#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:33:39,121 INFO L273 TraceCheckUtils]: 62: Hoare triple {18821#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18825#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:33:39,122 INFO L273 TraceCheckUtils]: 63: Hoare triple {18825#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18829#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:33:39,123 INFO L273 TraceCheckUtils]: 64: Hoare triple {18829#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18833#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:33:39,124 INFO L273 TraceCheckUtils]: 65: Hoare triple {18833#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18837#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:33:39,124 INFO L273 TraceCheckUtils]: 66: Hoare triple {18837#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18841#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} is VALID [2019-05-15 10:33:39,125 INFO L273 TraceCheckUtils]: 67: Hoare triple {18841#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} assume !(#memory_int[main_p1] >= 0); {18575#false} is VALID [2019-05-15 10:33:39,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:33:39,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:33:39,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-05-15 10:33:39,133 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 68 [2019-05-15 10:33:39,133 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:33:39,133 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 67 states. [2019-05-15 10:33:39,189 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:39,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-05-15 10:33:39,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-05-15 10:33:39,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-05-15 10:33:39,190 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 67 states. [2019-05-15 10:33:47,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:33:47,831 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-05-15 10:33:47,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-05-15 10:33:47,832 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 68 [2019-05-15 10:33:47,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:33:47,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-05-15 10:33:47,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-05-15 10:33:47,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-05-15 10:33:47,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-05-15 10:33:47,833 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 67 states and 71 transitions. [2019-05-15 10:33:47,888 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:33:47,889 INFO L225 Difference]: With dead ends: 70 [2019-05-15 10:33:47,889 INFO L226 Difference]: Without dead ends: 70 [2019-05-15 10:33:47,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-05-15 10:33:47,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-05-15 10:33:47,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-05-15 10:33:47,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:33:47,891 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 70 states. [2019-05-15 10:33:47,891 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2019-05-15 10:33:47,892 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2019-05-15 10:33:47,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:33:47,893 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-05-15 10:33:47,893 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-05-15 10:33:47,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:33:47,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:33:47,893 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2019-05-15 10:33:47,893 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2019-05-15 10:33:47,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:33:47,894 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-05-15 10:33:47,894 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-05-15 10:33:47,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:33:47,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:33:47,895 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:33:47,895 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:33:47,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-05-15 10:33:47,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-05-15 10:33:47,896 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-05-15 10:33:47,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:33:47,896 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-05-15 10:33:47,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-05-15 10:33:47,896 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-05-15 10:33:47,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-05-15 10:33:47,896 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:33:47,896 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1, 1] [2019-05-15 10:33:47,897 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:33:47,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:33:47,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1381920066, now seen corresponding path program 65 times [2019-05-15 10:33:47,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:33:47,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:33:47,933 WARN L254 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 67 conjunts are in the unsatisfiable core [2019-05-15 10:33:47,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:33:47,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:33:47,965 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:47,965 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:47,967 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:47,967 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:47,968 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:33:47,969 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:47,969 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2152|]. (= |#memory_int| (store |v_#memory_int_2152| ULTIMATE.start_main_p1 0)) [2019-05-15 10:33:47,969 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:33:47,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 16 treesize of output 11 [2019-05-15 10:33:47,990 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:47,992 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:47,992 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:47,992 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:48,002 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:48,003 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2153|]. (let ((.cse0 (select |v_#memory_int_2153| ULTIMATE.start_main_p1))) (and (= 0 .cse0) (= (store |v_#memory_int_2153| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:48,003 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:33:48,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:48,012 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,014 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:48,014 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,014 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:48,022 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:48,022 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2154|]. (let ((.cse0 (select |v_#memory_int_2154| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2154| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 1 .cse0))) [2019-05-15 10:33:48,022 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:33:48,033 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:48,034 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,036 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:48,036 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,036 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:48,042 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:48,042 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2155|]. (let ((.cse0 (select |v_#memory_int_2155| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2155| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 2))) [2019-05-15 10:33:48,043 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:33:48,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:48,055 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,057 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:48,057 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,057 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:48,065 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:48,065 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2156|]. (let ((.cse0 (select |v_#memory_int_2156| ULTIMATE.start_main_p1))) (and (= .cse0 3) (= |#memory_int| (store |v_#memory_int_2156| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:48,065 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:33: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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:48,078 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,080 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:48,080 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,081 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:48,087 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:48,088 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2157|]. (let ((.cse0 (select |v_#memory_int_2157| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2157| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 4))) [2019-05-15 10:33:48,088 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:33:48,100 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:48,101 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,103 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:48,103 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,103 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:48,111 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:48,112 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2158|]. (let ((.cse0 (select |v_#memory_int_2158| ULTIMATE.start_main_p1))) (and (= .cse0 5) (= (store |v_#memory_int_2158| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:48,112 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:33:48,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 16 treesize of output 11 [2019-05-15 10:33:48,126 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,128 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:48,129 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,129 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:48,136 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:48,136 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2159|]. (let ((.cse0 (select |v_#memory_int_2159| ULTIMATE.start_main_p1))) (and (= .cse0 6) (= |#memory_int| (store |v_#memory_int_2159| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:48,136 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:33:48,152 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:48,153 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,155 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:48,155 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,155 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:48,163 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:48,163 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2160|]. (let ((.cse0 (select |v_#memory_int_2160| ULTIMATE.start_main_p1))) (and (= 7 .cse0) (= (store |v_#memory_int_2160| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:48,163 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:33:48,177 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:48,178 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,179 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:48,180 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,180 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:48,188 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:48,188 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2161|]. (let ((.cse0 (select |v_#memory_int_2161| ULTIMATE.start_main_p1))) (and (= 8 .cse0) (= (store |v_#memory_int_2161| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:48,188 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:33:48,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 16 treesize of output 11 [2019-05-15 10:33:48,205 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,207 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:48,207 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,207 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:48,215 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:48,215 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2162|]. (let ((.cse0 (select |v_#memory_int_2162| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2162| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 9 .cse0))) [2019-05-15 10:33:48,215 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:33:48,231 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:48,232 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,234 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:48,234 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,235 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:48,242 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:48,242 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2163|]. (let ((.cse0 (select |v_#memory_int_2163| ULTIMATE.start_main_p1))) (and (= .cse0 10) (= (store |v_#memory_int_2163| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:48,242 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:33:48,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 16 treesize of output 11 [2019-05-15 10:33:48,260 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,262 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:48,262 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,262 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:48,269 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:48,269 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2164|]. (let ((.cse0 (select |v_#memory_int_2164| ULTIMATE.start_main_p1))) (and (= 11 .cse0) (= (store |v_#memory_int_2164| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:48,269 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:33:48,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 16 treesize of output 11 [2019-05-15 10:33:48,287 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,289 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:48,290 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,290 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:48,298 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:48,298 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2165|]. (let ((.cse0 (select |v_#memory_int_2165| ULTIMATE.start_main_p1))) (and (= .cse0 12) (= |#memory_int| (store |v_#memory_int_2165| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:48,298 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:33:48,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 16 treesize of output 11 [2019-05-15 10:33:48,317 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,319 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:48,319 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,320 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:48,327 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:48,327 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2166|]. (let ((.cse0 (select |v_#memory_int_2166| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2166| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 13 .cse0))) [2019-05-15 10:33:48,327 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:33:48,345 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:48,346 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,348 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:48,348 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,348 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:48,355 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:48,355 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2167|]. (let ((.cse0 (select |v_#memory_int_2167| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2167| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 14))) [2019-05-15 10:33:48,355 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:33:48,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:48,377 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,379 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:48,379 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,379 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:48,385 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:48,386 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2168|]. (let ((.cse0 (select |v_#memory_int_2168| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2168| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 15))) [2019-05-15 10:33:48,386 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:33:48,407 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:48,408 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,410 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:48,410 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,410 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:48,418 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:48,418 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2169|]. (let ((.cse0 (select |v_#memory_int_2169| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2169| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 16))) [2019-05-15 10:33:48,418 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:33:48,440 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:48,441 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,443 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:48,443 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,443 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:48,450 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:48,451 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2170|]. (let ((.cse0 (select |v_#memory_int_2170| ULTIMATE.start_main_p1))) (and (= 17 .cse0) (= (store |v_#memory_int_2170| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:48,451 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:33:48,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 16 treesize of output 11 [2019-05-15 10:33:48,473 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,475 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:48,476 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,476 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:48,483 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:48,483 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2171|]. (let ((.cse0 (select |v_#memory_int_2171| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2171| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 18 .cse0))) [2019-05-15 10:33:48,483 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:33:48,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 16 treesize of output 11 [2019-05-15 10:33:48,507 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,509 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:48,509 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,510 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:48,517 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:48,517 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2172|]. (let ((.cse0 (select |v_#memory_int_2172| ULTIMATE.start_main_p1))) (and (= 19 .cse0) (= |#memory_int| (store |v_#memory_int_2172| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:48,517 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:33:48,541 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:48,542 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,544 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:48,544 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,544 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:48,551 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:48,551 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2173|]. (let ((.cse0 (select |v_#memory_int_2173| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2173| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 20 .cse0))) [2019-05-15 10:33:48,551 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:33:48,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 16 treesize of output 11 [2019-05-15 10:33:48,577 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,578 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:48,579 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,579 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:48,586 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:48,586 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2174|]. (let ((.cse0 (select |v_#memory_int_2174| ULTIMATE.start_main_p1))) (and (= .cse0 21) (= (store |v_#memory_int_2174| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:48,586 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:33:48,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 16 treesize of output 11 [2019-05-15 10:33:48,614 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,616 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:48,616 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,616 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:48,622 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:48,623 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2175|]. (let ((.cse0 (select |v_#memory_int_2175| ULTIMATE.start_main_p1))) (and (= 22 .cse0) (= |#memory_int| (store |v_#memory_int_2175| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:48,623 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:33:48,647 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:48,648 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,650 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:48,650 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,651 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:48,657 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:48,657 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2176|]. (let ((.cse0 (select |v_#memory_int_2176| ULTIMATE.start_main_p1))) (and (= 23 .cse0) (= |#memory_int| (store |v_#memory_int_2176| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:48,657 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:33:48,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 16 treesize of output 11 [2019-05-15 10:33:48,684 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,686 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:48,686 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,687 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:48,694 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:48,694 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2177|]. (let ((.cse0 (select |v_#memory_int_2177| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2177| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 24 .cse0))) [2019-05-15 10:33:48,694 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:33:48,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 16 treesize of output 11 [2019-05-15 10:33:48,727 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,729 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:48,730 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,730 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:48,737 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:48,737 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2178|]. (let ((.cse0 (select |v_#memory_int_2178| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2178| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 25 .cse0))) [2019-05-15 10:33:48,737 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:33:48,764 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:48,765 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,767 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:48,767 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,767 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:48,775 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:48,775 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2179|]. (let ((.cse0 (select |v_#memory_int_2179| ULTIMATE.start_main_p1))) (and (= 26 .cse0) (= (store |v_#memory_int_2179| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:48,775 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:33:48,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 16 treesize of output 11 [2019-05-15 10:33:48,805 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,807 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:48,807 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,808 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:48,814 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:48,814 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2180|]. (let ((.cse0 (select |v_#memory_int_2180| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2180| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 27))) [2019-05-15 10:33:48,814 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:33:48,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:48,844 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,846 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:48,846 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,846 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:48,854 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:48,854 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2181|]. (let ((.cse0 (select |v_#memory_int_2181| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2181| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 28))) [2019-05-15 10:33:48,854 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:33:48,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 16 treesize of output 11 [2019-05-15 10:33:48,920 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,921 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:48,921 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,921 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:48,927 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:48,927 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2182|]. (let ((.cse0 (select |v_#memory_int_2182| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2182| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 29 .cse0))) [2019-05-15 10:33:48,927 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:33:48,959 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:48,959 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,961 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:48,962 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:48,962 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:48,970 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:48,970 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2183|]. (let ((.cse0 (select |v_#memory_int_2183| ULTIMATE.start_main_p1))) (and (= 30 .cse0) (= |#memory_int| (store |v_#memory_int_2183| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:48,970 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:33:49,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 16 treesize of output 11 [2019-05-15 10:33:49,003 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:49,005 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:49,006 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:49,006 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:49,012 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:49,012 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2184|]. (let ((.cse0 (select |v_#memory_int_2184| ULTIMATE.start_main_p1))) (and (= .cse0 31) (= (store |v_#memory_int_2184| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:49,012 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:33:49,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 16 treesize of output 11 [2019-05-15 10:33:49,046 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:49,048 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:49,049 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:49,049 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:49,056 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:49,057 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2185|]. (let ((.cse0 (select |v_#memory_int_2185| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2185| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 32))) [2019-05-15 10:33:49,057 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:33:49,092 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:49,093 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:49,095 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:49,095 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:49,095 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:49,103 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:49,103 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2186|]. (let ((.cse0 (select |v_#memory_int_2186| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2186| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 33 .cse0))) [2019-05-15 10:33:49,103 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:33:49,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:49,139 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:49,141 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:49,142 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:49,142 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:49,149 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:49,149 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2187|]. (let ((.cse0 (select |v_#memory_int_2187| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2187| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 34 .cse0))) [2019-05-15 10:33:49,149 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:33:49,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 16 treesize of output 11 [2019-05-15 10:33:49,185 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:49,187 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:49,187 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:49,187 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:49,195 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:49,195 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2188|]. (let ((.cse0 (select |v_#memory_int_2188| ULTIMATE.start_main_p1))) (and (= 35 .cse0) (= (store |v_#memory_int_2188| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:49,196 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:33:49,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 16 treesize of output 11 [2019-05-15 10:33:49,233 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:49,235 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:49,236 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:49,236 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:49,244 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:49,244 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2189|]. (let ((.cse0 (select |v_#memory_int_2189| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2189| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 36))) [2019-05-15 10:33:49,244 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:33:49,282 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:49,283 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:49,285 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:49,286 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:49,286 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:49,292 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:49,293 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2190|]. (let ((.cse0 (select |v_#memory_int_2190| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2190| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 37 .cse0))) [2019-05-15 10:33:49,293 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:33:49,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 16 treesize of output 11 [2019-05-15 10:33:49,336 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:49,338 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:49,339 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:49,339 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:49,347 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:49,348 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2191|]. (let ((.cse0 (select |v_#memory_int_2191| ULTIMATE.start_main_p1))) (and (= .cse0 38) (= (store |v_#memory_int_2191| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:49,348 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:33:49,391 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:49,392 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:49,394 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:49,395 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:49,395 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:49,402 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:49,402 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2192|]. (let ((.cse0 (select |v_#memory_int_2192| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2192| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 39 .cse0))) [2019-05-15 10:33:49,402 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:33:49,444 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:49,445 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:49,447 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:49,448 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:49,448 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:49,455 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:49,456 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2193|]. (let ((.cse0 (select |v_#memory_int_2193| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2193| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 40))) [2019-05-15 10:33:49,456 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:33:49,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:49,499 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:49,501 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:49,502 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:49,502 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:49,508 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:49,508 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2194|]. (let ((.cse0 (select |v_#memory_int_2194| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2194| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 41 .cse0))) [2019-05-15 10:33:49,508 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:33:49,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 16 treesize of output 11 [2019-05-15 10:33:49,553 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:49,555 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:49,555 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:49,555 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:49,562 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:49,563 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2195|]. (let ((.cse0 (select |v_#memory_int_2195| ULTIMATE.start_main_p1))) (and (= .cse0 42) (= (store |v_#memory_int_2195| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:49,563 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:33:49,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 16 treesize of output 11 [2019-05-15 10:33:49,605 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:49,607 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:49,607 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:49,608 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:49,615 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:49,615 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2196|]. (let ((.cse0 (select |v_#memory_int_2196| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2196| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 43 .cse0))) [2019-05-15 10:33:49,615 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:33:49,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 16 treesize of output 11 [2019-05-15 10:33:49,657 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:49,659 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:49,660 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:49,660 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:49,668 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:49,668 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2197|]. (let ((.cse0 (select |v_#memory_int_2197| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2197| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 44))) [2019-05-15 10:33:49,668 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:33:49,710 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:49,711 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:49,713 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:49,713 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:49,713 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:49,721 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:49,721 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2198|]. (let ((.cse0 (select |v_#memory_int_2198| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2198| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 45))) [2019-05-15 10:33:49,721 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:33:49,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 16 treesize of output 11 [2019-05-15 10:33:49,767 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:49,769 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:49,769 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:49,770 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:49,780 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:49,780 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2199|]. (let ((.cse0 (select |v_#memory_int_2199| ULTIMATE.start_main_p1))) (and (= .cse0 46) (= |#memory_int| (store |v_#memory_int_2199| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:49,780 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:33:49,828 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:49,829 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:49,831 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:49,831 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:49,832 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:49,839 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:49,840 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2200|]. (let ((.cse0 (select |v_#memory_int_2200| ULTIMATE.start_main_p1))) (and (= .cse0 47) (= (store |v_#memory_int_2200| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:49,840 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:33:49,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:49,888 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:49,890 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:49,891 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:49,891 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:49,899 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:49,899 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2201|]. (let ((.cse0 (select |v_#memory_int_2201| ULTIMATE.start_main_p1))) (and (= 48 .cse0) (= |#memory_int| (store |v_#memory_int_2201| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:49,900 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:33:49,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 16 treesize of output 11 [2019-05-15 10:33:49,951 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:49,953 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:49,953 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:49,954 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:49,962 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:49,962 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2202|]. (let ((.cse0 (select |v_#memory_int_2202| ULTIMATE.start_main_p1))) (and (= 49 .cse0) (= (store |v_#memory_int_2202| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:49,963 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:33:50,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:50,014 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:50,016 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:50,016 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:50,016 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:50,024 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:50,024 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2203|]. (let ((.cse0 (select |v_#memory_int_2203| ULTIMATE.start_main_p1))) (and (= 50 .cse0) (= (store |v_#memory_int_2203| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:50,025 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:33:50,072 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:50,073 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:50,076 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:50,076 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:50,076 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:50,085 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:50,085 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2204|]. (let ((.cse0 (select |v_#memory_int_2204| ULTIMATE.start_main_p1))) (and (= .cse0 51) (= (store |v_#memory_int_2204| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:50,085 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:33:50,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:50,138 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:50,140 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:50,140 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:50,140 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:50,149 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:50,149 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2205|]. (let ((.cse0 (select |v_#memory_int_2205| ULTIMATE.start_main_p1))) (and (= 52 .cse0) (= (store |v_#memory_int_2205| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:50,149 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:33:50,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 16 treesize of output 11 [2019-05-15 10:33:50,202 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:50,204 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:50,204 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:50,204 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:50,212 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:50,212 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2206|]. (let ((.cse0 (select |v_#memory_int_2206| ULTIMATE.start_main_p1))) (and (= .cse0 53) (= (store |v_#memory_int_2206| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:50,212 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:33:50,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 16 treesize of output 11 [2019-05-15 10:33:50,266 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:50,268 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:50,268 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:50,268 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:50,276 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:50,276 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2207|]. (let ((.cse0 (select |v_#memory_int_2207| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2207| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 54))) [2019-05-15 10:33:50,276 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:33:50,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 16 treesize of output 11 [2019-05-15 10:33:50,330 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:50,332 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:50,332 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:50,332 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:50,340 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:50,340 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2208|]. (let ((.cse0 (select |v_#memory_int_2208| ULTIMATE.start_main_p1))) (and (= 55 .cse0) (= (store |v_#memory_int_2208| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:50,340 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:33:50,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:50,396 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:50,399 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:50,399 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:50,399 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:50,406 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:50,406 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2209|]. (let ((.cse0 (select |v_#memory_int_2209| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2209| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 56 .cse0))) [2019-05-15 10:33:50,407 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:33:50,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 16 treesize of output 11 [2019-05-15 10:33:50,461 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:50,463 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:50,463 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:50,463 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:50,471 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:50,472 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2210|]. (let ((.cse0 (select |v_#memory_int_2210| ULTIMATE.start_main_p1))) (and (= 57 .cse0) (= (store |v_#memory_int_2210| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:50,472 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:33:50,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:50,525 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:50,527 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:50,528 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:50,528 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:50,535 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:50,535 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2211|]. (let ((.cse0 (select |v_#memory_int_2211| ULTIMATE.start_main_p1))) (and (= 58 .cse0) (= (store |v_#memory_int_2211| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:50,535 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:33:50,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:50,593 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:50,595 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:50,595 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:50,596 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:50,603 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:50,603 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2212|]. (let ((.cse0 (select |v_#memory_int_2212| ULTIMATE.start_main_p1))) (and (= .cse0 59) (= (store |v_#memory_int_2212| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:50,603 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:33:50,661 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:50,662 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:50,664 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:50,664 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:50,665 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:50,673 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:50,673 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2213|]. (let ((.cse0 (select |v_#memory_int_2213| ULTIMATE.start_main_p1))) (and (= .cse0 60) (= (store |v_#memory_int_2213| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:50,673 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:33:50,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:50,731 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:50,734 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:50,734 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:50,734 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:50,741 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:50,742 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2214|]. (let ((.cse0 (select |v_#memory_int_2214| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2214| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 61))) [2019-05-15 10:33:50,742 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:33:50,811 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:50,828 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:50,858 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:50,859 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:50,859 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:50,866 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:50,866 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2215|]. (let ((.cse0 (select |v_#memory_int_2215| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2215| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 62))) [2019-05-15 10:33:50,866 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:33:50,923 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:50,924 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:50,926 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:50,926 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:50,926 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:50,932 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:50,933 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2216|]. (let ((.cse0 (select |v_#memory_int_2216| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2216| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 63 .cse0))) [2019-05-15 10:33:50,933 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 64) [2019-05-15 10:33:50,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:50,992 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:50,994 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:50,994 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:50,994 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:51,000 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:51,000 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2217|]. (let ((.cse0 (select |v_#memory_int_2217| ULTIMATE.start_main_p1))) (and (= 64 .cse0) (= (store |v_#memory_int_2217| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:51,001 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 65) [2019-05-15 10:33:51,055 INFO L273 TraceCheckUtils]: 0: Hoare triple {19124#true} havoc main_p1; {19124#true} is VALID [2019-05-15 10:33:51,055 INFO L273 TraceCheckUtils]: 1: Hoare triple {19124#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {19124#true} is VALID [2019-05-15 10:33:51,056 INFO L273 TraceCheckUtils]: 2: Hoare triple {19124#true} #memory_int := #memory_int[main_p1 := 0]; {19135#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:33:51,056 INFO L273 TraceCheckUtils]: 3: Hoare triple {19135#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19139#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:33:51,057 INFO L273 TraceCheckUtils]: 4: Hoare triple {19139#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19143#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:33:51,058 INFO L273 TraceCheckUtils]: 5: Hoare triple {19143#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19147#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:33:51,059 INFO L273 TraceCheckUtils]: 6: Hoare triple {19147#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19151#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:33:51,059 INFO L273 TraceCheckUtils]: 7: Hoare triple {19151#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19155#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:33:51,060 INFO L273 TraceCheckUtils]: 8: Hoare triple {19155#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19159#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:33:51,061 INFO L273 TraceCheckUtils]: 9: Hoare triple {19159#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19163#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:33:51,062 INFO L273 TraceCheckUtils]: 10: Hoare triple {19163#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19167#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:33:51,062 INFO L273 TraceCheckUtils]: 11: Hoare triple {19167#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19171#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:33:51,063 INFO L273 TraceCheckUtils]: 12: Hoare triple {19171#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19175#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:33:51,064 INFO L273 TraceCheckUtils]: 13: Hoare triple {19175#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19179#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:33:51,065 INFO L273 TraceCheckUtils]: 14: Hoare triple {19179#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19183#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:33:51,065 INFO L273 TraceCheckUtils]: 15: Hoare triple {19183#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19187#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:33:51,066 INFO L273 TraceCheckUtils]: 16: Hoare triple {19187#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19191#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:33:51,067 INFO L273 TraceCheckUtils]: 17: Hoare triple {19191#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19195#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:33:51,068 INFO L273 TraceCheckUtils]: 18: Hoare triple {19195#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19199#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:33:51,068 INFO L273 TraceCheckUtils]: 19: Hoare triple {19199#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19203#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:33:51,069 INFO L273 TraceCheckUtils]: 20: Hoare triple {19203#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19207#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:33:51,070 INFO L273 TraceCheckUtils]: 21: Hoare triple {19207#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19211#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:33:51,071 INFO L273 TraceCheckUtils]: 22: Hoare triple {19211#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19215#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:33:51,071 INFO L273 TraceCheckUtils]: 23: Hoare triple {19215#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19219#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:33:51,072 INFO L273 TraceCheckUtils]: 24: Hoare triple {19219#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19223#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:33:51,073 INFO L273 TraceCheckUtils]: 25: Hoare triple {19223#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19227#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:33:51,074 INFO L273 TraceCheckUtils]: 26: Hoare triple {19227#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19231#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:33:51,074 INFO L273 TraceCheckUtils]: 27: Hoare triple {19231#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19235#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:33:51,075 INFO L273 TraceCheckUtils]: 28: Hoare triple {19235#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19239#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:33:51,076 INFO L273 TraceCheckUtils]: 29: Hoare triple {19239#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19243#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:33:51,077 INFO L273 TraceCheckUtils]: 30: Hoare triple {19243#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19247#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:33:51,077 INFO L273 TraceCheckUtils]: 31: Hoare triple {19247#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19251#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:33:51,078 INFO L273 TraceCheckUtils]: 32: Hoare triple {19251#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19255#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:33:51,079 INFO L273 TraceCheckUtils]: 33: Hoare triple {19255#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19259#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:33:51,080 INFO L273 TraceCheckUtils]: 34: Hoare triple {19259#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19263#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:33:51,080 INFO L273 TraceCheckUtils]: 35: Hoare triple {19263#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19267#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:33:51,081 INFO L273 TraceCheckUtils]: 36: Hoare triple {19267#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19271#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:33:51,082 INFO L273 TraceCheckUtils]: 37: Hoare triple {19271#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19275#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:33:51,083 INFO L273 TraceCheckUtils]: 38: Hoare triple {19275#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19279#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:33:51,083 INFO L273 TraceCheckUtils]: 39: Hoare triple {19279#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19283#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:33:51,084 INFO L273 TraceCheckUtils]: 40: Hoare triple {19283#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19287#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:33:51,085 INFO L273 TraceCheckUtils]: 41: Hoare triple {19287#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19291#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:33:51,086 INFO L273 TraceCheckUtils]: 42: Hoare triple {19291#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19295#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:33:51,086 INFO L273 TraceCheckUtils]: 43: Hoare triple {19295#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19299#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:33:51,087 INFO L273 TraceCheckUtils]: 44: Hoare triple {19299#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19303#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:33:51,088 INFO L273 TraceCheckUtils]: 45: Hoare triple {19303#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19307#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:33:51,089 INFO L273 TraceCheckUtils]: 46: Hoare triple {19307#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19311#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:33:51,089 INFO L273 TraceCheckUtils]: 47: Hoare triple {19311#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19315#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:33:51,090 INFO L273 TraceCheckUtils]: 48: Hoare triple {19315#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19319#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:33:51,091 INFO L273 TraceCheckUtils]: 49: Hoare triple {19319#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19323#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:33:51,092 INFO L273 TraceCheckUtils]: 50: Hoare triple {19323#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19327#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:33:51,092 INFO L273 TraceCheckUtils]: 51: Hoare triple {19327#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19331#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:33:51,093 INFO L273 TraceCheckUtils]: 52: Hoare triple {19331#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19335#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:33:51,094 INFO L273 TraceCheckUtils]: 53: Hoare triple {19335#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19339#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:33:51,095 INFO L273 TraceCheckUtils]: 54: Hoare triple {19339#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19343#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:33:51,095 INFO L273 TraceCheckUtils]: 55: Hoare triple {19343#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19347#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:33:51,096 INFO L273 TraceCheckUtils]: 56: Hoare triple {19347#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19351#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:33:51,097 INFO L273 TraceCheckUtils]: 57: Hoare triple {19351#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19355#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:33:51,098 INFO L273 TraceCheckUtils]: 58: Hoare triple {19355#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19359#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:33:51,098 INFO L273 TraceCheckUtils]: 59: Hoare triple {19359#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19363#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:33:51,099 INFO L273 TraceCheckUtils]: 60: Hoare triple {19363#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19367#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:33:51,100 INFO L273 TraceCheckUtils]: 61: Hoare triple {19367#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19371#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:33:51,101 INFO L273 TraceCheckUtils]: 62: Hoare triple {19371#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19375#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:33:51,101 INFO L273 TraceCheckUtils]: 63: Hoare triple {19375#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19379#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:33:51,102 INFO L273 TraceCheckUtils]: 64: Hoare triple {19379#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19383#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:33:51,103 INFO L273 TraceCheckUtils]: 65: Hoare triple {19383#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19387#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:33:51,104 INFO L273 TraceCheckUtils]: 66: Hoare triple {19387#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19391#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} is VALID [2019-05-15 10:33:51,104 INFO L273 TraceCheckUtils]: 67: Hoare triple {19391#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19395#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} is VALID [2019-05-15 10:33:51,105 INFO L273 TraceCheckUtils]: 68: Hoare triple {19395#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} assume !(#memory_int[main_p1] >= 0); {19125#false} is VALID [2019-05-15 10:33:51,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:33:51,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:33:51,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-05-15 10:33:51,113 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 69 [2019-05-15 10:33:51,113 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:33:51,113 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 68 states. [2019-05-15 10:33:51,168 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:33:51,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-05-15 10:33:51,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-05-15 10:33:51,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-05-15 10:33:51,169 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 68 states. [2019-05-15 10:34:00,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:34:00,072 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-05-15 10:34:00,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-05-15 10:34:00,072 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 69 [2019-05-15 10:34:00,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:34:00,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-05-15 10:34:00,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-05-15 10:34:00,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-05-15 10:34:00,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-05-15 10:34:00,074 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 68 states and 72 transitions. [2019-05-15 10:34:00,131 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:34:00,132 INFO L225 Difference]: With dead ends: 71 [2019-05-15 10:34:00,132 INFO L226 Difference]: Without dead ends: 71 [2019-05-15 10:34:00,132 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-05-15 10:34:00,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-05-15 10:34:00,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-05-15 10:34:00,134 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:34:00,134 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 71 states. [2019-05-15 10:34:00,134 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 71 states. [2019-05-15 10:34:00,134 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 71 states. [2019-05-15 10:34:00,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:34:00,135 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-05-15 10:34:00,135 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-05-15 10:34:00,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:34:00,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:34:00,135 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 71 states. [2019-05-15 10:34:00,135 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 71 states. [2019-05-15 10:34:00,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:34:00,136 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-05-15 10:34:00,136 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-05-15 10:34:00,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:34:00,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:34:00,137 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:34:00,137 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:34:00,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-05-15 10:34:00,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-05-15 10:34:00,138 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-05-15 10:34:00,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:34:00,138 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-05-15 10:34:00,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-05-15 10:34:00,138 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-05-15 10:34:00,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-05-15 10:34:00,139 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:34:00,139 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1, 1] [2019-05-15 10:34:00,139 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:34:00,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:34:00,139 INFO L82 PathProgramCache]: Analyzing trace with hash -110150968, now seen corresponding path program 66 times [2019-05-15 10:34:00,140 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:34:00,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:34:00,175 WARN L254 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 68 conjunts are in the unsatisfiable core [2019-05-15 10:34:00,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:34:00,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:34:00,241 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:00,241 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:00,242 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:00,243 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:00,243 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:34:00,244 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:00,244 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2218|]. (= |#memory_int| (store |v_#memory_int_2218| ULTIMATE.start_main_p1 0)) [2019-05-15 10:34:00,244 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:34:00,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 16 treesize of output 11 [2019-05-15 10:34:00,255 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:00,257 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:00,257 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:00,257 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:00,264 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:00,264 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2219|]. (let ((.cse0 (select |v_#memory_int_2219| ULTIMATE.start_main_p1))) (and (= 0 .cse0) (= (store |v_#memory_int_2219| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:00,264 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:34:00,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 16 treesize of output 11 [2019-05-15 10:34:00,274 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:00,276 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:00,276 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:00,277 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:00,284 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:00,284 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2220|]. (let ((.cse0 (select |v_#memory_int_2220| ULTIMATE.start_main_p1))) (and (= 1 .cse0) (= |#memory_int| (store |v_#memory_int_2220| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:00,284 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:34:00,296 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:00,296 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:00,298 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:00,299 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:00,299 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:00,306 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:00,306 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2221|]. (let ((.cse0 (select |v_#memory_int_2221| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2221| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 2 .cse0))) [2019-05-15 10:34:00,306 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:34:00,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 16 treesize of output 11 [2019-05-15 10:34:00,317 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:00,319 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:00,319 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:00,319 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:00,326 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:00,327 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2222|]. (let ((.cse0 (select |v_#memory_int_2222| ULTIMATE.start_main_p1))) (and (= 3 .cse0) (= |#memory_int| (store |v_#memory_int_2222| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:00,327 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:34:00,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:00,339 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:00,341 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:00,341 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:00,341 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:00,348 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:00,349 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2223|]. (let ((.cse0 (select |v_#memory_int_2223| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2223| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 4 .cse0))) [2019-05-15 10:34:00,349 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:34:00,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:00,361 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:00,363 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:00,363 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:00,364 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:00,370 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:00,371 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2224|]. (let ((.cse0 (select |v_#memory_int_2224| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2224| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 5 .cse0))) [2019-05-15 10:34:00,371 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:34:00,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:00,385 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:00,387 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:00,387 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:00,388 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:00,395 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:00,395 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2225|]. (let ((.cse0 (select |v_#memory_int_2225| ULTIMATE.start_main_p1))) (and (= 6 .cse0) (= (store |v_#memory_int_2225| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:00,395 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:34:00,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:00,410 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:00,412 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:00,412 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:00,413 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:00,420 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:00,420 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2226|]. (let ((.cse0 (select |v_#memory_int_2226| ULTIMATE.start_main_p1))) (and (= 7 .cse0) (= (store |v_#memory_int_2226| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:00,420 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:34:00,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:00,439 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:00,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:00,441 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:00,441 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:00,450 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:00,450 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2227|]. (let ((.cse0 (select |v_#memory_int_2227| ULTIMATE.start_main_p1))) (and (= 8 .cse0) (= (store |v_#memory_int_2227| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:00,450 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:34:00,467 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:00,468 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:00,470 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:00,470 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:00,470 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:00,475 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:00,475 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2228|]. (let ((.cse0 (select |v_#memory_int_2228| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2228| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 9 .cse0))) [2019-05-15 10:34:00,475 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:34:00,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:00,492 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:00,494 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:00,494 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:00,494 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:00,501 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:00,501 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2229|]. (let ((.cse0 (select |v_#memory_int_2229| ULTIMATE.start_main_p1))) (and (= 10 .cse0) (= |#memory_int| (store |v_#memory_int_2229| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:00,501 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:34:00,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 16 treesize of output 11 [2019-05-15 10:34:00,518 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:00,520 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:00,520 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:00,520 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:00,527 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:00,527 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2230|]. (let ((.cse0 (select |v_#memory_int_2230| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2230| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 11))) [2019-05-15 10:34:00,527 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:34:00,547 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:00,548 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:00,550 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:00,550 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:00,550 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:00,557 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:00,557 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2231|]. (let ((.cse0 (select |v_#memory_int_2231| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2231| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 12 .cse0))) [2019-05-15 10:34:00,557 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:34:00,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 16 treesize of output 11 [2019-05-15 10:34:00,577 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:00,579 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:00,579 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:00,580 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:00,587 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:00,587 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2232|]. (let ((.cse0 (select |v_#memory_int_2232| ULTIMATE.start_main_p1))) (and (= 13 .cse0) (= (store |v_#memory_int_2232| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:00,587 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:34:00,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:00,607 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:00,609 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:00,610 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:00,610 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:00,617 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:00,617 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2233|]. (let ((.cse0 (select |v_#memory_int_2233| ULTIMATE.start_main_p1))) (and (= .cse0 14) (= (store |v_#memory_int_2233| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:00,617 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:34:00,639 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:00,640 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:00,642 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:00,642 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:00,642 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:00,649 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:00,650 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2234|]. (let ((.cse0 (select |v_#memory_int_2234| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2234| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 15 .cse0))) [2019-05-15 10:34:00,650 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:34:00,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:00,672 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:00,674 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:00,674 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:00,674 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:00,682 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:00,682 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2235|]. (let ((.cse0 (select |v_#memory_int_2235| ULTIMATE.start_main_p1))) (and (= .cse0 16) (= |#memory_int| (store |v_#memory_int_2235| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:00,682 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:34:00,705 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:00,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:00,708 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:00,708 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:00,709 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:00,716 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:00,716 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2236|]. (let ((.cse0 (select |v_#memory_int_2236| ULTIMATE.start_main_p1))) (and (= 17 .cse0) (= (store |v_#memory_int_2236| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:00,716 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:34:00,739 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:00,740 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:00,742 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:00,742 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:00,743 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:00,748 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:00,749 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2237|]. (let ((.cse0 (select |v_#memory_int_2237| ULTIMATE.start_main_p1))) (and (= .cse0 18) (= |#memory_int| (store |v_#memory_int_2237| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:00,749 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:34:00,772 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:00,773 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:00,775 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:00,776 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:00,776 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:00,783 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:00,783 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2238|]. (let ((.cse0 (select |v_#memory_int_2238| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2238| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 19 .cse0))) [2019-05-15 10:34:00,783 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:34:00,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:00,808 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:00,810 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:00,810 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:00,810 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:00,818 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:00,818 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2239|]. (let ((.cse0 (select |v_#memory_int_2239| ULTIMATE.start_main_p1))) (and (= 20 .cse0) (= |#memory_int| (store |v_#memory_int_2239| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:00,818 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:34:00,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:00,846 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:00,848 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:00,848 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:00,848 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:00,855 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:00,855 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2240|]. (let ((.cse0 (select |v_#memory_int_2240| ULTIMATE.start_main_p1))) (and (= .cse0 21) (= (store |v_#memory_int_2240| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:00,856 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:34:00,882 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:00,883 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:00,885 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:00,885 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:00,885 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:00,892 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:00,893 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2241|]. (let ((.cse0 (select |v_#memory_int_2241| ULTIMATE.start_main_p1))) (and (= .cse0 22) (= (store |v_#memory_int_2241| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:00,893 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:34:00,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:00,920 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:00,922 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:00,922 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:00,923 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:00,930 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:00,930 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2242|]. (let ((.cse0 (select |v_#memory_int_2242| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2242| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 23 .cse0))) [2019-05-15 10:34:00,930 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:34:00,959 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:00,960 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:00,962 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:00,962 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:00,962 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:00,970 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:00,970 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2243|]. (let ((.cse0 (select |v_#memory_int_2243| ULTIMATE.start_main_p1))) (and (= 24 .cse0) (= (store |v_#memory_int_2243| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:00,970 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:34:00,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:01,000 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:01,002 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:01,003 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,003 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:01,010 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:01,011 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2244|]. (let ((.cse0 (select |v_#memory_int_2244| ULTIMATE.start_main_p1))) (and (= .cse0 25) (= (store |v_#memory_int_2244| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:01,011 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:34:01,040 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:01,041 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:01,043 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:01,044 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,044 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:01,050 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:01,050 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2245|]. (let ((.cse0 (select |v_#memory_int_2245| ULTIMATE.start_main_p1))) (and (= .cse0 26) (= (store |v_#memory_int_2245| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:01,050 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:34:01,079 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:01,080 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:01,082 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:01,083 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,083 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:01,090 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:01,091 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2246|]. (let ((.cse0 (select |v_#memory_int_2246| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2246| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 27 .cse0))) [2019-05-15 10:34:01,091 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:34: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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:01,123 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:01,125 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:01,126 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,126 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:01,133 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:01,134 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2247|]. (let ((.cse0 (select |v_#memory_int_2247| ULTIMATE.start_main_p1))) (and (= 28 .cse0) (= (store |v_#memory_int_2247| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:01,134 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:34:01,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 16 treesize of output 11 [2019-05-15 10:34:01,166 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:01,168 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:01,168 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,168 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:01,176 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:01,176 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2248|]. (let ((.cse0 (select |v_#memory_int_2248| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2248| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 29))) [2019-05-15 10:34:01,176 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:34:01,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 16 treesize of output 11 [2019-05-15 10:34:01,213 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:01,215 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:01,215 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,215 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:01,223 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:01,223 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2249|]. (let ((.cse0 (select |v_#memory_int_2249| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2249| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 30))) [2019-05-15 10:34:01,223 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:34:01,255 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:01,256 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:01,258 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:01,259 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,259 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:01,266 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:01,266 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2250|]. (let ((.cse0 (select |v_#memory_int_2250| ULTIMATE.start_main_p1))) (and (= 31 .cse0) (= |#memory_int| (store |v_#memory_int_2250| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:01,266 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:34:01,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:01,300 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:01,302 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:01,303 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,303 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:01,312 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:01,312 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2251|]. (let ((.cse0 (select |v_#memory_int_2251| ULTIMATE.start_main_p1))) (and (= 32 .cse0) (= (store |v_#memory_int_2251| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:01,312 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:34:01,351 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:01,352 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:01,354 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:01,354 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,354 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:01,363 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:01,363 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2252|]. (let ((.cse0 (select |v_#memory_int_2252| ULTIMATE.start_main_p1))) (and (= 33 .cse0) (= (store |v_#memory_int_2252| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:01,363 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:34:01,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:01,400 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:01,403 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:01,403 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,403 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:01,413 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:01,413 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2253|]. (let ((.cse0 (select |v_#memory_int_2253| ULTIMATE.start_main_p1))) (and (= 34 .cse0) (= (store |v_#memory_int_2253| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:01,413 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:34:01,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 16 treesize of output 11 [2019-05-15 10:34:01,461 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:01,463 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:01,463 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,463 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:01,471 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:01,471 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2254|]. (let ((.cse0 (select |v_#memory_int_2254| ULTIMATE.start_main_p1))) (and (= .cse0 35) (= |#memory_int| (store |v_#memory_int_2254| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:01,471 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:34:01,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:01,509 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:01,511 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:01,511 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,511 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:01,518 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:01,518 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2255|]. (let ((.cse0 (select |v_#memory_int_2255| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2255| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 36 .cse0))) [2019-05-15 10:34:01,518 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:34:01,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:01,557 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:01,559 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:01,559 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,559 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:01,567 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:01,567 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2256|]. (let ((.cse0 (select |v_#memory_int_2256| ULTIMATE.start_main_p1))) (and (= 37 .cse0) (= (store |v_#memory_int_2256| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:01,567 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:34:01,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 16 treesize of output 11 [2019-05-15 10:34:01,605 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:01,607 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:01,607 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,608 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:01,614 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:01,614 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2257|]. (let ((.cse0 (select |v_#memory_int_2257| ULTIMATE.start_main_p1))) (and (= 38 .cse0) (= (store |v_#memory_int_2257| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:01,614 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:34:01,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 16 treesize of output 11 [2019-05-15 10:34:01,654 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:01,656 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:01,657 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,657 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:01,664 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:01,664 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2258|]. (let ((.cse0 (select |v_#memory_int_2258| ULTIMATE.start_main_p1))) (and (= .cse0 39) (= (store |v_#memory_int_2258| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:01,665 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:34:01,704 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:01,705 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:01,707 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:01,707 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,708 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:01,716 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:01,716 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2259|]. (let ((.cse0 (select |v_#memory_int_2259| ULTIMATE.start_main_p1))) (and (= .cse0 40) (= (store |v_#memory_int_2259| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:01,716 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:34: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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:01,758 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:01,760 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:01,760 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,761 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:01,766 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:01,767 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2260|]. (let ((.cse0 (select |v_#memory_int_2260| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2260| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 41))) [2019-05-15 10:34:01,767 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:34:01,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:01,808 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:01,810 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:01,810 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,811 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:01,818 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:01,818 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2261|]. (let ((.cse0 (select |v_#memory_int_2261| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2261| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 42))) [2019-05-15 10:34:01,818 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:34:01,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:01,859 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:01,861 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:01,861 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,861 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:01,867 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:01,867 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2262|]. (let ((.cse0 (select |v_#memory_int_2262| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2262| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 43 .cse0))) [2019-05-15 10:34:01,867 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:34:01,909 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:01,910 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:01,912 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:01,912 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,912 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:01,920 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:01,920 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2263|]. (let ((.cse0 (select |v_#memory_int_2263| ULTIMATE.start_main_p1))) (and (= 44 .cse0) (= (store |v_#memory_int_2263| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:01,920 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:34:01,965 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:01,966 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:01,968 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:01,968 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,968 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:01,976 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:01,976 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2264|]. (let ((.cse0 (select |v_#memory_int_2264| ULTIMATE.start_main_p1))) (and (= .cse0 45) (= |#memory_int| (store |v_#memory_int_2264| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:01,976 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:34:02,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 16 treesize of output 11 [2019-05-15 10:34:02,023 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:02,025 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:02,025 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,025 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:02,033 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:02,033 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2265|]. (let ((.cse0 (select |v_#memory_int_2265| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2265| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 46 .cse0))) [2019-05-15 10:34:02,033 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:34:02,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:02,079 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:02,081 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:02,081 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,081 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:02,089 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:02,089 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2266|]. (let ((.cse0 (select |v_#memory_int_2266| ULTIMATE.start_main_p1))) (and (= 47 .cse0) (= (store |v_#memory_int_2266| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:02,089 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:34:02,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 16 treesize of output 11 [2019-05-15 10:34:02,134 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:02,136 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:02,137 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,137 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:02,144 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:02,144 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2267|]. (let ((.cse0 (select |v_#memory_int_2267| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2267| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 48))) [2019-05-15 10:34:02,144 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:34:02,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 16 treesize of output 11 [2019-05-15 10:34:02,190 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:02,192 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:02,193 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,193 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:02,200 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:02,200 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2268|]. (let ((.cse0 (select |v_#memory_int_2268| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2268| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 49 .cse0))) [2019-05-15 10:34:02,200 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:34:02,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 16 treesize of output 11 [2019-05-15 10:34:02,249 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:02,251 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:02,251 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,251 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:02,258 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:02,259 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2269|]. (let ((.cse0 (select |v_#memory_int_2269| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2269| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 50))) [2019-05-15 10:34:02,259 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:34:02,307 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:02,308 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:02,310 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:02,310 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,310 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:02,319 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:02,319 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2270|]. (let ((.cse0 (select |v_#memory_int_2270| ULTIMATE.start_main_p1))) (and (= 51 .cse0) (= (store |v_#memory_int_2270| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:02,319 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:34:02,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:02,366 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:02,368 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:02,368 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,368 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:02,376 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:02,376 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2271|]. (let ((.cse0 (select |v_#memory_int_2271| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2271| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 52 .cse0))) [2019-05-15 10:34:02,376 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:34:02,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 16 treesize of output 11 [2019-05-15 10:34:02,427 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:02,429 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:02,429 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,429 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:02,437 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:02,437 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2272|]. (let ((.cse0 (select |v_#memory_int_2272| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2272| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 53))) [2019-05-15 10:34:02,437 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:34:02,485 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:02,486 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:02,488 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:02,488 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,488 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:02,495 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:02,496 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2273|]. (let ((.cse0 (select |v_#memory_int_2273| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2273| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 54 .cse0))) [2019-05-15 10:34:02,496 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:34:02,546 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:02,547 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:02,549 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:02,549 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,549 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:02,557 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:02,557 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2274|]. (let ((.cse0 (select |v_#memory_int_2274| ULTIMATE.start_main_p1))) (and (= .cse0 55) (= (store |v_#memory_int_2274| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:02,557 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:34:02,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 16 treesize of output 11 [2019-05-15 10:34:02,611 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:02,613 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 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 1 xjuncts. [2019-05-15 10:34:02,614 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:02,623 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:02,623 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2275|]. (let ((.cse0 (select |v_#memory_int_2275| ULTIMATE.start_main_p1))) (and (= 56 .cse0) (= (store |v_#memory_int_2275| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:02,623 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:34:02,675 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:02,676 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:02,678 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:02,678 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,678 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:02,685 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:02,686 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2276|]. (let ((.cse0 (select |v_#memory_int_2276| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2276| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 57 .cse0))) [2019-05-15 10:34:02,686 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:34:02,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:02,742 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:02,744 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:02,744 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,744 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:02,752 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:02,752 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2277|]. (let ((.cse0 (select |v_#memory_int_2277| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2277| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 58 .cse0))) [2019-05-15 10:34:02,752 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:34:02,806 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:02,807 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:02,809 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:02,809 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,809 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:02,816 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:02,816 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2278|]. (let ((.cse0 (select |v_#memory_int_2278| ULTIMATE.start_main_p1))) (and (= 59 .cse0) (= (store |v_#memory_int_2278| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:02,816 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:34:02,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 16 treesize of output 11 [2019-05-15 10:34:02,870 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:02,872 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:02,872 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,873 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:02,880 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:02,881 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2279|]. (let ((.cse0 (select |v_#memory_int_2279| ULTIMATE.start_main_p1))) (and (= 60 .cse0) (= |#memory_int| (store |v_#memory_int_2279| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:02,881 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:34:02,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:02,936 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:02,938 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:02,939 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,939 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:02,946 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:02,946 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2280|]. (let ((.cse0 (select |v_#memory_int_2280| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2280| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 61 .cse0))) [2019-05-15 10:34:02,946 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:34:03,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:03,005 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:03,007 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:03,007 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:03,007 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:03,014 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:03,014 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2281|]. (let ((.cse0 (select |v_#memory_int_2281| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2281| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 62 .cse0))) [2019-05-15 10:34:03,014 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:34:03,070 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:03,071 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:03,073 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:03,074 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:03,074 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:03,081 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:03,081 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2282|]. (let ((.cse0 (select |v_#memory_int_2282| ULTIMATE.start_main_p1))) (and (= 63 .cse0) (= |#memory_int| (store |v_#memory_int_2282| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:03,082 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 64) [2019-05-15 10:34:03,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:03,142 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:03,144 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:03,145 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:03,145 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:03,152 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:03,152 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2283|]. (let ((.cse0 (select |v_#memory_int_2283| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2283| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 64))) [2019-05-15 10:34:03,152 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 65) [2019-05-15 10:34:03,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 16 treesize of output 11 [2019-05-15 10:34:03,213 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:03,215 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:03,215 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:03,215 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:03,223 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:03,223 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2284|]. (let ((.cse0 (select |v_#memory_int_2284| ULTIMATE.start_main_p1))) (and (= .cse0 65) (= (store |v_#memory_int_2284| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:03,223 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 66) [2019-05-15 10:34:03,278 INFO L273 TraceCheckUtils]: 0: Hoare triple {19682#true} havoc main_p1; {19682#true} is VALID [2019-05-15 10:34:03,278 INFO L273 TraceCheckUtils]: 1: Hoare triple {19682#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {19682#true} is VALID [2019-05-15 10:34:03,279 INFO L273 TraceCheckUtils]: 2: Hoare triple {19682#true} #memory_int := #memory_int[main_p1 := 0]; {19693#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:34:03,279 INFO L273 TraceCheckUtils]: 3: Hoare triple {19693#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19697#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:34:03,280 INFO L273 TraceCheckUtils]: 4: Hoare triple {19697#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19701#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:34:03,281 INFO L273 TraceCheckUtils]: 5: Hoare triple {19701#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19705#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:34:03,282 INFO L273 TraceCheckUtils]: 6: Hoare triple {19705#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19709#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:34:03,282 INFO L273 TraceCheckUtils]: 7: Hoare triple {19709#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19713#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:34:03,283 INFO L273 TraceCheckUtils]: 8: Hoare triple {19713#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19717#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:34:03,284 INFO L273 TraceCheckUtils]: 9: Hoare triple {19717#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19721#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:34:03,285 INFO L273 TraceCheckUtils]: 10: Hoare triple {19721#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19725#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:34:03,285 INFO L273 TraceCheckUtils]: 11: Hoare triple {19725#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19729#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:34:03,286 INFO L273 TraceCheckUtils]: 12: Hoare triple {19729#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19733#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:34:03,287 INFO L273 TraceCheckUtils]: 13: Hoare triple {19733#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19737#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:34:03,288 INFO L273 TraceCheckUtils]: 14: Hoare triple {19737#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19741#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:34:03,288 INFO L273 TraceCheckUtils]: 15: Hoare triple {19741#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19745#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:34:03,289 INFO L273 TraceCheckUtils]: 16: Hoare triple {19745#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19749#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:34:03,290 INFO L273 TraceCheckUtils]: 17: Hoare triple {19749#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19753#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:34:03,291 INFO L273 TraceCheckUtils]: 18: Hoare triple {19753#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19757#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:34:03,291 INFO L273 TraceCheckUtils]: 19: Hoare triple {19757#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19761#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:34:03,292 INFO L273 TraceCheckUtils]: 20: Hoare triple {19761#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19765#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:34:03,293 INFO L273 TraceCheckUtils]: 21: Hoare triple {19765#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19769#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:34:03,294 INFO L273 TraceCheckUtils]: 22: Hoare triple {19769#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19773#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:34:03,294 INFO L273 TraceCheckUtils]: 23: Hoare triple {19773#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19777#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:34:03,295 INFO L273 TraceCheckUtils]: 24: Hoare triple {19777#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19781#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:34:03,296 INFO L273 TraceCheckUtils]: 25: Hoare triple {19781#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19785#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:34:03,297 INFO L273 TraceCheckUtils]: 26: Hoare triple {19785#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19789#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:34:03,298 INFO L273 TraceCheckUtils]: 27: Hoare triple {19789#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19793#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:34:03,298 INFO L273 TraceCheckUtils]: 28: Hoare triple {19793#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19797#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:34:03,299 INFO L273 TraceCheckUtils]: 29: Hoare triple {19797#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19801#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:34:03,300 INFO L273 TraceCheckUtils]: 30: Hoare triple {19801#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19805#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:34:03,300 INFO L273 TraceCheckUtils]: 31: Hoare triple {19805#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19809#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:34:03,301 INFO L273 TraceCheckUtils]: 32: Hoare triple {19809#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19813#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:34:03,302 INFO L273 TraceCheckUtils]: 33: Hoare triple {19813#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19817#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:34:03,303 INFO L273 TraceCheckUtils]: 34: Hoare triple {19817#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19821#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:34:03,303 INFO L273 TraceCheckUtils]: 35: Hoare triple {19821#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19825#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:34:03,304 INFO L273 TraceCheckUtils]: 36: Hoare triple {19825#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19829#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:34:03,305 INFO L273 TraceCheckUtils]: 37: Hoare triple {19829#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19833#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:34:03,306 INFO L273 TraceCheckUtils]: 38: Hoare triple {19833#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19837#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:34:03,306 INFO L273 TraceCheckUtils]: 39: Hoare triple {19837#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19841#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:34:03,307 INFO L273 TraceCheckUtils]: 40: Hoare triple {19841#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19845#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:34:03,308 INFO L273 TraceCheckUtils]: 41: Hoare triple {19845#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19849#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:34:03,309 INFO L273 TraceCheckUtils]: 42: Hoare triple {19849#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19853#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:34:03,309 INFO L273 TraceCheckUtils]: 43: Hoare triple {19853#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19857#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:34:03,310 INFO L273 TraceCheckUtils]: 44: Hoare triple {19857#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19861#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:34:03,311 INFO L273 TraceCheckUtils]: 45: Hoare triple {19861#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19865#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:34:03,312 INFO L273 TraceCheckUtils]: 46: Hoare triple {19865#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19869#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:34:03,322 INFO L273 TraceCheckUtils]: 47: Hoare triple {19869#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19873#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:34:03,323 INFO L273 TraceCheckUtils]: 48: Hoare triple {19873#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19877#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:34:03,323 INFO L273 TraceCheckUtils]: 49: Hoare triple {19877#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19881#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:34:03,324 INFO L273 TraceCheckUtils]: 50: Hoare triple {19881#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19885#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:34:03,324 INFO L273 TraceCheckUtils]: 51: Hoare triple {19885#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19889#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:34:03,325 INFO L273 TraceCheckUtils]: 52: Hoare triple {19889#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19893#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:34:03,325 INFO L273 TraceCheckUtils]: 53: Hoare triple {19893#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19897#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:34:03,326 INFO L273 TraceCheckUtils]: 54: Hoare triple {19897#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19901#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:34:03,327 INFO L273 TraceCheckUtils]: 55: Hoare triple {19901#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19905#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:34:03,327 INFO L273 TraceCheckUtils]: 56: Hoare triple {19905#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19909#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:34:03,328 INFO L273 TraceCheckUtils]: 57: Hoare triple {19909#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19913#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:34:03,329 INFO L273 TraceCheckUtils]: 58: Hoare triple {19913#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19917#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:34:03,330 INFO L273 TraceCheckUtils]: 59: Hoare triple {19917#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19921#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:34:03,330 INFO L273 TraceCheckUtils]: 60: Hoare triple {19921#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19925#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:34:03,331 INFO L273 TraceCheckUtils]: 61: Hoare triple {19925#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19929#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:34:03,332 INFO L273 TraceCheckUtils]: 62: Hoare triple {19929#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19933#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:34:03,333 INFO L273 TraceCheckUtils]: 63: Hoare triple {19933#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19937#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:34:03,333 INFO L273 TraceCheckUtils]: 64: Hoare triple {19937#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19941#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:34:03,334 INFO L273 TraceCheckUtils]: 65: Hoare triple {19941#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19945#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:34:03,335 INFO L273 TraceCheckUtils]: 66: Hoare triple {19945#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19949#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} is VALID [2019-05-15 10:34:03,336 INFO L273 TraceCheckUtils]: 67: Hoare triple {19949#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19953#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} is VALID [2019-05-15 10:34:03,336 INFO L273 TraceCheckUtils]: 68: Hoare triple {19953#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19957#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} is VALID [2019-05-15 10:34:03,337 INFO L273 TraceCheckUtils]: 69: Hoare triple {19957#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} assume !(#memory_int[main_p1] >= 0); {19683#false} is VALID [2019-05-15 10:34:03,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:34:03,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:34:03,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-05-15 10:34:03,345 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 70 [2019-05-15 10:34:03,345 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:34:03,345 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 69 states. [2019-05-15 10:34:03,400 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:34:03,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-05-15 10:34:03,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-05-15 10:34:03,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-05-15 10:34:03,401 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 69 states. [2019-05-15 10:34:12,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:34:12,580 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-05-15 10:34:12,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-05-15 10:34:12,581 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 70 [2019-05-15 10:34:12,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:34:12,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-05-15 10:34:12,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-05-15 10:34:12,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-05-15 10:34:12,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-05-15 10:34:12,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 69 states and 73 transitions. [2019-05-15 10:34:12,639 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:34:12,640 INFO L225 Difference]: With dead ends: 72 [2019-05-15 10:34:12,640 INFO L226 Difference]: Without dead ends: 72 [2019-05-15 10:34:12,640 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-05-15 10:34:12,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-05-15 10:34:12,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-05-15 10:34:12,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:34:12,642 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 72 states. [2019-05-15 10:34:12,642 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2019-05-15 10:34:12,642 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2019-05-15 10:34:12,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:34:12,643 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-05-15 10:34:12,643 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-05-15 10:34:12,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:34:12,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:34:12,644 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2019-05-15 10:34:12,644 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2019-05-15 10:34:12,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:34:12,645 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-05-15 10:34:12,645 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-05-15 10:34:12,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:34:12,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:34:12,645 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:34:12,645 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:34:12,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-05-15 10:34:12,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-05-15 10:34:12,646 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-05-15 10:34:12,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:34:12,647 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-05-15 10:34:12,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-05-15 10:34:12,647 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-05-15 10:34:12,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-05-15 10:34:12,647 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:34:12,647 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1, 1] [2019-05-15 10:34:12,647 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:34:12,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:34:12,648 INFO L82 PathProgramCache]: Analyzing trace with hash 880287234, now seen corresponding path program 67 times [2019-05-15 10:34:12,648 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:34:12,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:34:12,685 WARN L254 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 69 conjunts are in the unsatisfiable core [2019-05-15 10:34:12,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:34:12,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:34:12,829 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:12,829 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:12,859 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:12,859 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:12,859 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:34:12,861 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:12,861 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2285|]. (= (store |v_#memory_int_2285| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:34:12,861 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:34:12,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 16 treesize of output 11 [2019-05-15 10:34:12,871 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:12,872 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:12,873 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:12,873 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:12,881 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:12,881 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2286|]. (let ((.cse0 (select |v_#memory_int_2286| ULTIMATE.start_main_p1))) (and (= .cse0 0) (= (store |v_#memory_int_2286| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:12,882 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:34:12,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 16 treesize of output 11 [2019-05-15 10:34:12,892 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:12,894 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:12,894 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:12,894 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:12,901 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:12,901 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2287|]. (let ((.cse0 (select |v_#memory_int_2287| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2287| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 1 .cse0))) [2019-05-15 10:34:12,901 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:34:12,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 16 treesize of output 11 [2019-05-15 10:34:12,914 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:12,916 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:12,916 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:12,916 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:12,923 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:12,923 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2288|]. (let ((.cse0 (select |v_#memory_int_2288| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2288| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 2 .cse0))) [2019-05-15 10:34:12,924 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:34:12,934 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:12,935 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:12,937 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:12,937 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:12,938 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:12,945 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:12,945 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2289|]. (let ((.cse0 (select |v_#memory_int_2289| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2289| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 3))) [2019-05-15 10:34:12,946 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:34:12,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 16 treesize of output 11 [2019-05-15 10:34:12,958 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:12,960 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:12,960 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:12,960 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:12,967 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:12,968 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2290|]. (let ((.cse0 (select |v_#memory_int_2290| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2290| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 4 .cse0))) [2019-05-15 10:34:12,968 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:34:12,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 16 treesize of output 11 [2019-05-15 10:34:12,980 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:12,982 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:12,982 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:12,982 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:12,991 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:12,991 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2291|]. (let ((.cse0 (select |v_#memory_int_2291| ULTIMATE.start_main_p1))) (and (= .cse0 5) (= (store |v_#memory_int_2291| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:12,991 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:34: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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:13,005 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:13,006 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:13,007 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:13,007 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:13,013 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:13,013 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2292|]. (let ((.cse0 (select |v_#memory_int_2292| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2292| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 6 .cse0))) [2019-05-15 10:34:13,013 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:34:13,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:13,028 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:13,030 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:13,030 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:13,030 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:13,038 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:13,038 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2293|]. (let ((.cse0 (select |v_#memory_int_2293| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2293| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 7 .cse0))) [2019-05-15 10:34:13,038 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:34:13,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:13,053 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:13,055 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:13,055 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:13,056 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:13,062 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:13,062 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2294|]. (let ((.cse0 (select |v_#memory_int_2294| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2294| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 8 .cse0))) [2019-05-15 10:34:13,062 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:34:13,077 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:13,078 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:13,080 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:13,080 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:13,080 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:13,086 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:13,087 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2295|]. (let ((.cse0 (select |v_#memory_int_2295| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2295| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 9 .cse0))) [2019-05-15 10:34:13,087 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:34:13,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 16 treesize of output 11 [2019-05-15 10:34:13,104 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:13,106 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:13,106 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:13,106 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:13,114 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:13,114 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2296|]. (let ((.cse0 (select |v_#memory_int_2296| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2296| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 10 .cse0))) [2019-05-15 10:34:13,114 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:34:13,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 16 treesize of output 11 [2019-05-15 10:34:13,134 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:13,136 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:13,136 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:13,136 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:13,144 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:13,144 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2297|]. (let ((.cse0 (select |v_#memory_int_2297| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2297| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 11 .cse0))) [2019-05-15 10:34:13,144 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:34:13,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 16 treesize of output 11 [2019-05-15 10:34:13,164 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:13,166 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:13,166 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:13,166 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:13,173 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:13,173 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2298|]. (let ((.cse0 (select |v_#memory_int_2298| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2298| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 12))) [2019-05-15 10:34:13,173 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:34:13,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 16 treesize of output 11 [2019-05-15 10:34:13,191 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:13,193 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:13,193 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:13,194 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:13,200 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:13,200 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2299|]. (let ((.cse0 (select |v_#memory_int_2299| ULTIMATE.start_main_p1))) (and (= .cse0 13) (= (store |v_#memory_int_2299| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:13,200 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:34:13,220 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:13,221 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:13,223 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:13,223 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:13,223 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:13,232 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:13,232 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2300|]. (let ((.cse0 (select |v_#memory_int_2300| ULTIMATE.start_main_p1))) (and (= 14 .cse0) (= (store |v_#memory_int_2300| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:13,232 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:34:13,253 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:13,254 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:13,256 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:13,256 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:13,256 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:13,263 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:13,263 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2301|]. (let ((.cse0 (select |v_#memory_int_2301| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2301| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 15 .cse0))) [2019-05-15 10:34:13,263 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:34:13,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:13,286 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:13,288 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:13,288 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:13,288 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:13,296 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:13,296 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2302|]. (let ((.cse0 (select |v_#memory_int_2302| ULTIMATE.start_main_p1))) (and (= 16 .cse0) (= (store |v_#memory_int_2302| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:13,296 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:34:13,319 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:13,320 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:13,322 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:13,323 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:13,323 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:13,332 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:13,332 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2303|]. (let ((.cse0 (select |v_#memory_int_2303| ULTIMATE.start_main_p1))) (and (= 17 .cse0) (= (store |v_#memory_int_2303| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:13,332 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:34:13,357 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:13,358 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:13,360 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:13,360 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:13,360 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:13,368 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:13,368 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2304|]. (let ((.cse0 (select |v_#memory_int_2304| ULTIMATE.start_main_p1))) (and (= 18 .cse0) (= (store |v_#memory_int_2304| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:13,368 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:34:13,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:13,393 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:13,395 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:13,395 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:13,396 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:13,402 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:13,402 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2305|]. (let ((.cse0 (select |v_#memory_int_2305| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2305| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 19 .cse0))) [2019-05-15 10:34:13,402 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:34:13,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:13,429 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:13,431 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:13,432 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:13,432 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:13,439 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:13,439 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2306|]. (let ((.cse0 (select |v_#memory_int_2306| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2306| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 20 .cse0))) [2019-05-15 10:34:13,439 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:34:13,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 16 treesize of output 11 [2019-05-15 10:34:13,470 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:13,472 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:13,472 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:13,472 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:13,479 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:13,479 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2307|]. (let ((.cse0 (select |v_#memory_int_2307| ULTIMATE.start_main_p1))) (and (= 21 .cse0) (= |#memory_int| (store |v_#memory_int_2307| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:13,480 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:34:13,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 16 treesize of output 11 [2019-05-15 10:34:13,508 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:13,510 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:13,510 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:13,510 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:13,518 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:13,518 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2308|]. (let ((.cse0 (select |v_#memory_int_2308| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2308| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 22 .cse0))) [2019-05-15 10:34:13,518 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:34:13,545 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:13,546 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:13,548 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:13,548 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:13,548 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:13,556 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:13,556 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2309|]. (let ((.cse0 (select |v_#memory_int_2309| ULTIMATE.start_main_p1))) (and (= 23 .cse0) (= (store |v_#memory_int_2309| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:13,556 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:34:13,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 16 treesize of output 11 [2019-05-15 10:34:13,631 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:13,664 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:13,664 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:13,664 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:13,675 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:13,675 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2310|]. (let ((.cse0 (select |v_#memory_int_2310| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2310| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 24 .cse0))) [2019-05-15 10:34:13,675 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:34:13,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 16 treesize of output 11 [2019-05-15 10:34:13,723 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:13,725 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:13,726 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:13,726 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:13,733 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:13,733 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2311|]. (let ((.cse0 (select |v_#memory_int_2311| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2311| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 25 .cse0))) [2019-05-15 10:34:13,733 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:34:13,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 16 treesize of output 11 [2019-05-15 10:34:13,763 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:13,765 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:13,766 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:13,766 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:13,773 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:13,773 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2312|]. (let ((.cse0 (select |v_#memory_int_2312| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2312| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 26 .cse0))) [2019-05-15 10:34:13,773 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:34:13,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 16 treesize of output 11 [2019-05-15 10:34:13,803 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:13,805 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:13,806 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:13,806 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:13,814 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:13,814 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2313|]. (let ((.cse0 (select |v_#memory_int_2313| ULTIMATE.start_main_p1))) (and (= .cse0 27) (= (store |v_#memory_int_2313| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:13,814 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:34:13,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 16 treesize of output 11 [2019-05-15 10:34:13,848 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:13,849 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:13,849 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:13,849 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:13,857 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:13,857 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2314|]. (let ((.cse0 (select |v_#memory_int_2314| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2314| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 28 .cse0))) [2019-05-15 10:34:13,857 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:34:13,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:13,890 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:13,892 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:13,893 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:13,893 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:13,901 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:13,901 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2315|]. (let ((.cse0 (select |v_#memory_int_2315| ULTIMATE.start_main_p1))) (and (= 29 .cse0) (= (store |v_#memory_int_2315| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:13,901 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:34:13,933 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:13,934 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:13,936 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:13,936 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:13,936 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:13,943 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:13,943 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2316|]. (let ((.cse0 (select |v_#memory_int_2316| ULTIMATE.start_main_p1))) (and (= 30 .cse0) (= (store |v_#memory_int_2316| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:13,943 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:34: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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:13,978 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:13,980 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:13,981 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:13,981 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:13,988 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:13,988 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2317|]. (let ((.cse0 (select |v_#memory_int_2317| ULTIMATE.start_main_p1))) (and (= .cse0 31) (= |#memory_int| (store |v_#memory_int_2317| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:13,988 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:34:14,021 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:14,022 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:14,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:14,024 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:14,025 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:14,032 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:14,032 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2318|]. (let ((.cse0 (select |v_#memory_int_2318| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2318| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 32 .cse0))) [2019-05-15 10:34:14,032 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:34:14,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 16 treesize of output 11 [2019-05-15 10:34:14,068 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:14,070 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:14,070 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:14,071 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:14,078 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:14,078 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2319|]. (let ((.cse0 (select |v_#memory_int_2319| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2319| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 33 .cse0))) [2019-05-15 10:34:14,078 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:34:14,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 16 treesize of output 11 [2019-05-15 10:34:14,115 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:14,117 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:14,117 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:14,117 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:14,124 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:14,125 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2320|]. (let ((.cse0 (select |v_#memory_int_2320| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2320| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 34))) [2019-05-15 10:34:14,125 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:34:14,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 16 treesize of output 11 [2019-05-15 10:34:14,163 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:14,165 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:14,165 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:14,166 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:14,173 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:14,173 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2321|]. (let ((.cse0 (select |v_#memory_int_2321| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2321| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 35 .cse0))) [2019-05-15 10:34:14,173 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:34:14,211 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:14,212 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:14,214 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:14,214 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:14,214 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:14,222 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:14,222 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2322|]. (let ((.cse0 (select |v_#memory_int_2322| ULTIMATE.start_main_p1))) (and (= 36 .cse0) (= (store |v_#memory_int_2322| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:14,222 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:34:14,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 16 treesize of output 11 [2019-05-15 10:34:14,261 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:14,263 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:14,263 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:14,263 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:14,270 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:14,271 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2323|]. (let ((.cse0 (select |v_#memory_int_2323| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2323| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 37 .cse0))) [2019-05-15 10:34:14,271 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:34:14,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 16 treesize of output 11 [2019-05-15 10:34:14,312 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:14,314 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:14,314 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:14,314 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:14,322 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:14,322 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2324|]. (let ((.cse0 (select |v_#memory_int_2324| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2324| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 38 .cse0))) [2019-05-15 10:34:14,322 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:34:14,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:14,363 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:14,365 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:14,365 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:14,365 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:14,373 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:14,373 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2325|]. (let ((.cse0 (select |v_#memory_int_2325| ULTIMATE.start_main_p1))) (and (= 39 .cse0) (= (store |v_#memory_int_2325| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:14,373 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:34:14,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:14,413 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:14,415 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:14,416 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:14,416 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:14,424 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:14,424 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2326|]. (let ((.cse0 (select |v_#memory_int_2326| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2326| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 40 .cse0))) [2019-05-15 10:34:14,424 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:34:14,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:14,466 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:14,468 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:14,468 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:14,469 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:14,476 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:14,477 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2327|]. (let ((.cse0 (select |v_#memory_int_2327| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2327| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 41 .cse0))) [2019-05-15 10:34:14,477 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:34:14,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 16 treesize of output 11 [2019-05-15 10:34:14,519 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:14,521 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:14,521 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:14,521 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:14,529 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:14,530 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2328|]. (let ((.cse0 (select |v_#memory_int_2328| ULTIMATE.start_main_p1))) (and (= .cse0 42) (= (store |v_#memory_int_2328| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:14,530 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:34:14,573 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:14,574 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:14,576 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:14,577 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:14,577 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:14,585 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:14,585 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2329|]. (let ((.cse0 (select |v_#memory_int_2329| ULTIMATE.start_main_p1))) (and (= 43 .cse0) (= |#memory_int| (store |v_#memory_int_2329| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:14,585 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:34:14,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:14,630 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:14,632 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:14,632 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:14,633 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:14,640 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:14,640 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2330|]. (let ((.cse0 (select |v_#memory_int_2330| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2330| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 44 .cse0))) [2019-05-15 10:34:14,640 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:34:14,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:14,689 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:14,691 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:14,691 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:14,691 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:14,699 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:14,700 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2331|]. (let ((.cse0 (select |v_#memory_int_2331| ULTIMATE.start_main_p1))) (and (= 45 .cse0) (= (store |v_#memory_int_2331| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:14,700 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:34:14,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 16 treesize of output 11 [2019-05-15 10:34:14,745 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:14,747 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:14,747 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:14,747 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:14,755 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:14,755 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2332|]. (let ((.cse0 (select |v_#memory_int_2332| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2332| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 46 .cse0))) [2019-05-15 10:34:14,755 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:34:14,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:14,802 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:14,805 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:14,805 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:14,805 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:14,813 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:14,813 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2333|]. (let ((.cse0 (select |v_#memory_int_2333| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2333| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 47 .cse0))) [2019-05-15 10:34:14,813 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:34:14,863 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:14,864 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:14,866 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:14,866 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:14,866 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:14,873 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:14,874 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2334|]. (let ((.cse0 (select |v_#memory_int_2334| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2334| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 48))) [2019-05-15 10:34:14,874 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:34:14,924 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:14,925 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:14,928 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:14,928 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:14,928 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:14,936 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:14,936 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2335|]. (let ((.cse0 (select |v_#memory_int_2335| ULTIMATE.start_main_p1))) (and (= .cse0 49) (= (store |v_#memory_int_2335| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:14,936 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:34:14,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:14,997 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:14,999 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:14,999 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:14,999 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:15,007 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:15,007 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2336|]. (let ((.cse0 (select |v_#memory_int_2336| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2336| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 50 .cse0))) [2019-05-15 10:34:15,007 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:34:15,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 16 treesize of output 11 [2019-05-15 10:34:15,058 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:15,060 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:15,060 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:15,060 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:15,068 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:15,068 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2337|]. (let ((.cse0 (select |v_#memory_int_2337| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2337| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 51 .cse0))) [2019-05-15 10:34:15,068 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:34:15,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 16 treesize of output 11 [2019-05-15 10:34:15,124 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:15,126 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:15,127 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:15,127 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:15,135 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:15,135 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2338|]. (let ((.cse0 (select |v_#memory_int_2338| ULTIMATE.start_main_p1))) (and (= 52 .cse0) (= |#memory_int| (store |v_#memory_int_2338| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:15,135 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:34:15,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:15,196 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:15,198 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:15,198 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:15,198 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:15,207 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:15,207 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2339|]. (let ((.cse0 (select |v_#memory_int_2339| ULTIMATE.start_main_p1))) (and (= 53 .cse0) (= (store |v_#memory_int_2339| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:15,207 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:34:15,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 16 treesize of output 11 [2019-05-15 10:34:15,260 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:15,262 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:15,262 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:15,262 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:15,269 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:15,269 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2340|]. (let ((.cse0 (select |v_#memory_int_2340| ULTIMATE.start_main_p1))) (and (= .cse0 54) (= (store |v_#memory_int_2340| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:15,270 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:34:15,318 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:15,319 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:15,321 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:15,321 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:15,321 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:15,329 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:15,329 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2341|]. (let ((.cse0 (select |v_#memory_int_2341| ULTIMATE.start_main_p1))) (and (= .cse0 55) (= |#memory_int| (store |v_#memory_int_2341| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:15,330 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:34: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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:15,382 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:15,384 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:15,385 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:15,385 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:15,392 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:15,392 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2342|]. (let ((.cse0 (select |v_#memory_int_2342| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2342| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 56 .cse0))) [2019-05-15 10:34:15,392 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:34:15,442 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:15,443 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:15,445 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:15,445 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:15,446 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:15,453 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:15,453 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2343|]. (let ((.cse0 (select |v_#memory_int_2343| ULTIMATE.start_main_p1))) (and (= .cse0 57) (= (store |v_#memory_int_2343| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:15,453 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:34:15,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 16 treesize of output 11 [2019-05-15 10:34:15,506 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:15,508 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:15,508 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:15,508 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:15,516 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:15,516 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2344|]. (let ((.cse0 (select |v_#memory_int_2344| ULTIMATE.start_main_p1))) (and (= 58 .cse0) (= (store |v_#memory_int_2344| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:15,516 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:34:15,570 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:15,571 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:15,573 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:15,574 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:15,574 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:15,581 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:15,581 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2345|]. (let ((.cse0 (select |v_#memory_int_2345| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2345| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 59 .cse0))) [2019-05-15 10:34:15,581 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:34:15,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 16 treesize of output 11 [2019-05-15 10:34:15,638 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:15,640 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:15,640 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:15,640 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:15,648 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:15,648 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2346|]. (let ((.cse0 (select |v_#memory_int_2346| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2346| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 60))) [2019-05-15 10:34:15,648 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:34:15,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:15,704 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:15,706 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:15,706 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:15,707 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:15,714 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:15,714 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2347|]. (let ((.cse0 (select |v_#memory_int_2347| ULTIMATE.start_main_p1))) (and (= 61 .cse0) (= |#memory_int| (store |v_#memory_int_2347| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:15,714 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:34:15,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 16 treesize of output 11 [2019-05-15 10:34:15,772 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:15,774 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:15,774 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:15,774 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:15,781 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:15,781 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2348|]. (let ((.cse0 (select |v_#memory_int_2348| ULTIMATE.start_main_p1))) (and (= 62 .cse0) (= (store |v_#memory_int_2348| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:15,781 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:34:15,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:15,841 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:15,843 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:15,843 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:15,843 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:15,851 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:15,851 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2349|]. (let ((.cse0 (select |v_#memory_int_2349| ULTIMATE.start_main_p1))) (and (= 63 .cse0) (= (store |v_#memory_int_2349| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:15,852 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 64) [2019-05-15 10:34:15,909 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:15,910 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:15,912 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:15,912 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:15,913 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:15,919 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:15,919 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2350|]. (let ((.cse0 (select |v_#memory_int_2350| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2350| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 64))) [2019-05-15 10:34:15,920 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 65) [2019-05-15 10:34:15,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 16 treesize of output 11 [2019-05-15 10:34:15,980 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:15,982 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:15,982 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:15,982 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:15,990 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:15,990 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2351|]. (let ((.cse0 (select |v_#memory_int_2351| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2351| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 65))) [2019-05-15 10:34:15,990 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 66) [2019-05-15 10:34:16,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 16 treesize of output 11 [2019-05-15 10:34:16,052 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:16,054 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:16,054 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:16,054 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:16,062 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:16,063 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2352|]. (let ((.cse0 (select |v_#memory_int_2352| ULTIMATE.start_main_p1))) (and (= 66 .cse0) (= (store |v_#memory_int_2352| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:16,063 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 67) [2019-05-15 10:34:16,118 INFO L273 TraceCheckUtils]: 0: Hoare triple {20248#true} havoc main_p1; {20248#true} is VALID [2019-05-15 10:34:16,118 INFO L273 TraceCheckUtils]: 1: Hoare triple {20248#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {20248#true} is VALID [2019-05-15 10:34:16,119 INFO L273 TraceCheckUtils]: 2: Hoare triple {20248#true} #memory_int := #memory_int[main_p1 := 0]; {20259#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:34:16,120 INFO L273 TraceCheckUtils]: 3: Hoare triple {20259#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20263#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:34:16,121 INFO L273 TraceCheckUtils]: 4: Hoare triple {20263#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20267#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:34:16,121 INFO L273 TraceCheckUtils]: 5: Hoare triple {20267#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20271#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:34:16,122 INFO L273 TraceCheckUtils]: 6: Hoare triple {20271#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20275#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:34:16,123 INFO L273 TraceCheckUtils]: 7: Hoare triple {20275#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20279#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:34:16,123 INFO L273 TraceCheckUtils]: 8: Hoare triple {20279#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20283#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:34:16,124 INFO L273 TraceCheckUtils]: 9: Hoare triple {20283#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20287#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:34:16,125 INFO L273 TraceCheckUtils]: 10: Hoare triple {20287#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20291#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:34:16,126 INFO L273 TraceCheckUtils]: 11: Hoare triple {20291#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20295#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:34:16,126 INFO L273 TraceCheckUtils]: 12: Hoare triple {20295#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20299#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:34:16,127 INFO L273 TraceCheckUtils]: 13: Hoare triple {20299#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20303#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:34:16,128 INFO L273 TraceCheckUtils]: 14: Hoare triple {20303#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20307#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:34:16,129 INFO L273 TraceCheckUtils]: 15: Hoare triple {20307#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20311#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:34:16,129 INFO L273 TraceCheckUtils]: 16: Hoare triple {20311#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20315#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:34:16,130 INFO L273 TraceCheckUtils]: 17: Hoare triple {20315#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20319#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:34:16,131 INFO L273 TraceCheckUtils]: 18: Hoare triple {20319#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20323#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:34:16,132 INFO L273 TraceCheckUtils]: 19: Hoare triple {20323#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20327#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:34:16,132 INFO L273 TraceCheckUtils]: 20: Hoare triple {20327#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20331#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:34:16,133 INFO L273 TraceCheckUtils]: 21: Hoare triple {20331#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20335#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:34:16,134 INFO L273 TraceCheckUtils]: 22: Hoare triple {20335#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20339#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:34:16,135 INFO L273 TraceCheckUtils]: 23: Hoare triple {20339#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20343#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:34:16,135 INFO L273 TraceCheckUtils]: 24: Hoare triple {20343#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20347#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:34:16,136 INFO L273 TraceCheckUtils]: 25: Hoare triple {20347#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20351#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:34:16,137 INFO L273 TraceCheckUtils]: 26: Hoare triple {20351#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20355#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:34:16,138 INFO L273 TraceCheckUtils]: 27: Hoare triple {20355#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20359#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:34:16,138 INFO L273 TraceCheckUtils]: 28: Hoare triple {20359#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20363#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:34:16,139 INFO L273 TraceCheckUtils]: 29: Hoare triple {20363#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20367#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:34:16,140 INFO L273 TraceCheckUtils]: 30: Hoare triple {20367#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20371#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:34:16,141 INFO L273 TraceCheckUtils]: 31: Hoare triple {20371#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20375#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:34:16,141 INFO L273 TraceCheckUtils]: 32: Hoare triple {20375#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20379#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:34:16,142 INFO L273 TraceCheckUtils]: 33: Hoare triple {20379#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20383#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:34:16,143 INFO L273 TraceCheckUtils]: 34: Hoare triple {20383#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20387#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:34:16,144 INFO L273 TraceCheckUtils]: 35: Hoare triple {20387#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20391#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:34:16,144 INFO L273 TraceCheckUtils]: 36: Hoare triple {20391#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20395#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:34:16,145 INFO L273 TraceCheckUtils]: 37: Hoare triple {20395#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20399#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:34:16,146 INFO L273 TraceCheckUtils]: 38: Hoare triple {20399#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20403#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:34:16,147 INFO L273 TraceCheckUtils]: 39: Hoare triple {20403#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20407#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:34:16,147 INFO L273 TraceCheckUtils]: 40: Hoare triple {20407#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20411#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:34:16,148 INFO L273 TraceCheckUtils]: 41: Hoare triple {20411#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20415#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:34:16,149 INFO L273 TraceCheckUtils]: 42: Hoare triple {20415#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20419#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:34:16,150 INFO L273 TraceCheckUtils]: 43: Hoare triple {20419#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20423#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:34:16,150 INFO L273 TraceCheckUtils]: 44: Hoare triple {20423#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20427#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:34:16,151 INFO L273 TraceCheckUtils]: 45: Hoare triple {20427#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20431#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:34:16,152 INFO L273 TraceCheckUtils]: 46: Hoare triple {20431#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20435#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:34:16,153 INFO L273 TraceCheckUtils]: 47: Hoare triple {20435#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20439#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:34:16,153 INFO L273 TraceCheckUtils]: 48: Hoare triple {20439#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20443#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:34:16,154 INFO L273 TraceCheckUtils]: 49: Hoare triple {20443#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20447#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:34:16,155 INFO L273 TraceCheckUtils]: 50: Hoare triple {20447#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20451#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:34:16,156 INFO L273 TraceCheckUtils]: 51: Hoare triple {20451#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20455#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:34:16,156 INFO L273 TraceCheckUtils]: 52: Hoare triple {20455#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20459#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:34:16,157 INFO L273 TraceCheckUtils]: 53: Hoare triple {20459#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20463#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:34:16,158 INFO L273 TraceCheckUtils]: 54: Hoare triple {20463#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20467#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:34:16,159 INFO L273 TraceCheckUtils]: 55: Hoare triple {20467#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20471#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:34:16,159 INFO L273 TraceCheckUtils]: 56: Hoare triple {20471#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20475#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:34:16,160 INFO L273 TraceCheckUtils]: 57: Hoare triple {20475#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20479#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:34:16,161 INFO L273 TraceCheckUtils]: 58: Hoare triple {20479#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20483#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:34:16,162 INFO L273 TraceCheckUtils]: 59: Hoare triple {20483#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20487#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:34:16,162 INFO L273 TraceCheckUtils]: 60: Hoare triple {20487#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20491#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:34:16,163 INFO L273 TraceCheckUtils]: 61: Hoare triple {20491#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20495#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:34:16,164 INFO L273 TraceCheckUtils]: 62: Hoare triple {20495#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20499#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:34:16,165 INFO L273 TraceCheckUtils]: 63: Hoare triple {20499#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20503#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:34:16,165 INFO L273 TraceCheckUtils]: 64: Hoare triple {20503#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20507#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:34:16,166 INFO L273 TraceCheckUtils]: 65: Hoare triple {20507#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20511#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:34:16,167 INFO L273 TraceCheckUtils]: 66: Hoare triple {20511#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20515#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} is VALID [2019-05-15 10:34:16,168 INFO L273 TraceCheckUtils]: 67: Hoare triple {20515#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20519#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} is VALID [2019-05-15 10:34:16,168 INFO L273 TraceCheckUtils]: 68: Hoare triple {20519#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20523#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} is VALID [2019-05-15 10:34:16,169 INFO L273 TraceCheckUtils]: 69: Hoare triple {20523#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20527#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} is VALID [2019-05-15 10:34:16,170 INFO L273 TraceCheckUtils]: 70: Hoare triple {20527#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} assume !(#memory_int[main_p1] >= 0); {20249#false} is VALID [2019-05-15 10:34:16,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:34:16,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:34:16,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-05-15 10:34:16,179 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 71 [2019-05-15 10:34:16,179 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:34:16,179 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 70 states. [2019-05-15 10:34:16,234 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:34:16,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-05-15 10:34:16,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-05-15 10:34:16,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-05-15 10:34:16,235 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 70 states. [2019-05-15 10:34:25,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:34:25,679 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-05-15 10:34:25,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-05-15 10:34:25,679 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 71 [2019-05-15 10:34:25,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:34:25,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-05-15 10:34:25,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2019-05-15 10:34:25,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-05-15 10:34:25,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2019-05-15 10:34:25,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 70 states and 74 transitions. [2019-05-15 10:34:25,738 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:25,739 INFO L225 Difference]: With dead ends: 73 [2019-05-15 10:34:25,740 INFO L226 Difference]: Without dead ends: 73 [2019-05-15 10:34:25,740 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-05-15 10:34:25,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-05-15 10:34:25,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-05-15 10:34:25,741 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:34:25,742 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 73 states. [2019-05-15 10:34:25,742 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 73 states. [2019-05-15 10:34:25,742 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 73 states. [2019-05-15 10:34:25,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:34:25,742 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-05-15 10:34:25,743 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-05-15 10:34:25,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:34:25,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:34:25,743 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 73 states. [2019-05-15 10:34:25,743 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 73 states. [2019-05-15 10:34:25,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:34:25,744 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-05-15 10:34:25,744 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-05-15 10:34:25,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:34:25,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:34:25,744 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:34:25,744 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:34:25,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-05-15 10:34:25,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-05-15 10:34:25,745 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-05-15 10:34:25,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:34:25,745 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-05-15 10:34:25,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-05-15 10:34:25,745 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-05-15 10:34:25,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-05-15 10:34:25,745 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:34:25,745 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1, 1] [2019-05-15 10:34:25,746 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:34:25,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:34:25,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1519100424, now seen corresponding path program 68 times [2019-05-15 10:34:25,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:34:25,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:34:25,782 WARN L254 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 70 conjunts are in the unsatisfiable core [2019-05-15 10:34:25,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:34:25,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:34:25,835 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:25,835 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:25,837 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:25,837 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:25,837 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:34:25,839 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:25,840 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2353|]. (= |#memory_int| (store |v_#memory_int_2353| ULTIMATE.start_main_p1 0)) [2019-05-15 10:34:25,840 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:34:25,849 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:25,850 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:25,852 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:25,852 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:25,852 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:25,859 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:25,860 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2354|]. (let ((.cse0 (select |v_#memory_int_2354| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2354| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 0))) [2019-05-15 10:34:25,860 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:34:25,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 16 treesize of output 11 [2019-05-15 10:34:25,870 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:25,872 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:25,872 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:25,873 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:25,880 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:25,880 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2355|]. (let ((.cse0 (select |v_#memory_int_2355| ULTIMATE.start_main_p1))) (and (= 1 .cse0) (= |#memory_int| (store |v_#memory_int_2355| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:25,880 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:34:25,890 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:25,891 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:25,893 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:25,893 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:25,894 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:25,901 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:25,901 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2356|]. (let ((.cse0 (select |v_#memory_int_2356| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2356| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 2))) [2019-05-15 10:34:25,901 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:34:25,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 16 treesize of output 11 [2019-05-15 10:34:25,913 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:25,915 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:25,916 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:25,916 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:25,922 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:25,923 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2357|]. (let ((.cse0 (select |v_#memory_int_2357| ULTIMATE.start_main_p1))) (and (= .cse0 3) (= (store |v_#memory_int_2357| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:25,923 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:34:25,934 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:25,935 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:25,937 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:25,937 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:25,937 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:25,944 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:25,944 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2358|]. (let ((.cse0 (select |v_#memory_int_2358| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2358| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 4))) [2019-05-15 10:34:25,944 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:34:25,956 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:25,957 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:25,959 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:25,959 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:25,959 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:25,967 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:25,967 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2359|]. (let ((.cse0 (select |v_#memory_int_2359| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2359| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 5 .cse0))) [2019-05-15 10:34:25,967 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:34:25,980 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:25,981 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:25,983 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:25,983 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:25,983 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:25,990 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:25,991 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2360|]. (let ((.cse0 (select |v_#memory_int_2360| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2360| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 6))) [2019-05-15 10:34:25,991 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:34:26,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:26,005 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:26,007 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:26,007 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:26,007 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:26,013 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:26,013 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2361|]. (let ((.cse0 (select |v_#memory_int_2361| ULTIMATE.start_main_p1))) (and (= .cse0 7) (= (store |v_#memory_int_2361| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:26,014 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:34:26,029 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:26,030 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:26,032 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:26,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:26,032 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:26,039 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:26,039 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2362|]. (let ((.cse0 (select |v_#memory_int_2362| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2362| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 8))) [2019-05-15 10:34:26,040 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:34:26,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:26,055 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:26,056 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:26,057 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:26,057 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:26,063 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:26,063 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2363|]. (let ((.cse0 (select |v_#memory_int_2363| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2363| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 9 .cse0))) [2019-05-15 10:34:26,063 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:34:26,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:26,081 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:26,082 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:26,083 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:26,083 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:26,090 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:26,090 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2364|]. (let ((.cse0 (select |v_#memory_int_2364| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2364| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 10 .cse0))) [2019-05-15 10:34:26,090 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:34:26,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 16 treesize of output 11 [2019-05-15 10:34:26,108 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:26,110 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:26,111 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:26,111 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:26,117 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:26,118 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2365|]. (let ((.cse0 (select |v_#memory_int_2365| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2365| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 11))) [2019-05-15 10:34:26,118 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:34:26,135 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:26,136 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:26,138 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:26,138 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:26,138 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:26,145 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:26,145 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2366|]. (let ((.cse0 (select |v_#memory_int_2366| ULTIMATE.start_main_p1))) (and (= .cse0 12) (= (store |v_#memory_int_2366| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:26,145 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:34:26,164 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:26,165 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:26,167 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:26,168 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:26,168 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:26,176 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:26,176 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2367|]. (let ((.cse0 (select |v_#memory_int_2367| ULTIMATE.start_main_p1))) (and (= 13 .cse0) (= (store |v_#memory_int_2367| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:26,176 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:34:26,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 16 treesize of output 11 [2019-05-15 10:34:26,198 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:26,200 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:26,201 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:26,201 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:26,209 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:26,209 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2368|]. (let ((.cse0 (select |v_#memory_int_2368| ULTIMATE.start_main_p1))) (and (= 14 .cse0) (= |#memory_int| (store |v_#memory_int_2368| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:26,209 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:34:26,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 16 treesize of output 11 [2019-05-15 10:34:26,229 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:26,231 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:26,231 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:26,231 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:26,238 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:26,238 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2369|]. (let ((.cse0 (select |v_#memory_int_2369| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2369| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 15))) [2019-05-15 10:34:26,239 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:34:26,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 16 treesize of output 11 [2019-05-15 10:34:26,260 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:26,262 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:26,262 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:26,263 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:26,269 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:26,270 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2370|]. (let ((.cse0 (select |v_#memory_int_2370| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2370| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 16))) [2019-05-15 10:34:26,270 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:34:26,293 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:26,294 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:26,296 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:26,296 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:26,296 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:26,303 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:26,303 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2371|]. (let ((.cse0 (select |v_#memory_int_2371| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2371| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 17 .cse0))) [2019-05-15 10:34:26,303 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:34:26,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 16 treesize of output 11 [2019-05-15 10:34:26,346 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:26,355 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:26,356 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:26,356 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:26,361 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:26,361 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2372|]. (let ((.cse0 (select |v_#memory_int_2372| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2372| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 18))) [2019-05-15 10:34:26,361 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:34:26,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 16 treesize of output 11 [2019-05-15 10:34:26,386 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:26,388 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:26,388 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:26,388 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:26,395 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:26,395 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2373|]. (let ((.cse0 (select |v_#memory_int_2373| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2373| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 19 .cse0))) [2019-05-15 10:34:26,395 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:34:26,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:26,420 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:26,422 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:26,422 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:26,422 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:26,429 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:26,429 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2374|]. (let ((.cse0 (select |v_#memory_int_2374| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2374| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 20 .cse0))) [2019-05-15 10:34:26,429 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:34:26,454 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:26,455 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:26,457 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:26,457 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:26,458 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:26,465 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:26,465 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2375|]. (let ((.cse0 (select |v_#memory_int_2375| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2375| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 21))) [2019-05-15 10:34:26,465 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:34:26,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:26,491 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:26,493 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:26,493 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:26,494 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:26,501 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:26,501 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2376|]. (let ((.cse0 (select |v_#memory_int_2376| ULTIMATE.start_main_p1))) (and (= 22 .cse0) (= |#memory_int| (store |v_#memory_int_2376| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:26,501 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:34:26,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:26,529 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:26,531 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:26,531 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:26,531 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:26,539 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:26,539 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2377|]. (let ((.cse0 (select |v_#memory_int_2377| ULTIMATE.start_main_p1))) (and (= 23 .cse0) (= (store |v_#memory_int_2377| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:26,539 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:34:26,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:26,656 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:26,658 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:26,658 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:26,658 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:26,664 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:26,664 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2378|]. (let ((.cse0 (select |v_#memory_int_2378| ULTIMATE.start_main_p1))) (and (= 24 .cse0) (= (store |v_#memory_int_2378| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:26,664 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:34:26,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 16 treesize of output 11 [2019-05-15 10:34:26,694 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:26,696 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:26,696 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:26,696 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:26,703 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:26,704 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2379|]. (let ((.cse0 (select |v_#memory_int_2379| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2379| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 25))) [2019-05-15 10:34:26,704 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:34:26,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:26,735 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:26,737 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:26,737 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:26,737 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:26,745 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:26,745 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2380|]. (let ((.cse0 (select |v_#memory_int_2380| ULTIMATE.start_main_p1))) (and (= 26 .cse0) (= (store |v_#memory_int_2380| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:26,745 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:34:26,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 16 treesize of output 11 [2019-05-15 10:34:26,776 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:26,778 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:26,778 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:26,778 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:26,787 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:26,787 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2381|]. (let ((.cse0 (select |v_#memory_int_2381| ULTIMATE.start_main_p1))) (and (= 27 .cse0) (= (store |v_#memory_int_2381| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:26,787 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:34:26,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:26,821 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:26,823 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:26,823 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:26,823 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:26,831 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:26,831 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2382|]. (let ((.cse0 (select |v_#memory_int_2382| ULTIMATE.start_main_p1))) (and (= 28 .cse0) (= (store |v_#memory_int_2382| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:26,831 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:34:26,863 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:26,864 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:26,866 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:26,866 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:26,866 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:26,873 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:26,874 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2383|]. (let ((.cse0 (select |v_#memory_int_2383| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2383| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 29))) [2019-05-15 10:34:26,874 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:34:26,906 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:26,907 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:26,909 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:26,909 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:26,909 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:26,917 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:26,917 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2384|]. (let ((.cse0 (select |v_#memory_int_2384| ULTIMATE.start_main_p1))) (and (= .cse0 30) (= (store |v_#memory_int_2384| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:26,917 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:34:26,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 16 treesize of output 11 [2019-05-15 10:34:26,951 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:26,953 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:26,953 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:26,953 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:26,960 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:26,960 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2385|]. (let ((.cse0 (select |v_#memory_int_2385| ULTIMATE.start_main_p1))) (and (= 31 .cse0) (= (store |v_#memory_int_2385| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:26,961 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:34:26,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 16 treesize of output 11 [2019-05-15 10:34:26,995 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:26,997 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:26,997 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:26,997 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:27,004 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:27,004 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2386|]. (let ((.cse0 (select |v_#memory_int_2386| ULTIMATE.start_main_p1))) (and (= 32 .cse0) (= (store |v_#memory_int_2386| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:27,004 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:34:27,038 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:27,039 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:27,042 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:27,042 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,042 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:27,049 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:27,049 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2387|]. (let ((.cse0 (select |v_#memory_int_2387| ULTIMATE.start_main_p1))) (and (= 33 .cse0) (= (store |v_#memory_int_2387| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:27,050 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:34:27,086 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:27,087 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:27,089 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:27,089 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,089 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:27,096 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:27,096 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2388|]. (let ((.cse0 (select |v_#memory_int_2388| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2388| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 34 .cse0))) [2019-05-15 10:34:27,097 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:34:27,132 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:27,133 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:27,135 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:27,136 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,136 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:27,144 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:27,144 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2389|]. (let ((.cse0 (select |v_#memory_int_2389| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2389| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 35))) [2019-05-15 10:34:27,144 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:34:27,181 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:27,182 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:27,185 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:27,185 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,185 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:27,193 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:27,193 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2390|]. (let ((.cse0 (select |v_#memory_int_2390| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2390| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 36 .cse0))) [2019-05-15 10:34:27,193 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:34:27,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 16 treesize of output 11 [2019-05-15 10:34:27,230 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:27,233 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:27,233 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,233 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:27,241 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:27,241 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2391|]. (let ((.cse0 (select |v_#memory_int_2391| ULTIMATE.start_main_p1))) (and (= 37 .cse0) (= |#memory_int| (store |v_#memory_int_2391| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:27,241 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:34:27,280 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:27,281 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:27,282 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:27,282 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,282 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:27,289 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:27,289 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2392|]. (let ((.cse0 (select |v_#memory_int_2392| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2392| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 38))) [2019-05-15 10:34:27,289 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:34: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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:27,330 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:27,332 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:27,332 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,332 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:27,340 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:27,340 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2393|]. (let ((.cse0 (select |v_#memory_int_2393| ULTIMATE.start_main_p1))) (and (= 39 .cse0) (= (store |v_#memory_int_2393| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:27,340 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:34:27,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:27,382 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:27,384 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:27,384 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,384 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:27,392 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:27,392 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2394|]. (let ((.cse0 (select |v_#memory_int_2394| ULTIMATE.start_main_p1))) (and (= .cse0 40) (= (store |v_#memory_int_2394| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:27,392 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:34:27,444 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:27,444 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:27,446 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:27,446 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,446 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:27,453 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:27,454 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2395|]. (let ((.cse0 (select |v_#memory_int_2395| ULTIMATE.start_main_p1))) (and (= .cse0 41) (= (store |v_#memory_int_2395| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:27,454 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:34:27,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 16 treesize of output 11 [2019-05-15 10:34:27,493 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:27,495 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:27,495 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,495 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:27,502 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:27,502 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2396|]. (let ((.cse0 (select |v_#memory_int_2396| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2396| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 42))) [2019-05-15 10:34:27,502 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:34:27,541 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:27,542 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:27,543 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:27,544 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,544 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:27,551 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:27,551 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2397|]. (let ((.cse0 (select |v_#memory_int_2397| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2397| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 43 .cse0))) [2019-05-15 10:34:27,551 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:34:27,593 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:27,594 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:27,596 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:27,596 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,596 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:27,604 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:27,604 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2398|]. (let ((.cse0 (select |v_#memory_int_2398| ULTIMATE.start_main_p1))) (and (= 44 .cse0) (= (store |v_#memory_int_2398| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:27,604 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:34:27,647 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:27,648 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:27,650 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:27,650 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,651 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:27,658 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:27,658 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2399|]. (let ((.cse0 (select |v_#memory_int_2399| ULTIMATE.start_main_p1))) (and (= 45 .cse0) (= (store |v_#memory_int_2399| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:27,659 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:34: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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:27,702 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:27,704 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:27,704 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,705 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:27,713 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:27,713 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2400|]. (let ((.cse0 (select |v_#memory_int_2400| ULTIMATE.start_main_p1))) (and (= 46 .cse0) (= (store |v_#memory_int_2400| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:27,713 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:34:27,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:27,759 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:27,761 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:27,761 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,762 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:27,768 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:27,769 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2401|]. (let ((.cse0 (select |v_#memory_int_2401| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2401| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 47 .cse0))) [2019-05-15 10:34:27,769 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:34:27,813 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:27,814 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:27,816 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:27,816 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,816 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:27,824 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:27,824 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2402|]. (let ((.cse0 (select |v_#memory_int_2402| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2402| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 48))) [2019-05-15 10:34:27,824 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:34:27,871 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:27,871 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:27,873 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:27,874 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,874 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:27,883 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:27,883 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2403|]. (let ((.cse0 (select |v_#memory_int_2403| ULTIMATE.start_main_p1))) (and (= 49 .cse0) (= (store |v_#memory_int_2403| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:27,883 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:34:27,929 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:27,930 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:27,932 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:27,932 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,933 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:27,940 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:27,940 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2404|]. (let ((.cse0 (select |v_#memory_int_2404| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2404| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 50))) [2019-05-15 10:34:27,940 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:34:27,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 16 treesize of output 11 [2019-05-15 10:34:27,988 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:27,990 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:27,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:27,990 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:27,998 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:27,998 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2405|]. (let ((.cse0 (select |v_#memory_int_2405| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2405| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 51))) [2019-05-15 10:34:27,998 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:34:28,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:28,048 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:28,050 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:28,050 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:28,050 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:28,057 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:28,058 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2406|]. (let ((.cse0 (select |v_#memory_int_2406| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2406| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 52 .cse0))) [2019-05-15 10:34:28,058 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:34:28,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 16 treesize of output 11 [2019-05-15 10:34:28,109 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:28,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:28,112 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:28,112 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:28,119 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:28,119 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2407|]. (let ((.cse0 (select |v_#memory_int_2407| ULTIMATE.start_main_p1))) (and (= 53 .cse0) (= (store |v_#memory_int_2407| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:28,120 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:34:28,168 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:28,169 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:28,171 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:28,172 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:28,172 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:28,180 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:28,180 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2408|]. (let ((.cse0 (select |v_#memory_int_2408| ULTIMATE.start_main_p1))) (and (= 54 .cse0) (= |#memory_int| (store |v_#memory_int_2408| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:28,180 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:34:28,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:28,233 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:28,235 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:28,235 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:28,236 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:28,243 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:28,243 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2409|]. (let ((.cse0 (select |v_#memory_int_2409| ULTIMATE.start_main_p1))) (and (= .cse0 55) (= |#memory_int| (store |v_#memory_int_2409| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:28,243 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:34:28,300 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:28,301 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:28,303 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:28,303 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:28,304 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:28,310 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:28,310 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2410|]. (let ((.cse0 (select |v_#memory_int_2410| ULTIMATE.start_main_p1))) (and (= .cse0 56) (= (store |v_#memory_int_2410| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:28,310 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:34:28,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:28,363 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:28,365 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:28,365 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:28,365 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:28,373 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:28,373 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2411|]. (let ((.cse0 (select |v_#memory_int_2411| ULTIMATE.start_main_p1))) (and (= .cse0 57) (= (store |v_#memory_int_2411| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:28,373 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:34:28,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 16 treesize of output 11 [2019-05-15 10:34:28,427 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:28,428 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:28,428 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:28,428 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:28,436 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:28,436 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2412|]. (let ((.cse0 (select |v_#memory_int_2412| ULTIMATE.start_main_p1))) (and (= .cse0 58) (= (store |v_#memory_int_2412| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:28,436 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:34:28,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 16 treesize of output 11 [2019-05-15 10:34:28,489 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:28,491 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:28,492 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:28,492 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:28,499 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:28,499 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2413|]. (let ((.cse0 (select |v_#memory_int_2413| ULTIMATE.start_main_p1))) (and (= 59 .cse0) (= (store |v_#memory_int_2413| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:28,500 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:34:28,554 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:28,555 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:28,557 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:28,557 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:28,558 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:28,567 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:28,567 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2414|]. (let ((.cse0 (select |v_#memory_int_2414| ULTIMATE.start_main_p1))) (and (= 60 .cse0) (= (store |v_#memory_int_2414| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:28,568 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:34:28,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:28,624 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:28,626 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:28,627 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:28,627 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:28,635 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:28,635 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2415|]. (let ((.cse0 (select |v_#memory_int_2415| ULTIMATE.start_main_p1))) (and (= 61 .cse0) (= (store |v_#memory_int_2415| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:28,635 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:34:28,691 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:28,692 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:28,694 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:28,694 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:28,695 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:28,703 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:28,703 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2416|]. (let ((.cse0 (select |v_#memory_int_2416| ULTIMATE.start_main_p1))) (and (= 62 .cse0) (= |#memory_int| (store |v_#memory_int_2416| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:28,703 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:34:28,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 16 treesize of output 11 [2019-05-15 10:34:28,760 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:28,762 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:28,762 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:28,763 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:28,770 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:28,770 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2417|]. (let ((.cse0 (select |v_#memory_int_2417| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2417| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 63 .cse0))) [2019-05-15 10:34:28,770 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 64) [2019-05-15 10:34:28,831 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:28,832 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:28,834 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:28,835 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:28,835 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:28,843 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:28,843 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2418|]. (let ((.cse0 (select |v_#memory_int_2418| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2418| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 64 .cse0))) [2019-05-15 10:34:28,843 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 65) [2019-05-15 10:34: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 16 treesize of output 11 [2019-05-15 10:34:28,902 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:28,904 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:28,904 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:28,904 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:28,912 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:28,912 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2419|]. (let ((.cse0 (select |v_#memory_int_2419| ULTIMATE.start_main_p1))) (and (= 65 .cse0) (= (store |v_#memory_int_2419| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:28,912 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 66) [2019-05-15 10:34:28,972 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:28,973 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:28,975 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:28,975 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:28,976 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:28,983 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:28,983 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2420|]. (let ((.cse0 (select |v_#memory_int_2420| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2420| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 66 .cse0))) [2019-05-15 10:34:28,983 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 67) [2019-05-15 10:34:29,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 16 treesize of output 11 [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,048 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:29,048 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:29,048 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:29,056 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:29,056 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2421|]. (let ((.cse0 (select |v_#memory_int_2421| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2421| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 67 .cse0))) [2019-05-15 10:34:29,056 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 68) [2019-05-15 10:34:29,114 INFO L273 TraceCheckUtils]: 0: Hoare triple {20822#true} havoc main_p1; {20822#true} is VALID [2019-05-15 10:34:29,114 INFO L273 TraceCheckUtils]: 1: Hoare triple {20822#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {20822#true} is VALID [2019-05-15 10:34:29,115 INFO L273 TraceCheckUtils]: 2: Hoare triple {20822#true} #memory_int := #memory_int[main_p1 := 0]; {20833#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:34:29,116 INFO L273 TraceCheckUtils]: 3: Hoare triple {20833#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20837#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:34:29,117 INFO L273 TraceCheckUtils]: 4: Hoare triple {20837#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20841#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:34:29,117 INFO L273 TraceCheckUtils]: 5: Hoare triple {20841#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20845#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:34:29,118 INFO L273 TraceCheckUtils]: 6: Hoare triple {20845#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20849#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:34:29,119 INFO L273 TraceCheckUtils]: 7: Hoare triple {20849#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20853#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:34:29,120 INFO L273 TraceCheckUtils]: 8: Hoare triple {20853#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20857#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:34:29,120 INFO L273 TraceCheckUtils]: 9: Hoare triple {20857#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20861#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:34:29,121 INFO L273 TraceCheckUtils]: 10: Hoare triple {20861#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20865#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:34:29,122 INFO L273 TraceCheckUtils]: 11: Hoare triple {20865#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20869#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:34:29,123 INFO L273 TraceCheckUtils]: 12: Hoare triple {20869#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20873#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:34:29,123 INFO L273 TraceCheckUtils]: 13: Hoare triple {20873#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20877#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:34:29,124 INFO L273 TraceCheckUtils]: 14: Hoare triple {20877#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20881#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:34:29,125 INFO L273 TraceCheckUtils]: 15: Hoare triple {20881#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20885#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:34:29,126 INFO L273 TraceCheckUtils]: 16: Hoare triple {20885#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20889#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:34:29,126 INFO L273 TraceCheckUtils]: 17: Hoare triple {20889#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20893#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:34:29,127 INFO L273 TraceCheckUtils]: 18: Hoare triple {20893#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20897#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:34:29,128 INFO L273 TraceCheckUtils]: 19: Hoare triple {20897#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20901#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:34:29,129 INFO L273 TraceCheckUtils]: 20: Hoare triple {20901#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20905#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:34:29,129 INFO L273 TraceCheckUtils]: 21: Hoare triple {20905#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20909#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:34:29,130 INFO L273 TraceCheckUtils]: 22: Hoare triple {20909#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20913#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:34:29,131 INFO L273 TraceCheckUtils]: 23: Hoare triple {20913#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20917#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:34:29,132 INFO L273 TraceCheckUtils]: 24: Hoare triple {20917#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20921#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:34:29,132 INFO L273 TraceCheckUtils]: 25: Hoare triple {20921#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20925#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:34:29,133 INFO L273 TraceCheckUtils]: 26: Hoare triple {20925#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20929#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:34:29,134 INFO L273 TraceCheckUtils]: 27: Hoare triple {20929#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20933#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:34:29,135 INFO L273 TraceCheckUtils]: 28: Hoare triple {20933#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20937#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:34:29,135 INFO L273 TraceCheckUtils]: 29: Hoare triple {20937#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20941#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:34:29,136 INFO L273 TraceCheckUtils]: 30: Hoare triple {20941#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20945#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:34:29,137 INFO L273 TraceCheckUtils]: 31: Hoare triple {20945#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20949#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:34:29,138 INFO L273 TraceCheckUtils]: 32: Hoare triple {20949#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20953#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:34:29,138 INFO L273 TraceCheckUtils]: 33: Hoare triple {20953#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20957#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:34:29,139 INFO L273 TraceCheckUtils]: 34: Hoare triple {20957#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20961#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:34:29,140 INFO L273 TraceCheckUtils]: 35: Hoare triple {20961#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20965#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:34:29,141 INFO L273 TraceCheckUtils]: 36: Hoare triple {20965#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20969#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:34:29,141 INFO L273 TraceCheckUtils]: 37: Hoare triple {20969#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20973#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:34:29,142 INFO L273 TraceCheckUtils]: 38: Hoare triple {20973#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20977#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:34:29,143 INFO L273 TraceCheckUtils]: 39: Hoare triple {20977#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20981#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:34:29,144 INFO L273 TraceCheckUtils]: 40: Hoare triple {20981#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20985#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:34:29,144 INFO L273 TraceCheckUtils]: 41: Hoare triple {20985#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20989#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:34:29,145 INFO L273 TraceCheckUtils]: 42: Hoare triple {20989#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20993#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:34:29,146 INFO L273 TraceCheckUtils]: 43: Hoare triple {20993#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20997#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:34:29,147 INFO L273 TraceCheckUtils]: 44: Hoare triple {20997#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21001#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:34:29,147 INFO L273 TraceCheckUtils]: 45: Hoare triple {21001#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21005#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:34:29,148 INFO L273 TraceCheckUtils]: 46: Hoare triple {21005#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21009#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:34:29,149 INFO L273 TraceCheckUtils]: 47: Hoare triple {21009#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21013#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:34:29,150 INFO L273 TraceCheckUtils]: 48: Hoare triple {21013#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21017#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:34:29,150 INFO L273 TraceCheckUtils]: 49: Hoare triple {21017#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21021#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:34:29,151 INFO L273 TraceCheckUtils]: 50: Hoare triple {21021#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21025#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:34:29,152 INFO L273 TraceCheckUtils]: 51: Hoare triple {21025#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21029#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:34:29,153 INFO L273 TraceCheckUtils]: 52: Hoare triple {21029#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21033#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:34:29,153 INFO L273 TraceCheckUtils]: 53: Hoare triple {21033#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21037#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:34:29,154 INFO L273 TraceCheckUtils]: 54: Hoare triple {21037#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21041#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:34:29,155 INFO L273 TraceCheckUtils]: 55: Hoare triple {21041#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21045#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:34:29,156 INFO L273 TraceCheckUtils]: 56: Hoare triple {21045#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21049#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:34:29,156 INFO L273 TraceCheckUtils]: 57: Hoare triple {21049#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21053#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:34:29,157 INFO L273 TraceCheckUtils]: 58: Hoare triple {21053#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21057#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:34:29,158 INFO L273 TraceCheckUtils]: 59: Hoare triple {21057#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21061#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:34:29,159 INFO L273 TraceCheckUtils]: 60: Hoare triple {21061#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21065#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:34:29,159 INFO L273 TraceCheckUtils]: 61: Hoare triple {21065#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21069#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:34:29,160 INFO L273 TraceCheckUtils]: 62: Hoare triple {21069#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21073#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:34:29,161 INFO L273 TraceCheckUtils]: 63: Hoare triple {21073#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21077#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:34:29,162 INFO L273 TraceCheckUtils]: 64: Hoare triple {21077#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21081#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:34:29,162 INFO L273 TraceCheckUtils]: 65: Hoare triple {21081#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21085#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:34:29,163 INFO L273 TraceCheckUtils]: 66: Hoare triple {21085#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21089#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} is VALID [2019-05-15 10:34:29,164 INFO L273 TraceCheckUtils]: 67: Hoare triple {21089#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21093#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} is VALID [2019-05-15 10:34:29,165 INFO L273 TraceCheckUtils]: 68: Hoare triple {21093#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21097#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} is VALID [2019-05-15 10:34:29,165 INFO L273 TraceCheckUtils]: 69: Hoare triple {21097#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21101#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} is VALID [2019-05-15 10:34:29,181 INFO L273 TraceCheckUtils]: 70: Hoare triple {21101#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21105#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} is VALID [2019-05-15 10:34:29,181 INFO L273 TraceCheckUtils]: 71: Hoare triple {21105#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} assume !(#memory_int[main_p1] >= 0); {20823#false} is VALID [2019-05-15 10:34:29,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:34:29,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:34:29,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-05-15 10:34:29,188 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 72 [2019-05-15 10:34:29,188 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:34:29,188 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 71 states. [2019-05-15 10:34:29,249 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:34:29,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-05-15 10:34:29,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-05-15 10:34:29,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-05-15 10:34:29,250 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 71 states. [2019-05-15 10:34:38,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:34:38,997 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-05-15 10:34:38,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-05-15 10:34:38,997 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 72 [2019-05-15 10:34:38,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:34:38,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-05-15 10:34:38,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2019-05-15 10:34:38,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-05-15 10:34:38,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2019-05-15 10:34:38,999 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 71 states and 75 transitions. [2019-05-15 10:34:39,145 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:34:39,146 INFO L225 Difference]: With dead ends: 74 [2019-05-15 10:34:39,146 INFO L226 Difference]: Without dead ends: 74 [2019-05-15 10:34:39,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-05-15 10:34:39,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-05-15 10:34:39,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-05-15 10:34:39,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:34:39,149 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 74 states. [2019-05-15 10:34:39,149 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 74 states. [2019-05-15 10:34:39,149 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 74 states. [2019-05-15 10:34:39,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:34:39,151 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-05-15 10:34:39,151 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-05-15 10:34:39,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:34:39,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:34:39,151 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 74 states. [2019-05-15 10:34:39,151 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 74 states. [2019-05-15 10:34:39,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:34:39,152 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-05-15 10:34:39,152 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-05-15 10:34:39,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:34:39,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:34:39,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:34:39,153 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:34:39,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-05-15 10:34:39,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-05-15 10:34:39,154 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-05-15 10:34:39,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:34:39,154 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-05-15 10:34:39,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-05-15 10:34:39,154 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-05-15 10:34:39,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-05-15 10:34:39,155 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:34:39,155 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1, 1] [2019-05-15 10:34:39,155 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:34:39,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:34:39,155 INFO L82 PathProgramCache]: Analyzing trace with hash -152527166, now seen corresponding path program 69 times [2019-05-15 10:34:39,156 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:34:39,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:34:39,192 WARN L254 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 71 conjunts are in the unsatisfiable core [2019-05-15 10:34:39,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:34:39,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:34:39,368 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:39,368 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:39,406 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:39,406 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:39,406 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:34:39,415 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:39,415 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2422|]. (= |#memory_int| (store |v_#memory_int_2422| ULTIMATE.start_main_p1 0)) [2019-05-15 10:34:39,416 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:34:39,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 16 treesize of output 11 [2019-05-15 10:34:39,487 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:39,489 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:39,490 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:39,490 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:39,497 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:39,498 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2423|]. (let ((.cse0 (select |v_#memory_int_2423| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2423| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 0))) [2019-05-15 10:34:39,498 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:34:39,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:39,509 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:39,511 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:39,511 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:39,511 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:39,518 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:39,518 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2424|]. (let ((.cse0 (select |v_#memory_int_2424| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2424| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 1))) [2019-05-15 10:34:39,518 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:34:39,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 16 treesize of output 11 [2019-05-15 10:34:39,530 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:39,532 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:39,533 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:39,533 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:39,540 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:39,540 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2425|]. (let ((.cse0 (select |v_#memory_int_2425| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2425| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 2 .cse0))) [2019-05-15 10:34:39,540 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:34:39,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 16 treesize of output 11 [2019-05-15 10:34:39,552 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:39,554 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:39,554 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:39,554 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:39,561 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:39,561 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2426|]. (let ((.cse0 (select |v_#memory_int_2426| ULTIMATE.start_main_p1))) (and (= 3 .cse0) (= |#memory_int| (store |v_#memory_int_2426| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:39,561 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:34:39,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:39,575 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:39,577 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:39,577 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:39,577 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:39,585 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:39,585 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2427|]. (let ((.cse0 (select |v_#memory_int_2427| ULTIMATE.start_main_p1))) (and (= 4 .cse0) (= |#memory_int| (store |v_#memory_int_2427| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:39,585 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:34:39,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:39,599 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:39,601 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:39,601 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:39,601 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:39,609 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:39,609 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2428|]. (let ((.cse0 (select |v_#memory_int_2428| ULTIMATE.start_main_p1))) (and (= 5 .cse0) (= |#memory_int| (store |v_#memory_int_2428| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:39,609 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:34:39,621 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:39,622 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:39,624 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:39,624 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:39,624 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:39,632 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:39,632 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2429|]. (let ((.cse0 (select |v_#memory_int_2429| ULTIMATE.start_main_p1))) (and (= 6 .cse0) (= (store |v_#memory_int_2429| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:39,632 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:34:39,646 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:39,647 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:39,649 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:39,649 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:39,649 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:39,656 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:39,656 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2430|]. (let ((.cse0 (select |v_#memory_int_2430| ULTIMATE.start_main_p1))) (and (= 7 .cse0) (= (store |v_#memory_int_2430| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:39,656 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:34:39,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:39,672 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:39,674 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:39,674 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:39,674 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:39,682 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:39,682 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2431|]. (let ((.cse0 (select |v_#memory_int_2431| ULTIMATE.start_main_p1))) (and (= .cse0 8) (= (store |v_#memory_int_2431| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:39,682 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:34: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 16 treesize of output 11 [2019-05-15 10:34:39,698 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:39,700 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:39,700 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:39,700 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:39,708 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:39,708 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2432|]. (let ((.cse0 (select |v_#memory_int_2432| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2432| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 9 .cse0))) [2019-05-15 10:34:39,708 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:34:39,725 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:39,725 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:39,727 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:39,728 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:39,728 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:39,734 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:39,734 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2433|]. (let ((.cse0 (select |v_#memory_int_2433| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2433| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 10))) [2019-05-15 10:34:39,734 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:34:39,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 16 treesize of output 11 [2019-05-15 10:34:39,753 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:39,755 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:39,755 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:39,755 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:39,764 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:39,764 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2434|]. (let ((.cse0 (select |v_#memory_int_2434| ULTIMATE.start_main_p1))) (and (= 11 .cse0) (= (store |v_#memory_int_2434| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:39,765 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:34:39,781 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:39,782 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:39,784 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:39,784 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:39,785 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:39,791 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:39,792 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2435|]. (let ((.cse0 (select |v_#memory_int_2435| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2435| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 12))) [2019-05-15 10:34:39,792 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:34:39,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 16 treesize of output 11 [2019-05-15 10:34:39,810 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:39,812 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:39,812 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:39,812 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:39,819 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:39,819 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2436|]. (let ((.cse0 (select |v_#memory_int_2436| ULTIMATE.start_main_p1))) (and (= .cse0 13) (= |#memory_int| (store |v_#memory_int_2436| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:39,820 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:34:39,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 16 treesize of output 11 [2019-05-15 10:34:39,839 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:39,841 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:39,841 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:39,842 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:39,848 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:39,849 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2437|]. (let ((.cse0 (select |v_#memory_int_2437| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2437| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 14 .cse0))) [2019-05-15 10:34:39,849 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:34:39,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 16 treesize of output 11 [2019-05-15 10:34:39,871 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:39,873 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:39,873 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:39,874 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:39,881 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:39,881 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2438|]. (let ((.cse0 (select |v_#memory_int_2438| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2438| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 15 .cse0))) [2019-05-15 10:34:39,881 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:34:39,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 16 treesize of output 11 [2019-05-15 10:34:39,902 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:39,904 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:39,904 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:39,904 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:39,912 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:39,912 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2439|]. (let ((.cse0 (select |v_#memory_int_2439| ULTIMATE.start_main_p1))) (and (= .cse0 16) (= (store |v_#memory_int_2439| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:39,912 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:34:39,934 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:39,935 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:39,937 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:39,937 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:39,937 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:39,945 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:39,945 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2440|]. (let ((.cse0 (select |v_#memory_int_2440| ULTIMATE.start_main_p1))) (and (= 17 .cse0) (= (store |v_#memory_int_2440| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:39,945 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:34:39,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:39,968 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:39,970 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:39,970 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:39,970 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:39,977 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:39,977 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2441|]. (let ((.cse0 (select |v_#memory_int_2441| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2441| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 18 .cse0))) [2019-05-15 10:34:39,978 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:34:40,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 16 treesize of output 11 [2019-05-15 10:34:40,003 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:40,005 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:40,005 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:40,005 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:40,013 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:40,013 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2442|]. (let ((.cse0 (select |v_#memory_int_2442| ULTIMATE.start_main_p1))) (and (= 19 .cse0) (= (store |v_#memory_int_2442| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:40,013 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:34:40,038 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:40,039 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:40,041 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:40,041 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:40,042 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:40,049 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:40,049 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2443|]. (let ((.cse0 (select |v_#memory_int_2443| ULTIMATE.start_main_p1))) (and (= .cse0 20) (= (store |v_#memory_int_2443| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:40,049 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:34:40,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 16 treesize of output 11 [2019-05-15 10:34:40,076 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:40,078 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:40,078 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:40,078 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:40,085 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:40,085 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2444|]. (let ((.cse0 (select |v_#memory_int_2444| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2444| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 21))) [2019-05-15 10:34:40,086 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:34:40,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 16 treesize of output 11 [2019-05-15 10:34:40,112 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:40,114 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:40,114 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:40,114 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:40,121 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:40,121 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2445|]. (let ((.cse0 (select |v_#memory_int_2445| ULTIMATE.start_main_p1))) (and (= 22 .cse0) (= |#memory_int| (store |v_#memory_int_2445| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:40,121 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:34:40,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 16 treesize of output 11 [2019-05-15 10:34:40,151 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:40,153 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:40,153 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:40,153 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:40,161 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:40,161 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2446|]. (let ((.cse0 (select |v_#memory_int_2446| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2446| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 23))) [2019-05-15 10:34:40,161 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:34:40,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 16 treesize of output 11 [2019-05-15 10:34:40,190 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:40,192 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:40,192 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:40,193 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:40,200 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:40,200 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2447|]. (let ((.cse0 (select |v_#memory_int_2447| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2447| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 24))) [2019-05-15 10:34:40,200 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:34:40,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 16 treesize of output 11 [2019-05-15 10:34:40,231 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:40,233 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:40,233 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:40,234 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:40,241 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:40,241 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2448|]. (let ((.cse0 (select |v_#memory_int_2448| ULTIMATE.start_main_p1))) (and (= 25 .cse0) (= (store |v_#memory_int_2448| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:40,241 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:34:40,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:40,273 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:40,275 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:40,275 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:40,275 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:40,283 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:40,283 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2449|]. (let ((.cse0 (select |v_#memory_int_2449| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2449| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 26 .cse0))) [2019-05-15 10:34:40,284 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:34:40,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 16 treesize of output 11 [2019-05-15 10:34:40,315 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:40,317 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:40,317 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:40,317 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:40,323 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:40,324 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2450|]. (let ((.cse0 (select |v_#memory_int_2450| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2450| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 27 .cse0))) [2019-05-15 10:34:40,324 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:34:40,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 16 treesize of output 11 [2019-05-15 10:34:40,356 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:40,358 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:40,358 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:40,359 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:40,366 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:40,366 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2451|]. (let ((.cse0 (select |v_#memory_int_2451| ULTIMATE.start_main_p1))) (and (= 28 .cse0) (= (store |v_#memory_int_2451| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:40,366 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:34:40,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 16 treesize of output 11 [2019-05-15 10:34:40,398 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:40,400 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:40,400 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:40,400 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:40,408 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:40,408 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2452|]. (let ((.cse0 (select |v_#memory_int_2452| ULTIMATE.start_main_p1))) (and (= 29 .cse0) (= (store |v_#memory_int_2452| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:40,408 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:34:40,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:40,442 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:40,444 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:40,444 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:40,444 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:40,451 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:40,452 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2453|]. (let ((.cse0 (select |v_#memory_int_2453| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2453| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 30 .cse0))) [2019-05-15 10:34:40,452 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:34:40,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 16 treesize of output 11 [2019-05-15 10:34:40,487 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:40,489 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:40,489 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:40,489 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:40,496 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:40,497 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2454|]. (let ((.cse0 (select |v_#memory_int_2454| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2454| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 31 .cse0))) [2019-05-15 10:34:40,497 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:34:40,533 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:40,534 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:40,536 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:40,536 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:40,536 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:40,545 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:40,545 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2455|]. (let ((.cse0 (select |v_#memory_int_2455| ULTIMATE.start_main_p1))) (and (= 32 .cse0) (= (store |v_#memory_int_2455| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:40,545 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:34:40,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 16 treesize of output 11 [2019-05-15 10:34:40,585 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:40,587 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:40,588 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:40,588 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:40,595 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:40,596 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2456|]. (let ((.cse0 (select |v_#memory_int_2456| ULTIMATE.start_main_p1))) (and (= .cse0 33) (= |#memory_int| (store |v_#memory_int_2456| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:40,596 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:34:40,633 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:40,634 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:40,636 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:40,636 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:40,636 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:40,643 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:40,644 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2457|]. (let ((.cse0 (select |v_#memory_int_2457| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2457| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 34 .cse0))) [2019-05-15 10:34:40,644 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:34:40,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:40,681 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:40,683 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:40,684 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:40,684 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:40,692 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:40,692 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2458|]. (let ((.cse0 (select |v_#memory_int_2458| ULTIMATE.start_main_p1))) (and (= 35 .cse0) (= |#memory_int| (store |v_#memory_int_2458| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:40,692 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:34:40,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:40,731 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:40,733 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:40,733 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:40,733 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:40,742 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:40,742 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2459|]. (let ((.cse0 (select |v_#memory_int_2459| ULTIMATE.start_main_p1))) (and (= 36 .cse0) (= (store |v_#memory_int_2459| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:40,742 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:34:40,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:40,781 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:40,783 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:40,784 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:40,784 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:40,790 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:40,791 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2460|]. (let ((.cse0 (select |v_#memory_int_2460| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2460| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 37 .cse0))) [2019-05-15 10:34:40,791 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:34:40,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:40,830 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:40,832 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:40,833 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:40,833 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:40,841 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:40,842 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2461|]. (let ((.cse0 (select |v_#memory_int_2461| ULTIMATE.start_main_p1))) (and (= 38 .cse0) (= (store |v_#memory_int_2461| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:40,842 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:34:40,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:40,882 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:40,884 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:40,885 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:40,885 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:40,893 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:40,893 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2462|]. (let ((.cse0 (select |v_#memory_int_2462| ULTIMATE.start_main_p1))) (and (= .cse0 39) (= (store |v_#memory_int_2462| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:40,893 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:34:40,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:40,936 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:40,938 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:40,938 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:40,938 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:40,947 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:40,947 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2463|]. (let ((.cse0 (select |v_#memory_int_2463| ULTIMATE.start_main_p1))) (and (= .cse0 40) (= (store |v_#memory_int_2463| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:40,947 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:34:40,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 16 treesize of output 11 [2019-05-15 10:34:40,988 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:40,990 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:40,991 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:40,991 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:40,999 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:40,999 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2464|]. (let ((.cse0 (select |v_#memory_int_2464| ULTIMATE.start_main_p1))) (and (= 41 .cse0) (= |#memory_int| (store |v_#memory_int_2464| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:40,999 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:34:41,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 16 treesize of output 11 [2019-05-15 10:34:41,044 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:41,046 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:41,046 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:41,046 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:41,055 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:41,055 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2465|]. (let ((.cse0 (select |v_#memory_int_2465| ULTIMATE.start_main_p1))) (and (= .cse0 42) (= (store |v_#memory_int_2465| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:41,055 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:34:41,100 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:41,101 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:41,103 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:41,103 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:41,103 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:41,111 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:41,111 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2466|]. (let ((.cse0 (select |v_#memory_int_2466| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2466| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 43 .cse0))) [2019-05-15 10:34:41,111 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:34:41,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 16 treesize of output 11 [2019-05-15 10:34:41,155 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:41,157 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:41,157 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:41,158 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:41,165 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:41,165 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2467|]. (let ((.cse0 (select |v_#memory_int_2467| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2467| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 44 .cse0))) [2019-05-15 10:34:41,165 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:34:41,211 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:41,212 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:41,214 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:41,214 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:41,214 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:41,222 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:41,222 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2468|]. (let ((.cse0 (select |v_#memory_int_2468| ULTIMATE.start_main_p1))) (and (= 45 .cse0) (= (store |v_#memory_int_2468| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:41,222 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:34:41,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 16 treesize of output 11 [2019-05-15 10:34:41,267 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:41,269 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:41,269 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:41,270 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:41,277 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:41,277 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2469|]. (let ((.cse0 (select |v_#memory_int_2469| ULTIMATE.start_main_p1))) (and (= .cse0 46) (= (store |v_#memory_int_2469| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:41,277 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:34:41,322 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:41,323 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:41,325 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:41,325 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:41,325 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:41,333 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:41,333 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2470|]. (let ((.cse0 (select |v_#memory_int_2470| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2470| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 47))) [2019-05-15 10:34:41,334 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:34:41,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 16 treesize of output 11 [2019-05-15 10:34:41,389 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:41,391 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:41,392 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:41,392 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:41,400 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:41,400 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2471|]. (let ((.cse0 (select |v_#memory_int_2471| ULTIMATE.start_main_p1))) (and (= 48 .cse0) (= |#memory_int| (store |v_#memory_int_2471| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:41,400 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:34:41,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 16 treesize of output 11 [2019-05-15 10:34:41,448 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:41,450 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:41,450 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:41,450 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:41,458 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:41,458 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2472|]. (let ((.cse0 (select |v_#memory_int_2472| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2472| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 49))) [2019-05-15 10:34:41,458 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:34:41,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 16 treesize of output 11 [2019-05-15 10:34:41,506 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:41,508 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:41,508 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:41,508 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:41,514 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:41,514 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2473|]. (let ((.cse0 (select |v_#memory_int_2473| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2473| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 50))) [2019-05-15 10:34:41,514 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:34:41,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:41,561 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:41,563 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:41,564 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:41,564 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:41,572 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:41,572 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2474|]. (let ((.cse0 (select |v_#memory_int_2474| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2474| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 51))) [2019-05-15 10:34:41,572 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:34:41,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 16 treesize of output 11 [2019-05-15 10:34:41,621 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:41,623 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:41,624 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:41,624 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:41,631 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:41,631 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2475|]. (let ((.cse0 (select |v_#memory_int_2475| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2475| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 52 .cse0))) [2019-05-15 10:34:41,631 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:34:41,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:41,681 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:41,683 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:41,684 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:41,684 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:41,691 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:41,692 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2476|]. (let ((.cse0 (select |v_#memory_int_2476| ULTIMATE.start_main_p1))) (and (= .cse0 53) (= (store |v_#memory_int_2476| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:41,692 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:34:41,740 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:41,741 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:41,743 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:41,743 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:41,744 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:41,751 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:41,751 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2477|]. (let ((.cse0 (select |v_#memory_int_2477| ULTIMATE.start_main_p1))) (and (= 54 .cse0) (= (store |v_#memory_int_2477| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:41,751 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:34:41,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 16 treesize of output 11 [2019-05-15 10:34:41,801 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:41,803 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:41,803 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:41,804 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:41,811 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:41,811 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2478|]. (let ((.cse0 (select |v_#memory_int_2478| ULTIMATE.start_main_p1))) (and (= 55 .cse0) (= (store |v_#memory_int_2478| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:41,811 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:34:41,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:41,862 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:41,864 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:41,865 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:41,865 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:41,872 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:41,872 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2479|]. (let ((.cse0 (select |v_#memory_int_2479| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2479| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 56 .cse0))) [2019-05-15 10:34:41,872 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:34:41,924 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:41,925 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:41,927 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:41,927 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:41,927 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:41,933 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:41,934 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2480|]. (let ((.cse0 (select |v_#memory_int_2480| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2480| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 57 .cse0))) [2019-05-15 10:34:41,934 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:34:41,992 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:41,993 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:41,995 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:41,996 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:41,996 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:42,003 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:42,003 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2481|]. (let ((.cse0 (select |v_#memory_int_2481| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2481| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 58 .cse0))) [2019-05-15 10:34:42,003 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:34:42,056 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:42,057 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:42,059 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:42,059 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:42,060 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:42,067 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:42,068 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2482|]. (let ((.cse0 (select |v_#memory_int_2482| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2482| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 59 .cse0))) [2019-05-15 10:34:42,068 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:34:42,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 16 treesize of output 11 [2019-05-15 10:34:42,123 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:42,125 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:42,126 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:42,126 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:42,132 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:42,133 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2483|]. (let ((.cse0 (select |v_#memory_int_2483| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2483| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 60))) [2019-05-15 10:34:42,133 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:34:42,187 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:42,187 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:42,189 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:42,190 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:42,190 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:42,198 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:42,198 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2484|]. (let ((.cse0 (select |v_#memory_int_2484| ULTIMATE.start_main_p1))) (and (= .cse0 61) (= |#memory_int| (store |v_#memory_int_2484| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:42,198 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:34:42,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 16 treesize of output 11 [2019-05-15 10:34:42,255 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:42,257 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:42,257 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:42,257 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:42,266 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:42,266 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2485|]. (let ((.cse0 (select |v_#memory_int_2485| ULTIMATE.start_main_p1))) (and (= .cse0 62) (= (store |v_#memory_int_2485| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:42,266 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:34:42,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 16 treesize of output 11 [2019-05-15 10:34:42,325 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:42,327 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:42,328 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:42,328 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:42,336 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:42,336 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2486|]. (let ((.cse0 (select |v_#memory_int_2486| ULTIMATE.start_main_p1))) (and (= 63 .cse0) (= (store |v_#memory_int_2486| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:42,336 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 64) [2019-05-15 10:34:42,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 16 treesize of output 11 [2019-05-15 10:34:42,395 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:42,397 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:42,398 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:42,398 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:42,405 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:42,406 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2487|]. (let ((.cse0 (select |v_#memory_int_2487| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2487| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 64 .cse0))) [2019-05-15 10:34:42,406 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 65) [2019-05-15 10:34:42,464 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:42,465 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:42,467 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:42,467 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:42,467 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:42,475 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:42,475 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2488|]. (let ((.cse0 (select |v_#memory_int_2488| ULTIMATE.start_main_p1))) (and (= 65 .cse0) (= (store |v_#memory_int_2488| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:42,476 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 66) [2019-05-15 10:34:42,534 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:42,535 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:42,537 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:42,537 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:42,537 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:42,545 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:42,545 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2489|]. (let ((.cse0 (select |v_#memory_int_2489| ULTIMATE.start_main_p1))) (and (= .cse0 66) (= (store |v_#memory_int_2489| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:42,545 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 67) [2019-05-15 10:34:42,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 16 treesize of output 11 [2019-05-15 10:34:42,609 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:42,611 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:42,611 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:42,611 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:42,620 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:42,621 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2490|]. (let ((.cse0 (select |v_#memory_int_2490| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2490| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 67 .cse0))) [2019-05-15 10:34:42,621 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 68) [2019-05-15 10:34:42,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:42,682 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:42,684 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:42,684 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:42,684 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:42,691 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:42,692 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2491|]. (let ((.cse0 (select |v_#memory_int_2491| ULTIMATE.start_main_p1))) (and (= 68 .cse0) (= (store |v_#memory_int_2491| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:42,692 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 69) [2019-05-15 10:34:42,750 INFO L273 TraceCheckUtils]: 0: Hoare triple {21404#true} havoc main_p1; {21404#true} is VALID [2019-05-15 10:34:42,751 INFO L273 TraceCheckUtils]: 1: Hoare triple {21404#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {21404#true} is VALID [2019-05-15 10:34:42,751 INFO L273 TraceCheckUtils]: 2: Hoare triple {21404#true} #memory_int := #memory_int[main_p1 := 0]; {21415#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:34:42,752 INFO L273 TraceCheckUtils]: 3: Hoare triple {21415#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21419#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:34:42,752 INFO L273 TraceCheckUtils]: 4: Hoare triple {21419#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21423#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:34:42,753 INFO L273 TraceCheckUtils]: 5: Hoare triple {21423#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21427#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:34:42,753 INFO L273 TraceCheckUtils]: 6: Hoare triple {21427#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21431#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:34:42,754 INFO L273 TraceCheckUtils]: 7: Hoare triple {21431#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21435#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:34:42,754 INFO L273 TraceCheckUtils]: 8: Hoare triple {21435#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21439#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:34:42,755 INFO L273 TraceCheckUtils]: 9: Hoare triple {21439#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21443#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:34:42,756 INFO L273 TraceCheckUtils]: 10: Hoare triple {21443#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21447#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:34:42,756 INFO L273 TraceCheckUtils]: 11: Hoare triple {21447#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21451#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:34:42,757 INFO L273 TraceCheckUtils]: 12: Hoare triple {21451#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21455#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:34:42,758 INFO L273 TraceCheckUtils]: 13: Hoare triple {21455#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21459#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:34:42,759 INFO L273 TraceCheckUtils]: 14: Hoare triple {21459#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21463#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:34:42,759 INFO L273 TraceCheckUtils]: 15: Hoare triple {21463#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21467#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:34:42,760 INFO L273 TraceCheckUtils]: 16: Hoare triple {21467#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21471#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:34:42,761 INFO L273 TraceCheckUtils]: 17: Hoare triple {21471#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21475#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:34:42,762 INFO L273 TraceCheckUtils]: 18: Hoare triple {21475#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21479#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:34:42,762 INFO L273 TraceCheckUtils]: 19: Hoare triple {21479#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21483#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:34:42,763 INFO L273 TraceCheckUtils]: 20: Hoare triple {21483#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21487#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:34:42,764 INFO L273 TraceCheckUtils]: 21: Hoare triple {21487#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21491#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:34:42,765 INFO L273 TraceCheckUtils]: 22: Hoare triple {21491#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21495#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:34:42,765 INFO L273 TraceCheckUtils]: 23: Hoare triple {21495#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21499#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:34:42,766 INFO L273 TraceCheckUtils]: 24: Hoare triple {21499#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21503#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:34:42,767 INFO L273 TraceCheckUtils]: 25: Hoare triple {21503#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21507#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:34:42,768 INFO L273 TraceCheckUtils]: 26: Hoare triple {21507#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21511#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:34:42,768 INFO L273 TraceCheckUtils]: 27: Hoare triple {21511#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21515#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:34:42,769 INFO L273 TraceCheckUtils]: 28: Hoare triple {21515#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21519#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:34:42,770 INFO L273 TraceCheckUtils]: 29: Hoare triple {21519#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21523#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:34:42,771 INFO L273 TraceCheckUtils]: 30: Hoare triple {21523#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21527#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:34:42,771 INFO L273 TraceCheckUtils]: 31: Hoare triple {21527#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21531#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:34:42,772 INFO L273 TraceCheckUtils]: 32: Hoare triple {21531#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21535#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:34:42,773 INFO L273 TraceCheckUtils]: 33: Hoare triple {21535#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21539#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:34:42,774 INFO L273 TraceCheckUtils]: 34: Hoare triple {21539#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21543#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:34:42,774 INFO L273 TraceCheckUtils]: 35: Hoare triple {21543#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21547#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:34:42,775 INFO L273 TraceCheckUtils]: 36: Hoare triple {21547#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21551#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:34:42,776 INFO L273 TraceCheckUtils]: 37: Hoare triple {21551#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21555#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:34:42,777 INFO L273 TraceCheckUtils]: 38: Hoare triple {21555#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21559#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:34:42,777 INFO L273 TraceCheckUtils]: 39: Hoare triple {21559#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21563#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:34:42,778 INFO L273 TraceCheckUtils]: 40: Hoare triple {21563#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21567#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:34:42,779 INFO L273 TraceCheckUtils]: 41: Hoare triple {21567#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21571#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:34:42,780 INFO L273 TraceCheckUtils]: 42: Hoare triple {21571#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21575#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:34:42,780 INFO L273 TraceCheckUtils]: 43: Hoare triple {21575#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21579#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:34:42,781 INFO L273 TraceCheckUtils]: 44: Hoare triple {21579#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21583#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:34:42,782 INFO L273 TraceCheckUtils]: 45: Hoare triple {21583#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21587#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:34:42,783 INFO L273 TraceCheckUtils]: 46: Hoare triple {21587#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21591#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:34:42,783 INFO L273 TraceCheckUtils]: 47: Hoare triple {21591#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21595#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:34:42,784 INFO L273 TraceCheckUtils]: 48: Hoare triple {21595#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21599#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:34:42,785 INFO L273 TraceCheckUtils]: 49: Hoare triple {21599#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21603#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:34:42,786 INFO L273 TraceCheckUtils]: 50: Hoare triple {21603#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21607#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:34:42,786 INFO L273 TraceCheckUtils]: 51: Hoare triple {21607#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21611#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:34:42,787 INFO L273 TraceCheckUtils]: 52: Hoare triple {21611#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21615#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:34:42,788 INFO L273 TraceCheckUtils]: 53: Hoare triple {21615#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21619#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:34:42,789 INFO L273 TraceCheckUtils]: 54: Hoare triple {21619#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21623#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:34:42,789 INFO L273 TraceCheckUtils]: 55: Hoare triple {21623#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21627#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:34:42,790 INFO L273 TraceCheckUtils]: 56: Hoare triple {21627#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21631#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:34:42,791 INFO L273 TraceCheckUtils]: 57: Hoare triple {21631#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21635#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:34:42,792 INFO L273 TraceCheckUtils]: 58: Hoare triple {21635#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21639#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:34:42,792 INFO L273 TraceCheckUtils]: 59: Hoare triple {21639#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21643#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:34:42,793 INFO L273 TraceCheckUtils]: 60: Hoare triple {21643#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21647#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:34:42,794 INFO L273 TraceCheckUtils]: 61: Hoare triple {21647#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21651#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:34:42,795 INFO L273 TraceCheckUtils]: 62: Hoare triple {21651#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21655#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:34:42,795 INFO L273 TraceCheckUtils]: 63: Hoare triple {21655#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21659#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:34:42,796 INFO L273 TraceCheckUtils]: 64: Hoare triple {21659#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21663#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:34:42,797 INFO L273 TraceCheckUtils]: 65: Hoare triple {21663#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21667#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:34:42,799 INFO L273 TraceCheckUtils]: 66: Hoare triple {21667#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21671#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} is VALID [2019-05-15 10:34:42,800 INFO L273 TraceCheckUtils]: 67: Hoare triple {21671#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21675#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} is VALID [2019-05-15 10:34:42,800 INFO L273 TraceCheckUtils]: 68: Hoare triple {21675#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21679#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} is VALID [2019-05-15 10:34:42,801 INFO L273 TraceCheckUtils]: 69: Hoare triple {21679#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21683#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} is VALID [2019-05-15 10:34:42,801 INFO L273 TraceCheckUtils]: 70: Hoare triple {21683#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21687#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} is VALID [2019-05-15 10:34:42,802 INFO L273 TraceCheckUtils]: 71: Hoare triple {21687#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21691#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} is VALID [2019-05-15 10:34:42,803 INFO L273 TraceCheckUtils]: 72: Hoare triple {21691#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} assume !(#memory_int[main_p1] >= 0); {21405#false} is VALID [2019-05-15 10:34:42,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:34:42,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:34:42,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-05-15 10:34:42,812 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 73 [2019-05-15 10:34:42,812 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:34:42,812 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 72 states. [2019-05-15 10:34:42,870 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:34:42,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-05-15 10:34:42,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-05-15 10:34:42,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-05-15 10:34:42,871 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 72 states. [2019-05-15 10:34:52,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:34:52,911 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-05-15 10:34:52,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-05-15 10:34:52,911 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 73 [2019-05-15 10:34:52,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:34:52,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-05-15 10:34:52,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2019-05-15 10:34:52,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-05-15 10:34:52,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2019-05-15 10:34:52,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 72 states and 76 transitions. [2019-05-15 10:34:52,977 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:52,978 INFO L225 Difference]: With dead ends: 75 [2019-05-15 10:34:52,979 INFO L226 Difference]: Without dead ends: 75 [2019-05-15 10:34:52,979 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-05-15 10:34:52,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-05-15 10:34:52,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-05-15 10:34:52,981 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:34:52,981 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 75 states. [2019-05-15 10:34:52,981 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 75 states. [2019-05-15 10:34:52,981 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 75 states. [2019-05-15 10:34:52,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:34:52,982 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-05-15 10:34:52,982 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-05-15 10:34:52,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:34:52,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:34:52,982 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 75 states. [2019-05-15 10:34:52,982 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 75 states. [2019-05-15 10:34:52,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:34:52,990 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-05-15 10:34:52,990 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-05-15 10:34:52,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:34:52,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:34:52,990 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:34:52,990 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:34:52,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-05-15 10:34:52,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-05-15 10:34:52,991 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-05-15 10:34:52,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:34:52,991 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-05-15 10:34:52,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-05-15 10:34:52,991 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-05-15 10:34:52,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-05-15 10:34:52,992 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:34:52,992 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1, 1] [2019-05-15 10:34:52,992 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:34:52,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:34:52,992 INFO L82 PathProgramCache]: Analyzing trace with hash -433374904, now seen corresponding path program 70 times [2019-05-15 10:34:52,993 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:34:53,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:34:53,028 WARN L254 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 72 conjunts are in the unsatisfiable core [2019-05-15 10:34:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:34:53,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:34:53,095 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,095 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 0, result has 100.0 percent of original size [2019-05-15 10:34:53,097 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:6, output treesize:5 [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,100 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2492|]. (= (store |v_#memory_int_2492| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:34:53,100 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:34:53,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 16 treesize of output 11 [2019-05-15 10:34:53,110 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:53,112 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:53,112 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,112 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:53,120 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:53,120 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2493|]. (let ((.cse0 (select |v_#memory_int_2493| ULTIMATE.start_main_p1))) (and (= .cse0 0) (= |#memory_int| (store |v_#memory_int_2493| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:53,120 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:34:53,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 16 treesize of output 11 [2019-05-15 10:34:53,131 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:53,133 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:53,133 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,133 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:53,141 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:53,141 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2494|]. (let ((.cse0 (select |v_#memory_int_2494| ULTIMATE.start_main_p1))) (and (= 1 .cse0) (= (store |v_#memory_int_2494| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:53,141 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:34:53,152 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:53,153 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:53,155 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:53,155 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,155 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:53,163 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:53,163 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2495|]. (let ((.cse0 (select |v_#memory_int_2495| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2495| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 2))) [2019-05-15 10:34:53,163 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:34:53,174 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:53,175 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:53,177 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:53,177 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,177 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:53,184 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:53,185 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2496|]. (let ((.cse0 (select |v_#memory_int_2496| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2496| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 3 .cse0))) [2019-05-15 10:34:53,185 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:34:53,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 16 treesize of output 11 [2019-05-15 10:34:53,198 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:53,200 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:53,200 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,200 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:53,208 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:53,208 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2497|]. (let ((.cse0 (select |v_#memory_int_2497| ULTIMATE.start_main_p1))) (and (= 4 .cse0) (= (store |v_#memory_int_2497| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:53,208 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:34:53,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:53,222 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:53,224 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:53,225 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,225 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:53,233 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:53,233 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2498|]. (let ((.cse0 (select |v_#memory_int_2498| ULTIMATE.start_main_p1))) (and (= 5 .cse0) (= |#memory_int| (store |v_#memory_int_2498| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:53,233 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:34:53,247 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:53,248 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:53,250 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:53,250 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,251 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:53,257 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:53,257 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2499|]. (let ((.cse0 (select |v_#memory_int_2499| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2499| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 6 .cse0))) [2019-05-15 10:34:53,257 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:34:53,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:53,307 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:53,309 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:53,309 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,309 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:53,316 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:53,317 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2500|]. (let ((.cse0 (select |v_#memory_int_2500| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2500| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 7 .cse0))) [2019-05-15 10:34:53,317 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:34:53,333 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:53,333 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:53,335 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:53,336 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,336 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:53,344 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:53,344 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2501|]. (let ((.cse0 (select |v_#memory_int_2501| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2501| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 8 .cse0))) [2019-05-15 10:34:53,344 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:34:53,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:53,361 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:53,363 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:53,363 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,363 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:53,369 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:53,369 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2502|]. (let ((.cse0 (select |v_#memory_int_2502| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2502| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 9 .cse0))) [2019-05-15 10:34:53,369 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:34:53,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:53,406 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:53,408 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:53,408 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,408 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:53,416 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:53,416 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2503|]. (let ((.cse0 (select |v_#memory_int_2503| ULTIMATE.start_main_p1))) (and (= .cse0 10) (= (store |v_#memory_int_2503| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:53,416 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:34:53,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 16 treesize of output 11 [2019-05-15 10:34:53,436 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:53,438 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:53,438 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,438 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:53,445 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:53,445 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2504|]. (let ((.cse0 (select |v_#memory_int_2504| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2504| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 11))) [2019-05-15 10:34:53,445 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:34:53,462 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:53,463 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:53,465 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:53,465 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,465 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:53,472 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:53,472 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2505|]. (let ((.cse0 (select |v_#memory_int_2505| ULTIMATE.start_main_p1))) (and (= .cse0 12) (= |#memory_int| (store |v_#memory_int_2505| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:53,472 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:34: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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:53,490 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:53,492 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:53,493 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,493 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:53,500 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:53,500 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2506|]. (let ((.cse0 (select |v_#memory_int_2506| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2506| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 13 .cse0))) [2019-05-15 10:34:53,500 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:34:53,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 16 treesize of output 11 [2019-05-15 10:34:53,520 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:53,522 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:53,523 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,523 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:53,529 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:53,530 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2507|]. (let ((.cse0 (select |v_#memory_int_2507| ULTIMATE.start_main_p1))) (and (= 14 .cse0) (= (store |v_#memory_int_2507| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:53,530 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:34:53,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 16 treesize of output 11 [2019-05-15 10:34:53,552 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:53,553 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:53,554 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,554 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:53,561 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:53,561 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2508|]. (let ((.cse0 (select |v_#memory_int_2508| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2508| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 15))) [2019-05-15 10:34:53,561 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:34:53,581 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:53,582 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:53,584 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:53,584 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,584 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:53,592 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:53,592 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2509|]. (let ((.cse0 (select |v_#memory_int_2509| ULTIMATE.start_main_p1))) (and (= .cse0 16) (= (store |v_#memory_int_2509| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:53,592 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [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 16 treesize of output 11 [2019-05-15 10:34:53,614 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:53,615 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:53,616 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,616 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:53,623 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:53,623 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2510|]. (let ((.cse0 (select |v_#memory_int_2510| ULTIMATE.start_main_p1))) (and (= 17 .cse0) (= (store |v_#memory_int_2510| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:53,623 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:34:53,647 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:53,648 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:53,650 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:53,650 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,650 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:53,658 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:53,658 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2511|]. (let ((.cse0 (select |v_#memory_int_2511| ULTIMATE.start_main_p1))) (and (= 18 .cse0) (= (store |v_#memory_int_2511| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:53,658 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:34:53,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 16 treesize of output 11 [2019-05-15 10:34:53,684 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:53,686 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:53,686 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,686 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:53,693 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:53,693 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2512|]. (let ((.cse0 (select |v_#memory_int_2512| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2512| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 19 .cse0))) [2019-05-15 10:34:53,694 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:34:53,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:53,718 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:53,720 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:53,720 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,720 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:53,727 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:53,727 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2513|]. (let ((.cse0 (select |v_#memory_int_2513| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2513| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 20))) [2019-05-15 10:34:53,727 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:34:53,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 16 treesize of output 11 [2019-05-15 10:34:53,752 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:53,754 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:53,754 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,755 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [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,761 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2514|]. (let ((.cse0 (select |v_#memory_int_2514| ULTIMATE.start_main_p1))) (and (= .cse0 21) (= |#memory_int| (store |v_#memory_int_2514| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:53,761 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:34:53,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:53,787 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:53,789 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:53,789 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,789 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:53,795 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:53,795 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2515|]. (let ((.cse0 (select |v_#memory_int_2515| ULTIMATE.start_main_p1))) (and (= .cse0 22) (= (store |v_#memory_int_2515| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:53,796 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:34:53,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 16 treesize of output 11 [2019-05-15 10:34:53,825 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:53,827 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:53,828 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,828 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:53,834 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:53,834 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2516|]. (let ((.cse0 (select |v_#memory_int_2516| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2516| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 23 .cse0))) [2019-05-15 10:34:53,834 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:34:53,861 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:53,862 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:53,864 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:53,865 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,865 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:53,871 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:53,871 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2517|]. (let ((.cse0 (select |v_#memory_int_2517| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2517| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 24))) [2019-05-15 10:34:53,871 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:34:53,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:53,900 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:53,902 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:53,902 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,902 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:53,909 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:53,909 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2518|]. (let ((.cse0 (select |v_#memory_int_2518| ULTIMATE.start_main_p1))) (and (= .cse0 25) (= (store |v_#memory_int_2518| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:53,909 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:34:53,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:53,938 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:53,940 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 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 1 xjuncts. [2019-05-15 10:34:53,941 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:53,948 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:53,949 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2519|]. (let ((.cse0 (select |v_#memory_int_2519| ULTIMATE.start_main_p1))) (and (= .cse0 26) (= (store |v_#memory_int_2519| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:53,949 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:34:53,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 16 treesize of output 11 [2019-05-15 10:34:53,985 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:53,987 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:53,988 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,988 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:53,995 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:53,995 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2520|]. (let ((.cse0 (select |v_#memory_int_2520| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2520| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 27 .cse0))) [2019-05-15 10:34:53,995 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:34:54,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:54,027 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,029 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:54,029 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,030 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:54,037 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:54,037 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2521|]. (let ((.cse0 (select |v_#memory_int_2521| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2521| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 28 .cse0))) [2019-05-15 10:34:54,037 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:34:54,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:54,075 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,077 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:54,078 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,078 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:54,086 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:54,086 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2522|]. (let ((.cse0 (select |v_#memory_int_2522| ULTIMATE.start_main_p1))) (and (= .cse0 29) (= (store |v_#memory_int_2522| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:54,086 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:34:54,119 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:54,120 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,122 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:54,122 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,122 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:54,130 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:54,130 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2523|]. (let ((.cse0 (select |v_#memory_int_2523| ULTIMATE.start_main_p1))) (and (= 30 .cse0) (= (store |v_#memory_int_2523| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:54,130 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:34:54,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 16 treesize of output 11 [2019-05-15 10:34:54,164 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,166 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:54,166 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,166 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:54,173 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:54,173 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2524|]. (let ((.cse0 (select |v_#memory_int_2524| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2524| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 31 .cse0))) [2019-05-15 10:34:54,174 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:34:54,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 16 treesize of output 11 [2019-05-15 10:34:54,208 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,210 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:54,210 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,210 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:54,218 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:54,218 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2525|]. (let ((.cse0 (select |v_#memory_int_2525| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2525| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 32))) [2019-05-15 10:34:54,218 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:34: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 16 treesize of output 11 [2019-05-15 10:34:54,253 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,255 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:54,255 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,255 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:54,262 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:54,263 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2526|]. (let ((.cse0 (select |v_#memory_int_2526| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2526| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 33))) [2019-05-15 10:34:54,263 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:34:54,296 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:54,297 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,299 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:54,299 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,300 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:54,307 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:54,307 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2527|]. (let ((.cse0 (select |v_#memory_int_2527| ULTIMATE.start_main_p1))) (and (= 34 .cse0) (= (store |v_#memory_int_2527| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:54,307 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:34:54,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 16 treesize of output 11 [2019-05-15 10:34:54,344 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,346 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:54,347 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,347 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:54,353 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:54,353 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2528|]. (let ((.cse0 (select |v_#memory_int_2528| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2528| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 35))) [2019-05-15 10:34:54,353 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:34:54,391 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:54,392 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,394 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:54,394 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,394 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:54,402 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:54,402 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2529|]. (let ((.cse0 (select |v_#memory_int_2529| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2529| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 36))) [2019-05-15 10:34:54,402 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:34:54,440 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:54,441 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,443 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:54,443 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,443 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:54,450 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:54,451 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2530|]. (let ((.cse0 (select |v_#memory_int_2530| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2530| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 37))) [2019-05-15 10:34:54,451 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:34:54,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:54,491 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,493 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:54,493 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,494 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:54,501 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:54,501 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2531|]. (let ((.cse0 (select |v_#memory_int_2531| ULTIMATE.start_main_p1))) (and (= .cse0 38) (= |#memory_int| (store |v_#memory_int_2531| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:54,501 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:34:54,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:54,543 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,545 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:54,545 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,546 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:54,553 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:54,553 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2532|]. (let ((.cse0 (select |v_#memory_int_2532| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2532| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 39 .cse0))) [2019-05-15 10:34:54,553 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:34:54,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 16 treesize of output 11 [2019-05-15 10:34:54,597 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,599 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:54,599 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,599 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:54,607 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:54,607 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2533|]. (let ((.cse0 (select |v_#memory_int_2533| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2533| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 40 .cse0))) [2019-05-15 10:34:54,607 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:34:54,648 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:54,649 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,651 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:54,651 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,651 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:54,660 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:54,660 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2534|]. (let ((.cse0 (select |v_#memory_int_2534| ULTIMATE.start_main_p1))) (and (= 41 .cse0) (= |#memory_int| (store |v_#memory_int_2534| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:54,660 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:34:54,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:54,702 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,704 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:54,705 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,705 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:54,713 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:54,713 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2535|]. (let ((.cse0 (select |v_#memory_int_2535| ULTIMATE.start_main_p1))) (and (= 42 .cse0) (= |#memory_int| (store |v_#memory_int_2535| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:54,713 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:34:54,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 16 treesize of output 11 [2019-05-15 10:34:54,755 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,757 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:54,757 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,758 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:54,765 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:54,765 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2536|]. (let ((.cse0 (select |v_#memory_int_2536| ULTIMATE.start_main_p1))) (and (= 43 .cse0) (= (store |v_#memory_int_2536| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:54,766 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:34:54,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 16 treesize of output 11 [2019-05-15 10:34:54,810 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,812 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:54,812 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,812 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:54,819 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:54,819 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2537|]. (let ((.cse0 (select |v_#memory_int_2537| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2537| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 44 .cse0))) [2019-05-15 10:34:54,819 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:34:54,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:54,865 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,867 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:54,867 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,867 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:54,874 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:54,874 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2538|]. (let ((.cse0 (select |v_#memory_int_2538| ULTIMATE.start_main_p1))) (and (= 45 .cse0) (= (store |v_#memory_int_2538| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:54,874 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:34:54,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 16 treesize of output 11 [2019-05-15 10:34:54,922 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,924 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:54,924 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,924 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:54,932 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:54,932 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2539|]. (let ((.cse0 (select |v_#memory_int_2539| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2539| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 46 .cse0))) [2019-05-15 10:34:54,932 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [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,982 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:54,982 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:54,982 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:54,989 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:54,990 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2540|]. (let ((.cse0 (select |v_#memory_int_2540| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2540| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 47 .cse0))) [2019-05-15 10:34:54,990 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:34:55,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:55,037 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:55,039 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:55,039 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:55,039 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:55,047 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:55,047 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2541|]. (let ((.cse0 (select |v_#memory_int_2541| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2541| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 48))) [2019-05-15 10:34:55,047 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:34:55,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 16 treesize of output 11 [2019-05-15 10:34:55,098 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:55,100 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:55,100 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:55,100 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:55,108 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:55,108 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2542|]. (let ((.cse0 (select |v_#memory_int_2542| ULTIMATE.start_main_p1))) (and (= 49 .cse0) (= (store |v_#memory_int_2542| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:55,108 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:34:55,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:55,159 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:55,162 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:55,162 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:55,162 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:55,170 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:55,170 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2543|]. (let ((.cse0 (select |v_#memory_int_2543| ULTIMATE.start_main_p1))) (and (= 50 .cse0) (= (store |v_#memory_int_2543| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:55,170 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:34:55,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 16 treesize of output 11 [2019-05-15 10:34:55,222 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:55,224 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:55,224 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:55,224 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:55,232 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:55,233 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2544|]. (let ((.cse0 (select |v_#memory_int_2544| ULTIMATE.start_main_p1))) (and (= 51 .cse0) (= (store |v_#memory_int_2544| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:55,233 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:34:55,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 16 treesize of output 11 [2019-05-15 10:34:55,285 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:55,287 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:55,287 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:55,287 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:55,295 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:55,295 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2545|]. (let ((.cse0 (select |v_#memory_int_2545| ULTIMATE.start_main_p1))) (and (= 52 .cse0) (= |#memory_int| (store |v_#memory_int_2545| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:55,295 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:34:55,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 16 treesize of output 11 [2019-05-15 10:34:55,347 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:55,349 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:55,350 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:55,350 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:55,357 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:55,357 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2546|]. (let ((.cse0 (select |v_#memory_int_2546| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2546| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 53 .cse0))) [2019-05-15 10:34:55,357 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:34:55,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:55,417 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:55,419 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:55,419 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:55,419 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:55,427 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:55,427 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2547|]. (let ((.cse0 (select |v_#memory_int_2547| ULTIMATE.start_main_p1))) (and (= .cse0 54) (= (store |v_#memory_int_2547| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:55,427 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:34:55,476 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:55,477 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:55,479 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:55,479 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:55,480 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:55,487 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:55,487 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2548|]. (let ((.cse0 (select |v_#memory_int_2548| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2548| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 55))) [2019-05-15 10:34:55,487 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:34:55,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:55,538 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:55,540 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:55,540 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:55,540 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:55,548 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:55,548 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2549|]. (let ((.cse0 (select |v_#memory_int_2549| ULTIMATE.start_main_p1))) (and (= .cse0 56) (= (store |v_#memory_int_2549| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:55,548 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:34:55,599 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:55,600 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:55,602 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:55,602 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:55,602 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:55,610 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:55,610 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2550|]. (let ((.cse0 (select |v_#memory_int_2550| ULTIMATE.start_main_p1))) (and (= 57 .cse0) (= |#memory_int| (store |v_#memory_int_2550| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:55,610 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:34:55,662 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:55,663 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:55,664 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:55,665 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:55,665 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:55,672 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:55,672 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2551|]. (let ((.cse0 (select |v_#memory_int_2551| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2551| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 58 .cse0))) [2019-05-15 10:34:55,672 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:34:55,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 16 treesize of output 11 [2019-05-15 10:34:55,727 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:55,728 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:55,728 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:55,728 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:55,735 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:55,735 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2552|]. (let ((.cse0 (select |v_#memory_int_2552| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2552| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 59 .cse0))) [2019-05-15 10:34:55,735 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:34:55,790 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:55,791 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:55,792 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:55,793 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:55,793 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:55,800 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:55,801 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2553|]. (let ((.cse0 (select |v_#memory_int_2553| ULTIMATE.start_main_p1))) (and (= 60 .cse0) (= (store |v_#memory_int_2553| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:55,801 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:34:55,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 16 treesize of output 11 [2019-05-15 10:34:55,855 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:55,857 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:55,858 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:55,858 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:55,866 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:55,866 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2554|]. (let ((.cse0 (select |v_#memory_int_2554| ULTIMATE.start_main_p1))) (and (= .cse0 61) (= (store |v_#memory_int_2554| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:55,866 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:34:55,930 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:55,931 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:55,933 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:55,933 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:55,933 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:55,942 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:55,942 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2555|]. (let ((.cse0 (select |v_#memory_int_2555| ULTIMATE.start_main_p1))) (and (= .cse0 62) (= (store |v_#memory_int_2555| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:55,942 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:34:56,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:56,002 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:56,004 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:56,004 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:56,004 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:56,011 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:56,011 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2556|]. (let ((.cse0 (select |v_#memory_int_2556| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2556| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 63))) [2019-05-15 10:34:56,012 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 64) [2019-05-15 10:34:56,070 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:56,071 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:56,073 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:56,073 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:56,073 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:56,081 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:56,081 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2557|]. (let ((.cse0 (select |v_#memory_int_2557| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2557| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 64 .cse0))) [2019-05-15 10:34:56,081 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 65) [2019-05-15 10:34:56,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 16 treesize of output 11 [2019-05-15 10:34:56,143 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:56,145 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:56,146 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:56,146 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:56,153 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:56,153 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2558|]. (let ((.cse0 (select |v_#memory_int_2558| ULTIMATE.start_main_p1))) (and (= 65 .cse0) (= (store |v_#memory_int_2558| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:56,153 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 66) [2019-05-15 10:34:56,211 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:56,212 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:56,214 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:56,214 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:56,214 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:56,222 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:56,222 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2559|]. (let ((.cse0 (select |v_#memory_int_2559| ULTIMATE.start_main_p1))) (and (= 66 .cse0) (= (store |v_#memory_int_2559| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:56,222 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 67) [2019-05-15 10:34:56,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 16 treesize of output 11 [2019-05-15 10:34:56,283 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:56,285 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:56,286 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:56,286 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:56,293 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:56,293 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2560|]. (let ((.cse0 (select |v_#memory_int_2560| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2560| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 67 .cse0))) [2019-05-15 10:34:56,293 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 68) [2019-05-15 10:34:56,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 16 treesize of output 11 [2019-05-15 10:34:56,355 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:56,357 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:56,357 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:56,357 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:56,365 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:56,365 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2561|]. (let ((.cse0 (select |v_#memory_int_2561| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2561| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 68 .cse0))) [2019-05-15 10:34:56,365 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 69) [2019-05-15 10:34:56,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:56,431 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:56,433 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:56,433 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:56,433 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:56,440 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:56,440 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2562|]. (let ((.cse0 (select |v_#memory_int_2562| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2562| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 69 .cse0))) [2019-05-15 10:34:56,440 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 70) [2019-05-15 10:34:56,501 INFO L273 TraceCheckUtils]: 0: Hoare triple {21994#true} havoc main_p1; {21994#true} is VALID [2019-05-15 10:34:56,502 INFO L273 TraceCheckUtils]: 1: Hoare triple {21994#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {21994#true} is VALID [2019-05-15 10:34:56,502 INFO L273 TraceCheckUtils]: 2: Hoare triple {21994#true} #memory_int := #memory_int[main_p1 := 0]; {22005#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:34:56,503 INFO L273 TraceCheckUtils]: 3: Hoare triple {22005#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22009#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:34:56,504 INFO L273 TraceCheckUtils]: 4: Hoare triple {22009#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22013#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:34:56,504 INFO L273 TraceCheckUtils]: 5: Hoare triple {22013#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22017#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:34:56,505 INFO L273 TraceCheckUtils]: 6: Hoare triple {22017#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22021#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:34:56,505 INFO L273 TraceCheckUtils]: 7: Hoare triple {22021#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22025#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:34:56,506 INFO L273 TraceCheckUtils]: 8: Hoare triple {22025#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22029#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:34:56,506 INFO L273 TraceCheckUtils]: 9: Hoare triple {22029#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22033#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:34:56,507 INFO L273 TraceCheckUtils]: 10: Hoare triple {22033#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22037#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:34:56,508 INFO L273 TraceCheckUtils]: 11: Hoare triple {22037#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22041#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:34:56,509 INFO L273 TraceCheckUtils]: 12: Hoare triple {22041#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22045#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:34:56,509 INFO L273 TraceCheckUtils]: 13: Hoare triple {22045#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22049#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:34:56,510 INFO L273 TraceCheckUtils]: 14: Hoare triple {22049#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22053#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:34:56,511 INFO L273 TraceCheckUtils]: 15: Hoare triple {22053#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22057#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:34:56,512 INFO L273 TraceCheckUtils]: 16: Hoare triple {22057#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22061#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:34:56,512 INFO L273 TraceCheckUtils]: 17: Hoare triple {22061#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22065#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:34:56,513 INFO L273 TraceCheckUtils]: 18: Hoare triple {22065#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22069#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:34:56,514 INFO L273 TraceCheckUtils]: 19: Hoare triple {22069#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22073#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:34:56,515 INFO L273 TraceCheckUtils]: 20: Hoare triple {22073#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22077#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:34:56,515 INFO L273 TraceCheckUtils]: 21: Hoare triple {22077#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22081#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:34:56,516 INFO L273 TraceCheckUtils]: 22: Hoare triple {22081#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22085#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:34:56,517 INFO L273 TraceCheckUtils]: 23: Hoare triple {22085#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22089#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:34:56,518 INFO L273 TraceCheckUtils]: 24: Hoare triple {22089#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22093#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:34:56,518 INFO L273 TraceCheckUtils]: 25: Hoare triple {22093#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22097#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:34:56,519 INFO L273 TraceCheckUtils]: 26: Hoare triple {22097#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22101#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:34:56,520 INFO L273 TraceCheckUtils]: 27: Hoare triple {22101#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22105#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:34:56,521 INFO L273 TraceCheckUtils]: 28: Hoare triple {22105#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22109#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:34:56,521 INFO L273 TraceCheckUtils]: 29: Hoare triple {22109#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22113#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:34:56,522 INFO L273 TraceCheckUtils]: 30: Hoare triple {22113#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22117#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:34:56,523 INFO L273 TraceCheckUtils]: 31: Hoare triple {22117#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22121#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:34:56,524 INFO L273 TraceCheckUtils]: 32: Hoare triple {22121#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22125#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:34:56,524 INFO L273 TraceCheckUtils]: 33: Hoare triple {22125#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22129#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:34:56,525 INFO L273 TraceCheckUtils]: 34: Hoare triple {22129#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22133#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:34:56,526 INFO L273 TraceCheckUtils]: 35: Hoare triple {22133#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22137#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:34:56,527 INFO L273 TraceCheckUtils]: 36: Hoare triple {22137#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22141#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:34:56,527 INFO L273 TraceCheckUtils]: 37: Hoare triple {22141#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22145#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:34:56,528 INFO L273 TraceCheckUtils]: 38: Hoare triple {22145#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22149#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:34:56,529 INFO L273 TraceCheckUtils]: 39: Hoare triple {22149#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22153#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:34:56,530 INFO L273 TraceCheckUtils]: 40: Hoare triple {22153#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22157#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:34:56,530 INFO L273 TraceCheckUtils]: 41: Hoare triple {22157#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22161#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:34:56,531 INFO L273 TraceCheckUtils]: 42: Hoare triple {22161#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22165#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:34:56,532 INFO L273 TraceCheckUtils]: 43: Hoare triple {22165#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22169#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:34:56,533 INFO L273 TraceCheckUtils]: 44: Hoare triple {22169#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22173#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:34:56,533 INFO L273 TraceCheckUtils]: 45: Hoare triple {22173#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22177#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:34:56,534 INFO L273 TraceCheckUtils]: 46: Hoare triple {22177#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22181#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:34:56,535 INFO L273 TraceCheckUtils]: 47: Hoare triple {22181#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22185#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:34:56,536 INFO L273 TraceCheckUtils]: 48: Hoare triple {22185#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22189#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:34:56,536 INFO L273 TraceCheckUtils]: 49: Hoare triple {22189#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22193#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:34:56,537 INFO L273 TraceCheckUtils]: 50: Hoare triple {22193#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22197#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:34:56,538 INFO L273 TraceCheckUtils]: 51: Hoare triple {22197#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22201#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:34:56,539 INFO L273 TraceCheckUtils]: 52: Hoare triple {22201#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22205#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:34:56,539 INFO L273 TraceCheckUtils]: 53: Hoare triple {22205#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22209#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:34:56,540 INFO L273 TraceCheckUtils]: 54: Hoare triple {22209#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22213#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:34:56,541 INFO L273 TraceCheckUtils]: 55: Hoare triple {22213#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22217#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:34:56,542 INFO L273 TraceCheckUtils]: 56: Hoare triple {22217#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22221#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:34:56,545 INFO L273 TraceCheckUtils]: 57: Hoare triple {22221#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22225#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:34:56,546 INFO L273 TraceCheckUtils]: 58: Hoare triple {22225#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22229#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:34:56,546 INFO L273 TraceCheckUtils]: 59: Hoare triple {22229#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22233#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:34:56,547 INFO L273 TraceCheckUtils]: 60: Hoare triple {22233#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22237#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:34:56,547 INFO L273 TraceCheckUtils]: 61: Hoare triple {22237#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22241#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:34:56,548 INFO L273 TraceCheckUtils]: 62: Hoare triple {22241#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22245#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:34:56,548 INFO L273 TraceCheckUtils]: 63: Hoare triple {22245#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22249#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:34:56,549 INFO L273 TraceCheckUtils]: 64: Hoare triple {22249#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22253#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:34:56,550 INFO L273 TraceCheckUtils]: 65: Hoare triple {22253#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22257#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:34:56,551 INFO L273 TraceCheckUtils]: 66: Hoare triple {22257#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22261#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} is VALID [2019-05-15 10:34:56,551 INFO L273 TraceCheckUtils]: 67: Hoare triple {22261#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22265#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} is VALID [2019-05-15 10:34:56,552 INFO L273 TraceCheckUtils]: 68: Hoare triple {22265#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22269#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} is VALID [2019-05-15 10:34:56,553 INFO L273 TraceCheckUtils]: 69: Hoare triple {22269#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22273#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} is VALID [2019-05-15 10:34:56,554 INFO L273 TraceCheckUtils]: 70: Hoare triple {22273#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22277#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} is VALID [2019-05-15 10:34:56,554 INFO L273 TraceCheckUtils]: 71: Hoare triple {22277#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22281#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} is VALID [2019-05-15 10:34:56,555 INFO L273 TraceCheckUtils]: 72: Hoare triple {22281#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22285#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} is VALID [2019-05-15 10:34:56,556 INFO L273 TraceCheckUtils]: 73: Hoare triple {22285#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} assume !(#memory_int[main_p1] >= 0); {21995#false} is VALID [2019-05-15 10:34:56,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:34:56,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:34:56,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-05-15 10:34:56,565 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 74 [2019-05-15 10:34:56,565 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:34:56,565 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 73 states. [2019-05-15 10:34:56,623 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:56,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-05-15 10:34:56,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-05-15 10:34:56,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-05-15 10:34:56,624 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 73 states. [2019-05-15 10:35:06,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:35:06,953 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-05-15 10:35:06,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-05-15 10:35:06,953 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 74 [2019-05-15 10:35:06,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:35:06,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-05-15 10:35:06,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2019-05-15 10:35:06,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-05-15 10:35:06,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2019-05-15 10:35:06,956 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 73 states and 77 transitions. [2019-05-15 10:35:07,017 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:35:07,018 INFO L225 Difference]: With dead ends: 76 [2019-05-15 10:35:07,019 INFO L226 Difference]: Without dead ends: 76 [2019-05-15 10:35:07,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-05-15 10:35:07,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-05-15 10:35:07,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-05-15 10:35:07,021 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:35:07,021 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 76 states. [2019-05-15 10:35:07,021 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 76 states. [2019-05-15 10:35:07,021 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 76 states. [2019-05-15 10:35:07,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:35:07,022 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-05-15 10:35:07,022 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-05-15 10:35:07,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:35:07,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:35:07,023 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 76 states. [2019-05-15 10:35:07,023 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 76 states. [2019-05-15 10:35:07,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:35:07,024 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-05-15 10:35:07,024 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-05-15 10:35:07,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:35:07,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:35:07,024 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:35:07,025 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:35:07,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-05-15 10:35:07,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-05-15 10:35:07,026 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-05-15 10:35:07,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:35:07,026 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-05-15 10:35:07,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-05-15 10:35:07,026 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-05-15 10:35:07,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-05-15 10:35:07,026 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:35:07,027 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1, 1] [2019-05-15 10:35:07,027 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:35:07,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:35:07,027 INFO L82 PathProgramCache]: Analyzing trace with hash -549720190, now seen corresponding path program 71 times [2019-05-15 10:35:07,028 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:35:07,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:35:07,058 WARN L254 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 73 conjunts are in the unsatisfiable core [2019-05-15 10:35:07,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:35:07,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:35:07,095 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:07,095 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,097 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:07,097 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,097 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:35:07,099 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:07,100 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2563|]. (= (store |v_#memory_int_2563| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:35:07,100 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:35:07,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 16 treesize of output 11 [2019-05-15 10:35:07,114 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,116 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:07,117 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,117 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:07,125 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:07,125 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2564|]. (let ((.cse0 (select |v_#memory_int_2564| ULTIMATE.start_main_p1))) (and (= .cse0 0) (= (store |v_#memory_int_2564| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:07,125 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:35:07,136 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:07,136 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,138 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:07,139 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,139 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:07,146 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:07,146 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2565|]. (let ((.cse0 (select |v_#memory_int_2565| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2565| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 1))) [2019-05-15 10:35:07,146 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:35:07,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:07,157 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,159 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:07,159 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,159 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:07,166 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:07,166 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2566|]. (let ((.cse0 (select |v_#memory_int_2566| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2566| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 2 .cse0))) [2019-05-15 10:35:07,167 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:35:07,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:07,180 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,181 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:07,181 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,182 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:07,189 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:07,189 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2567|]. (let ((.cse0 (select |v_#memory_int_2567| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2567| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 3))) [2019-05-15 10:35:07,189 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:35:07,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 16 treesize of output 11 [2019-05-15 10:35:07,202 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,204 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:07,204 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,205 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:07,212 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:07,212 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2568|]. (let ((.cse0 (select |v_#memory_int_2568| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2568| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 4))) [2019-05-15 10:35:07,212 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:35:07,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 16 treesize of output 11 [2019-05-15 10:35:07,226 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,228 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:07,229 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,229 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:07,236 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:07,236 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2569|]. (let ((.cse0 (select |v_#memory_int_2569| ULTIMATE.start_main_p1))) (and (= 5 .cse0) (= (store |v_#memory_int_2569| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:07,236 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:35:07,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 16 treesize of output 11 [2019-05-15 10:35:07,253 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,255 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:07,255 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,256 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:07,263 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:07,263 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2570|]. (let ((.cse0 (select |v_#memory_int_2570| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2570| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 6))) [2019-05-15 10:35:07,263 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:35:07,277 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:07,278 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,280 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:07,280 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,280 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:07,288 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:07,288 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2571|]. (let ((.cse0 (select |v_#memory_int_2571| ULTIMATE.start_main_p1))) (and (= .cse0 7) (= (store |v_#memory_int_2571| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:07,288 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:35:07,305 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:07,305 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,307 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:07,308 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,308 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:07,315 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:07,315 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2572|]. (let ((.cse0 (select |v_#memory_int_2572| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2572| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 8 .cse0))) [2019-05-15 10:35:07,316 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:35:07,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:07,332 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,334 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:07,334 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,334 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:07,342 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:07,342 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2573|]. (let ((.cse0 (select |v_#memory_int_2573| ULTIMATE.start_main_p1))) (and (= .cse0 9) (= (store |v_#memory_int_2573| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:07,342 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:35:07,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:07,361 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,363 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:07,363 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,364 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:07,371 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:07,371 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2574|]. (let ((.cse0 (select |v_#memory_int_2574| ULTIMATE.start_main_p1))) (and (= 10 .cse0) (= (store |v_#memory_int_2574| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:07,371 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:35:07,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 16 treesize of output 11 [2019-05-15 10:35:07,397 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,399 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:07,399 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,400 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:07,407 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:07,407 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2575|]. (let ((.cse0 (select |v_#memory_int_2575| ULTIMATE.start_main_p1))) (and (= 11 .cse0) (= (store |v_#memory_int_2575| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:07,407 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:35:07,425 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:07,429 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,431 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:07,431 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,431 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:07,438 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:07,438 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2576|]. (let ((.cse0 (select |v_#memory_int_2576| ULTIMATE.start_main_p1))) (and (= 12 .cse0) (= |#memory_int| (store |v_#memory_int_2576| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:07,438 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:35:07,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 16 treesize of output 11 [2019-05-15 10:35:07,458 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,460 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:07,460 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,460 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:07,466 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:07,466 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2577|]. (let ((.cse0 (select |v_#memory_int_2577| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2577| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 13))) [2019-05-15 10:35:07,466 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:35:07,485 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:07,485 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,487 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:07,488 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,488 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:07,495 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:07,495 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2578|]. (let ((.cse0 (select |v_#memory_int_2578| ULTIMATE.start_main_p1))) (and (= 14 .cse0) (= (store |v_#memory_int_2578| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:07,495 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:35:07,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:07,517 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,519 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:07,519 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,520 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:07,526 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:07,527 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2579|]. (let ((.cse0 (select |v_#memory_int_2579| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2579| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 15 .cse0))) [2019-05-15 10:35:07,527 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:35:07,547 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:07,547 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,549 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:07,550 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,550 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:07,556 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:07,556 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2580|]. (let ((.cse0 (select |v_#memory_int_2580| ULTIMATE.start_main_p1))) (and (= 16 .cse0) (= (store |v_#memory_int_2580| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:07,557 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:35:07,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:07,580 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,582 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:07,582 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,582 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:07,589 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:07,589 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2581|]. (let ((.cse0 (select |v_#memory_int_2581| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2581| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 17))) [2019-05-15 10:35:07,589 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:35:07,612 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:07,613 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,615 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:07,615 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,615 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:07,622 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:07,622 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2582|]. (let ((.cse0 (select |v_#memory_int_2582| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2582| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 18))) [2019-05-15 10:35:07,622 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:35:07,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:07,645 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,647 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:07,647 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,648 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:07,654 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:07,654 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2583|]. (let ((.cse0 (select |v_#memory_int_2583| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2583| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 19 .cse0))) [2019-05-15 10:35:07,655 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:35:07,678 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:07,679 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,681 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:07,681 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,681 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:07,688 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:07,688 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2584|]. (let ((.cse0 (select |v_#memory_int_2584| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2584| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 20 .cse0))) [2019-05-15 10:35:07,689 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:35:07,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 16 treesize of output 11 [2019-05-15 10:35:07,716 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,718 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:07,718 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,718 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:07,725 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:07,725 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2585|]. (let ((.cse0 (select |v_#memory_int_2585| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2585| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 21 .cse0))) [2019-05-15 10:35:07,725 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:35:07,750 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:07,751 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,753 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:07,753 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,753 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:07,760 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:07,761 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2586|]. (let ((.cse0 (select |v_#memory_int_2586| ULTIMATE.start_main_p1))) (and (= 22 .cse0) (= (store |v_#memory_int_2586| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:07,761 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:35:07,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 16 treesize of output 11 [2019-05-15 10:35:07,789 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,790 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:07,791 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,791 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:07,798 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:07,798 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2587|]. (let ((.cse0 (select |v_#memory_int_2587| ULTIMATE.start_main_p1))) (and (= 23 .cse0) (= |#memory_int| (store |v_#memory_int_2587| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:07,798 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:35:07,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:07,826 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,828 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:07,828 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,829 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:07,836 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:07,836 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2588|]. (let ((.cse0 (select |v_#memory_int_2588| ULTIMATE.start_main_p1))) (and (= 24 .cse0) (= (store |v_#memory_int_2588| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:07,836 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:35:07,863 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:07,864 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,866 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:07,866 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,867 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:07,873 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:07,873 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2589|]. (let ((.cse0 (select |v_#memory_int_2589| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2589| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 25 .cse0))) [2019-05-15 10:35:07,874 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:35:07,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 16 treesize of output 11 [2019-05-15 10:35:07,904 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,906 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:07,906 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,906 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:07,914 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:07,914 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2590|]. (let ((.cse0 (select |v_#memory_int_2590| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2590| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 26))) [2019-05-15 10:35:07,914 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:35:07,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 16 treesize of output 11 [2019-05-15 10:35:07,944 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,946 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:07,946 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,946 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:07,954 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:07,954 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2591|]. (let ((.cse0 (select |v_#memory_int_2591| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2591| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 27))) [2019-05-15 10:35:07,954 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:35:07,985 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:07,986 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,988 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:07,988 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:07,988 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:07,996 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:07,997 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2592|]. (let ((.cse0 (select |v_#memory_int_2592| ULTIMATE.start_main_p1))) (and (= .cse0 28) (= (store |v_#memory_int_2592| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:07,997 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:35:08,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:08,027 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:08,029 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:08,030 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:08,030 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:08,036 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:08,037 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2593|]. (let ((.cse0 (select |v_#memory_int_2593| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2593| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 29 .cse0))) [2019-05-15 10:35:08,037 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:35:08,068 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:08,069 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:08,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:08,071 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:08,072 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:08,078 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:08,078 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2594|]. (let ((.cse0 (select |v_#memory_int_2594| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2594| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 30))) [2019-05-15 10:35:08,079 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:35:08,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 16 treesize of output 11 [2019-05-15 10:35:08,113 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:08,115 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:08,116 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:08,116 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:08,123 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:08,124 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2595|]. (let ((.cse0 (select |v_#memory_int_2595| ULTIMATE.start_main_p1))) (and (= .cse0 31) (= (store |v_#memory_int_2595| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:08,124 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:35:08,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:08,159 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:08,161 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:08,161 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:08,161 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:08,168 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:08,169 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2596|]. (let ((.cse0 (select |v_#memory_int_2596| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2596| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 32 .cse0))) [2019-05-15 10:35:08,169 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:35:08,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 16 treesize of output 11 [2019-05-15 10:35:08,211 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:08,212 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:08,212 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:08,212 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:08,219 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:08,219 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2597|]. (let ((.cse0 (select |v_#memory_int_2597| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2597| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 33 .cse0))) [2019-05-15 10:35:08,219 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:35:08,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 16 treesize of output 11 [2019-05-15 10:35:08,255 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:08,257 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:08,258 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:08,258 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:08,266 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:08,266 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2598|]. (let ((.cse0 (select |v_#memory_int_2598| ULTIMATE.start_main_p1))) (and (= .cse0 34) (= (store |v_#memory_int_2598| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:08,266 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:35:08,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 16 treesize of output 11 [2019-05-15 10:35:08,302 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:08,304 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:08,304 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:08,304 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:08,311 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:08,311 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2599|]. (let ((.cse0 (select |v_#memory_int_2599| ULTIMATE.start_main_p1))) (and (= .cse0 35) (= |#memory_int| (store |v_#memory_int_2599| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:08,312 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:35:08,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 16 treesize of output 11 [2019-05-15 10:35:08,347 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:08,349 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:08,350 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:08,350 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:08,358 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:08,358 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2600|]. (let ((.cse0 (select |v_#memory_int_2600| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2600| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 36 .cse0))) [2019-05-15 10:35:08,358 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:35:08,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 16 treesize of output 11 [2019-05-15 10:35:08,397 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:08,400 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:08,400 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:08,400 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:08,406 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:08,406 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2601|]. (let ((.cse0 (select |v_#memory_int_2601| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2601| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 37))) [2019-05-15 10:35:08,406 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:35:08,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 16 treesize of output 11 [2019-05-15 10:35:08,449 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:08,451 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:08,451 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:08,451 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:08,459 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:08,459 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2602|]. (let ((.cse0 (select |v_#memory_int_2602| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2602| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 38))) [2019-05-15 10:35:08,459 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:35:08,499 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:08,500 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:08,502 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:08,502 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:08,503 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:08,511 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:08,511 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2603|]. (let ((.cse0 (select |v_#memory_int_2603| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2603| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 39 .cse0))) [2019-05-15 10:35:08,511 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:35:08,554 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:08,555 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:08,557 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:08,557 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:08,558 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:08,565 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:08,566 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2604|]. (let ((.cse0 (select |v_#memory_int_2604| ULTIMATE.start_main_p1))) (and (= 40 .cse0) (= (store |v_#memory_int_2604| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:08,566 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:35:08,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:08,608 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:08,610 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:08,610 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:08,610 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:08,619 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:08,619 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2605|]. (let ((.cse0 (select |v_#memory_int_2605| ULTIMATE.start_main_p1))) (and (= .cse0 41) (= |#memory_int| (store |v_#memory_int_2605| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:08,619 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:35:08,661 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:08,662 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:08,664 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:08,665 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:08,665 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:08,672 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:08,672 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2606|]. (let ((.cse0 (select |v_#memory_int_2606| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2606| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 42))) [2019-05-15 10:35:08,672 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:35:08,713 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:08,714 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:08,716 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:08,717 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:08,717 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:08,726 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:08,726 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2607|]. (let ((.cse0 (select |v_#memory_int_2607| ULTIMATE.start_main_p1))) (and (= .cse0 43) (= (store |v_#memory_int_2607| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:08,726 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:35:08,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 16 treesize of output 11 [2019-05-15 10:35:08,771 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:08,773 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:08,773 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:08,774 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:08,782 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:08,782 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2608|]. (let ((.cse0 (select |v_#memory_int_2608| ULTIMATE.start_main_p1))) (and (= 44 .cse0) (= (store |v_#memory_int_2608| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:08,782 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:35:08,830 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:08,831 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:08,834 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:08,834 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:08,834 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:08,842 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:08,842 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2609|]. (let ((.cse0 (select |v_#memory_int_2609| ULTIMATE.start_main_p1))) (and (= 45 .cse0) (= (store |v_#memory_int_2609| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:08,842 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:35:08,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 16 treesize of output 11 [2019-05-15 10:35:08,892 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:08,894 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:08,894 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:08,894 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:08,902 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:08,902 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2610|]. (let ((.cse0 (select |v_#memory_int_2610| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2610| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 46))) [2019-05-15 10:35:08,902 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:35:08,956 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:08,956 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:08,958 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:08,959 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:08,959 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:08,965 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:08,965 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2611|]. (let ((.cse0 (select |v_#memory_int_2611| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2611| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 47 .cse0))) [2019-05-15 10:35:08,965 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:35:09,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:09,010 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:09,012 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:09,012 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:09,012 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:09,020 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:09,021 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2612|]. (let ((.cse0 (select |v_#memory_int_2612| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2612| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 48))) [2019-05-15 10:35:09,021 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:35:09,069 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:09,080 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:09,081 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:09,081 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:09,082 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:09,088 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:09,088 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2613|]. (let ((.cse0 (select |v_#memory_int_2613| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2613| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 49))) [2019-05-15 10:35:09,088 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:35:09,135 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:09,136 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:09,138 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:09,138 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:09,138 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:09,145 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:09,146 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2614|]. (let ((.cse0 (select |v_#memory_int_2614| ULTIMATE.start_main_p1))) (and (= 50 .cse0) (= (store |v_#memory_int_2614| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:09,146 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:35: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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:09,194 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:09,196 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:09,196 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:09,196 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:09,205 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:09,205 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2615|]. (let ((.cse0 (select |v_#memory_int_2615| ULTIMATE.start_main_p1))) (and (= .cse0 51) (= (store |v_#memory_int_2615| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:09,205 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:35:09,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:09,257 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:09,259 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:09,259 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:09,259 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:09,266 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:09,267 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2616|]. (let ((.cse0 (select |v_#memory_int_2616| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2616| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 52 .cse0))) [2019-05-15 10:35:09,267 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:35:09,318 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:09,319 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:09,321 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:09,321 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:09,321 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:09,328 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:09,329 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2617|]. (let ((.cse0 (select |v_#memory_int_2617| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2617| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 53))) [2019-05-15 10:35:09,329 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:35:09,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:09,380 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:09,382 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:09,382 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:09,382 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:09,390 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:09,390 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2618|]. (let ((.cse0 (select |v_#memory_int_2618| ULTIMATE.start_main_p1))) (and (= 54 .cse0) (= (store |v_#memory_int_2618| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:09,390 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:35:09,439 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:09,440 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:09,442 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:09,442 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:09,442 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:09,451 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:09,451 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2619|]. (let ((.cse0 (select |v_#memory_int_2619| ULTIMATE.start_main_p1))) (and (= .cse0 55) (= |#memory_int| (store |v_#memory_int_2619| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:09,451 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:35:09,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 16 treesize of output 11 [2019-05-15 10:35:09,506 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:09,508 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:09,508 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:09,508 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:09,516 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:09,516 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2620|]. (let ((.cse0 (select |v_#memory_int_2620| ULTIMATE.start_main_p1))) (and (= .cse0 56) (= (store |v_#memory_int_2620| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:09,516 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:35:09,570 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:09,571 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:09,573 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:09,573 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:09,574 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:09,581 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:09,581 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2621|]. (let ((.cse0 (select |v_#memory_int_2621| ULTIMATE.start_main_p1))) (and (= 57 .cse0) (= |#memory_int| (store |v_#memory_int_2621| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:09,582 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:35:09,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 16 treesize of output 11 [2019-05-15 10:35:09,638 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:09,640 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:09,640 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:09,640 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:09,648 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:09,648 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2622|]. (let ((.cse0 (select |v_#memory_int_2622| ULTIMATE.start_main_p1))) (and (= .cse0 58) (= (store |v_#memory_int_2622| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:09,648 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:35:09,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 16 treesize of output 11 [2019-05-15 10:35:09,703 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:09,705 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:09,705 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:09,705 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:09,713 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:09,713 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2623|]. (let ((.cse0 (select |v_#memory_int_2623| ULTIMATE.start_main_p1))) (and (= 59 .cse0) (= (store |v_#memory_int_2623| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:09,713 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:35:09,768 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:09,769 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:09,771 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:09,771 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:09,771 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:09,778 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:09,778 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2624|]. (let ((.cse0 (select |v_#memory_int_2624| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2624| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 60))) [2019-05-15 10:35:09,779 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:35:09,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:09,834 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:09,836 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:09,837 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:09,837 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:09,844 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:09,845 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2625|]. (let ((.cse0 (select |v_#memory_int_2625| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2625| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 61 .cse0))) [2019-05-15 10:35:09,845 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:35:09,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 16 treesize of output 11 [2019-05-15 10:35:09,921 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:09,952 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:09,952 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:09,952 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:09,957 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:09,958 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2626|]. (let ((.cse0 (select |v_#memory_int_2626| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2626| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 62 .cse0))) [2019-05-15 10:35:09,958 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:35:10,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:10,014 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:10,016 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:10,016 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:10,017 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:10,024 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:10,025 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2627|]. (let ((.cse0 (select |v_#memory_int_2627| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2627| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 63))) [2019-05-15 10:35:10,025 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 64) [2019-05-15 10:35:10,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:10,081 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:10,083 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:10,084 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:10,084 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:10,090 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:10,090 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2628|]. (let ((.cse0 (select |v_#memory_int_2628| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2628| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 64))) [2019-05-15 10:35:10,090 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 65) [2019-05-15 10:35:10,152 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:10,153 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:10,155 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:10,155 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:10,156 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:10,163 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:10,163 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2629|]. (let ((.cse0 (select |v_#memory_int_2629| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2629| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 65))) [2019-05-15 10:35:10,164 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 66) [2019-05-15 10:35:10,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:10,225 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:10,227 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:10,227 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:10,227 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:10,234 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:10,234 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2630|]. (let ((.cse0 (select |v_#memory_int_2630| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2630| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 66 .cse0))) [2019-05-15 10:35:10,234 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 67) [2019-05-15 10:35:10,294 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:10,295 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:10,297 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:10,297 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:10,298 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:10,305 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:10,305 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2631|]. (let ((.cse0 (select |v_#memory_int_2631| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2631| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 67 .cse0))) [2019-05-15 10:35:10,305 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 68) [2019-05-15 10:35:10,366 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:10,367 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:10,369 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:10,369 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:10,370 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:10,377 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:10,377 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2632|]. (let ((.cse0 (select |v_#memory_int_2632| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2632| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 68))) [2019-05-15 10:35:10,377 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 69) [2019-05-15 10:35:10,440 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:10,441 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:10,443 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:10,443 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:10,443 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:10,451 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:10,451 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2633|]. (let ((.cse0 (select |v_#memory_int_2633| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2633| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 69))) [2019-05-15 10:35:10,451 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 70) [2019-05-15 10:35:10,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 16 treesize of output 11 [2019-05-15 10:35:10,524 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:10,526 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:10,526 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:10,526 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:10,533 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:10,533 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2634|]. (let ((.cse0 (select |v_#memory_int_2634| ULTIMATE.start_main_p1))) (and (= 70 .cse0) (= (store |v_#memory_int_2634| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:10,533 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 71) [2019-05-15 10:35:10,591 INFO L273 TraceCheckUtils]: 0: Hoare triple {22592#true} havoc main_p1; {22592#true} is VALID [2019-05-15 10:35:10,591 INFO L273 TraceCheckUtils]: 1: Hoare triple {22592#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {22592#true} is VALID [2019-05-15 10:35:10,592 INFO L273 TraceCheckUtils]: 2: Hoare triple {22592#true} #memory_int := #memory_int[main_p1 := 0]; {22603#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:35:10,593 INFO L273 TraceCheckUtils]: 3: Hoare triple {22603#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22607#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:35:10,593 INFO L273 TraceCheckUtils]: 4: Hoare triple {22607#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22611#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:35:10,594 INFO L273 TraceCheckUtils]: 5: Hoare triple {22611#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22615#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:35:10,595 INFO L273 TraceCheckUtils]: 6: Hoare triple {22615#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22619#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:35:10,596 INFO L273 TraceCheckUtils]: 7: Hoare triple {22619#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22623#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:35:10,596 INFO L273 TraceCheckUtils]: 8: Hoare triple {22623#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22627#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:35:10,597 INFO L273 TraceCheckUtils]: 9: Hoare triple {22627#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22631#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:35:10,598 INFO L273 TraceCheckUtils]: 10: Hoare triple {22631#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22635#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:35:10,599 INFO L273 TraceCheckUtils]: 11: Hoare triple {22635#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22639#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:35:10,599 INFO L273 TraceCheckUtils]: 12: Hoare triple {22639#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22643#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:35:10,600 INFO L273 TraceCheckUtils]: 13: Hoare triple {22643#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22647#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:35:10,601 INFO L273 TraceCheckUtils]: 14: Hoare triple {22647#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22651#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:35:10,602 INFO L273 TraceCheckUtils]: 15: Hoare triple {22651#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22655#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:35:10,602 INFO L273 TraceCheckUtils]: 16: Hoare triple {22655#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22659#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:35:10,603 INFO L273 TraceCheckUtils]: 17: Hoare triple {22659#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22663#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:35:10,604 INFO L273 TraceCheckUtils]: 18: Hoare triple {22663#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22667#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:35:10,605 INFO L273 TraceCheckUtils]: 19: Hoare triple {22667#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22671#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:35:10,605 INFO L273 TraceCheckUtils]: 20: Hoare triple {22671#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22675#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:35:10,606 INFO L273 TraceCheckUtils]: 21: Hoare triple {22675#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22679#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:35:10,607 INFO L273 TraceCheckUtils]: 22: Hoare triple {22679#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22683#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:35:10,608 INFO L273 TraceCheckUtils]: 23: Hoare triple {22683#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22687#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:35:10,608 INFO L273 TraceCheckUtils]: 24: Hoare triple {22687#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22691#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:35:10,609 INFO L273 TraceCheckUtils]: 25: Hoare triple {22691#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22695#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:35:10,610 INFO L273 TraceCheckUtils]: 26: Hoare triple {22695#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22699#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:35:10,611 INFO L273 TraceCheckUtils]: 27: Hoare triple {22699#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22703#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:35:10,611 INFO L273 TraceCheckUtils]: 28: Hoare triple {22703#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22707#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:35:10,612 INFO L273 TraceCheckUtils]: 29: Hoare triple {22707#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22711#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:35:10,613 INFO L273 TraceCheckUtils]: 30: Hoare triple {22711#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22715#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:35:10,614 INFO L273 TraceCheckUtils]: 31: Hoare triple {22715#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22719#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:35:10,614 INFO L273 TraceCheckUtils]: 32: Hoare triple {22719#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22723#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:35:10,615 INFO L273 TraceCheckUtils]: 33: Hoare triple {22723#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22727#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:35:10,616 INFO L273 TraceCheckUtils]: 34: Hoare triple {22727#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22731#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:35:10,617 INFO L273 TraceCheckUtils]: 35: Hoare triple {22731#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22735#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:35:10,617 INFO L273 TraceCheckUtils]: 36: Hoare triple {22735#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22739#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:35:10,618 INFO L273 TraceCheckUtils]: 37: Hoare triple {22739#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22743#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:35:10,619 INFO L273 TraceCheckUtils]: 38: Hoare triple {22743#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22747#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:35:10,620 INFO L273 TraceCheckUtils]: 39: Hoare triple {22747#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22751#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:35:10,620 INFO L273 TraceCheckUtils]: 40: Hoare triple {22751#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22755#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:35:10,621 INFO L273 TraceCheckUtils]: 41: Hoare triple {22755#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22759#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:35:10,622 INFO L273 TraceCheckUtils]: 42: Hoare triple {22759#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22763#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:35:10,622 INFO L273 TraceCheckUtils]: 43: Hoare triple {22763#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22767#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:35:10,623 INFO L273 TraceCheckUtils]: 44: Hoare triple {22767#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22771#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:35:10,624 INFO L273 TraceCheckUtils]: 45: Hoare triple {22771#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22775#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:35:10,625 INFO L273 TraceCheckUtils]: 46: Hoare triple {22775#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22779#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:35:10,625 INFO L273 TraceCheckUtils]: 47: Hoare triple {22779#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22783#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:35:10,626 INFO L273 TraceCheckUtils]: 48: Hoare triple {22783#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22787#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:35:10,627 INFO L273 TraceCheckUtils]: 49: Hoare triple {22787#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22791#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:35:10,628 INFO L273 TraceCheckUtils]: 50: Hoare triple {22791#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22795#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:35:10,628 INFO L273 TraceCheckUtils]: 51: Hoare triple {22795#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22799#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:35:10,629 INFO L273 TraceCheckUtils]: 52: Hoare triple {22799#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22803#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:35:10,630 INFO L273 TraceCheckUtils]: 53: Hoare triple {22803#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22807#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:35:10,631 INFO L273 TraceCheckUtils]: 54: Hoare triple {22807#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22811#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:35:10,631 INFO L273 TraceCheckUtils]: 55: Hoare triple {22811#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22815#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:35:10,632 INFO L273 TraceCheckUtils]: 56: Hoare triple {22815#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22819#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:35:10,633 INFO L273 TraceCheckUtils]: 57: Hoare triple {22819#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22823#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:35:10,634 INFO L273 TraceCheckUtils]: 58: Hoare triple {22823#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22827#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:35:10,634 INFO L273 TraceCheckUtils]: 59: Hoare triple {22827#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22831#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:35:10,635 INFO L273 TraceCheckUtils]: 60: Hoare triple {22831#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22835#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:35:10,636 INFO L273 TraceCheckUtils]: 61: Hoare triple {22835#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22839#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:35:10,637 INFO L273 TraceCheckUtils]: 62: Hoare triple {22839#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22843#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:35:10,637 INFO L273 TraceCheckUtils]: 63: Hoare triple {22843#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22847#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:35:10,638 INFO L273 TraceCheckUtils]: 64: Hoare triple {22847#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22851#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:35:10,639 INFO L273 TraceCheckUtils]: 65: Hoare triple {22851#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22855#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:35:10,640 INFO L273 TraceCheckUtils]: 66: Hoare triple {22855#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22859#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} is VALID [2019-05-15 10:35:10,640 INFO L273 TraceCheckUtils]: 67: Hoare triple {22859#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22863#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} is VALID [2019-05-15 10:35:10,641 INFO L273 TraceCheckUtils]: 68: Hoare triple {22863#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22867#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} is VALID [2019-05-15 10:35:10,642 INFO L273 TraceCheckUtils]: 69: Hoare triple {22867#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22871#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} is VALID [2019-05-15 10:35:10,643 INFO L273 TraceCheckUtils]: 70: Hoare triple {22871#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22875#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} is VALID [2019-05-15 10:35:10,643 INFO L273 TraceCheckUtils]: 71: Hoare triple {22875#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22879#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} is VALID [2019-05-15 10:35:10,644 INFO L273 TraceCheckUtils]: 72: Hoare triple {22879#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22883#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} is VALID [2019-05-15 10:35:10,645 INFO L273 TraceCheckUtils]: 73: Hoare triple {22883#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22887#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} is VALID [2019-05-15 10:35:10,646 INFO L273 TraceCheckUtils]: 74: Hoare triple {22887#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} assume !(#memory_int[main_p1] >= 0); {22593#false} is VALID [2019-05-15 10:35:10,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:35:10,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:35:10,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-05-15 10:35:10,654 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 75 [2019-05-15 10:35:10,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:35:10,654 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 74 states. [2019-05-15 10:35:10,714 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:35:10,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-05-15 10:35:10,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-05-15 10:35:10,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-05-15 10:35:10,715 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 74 states. [2019-05-15 10:35:21,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:35:21,346 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-05-15 10:35:21,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-05-15 10:35:21,346 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 75 [2019-05-15 10:35:21,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:35:21,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-05-15 10:35:21,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2019-05-15 10:35:21,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-05-15 10:35:21,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2019-05-15 10:35:21,348 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 74 states and 78 transitions. [2019-05-15 10:35:21,416 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:21,418 INFO L225 Difference]: With dead ends: 77 [2019-05-15 10:35:21,418 INFO L226 Difference]: Without dead ends: 77 [2019-05-15 10:35:21,418 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-05-15 10:35:21,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-05-15 10:35:21,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-05-15 10:35:21,419 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:35:21,419 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 77 states. [2019-05-15 10:35:21,419 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 77 states. [2019-05-15 10:35:21,420 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 77 states. [2019-05-15 10:35:21,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:35:21,420 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-05-15 10:35:21,420 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-05-15 10:35:21,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:35:21,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:35:21,421 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 77 states. [2019-05-15 10:35:21,421 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 77 states. [2019-05-15 10:35:21,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:35:21,421 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-05-15 10:35:21,421 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-05-15 10:35:21,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:35:21,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:35:21,422 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:35:21,422 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:35:21,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-05-15 10:35:21,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-05-15 10:35:21,423 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-05-15 10:35:21,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:35:21,423 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-05-15 10:35:21,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-05-15 10:35:21,423 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-05-15 10:35:21,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-05-15 10:35:21,423 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:35:21,423 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1, 1] [2019-05-15 10:35:21,423 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:35:21,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:35:21,424 INFO L82 PathProgramCache]: Analyzing trace with hash 138543240, now seen corresponding path program 72 times [2019-05-15 10:35:21,424 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:35:21,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:35:21,456 WARN L254 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 74 conjunts are in the unsatisfiable core [2019-05-15 10:35:21,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:35:21,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:35:21,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:35:21,484 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,489 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:21,489 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,489 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:35:21,491 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:21,491 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2635|]. (= |#memory_int| (store |v_#memory_int_2635| ULTIMATE.start_main_p1 0)) [2019-05-15 10:35:21,491 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:35:21,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:21,509 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,510 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:21,510 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,510 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:21,518 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:21,518 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2636|]. (let ((.cse0 (select |v_#memory_int_2636| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2636| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 0))) [2019-05-15 10:35:21,518 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:35:21,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:21,529 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,531 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:21,531 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,531 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:21,539 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:21,539 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2637|]. (let ((.cse0 (select |v_#memory_int_2637| ULTIMATE.start_main_p1))) (and (= .cse0 1) (= (store |v_#memory_int_2637| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:21,539 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:35:21,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 16 treesize of output 11 [2019-05-15 10:35:21,550 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,555 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:21,555 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,555 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:21,561 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:21,561 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2638|]. (let ((.cse0 (select |v_#memory_int_2638| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2638| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 2 .cse0))) [2019-05-15 10:35:21,561 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:35:21,573 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:21,574 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,578 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:21,578 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,578 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:21,585 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:21,586 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2639|]. (let ((.cse0 (select |v_#memory_int_2639| ULTIMATE.start_main_p1))) (and (= 3 .cse0) (= (store |v_#memory_int_2639| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:21,586 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:35:21,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 16 treesize of output 11 [2019-05-15 10:35:21,597 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,599 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:21,599 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,599 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:21,607 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:21,607 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2640|]. (let ((.cse0 (select |v_#memory_int_2640| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2640| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 4 .cse0))) [2019-05-15 10:35:21,607 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:35:21,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 16 treesize of output 11 [2019-05-15 10:35:21,621 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,624 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:21,624 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,624 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:21,632 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:21,632 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2641|]. (let ((.cse0 (select |v_#memory_int_2641| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2641| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 5))) [2019-05-15 10:35:21,632 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:35:21,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:21,646 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,648 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:21,648 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,648 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:21,656 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:21,656 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2642|]. (let ((.cse0 (select |v_#memory_int_2642| ULTIMATE.start_main_p1))) (and (= .cse0 6) (= |#memory_int| (store |v_#memory_int_2642| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:21,656 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:35:21,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:21,671 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,673 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:21,674 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,674 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:21,681 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:21,681 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2643|]. (let ((.cse0 (select |v_#memory_int_2643| ULTIMATE.start_main_p1))) (and (= .cse0 7) (= |#memory_int| (store |v_#memory_int_2643| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:21,681 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:35:21,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:21,696 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,698 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:21,698 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,698 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:21,706 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:21,706 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2644|]. (let ((.cse0 (select |v_#memory_int_2644| ULTIMATE.start_main_p1))) (and (= 8 .cse0) (= |#memory_int| (store |v_#memory_int_2644| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:21,706 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:35:21,721 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:21,721 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,723 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:21,724 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,724 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:21,734 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:21,734 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2645|]. (let ((.cse0 (select |v_#memory_int_2645| ULTIMATE.start_main_p1))) (and (= .cse0 9) (= |#memory_int| (store |v_#memory_int_2645| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:21,734 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:35:21,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 16 treesize of output 11 [2019-05-15 10:35:21,752 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,754 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:21,754 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,754 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:21,761 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:21,761 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2646|]. (let ((.cse0 (select |v_#memory_int_2646| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2646| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 10))) [2019-05-15 10:35:21,761 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:35:21,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 16 treesize of output 11 [2019-05-15 10:35:21,778 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,780 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:21,780 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,780 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:21,787 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:21,788 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2647|]. (let ((.cse0 (select |v_#memory_int_2647| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2647| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 11))) [2019-05-15 10:35:21,788 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:35:21,808 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:21,809 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,811 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:21,811 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,812 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:21,819 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:21,819 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2648|]. (let ((.cse0 (select |v_#memory_int_2648| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2648| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 12 .cse0))) [2019-05-15 10:35:21,819 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:35:21,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 16 treesize of output 11 [2019-05-15 10:35:21,840 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,842 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:21,842 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,843 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:21,849 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:21,850 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2649|]. (let ((.cse0 (select |v_#memory_int_2649| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2649| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 13))) [2019-05-15 10:35:21,850 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:35:21,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 16 treesize of output 11 [2019-05-15 10:35:21,871 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,873 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:21,873 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,873 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:21,881 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:21,882 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2650|]. (let ((.cse0 (select |v_#memory_int_2650| ULTIMATE.start_main_p1))) (and (= .cse0 14) (= |#memory_int| (store |v_#memory_int_2650| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:21,882 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:35:21,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 16 treesize of output 11 [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,904 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:21,904 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,904 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:21,911 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:21,911 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2651|]. (let ((.cse0 (select |v_#memory_int_2651| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2651| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 15 .cse0))) [2019-05-15 10:35:21,912 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:35:21,933 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:21,934 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,936 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:21,936 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,936 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:21,943 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:21,943 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2652|]. (let ((.cse0 (select |v_#memory_int_2652| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2652| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 16))) [2019-05-15 10:35:21,943 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:35:21,965 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:21,965 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,967 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:21,968 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,968 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:21,975 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:21,975 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2653|]. (let ((.cse0 (select |v_#memory_int_2653| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2653| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 17 .cse0))) [2019-05-15 10:35:21,975 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:35:21,998 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:21,999 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,001 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:22,001 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,001 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:22,008 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:22,009 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2654|]. (let ((.cse0 (select |v_#memory_int_2654| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2654| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 18))) [2019-05-15 10:35:22,009 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:35:22,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 16 treesize of output 11 [2019-05-15 10:35:22,033 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,035 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:22,035 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,036 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:22,042 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:22,042 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2655|]. (let ((.cse0 (select |v_#memory_int_2655| ULTIMATE.start_main_p1))) (and (= .cse0 19) (= (store |v_#memory_int_2655| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:22,043 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:35:22,068 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:22,069 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:22,071 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,071 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:22,079 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:22,079 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2656|]. (let ((.cse0 (select |v_#memory_int_2656| ULTIMATE.start_main_p1))) (and (= .cse0 20) (= (store |v_#memory_int_2656| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:22,079 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:35:22,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:22,109 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:22,111 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,111 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:22,117 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:22,118 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2657|]. (let ((.cse0 (select |v_#memory_int_2657| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2657| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 21))) [2019-05-15 10:35:22,118 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:35:22,149 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:22,150 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,152 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:22,152 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,152 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:22,159 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:22,160 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2658|]. (let ((.cse0 (select |v_#memory_int_2658| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2658| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 22 .cse0))) [2019-05-15 10:35:22,160 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:35:22,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 16 treesize of output 11 [2019-05-15 10:35:22,187 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,189 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:22,189 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,189 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:22,197 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:22,197 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2659|]. (let ((.cse0 (select |v_#memory_int_2659| ULTIMATE.start_main_p1))) (and (= 23 .cse0) (= (store |v_#memory_int_2659| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:22,198 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:35:22,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:22,226 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,228 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:22,228 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,229 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:22,236 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:22,236 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2660|]. (let ((.cse0 (select |v_#memory_int_2660| ULTIMATE.start_main_p1))) (and (= .cse0 24) (= |#memory_int| (store |v_#memory_int_2660| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:22,237 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:35:22,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 16 treesize of output 11 [2019-05-15 10:35:22,266 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,268 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:22,269 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,269 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:22,276 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:22,277 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2661|]. (let ((.cse0 (select |v_#memory_int_2661| ULTIMATE.start_main_p1))) (and (= 25 .cse0) (= |#memory_int| (store |v_#memory_int_2661| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:22,277 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:35:22,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 16 treesize of output 11 [2019-05-15 10:35:22,309 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,311 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:22,311 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,311 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:22,320 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:22,320 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2662|]. (let ((.cse0 (select |v_#memory_int_2662| ULTIMATE.start_main_p1))) (and (= 26 .cse0) (= (store |v_#memory_int_2662| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:22,320 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:35:22,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:22,351 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,353 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:22,353 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,354 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:22,362 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:22,362 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2663|]. (let ((.cse0 (select |v_#memory_int_2663| ULTIMATE.start_main_p1))) (and (= .cse0 27) (= (store |v_#memory_int_2663| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:22,362 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:35:22,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 16 treesize of output 11 [2019-05-15 10:35:22,395 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,397 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:22,397 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,397 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:22,404 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_#memory_int_2664|]. (let ((.cse0 (select |v_#memory_int_2664| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2664| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 28))) [2019-05-15 10:35:22,405 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:35:22,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:22,438 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,440 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:22,441 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,441 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:22,448 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:22,449 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2665|]. (let ((.cse0 (select |v_#memory_int_2665| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2665| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 29 .cse0))) [2019-05-15 10:35:22,449 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:35:22,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 16 treesize of output 11 [2019-05-15 10:35:22,482 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,484 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:22,485 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,485 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:22,492 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:22,492 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2666|]. (let ((.cse0 (select |v_#memory_int_2666| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2666| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 30 .cse0))) [2019-05-15 10:35:22,492 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:35:22,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 16 treesize of output 11 [2019-05-15 10:35:22,527 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,529 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:22,529 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,529 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:22,537 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:22,537 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2667|]. (let ((.cse0 (select |v_#memory_int_2667| ULTIMATE.start_main_p1))) (and (= 31 .cse0) (= |#memory_int| (store |v_#memory_int_2667| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:22,537 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:35:22,573 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:22,574 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,576 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:22,576 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,577 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:22,584 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:22,584 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2668|]. (let ((.cse0 (select |v_#memory_int_2668| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2668| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 32 .cse0))) [2019-05-15 10:35:22,584 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:35:22,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 16 treesize of output 11 [2019-05-15 10:35:22,621 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,623 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:22,624 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,624 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:22,631 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:22,632 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2669|]. (let ((.cse0 (select |v_#memory_int_2669| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2669| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 33 .cse0))) [2019-05-15 10:35:22,632 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:35:22,668 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:22,669 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,671 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:22,671 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,671 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:22,679 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:22,679 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2670|]. (let ((.cse0 (select |v_#memory_int_2670| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2670| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 34 .cse0))) [2019-05-15 10:35:22,679 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:35:22,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 16 treesize of output 11 [2019-05-15 10:35:22,717 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,719 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:22,719 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,719 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:22,731 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:22,732 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2671|]. (let ((.cse0 (select |v_#memory_int_2671| ULTIMATE.start_main_p1))) (and (= .cse0 35) (= (store |v_#memory_int_2671| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:22,732 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:35:22,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 16 treesize of output 11 [2019-05-15 10:35:22,771 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,773 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:22,773 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,774 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:22,781 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:22,782 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2672|]. (let ((.cse0 (select |v_#memory_int_2672| ULTIMATE.start_main_p1))) (and (= .cse0 36) (= (store |v_#memory_int_2672| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:22,782 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:35:22,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:22,821 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,823 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:22,823 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,823 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:22,830 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:22,830 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2673|]. (let ((.cse0 (select |v_#memory_int_2673| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2673| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 37 .cse0))) [2019-05-15 10:35:22,831 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:35:22,871 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:22,872 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,874 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 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 1 xjuncts. [2019-05-15 10:35:22,874 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:22,882 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:22,882 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2674|]. (let ((.cse0 (select |v_#memory_int_2674| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2674| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 38))) [2019-05-15 10:35:22,882 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:35:22,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 16 treesize of output 11 [2019-05-15 10:35:22,933 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,935 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:22,935 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,935 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:22,942 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:22,943 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2675|]. (let ((.cse0 (select |v_#memory_int_2675| ULTIMATE.start_main_p1))) (and (= .cse0 39) (= (store |v_#memory_int_2675| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:22,943 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:35:22,985 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:22,986 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,987 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:22,988 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:22,988 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:22,997 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:22,997 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2676|]. (let ((.cse0 (select |v_#memory_int_2676| ULTIMATE.start_main_p1))) (and (= .cse0 40) (= (store |v_#memory_int_2676| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:22,997 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:35:23,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:23,038 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:23,040 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:23,040 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:23,041 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:23,048 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:23,048 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2677|]. (let ((.cse0 (select |v_#memory_int_2677| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2677| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 41))) [2019-05-15 10:35:23,048 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:35:23,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:23,090 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:23,092 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:23,092 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:23,093 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:23,100 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:23,100 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2678|]. (let ((.cse0 (select |v_#memory_int_2678| ULTIMATE.start_main_p1))) (and (= 42 .cse0) (= (store |v_#memory_int_2678| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:23,100 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:35:23,142 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:23,142 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:23,144 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:23,145 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:23,145 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:23,152 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:23,152 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2679|]. (let ((.cse0 (select |v_#memory_int_2679| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2679| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 43))) [2019-05-15 10:35:23,152 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:35:23,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 16 treesize of output 11 [2019-05-15 10:35:23,194 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:23,196 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:23,196 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:23,196 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:23,204 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:23,204 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2680|]. (let ((.cse0 (select |v_#memory_int_2680| ULTIMATE.start_main_p1))) (and (= 44 .cse0) (= |#memory_int| (store |v_#memory_int_2680| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:23,204 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:35:23,246 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:23,247 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:23,249 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:23,249 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:23,249 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:23,257 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:23,257 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2681|]. (let ((.cse0 (select |v_#memory_int_2681| ULTIMATE.start_main_p1))) (and (= 45 .cse0) (= (store |v_#memory_int_2681| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:23,257 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:35:23,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 16 treesize of output 11 [2019-05-15 10:35:23,305 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:23,307 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:23,307 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:23,307 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:23,314 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:23,315 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2682|]. (let ((.cse0 (select |v_#memory_int_2682| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2682| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 46))) [2019-05-15 10:35:23,315 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:35:23,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:23,359 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:23,361 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:23,362 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:23,362 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:23,368 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:23,369 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2683|]. (let ((.cse0 (select |v_#memory_int_2683| ULTIMATE.start_main_p1))) (and (= 47 .cse0) (= |#memory_int| (store |v_#memory_int_2683| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:23,369 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:35:23,415 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:23,416 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:23,418 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:23,418 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:23,418 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:23,426 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:23,426 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2684|]. (let ((.cse0 (select |v_#memory_int_2684| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2684| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 48))) [2019-05-15 10:35:23,426 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:35:23,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 16 treesize of output 11 [2019-05-15 10:35:23,501 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:23,503 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:23,503 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:23,503 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:23,511 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:23,511 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2685|]. (let ((.cse0 (select |v_#memory_int_2685| ULTIMATE.start_main_p1))) (and (= 49 .cse0) (= (store |v_#memory_int_2685| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:23,511 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:35:23,557 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:23,558 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:23,560 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:23,560 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:23,561 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:23,568 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:23,569 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2686|]. (let ((.cse0 (select |v_#memory_int_2686| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2686| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 50))) [2019-05-15 10:35:23,569 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:35:23,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 16 treesize of output 11 [2019-05-15 10:35:23,617 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:23,619 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:23,619 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:23,620 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:23,627 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:23,627 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2687|]. (let ((.cse0 (select |v_#memory_int_2687| ULTIMATE.start_main_p1))) (and (= .cse0 51) (= (store |v_#memory_int_2687| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:23,627 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:35:23,682 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:23,683 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:23,684 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:23,684 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:23,684 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:23,692 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:23,692 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2688|]. (let ((.cse0 (select |v_#memory_int_2688| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2688| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 52))) [2019-05-15 10:35:23,692 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:35:23,739 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:23,740 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:23,742 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:23,742 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:23,742 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:23,750 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:23,750 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2689|]. (let ((.cse0 (select |v_#memory_int_2689| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2689| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 53))) [2019-05-15 10:35:23,750 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:35:23,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 16 treesize of output 11 [2019-05-15 10:35:23,801 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:23,803 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:23,804 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:23,804 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:23,811 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:23,811 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2690|]. (let ((.cse0 (select |v_#memory_int_2690| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2690| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 54))) [2019-05-15 10:35:23,811 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:35:23,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:23,866 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:23,868 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:23,868 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:23,869 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:23,875 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:23,875 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2691|]. (let ((.cse0 (select |v_#memory_int_2691| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2691| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 55))) [2019-05-15 10:35:23,875 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:35:23,929 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:23,930 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:23,932 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:23,932 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:23,933 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:23,941 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:23,942 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2692|]. (let ((.cse0 (select |v_#memory_int_2692| ULTIMATE.start_main_p1))) (and (= .cse0 56) (= (store |v_#memory_int_2692| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:23,942 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:35:23,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 16 treesize of output 11 [2019-05-15 10:35:23,997 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:23,999 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:23,999 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:23,999 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:24,007 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:24,007 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2693|]. (let ((.cse0 (select |v_#memory_int_2693| ULTIMATE.start_main_p1))) (and (= .cse0 57) (= (store |v_#memory_int_2693| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:24,007 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:35:24,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 16 treesize of output 11 [2019-05-15 10:35:24,140 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:24,159 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:24,160 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:24,160 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:24,170 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:24,170 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2694|]. (let ((.cse0 (select |v_#memory_int_2694| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2694| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 58))) [2019-05-15 10:35:24,170 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:35:24,295 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:24,296 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:24,298 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:24,298 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:24,298 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:24,307 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:24,307 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2695|]. (let ((.cse0 (select |v_#memory_int_2695| ULTIMATE.start_main_p1))) (and (= .cse0 59) (= (store |v_#memory_int_2695| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:24,307 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:35:24,367 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:24,368 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:24,370 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:24,370 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:24,371 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:24,378 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:24,378 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2696|]. (let ((.cse0 (select |v_#memory_int_2696| ULTIMATE.start_main_p1))) (and (= 60 .cse0) (= (store |v_#memory_int_2696| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:24,378 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:35:24,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:24,442 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:24,444 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:24,444 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:24,444 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:24,450 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:24,450 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2697|]. (let ((.cse0 (select |v_#memory_int_2697| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2697| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 61))) [2019-05-15 10:35:24,450 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:35:24,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 16 treesize of output 11 [2019-05-15 10:35:24,506 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:24,508 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:24,508 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:24,509 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:24,515 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:24,515 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2698|]. (let ((.cse0 (select |v_#memory_int_2698| ULTIMATE.start_main_p1))) (and (= .cse0 62) (= |#memory_int| (store |v_#memory_int_2698| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:24,515 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:35:24,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 16 treesize of output 11 [2019-05-15 10:35:24,573 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:24,574 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:24,575 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:24,575 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:24,582 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:24,583 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2699|]. (let ((.cse0 (select |v_#memory_int_2699| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2699| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 63))) [2019-05-15 10:35:24,583 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 64) [2019-05-15 10:35:24,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 16 treesize of output 11 [2019-05-15 10:35:24,641 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:24,643 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:24,643 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:24,643 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:24,651 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:24,651 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2700|]. (let ((.cse0 (select |v_#memory_int_2700| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2700| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 64))) [2019-05-15 10:35:24,651 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 65) [2019-05-15 10:35:24,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:24,713 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:24,715 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:24,715 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:24,715 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:24,723 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:24,723 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2701|]. (let ((.cse0 (select |v_#memory_int_2701| ULTIMATE.start_main_p1))) (and (= 65 .cse0) (= (store |v_#memory_int_2701| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:24,723 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 66) [2019-05-15 10:35:24,783 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:24,784 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:24,786 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:24,786 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:24,787 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:24,794 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:24,794 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2702|]. (let ((.cse0 (select |v_#memory_int_2702| ULTIMATE.start_main_p1))) (and (= .cse0 66) (= (store |v_#memory_int_2702| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:24,794 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 67) [2019-05-15 10:35:24,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 16 treesize of output 11 [2019-05-15 10:35:24,856 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:24,858 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:24,858 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:24,858 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:24,866 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:24,866 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2703|]. (let ((.cse0 (select |v_#memory_int_2703| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2703| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 67))) [2019-05-15 10:35:24,866 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 68) [2019-05-15 10:35:24,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 16 treesize of output 11 [2019-05-15 10:35:24,929 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:24,931 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:24,932 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:24,932 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:24,939 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:24,939 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2704|]. (let ((.cse0 (select |v_#memory_int_2704| ULTIMATE.start_main_p1))) (and (= 68 .cse0) (= (store |v_#memory_int_2704| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:24,939 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 69) [2019-05-15 10:35:25,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 16 treesize of output 11 [2019-05-15 10:35:25,001 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:25,003 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:25,003 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:25,003 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:25,010 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:25,010 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2705|]. (let ((.cse0 (select |v_#memory_int_2705| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2705| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 69 .cse0))) [2019-05-15 10:35:25,010 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 70) [2019-05-15 10:35:25,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:25,075 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:25,077 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:25,078 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:25,078 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:25,086 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:25,086 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2706|]. (let ((.cse0 (select |v_#memory_int_2706| ULTIMATE.start_main_p1))) (and (= .cse0 70) (= (store |v_#memory_int_2706| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:25,086 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 71) [2019-05-15 10:35:25,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:25,154 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:25,156 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:25,157 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:25,157 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:25,166 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:25,166 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2707|]. (let ((.cse0 (select |v_#memory_int_2707| ULTIMATE.start_main_p1))) (and (= 71 .cse0) (= (store |v_#memory_int_2707| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:25,166 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 72) [2019-05-15 10:35:25,228 INFO L273 TraceCheckUtils]: 0: Hoare triple {23198#true} havoc main_p1; {23198#true} is VALID [2019-05-15 10:35:25,228 INFO L273 TraceCheckUtils]: 1: Hoare triple {23198#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {23198#true} is VALID [2019-05-15 10:35:25,229 INFO L273 TraceCheckUtils]: 2: Hoare triple {23198#true} #memory_int := #memory_int[main_p1 := 0]; {23209#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:35:25,229 INFO L273 TraceCheckUtils]: 3: Hoare triple {23209#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23213#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:35:25,230 INFO L273 TraceCheckUtils]: 4: Hoare triple {23213#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23217#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:35:25,230 INFO L273 TraceCheckUtils]: 5: Hoare triple {23217#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23221#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:35:25,231 INFO L273 TraceCheckUtils]: 6: Hoare triple {23221#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23225#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:35:25,231 INFO L273 TraceCheckUtils]: 7: Hoare triple {23225#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23229#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:35:25,232 INFO L273 TraceCheckUtils]: 8: Hoare triple {23229#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23233#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:35:25,232 INFO L273 TraceCheckUtils]: 9: Hoare triple {23233#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23237#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:35:25,233 INFO L273 TraceCheckUtils]: 10: Hoare triple {23237#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23241#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:35:25,234 INFO L273 TraceCheckUtils]: 11: Hoare triple {23241#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23245#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:35:25,235 INFO L273 TraceCheckUtils]: 12: Hoare triple {23245#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23249#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:35:25,235 INFO L273 TraceCheckUtils]: 13: Hoare triple {23249#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23253#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:35:25,236 INFO L273 TraceCheckUtils]: 14: Hoare triple {23253#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23257#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:35:25,237 INFO L273 TraceCheckUtils]: 15: Hoare triple {23257#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23261#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:35:25,238 INFO L273 TraceCheckUtils]: 16: Hoare triple {23261#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23265#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:35:25,238 INFO L273 TraceCheckUtils]: 17: Hoare triple {23265#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23269#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:35:25,239 INFO L273 TraceCheckUtils]: 18: Hoare triple {23269#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23273#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:35:25,240 INFO L273 TraceCheckUtils]: 19: Hoare triple {23273#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23277#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:35:25,241 INFO L273 TraceCheckUtils]: 20: Hoare triple {23277#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23281#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:35:25,241 INFO L273 TraceCheckUtils]: 21: Hoare triple {23281#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23285#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:35:25,242 INFO L273 TraceCheckUtils]: 22: Hoare triple {23285#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23289#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:35:25,243 INFO L273 TraceCheckUtils]: 23: Hoare triple {23289#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23293#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:35:25,244 INFO L273 TraceCheckUtils]: 24: Hoare triple {23293#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23297#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:35:25,244 INFO L273 TraceCheckUtils]: 25: Hoare triple {23297#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23301#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:35:25,245 INFO L273 TraceCheckUtils]: 26: Hoare triple {23301#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23305#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:35:25,246 INFO L273 TraceCheckUtils]: 27: Hoare triple {23305#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23309#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:35:25,247 INFO L273 TraceCheckUtils]: 28: Hoare triple {23309#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23313#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:35:25,247 INFO L273 TraceCheckUtils]: 29: Hoare triple {23313#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23317#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:35:25,248 INFO L273 TraceCheckUtils]: 30: Hoare triple {23317#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23321#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:35:25,249 INFO L273 TraceCheckUtils]: 31: Hoare triple {23321#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23325#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:35:25,250 INFO L273 TraceCheckUtils]: 32: Hoare triple {23325#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23329#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:35:25,250 INFO L273 TraceCheckUtils]: 33: Hoare triple {23329#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23333#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:35:25,251 INFO L273 TraceCheckUtils]: 34: Hoare triple {23333#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23337#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:35:25,252 INFO L273 TraceCheckUtils]: 35: Hoare triple {23337#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23341#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:35:25,253 INFO L273 TraceCheckUtils]: 36: Hoare triple {23341#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23345#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:35:25,253 INFO L273 TraceCheckUtils]: 37: Hoare triple {23345#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23349#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:35:25,254 INFO L273 TraceCheckUtils]: 38: Hoare triple {23349#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23353#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:35:25,255 INFO L273 TraceCheckUtils]: 39: Hoare triple {23353#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23357#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:35:25,256 INFO L273 TraceCheckUtils]: 40: Hoare triple {23357#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23361#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:35:25,256 INFO L273 TraceCheckUtils]: 41: Hoare triple {23361#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23365#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:35:25,257 INFO L273 TraceCheckUtils]: 42: Hoare triple {23365#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23369#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:35:25,258 INFO L273 TraceCheckUtils]: 43: Hoare triple {23369#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23373#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:35:25,258 INFO L273 TraceCheckUtils]: 44: Hoare triple {23373#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23377#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:35:25,259 INFO L273 TraceCheckUtils]: 45: Hoare triple {23377#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23381#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:35:25,260 INFO L273 TraceCheckUtils]: 46: Hoare triple {23381#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23385#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:35:25,261 INFO L273 TraceCheckUtils]: 47: Hoare triple {23385#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23389#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:35:25,261 INFO L273 TraceCheckUtils]: 48: Hoare triple {23389#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23393#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:35:25,262 INFO L273 TraceCheckUtils]: 49: Hoare triple {23393#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23397#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:35:25,263 INFO L273 TraceCheckUtils]: 50: Hoare triple {23397#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23401#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:35:25,264 INFO L273 TraceCheckUtils]: 51: Hoare triple {23401#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23405#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:35:25,264 INFO L273 TraceCheckUtils]: 52: Hoare triple {23405#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23409#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:35:25,265 INFO L273 TraceCheckUtils]: 53: Hoare triple {23409#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23413#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:35:25,266 INFO L273 TraceCheckUtils]: 54: Hoare triple {23413#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23417#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:35:25,267 INFO L273 TraceCheckUtils]: 55: Hoare triple {23417#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23421#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:35:25,267 INFO L273 TraceCheckUtils]: 56: Hoare triple {23421#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23425#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:35:25,268 INFO L273 TraceCheckUtils]: 57: Hoare triple {23425#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23429#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:35:25,269 INFO L273 TraceCheckUtils]: 58: Hoare triple {23429#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23433#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:35:25,270 INFO L273 TraceCheckUtils]: 59: Hoare triple {23433#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23437#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:35:25,270 INFO L273 TraceCheckUtils]: 60: Hoare triple {23437#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23441#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:35:25,271 INFO L273 TraceCheckUtils]: 61: Hoare triple {23441#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23445#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:35:25,272 INFO L273 TraceCheckUtils]: 62: Hoare triple {23445#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23449#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:35:25,273 INFO L273 TraceCheckUtils]: 63: Hoare triple {23449#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23453#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:35:25,273 INFO L273 TraceCheckUtils]: 64: Hoare triple {23453#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23457#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:35:25,274 INFO L273 TraceCheckUtils]: 65: Hoare triple {23457#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23461#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:35:25,275 INFO L273 TraceCheckUtils]: 66: Hoare triple {23461#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23465#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} is VALID [2019-05-15 10:35:25,276 INFO L273 TraceCheckUtils]: 67: Hoare triple {23465#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23469#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} is VALID [2019-05-15 10:35:25,276 INFO L273 TraceCheckUtils]: 68: Hoare triple {23469#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23473#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} is VALID [2019-05-15 10:35:25,277 INFO L273 TraceCheckUtils]: 69: Hoare triple {23473#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23477#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} is VALID [2019-05-15 10:35:25,278 INFO L273 TraceCheckUtils]: 70: Hoare triple {23477#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23481#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} is VALID [2019-05-15 10:35:25,279 INFO L273 TraceCheckUtils]: 71: Hoare triple {23481#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23485#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} is VALID [2019-05-15 10:35:25,279 INFO L273 TraceCheckUtils]: 72: Hoare triple {23485#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23489#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} is VALID [2019-05-15 10:35:25,280 INFO L273 TraceCheckUtils]: 73: Hoare triple {23489#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23493#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} is VALID [2019-05-15 10:35:25,281 INFO L273 TraceCheckUtils]: 74: Hoare triple {23493#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23497#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} is VALID [2019-05-15 10:35:25,282 INFO L273 TraceCheckUtils]: 75: Hoare triple {23497#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} assume !(#memory_int[main_p1] >= 0); {23199#false} is VALID [2019-05-15 10:35:25,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:35:25,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:35:25,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-05-15 10:35:25,290 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 76 [2019-05-15 10:35:25,290 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:35:25,290 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 75 states. [2019-05-15 10:35:25,350 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:35:25,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-05-15 10:35:25,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-05-15 10:35:25,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-05-15 10:35:25,351 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 75 states. [2019-05-15 10:35:36,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:35:36,258 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-05-15 10:35:36,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-05-15 10:35:36,258 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 76 [2019-05-15 10:35:36,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:35:36,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-05-15 10:35:36,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2019-05-15 10:35:36,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-05-15 10:35:36,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2019-05-15 10:35:36,260 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 75 states and 79 transitions. [2019-05-15 10:35:36,323 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:35:36,324 INFO L225 Difference]: With dead ends: 78 [2019-05-15 10:35:36,324 INFO L226 Difference]: Without dead ends: 78 [2019-05-15 10:35:36,324 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-05-15 10:35:36,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-05-15 10:35:36,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-05-15 10:35:36,325 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:35:36,325 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 78 states. [2019-05-15 10:35:36,326 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 78 states. [2019-05-15 10:35:36,326 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 78 states. [2019-05-15 10:35:36,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:35:36,326 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-05-15 10:35:36,326 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-05-15 10:35:36,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:35:36,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:35:36,327 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 78 states. [2019-05-15 10:35:36,327 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 78 states. [2019-05-15 10:35:36,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:35:36,328 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-05-15 10:35:36,328 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-05-15 10:35:36,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:35:36,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:35:36,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:35:36,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:35:36,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-05-15 10:35:36,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-05-15 10:35:36,329 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-05-15 10:35:36,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:35:36,329 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-05-15 10:35:36,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-05-15 10:35:36,329 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-05-15 10:35:36,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-05-15 10:35:36,329 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:35:36,329 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1, 1] [2019-05-15 10:35:36,330 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:35:36,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:35:36,330 INFO L82 PathProgramCache]: Analyzing trace with hash -126910, now seen corresponding path program 73 times [2019-05-15 10:35:36,330 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:35:36,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:35:36,366 WARN L254 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 75 conjunts are in the unsatisfiable core [2019-05-15 10:35:36,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:35:36,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:35:36,486 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:36,487 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,488 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:36,488 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,488 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:35:36,490 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:36,490 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2708|]. (= (store |v_#memory_int_2708| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:35:36,491 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:35:36,500 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:36,500 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,502 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:36,503 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,503 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:36,511 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:36,511 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2709|]. (let ((.cse0 (select |v_#memory_int_2709| ULTIMATE.start_main_p1))) (and (= .cse0 0) (= (store |v_#memory_int_2709| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:36,512 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:35:36,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 16 treesize of output 11 [2019-05-15 10:35:36,523 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,524 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:36,525 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,525 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:36,533 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:36,533 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2710|]. (let ((.cse0 (select |v_#memory_int_2710| ULTIMATE.start_main_p1))) (and (= .cse0 1) (= |#memory_int| (store |v_#memory_int_2710| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:36,533 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:35:36,545 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:36,546 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,548 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:36,548 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,549 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:36,555 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:36,555 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2711|]. (let ((.cse0 (select |v_#memory_int_2711| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2711| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 2))) [2019-05-15 10:35:36,555 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:35:36,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 16 treesize of output 11 [2019-05-15 10:35:36,569 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,571 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:36,572 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,572 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:36,578 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:36,578 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2712|]. (let ((.cse0 (select |v_#memory_int_2712| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2712| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 3 .cse0))) [2019-05-15 10:35:36,579 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:35:36,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:36,592 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,594 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:36,594 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,594 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:36,603 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:36,603 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2713|]. (let ((.cse0 (select |v_#memory_int_2713| ULTIMATE.start_main_p1))) (and (= 4 .cse0) (= |#memory_int| (store |v_#memory_int_2713| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:36,603 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:35:36,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 16 treesize of output 11 [2019-05-15 10:35:36,615 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,617 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:36,617 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,618 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:36,625 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:36,625 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2714|]. (let ((.cse0 (select |v_#memory_int_2714| ULTIMATE.start_main_p1))) (and (= 5 .cse0) (= (store |v_#memory_int_2714| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:36,625 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:35:36,639 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:36,640 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,642 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:36,642 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,642 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:36,649 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:36,649 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2715|]. (let ((.cse0 (select |v_#memory_int_2715| ULTIMATE.start_main_p1))) (and (= 6 .cse0) (= |#memory_int| (store |v_#memory_int_2715| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:36,649 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:35:36,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 16 treesize of output 11 [2019-05-15 10:35:36,667 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,669 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:36,669 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,669 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:36,675 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:36,675 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2716|]. (let ((.cse0 (select |v_#memory_int_2716| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2716| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 7))) [2019-05-15 10:35:36,676 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:35:36,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 16 treesize of output 11 [2019-05-15 10:35:36,704 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,705 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:36,705 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,705 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:36,711 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:36,711 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2717|]. (let ((.cse0 (select |v_#memory_int_2717| ULTIMATE.start_main_p1))) (and (= 8 .cse0) (= |#memory_int| (store |v_#memory_int_2717| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:36,712 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:35:36,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 16 treesize of output 11 [2019-05-15 10:35:36,729 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,731 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:36,731 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,732 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:36,739 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:36,739 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2718|]. (let ((.cse0 (select |v_#memory_int_2718| ULTIMATE.start_main_p1))) (and (= 9 .cse0) (= (store |v_#memory_int_2718| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:36,740 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:35:36,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:36,759 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,761 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:36,761 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,761 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:36,769 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:36,769 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2719|]. (let ((.cse0 (select |v_#memory_int_2719| ULTIMATE.start_main_p1))) (and (= .cse0 10) (= (store |v_#memory_int_2719| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:36,770 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:35:36,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:36,787 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,789 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:36,789 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,790 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:36,797 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:36,797 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2720|]. (let ((.cse0 (select |v_#memory_int_2720| ULTIMATE.start_main_p1))) (and (= .cse0 11) (= (store |v_#memory_int_2720| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:36,797 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:35:36,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:36,816 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,818 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:36,819 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,819 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:36,826 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:36,826 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2721|]. (let ((.cse0 (select |v_#memory_int_2721| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2721| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 12))) [2019-05-15 10:35:36,827 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:35:36,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 16 treesize of output 11 [2019-05-15 10:35:36,848 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,850 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:36,850 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,850 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:36,857 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:36,857 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2722|]. (let ((.cse0 (select |v_#memory_int_2722| ULTIMATE.start_main_p1))) (and (= .cse0 13) (= (store |v_#memory_int_2722| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:36,858 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:35:36,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 16 treesize of output 11 [2019-05-15 10:35:36,889 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,891 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:36,891 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,892 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:36,899 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:36,899 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2723|]. (let ((.cse0 (select |v_#memory_int_2723| ULTIMATE.start_main_p1))) (and (= .cse0 14) (= |#memory_int| (store |v_#memory_int_2723| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:36,899 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:35:36,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 16 treesize of output 11 [2019-05-15 10:35:36,921 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,923 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:36,923 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,923 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:36,931 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:36,931 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2724|]. (let ((.cse0 (select |v_#memory_int_2724| ULTIMATE.start_main_p1))) (and (= .cse0 15) (= (store |v_#memory_int_2724| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:36,931 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:35:36,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 16 treesize of output 11 [2019-05-15 10:35:36,952 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,954 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:36,954 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,954 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:36,962 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:36,962 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2725|]. (let ((.cse0 (select |v_#memory_int_2725| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2725| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 16))) [2019-05-15 10:35:36,962 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:35:36,985 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:36,986 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,988 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:36,988 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,988 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:36,995 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:36,995 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2726|]. (let ((.cse0 (select |v_#memory_int_2726| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2726| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 17 .cse0))) [2019-05-15 10:35:36,995 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:35:37,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 16 treesize of output 11 [2019-05-15 10:35:37,019 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,021 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:37,021 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,021 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:37,029 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:37,029 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2727|]. (let ((.cse0 (select |v_#memory_int_2727| ULTIMATE.start_main_p1))) (and (= .cse0 18) (= |#memory_int| (store |v_#memory_int_2727| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:37,029 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:35:37,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:37,053 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,055 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:37,055 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,056 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:37,064 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:37,064 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2728|]. (let ((.cse0 (select |v_#memory_int_2728| ULTIMATE.start_main_p1))) (and (= 19 .cse0) (= (store |v_#memory_int_2728| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:37,064 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:35:37,088 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:37,089 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,091 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:37,091 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,092 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:37,098 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:37,098 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2729|]. (let ((.cse0 (select |v_#memory_int_2729| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2729| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 20 .cse0))) [2019-05-15 10:35:37,098 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:35:37,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 16 treesize of output 11 [2019-05-15 10:35:37,126 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,128 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:37,128 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,128 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:37,135 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:37,135 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2730|]. (let ((.cse0 (select |v_#memory_int_2730| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2730| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 21))) [2019-05-15 10:35:37,135 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:35:37,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 16 treesize of output 11 [2019-05-15 10:35:37,181 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,185 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:37,185 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,185 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:37,190 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:37,190 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2731|]. (let ((.cse0 (select |v_#memory_int_2731| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2731| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 22))) [2019-05-15 10:35:37,190 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:35:37,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 16 treesize of output 11 [2019-05-15 10:35:37,217 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,219 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:37,219 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,220 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:37,227 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:37,227 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2732|]. (let ((.cse0 (select |v_#memory_int_2732| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2732| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 23 .cse0))) [2019-05-15 10:35:37,227 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:35:37,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 16 treesize of output 11 [2019-05-15 10:35:37,254 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,256 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:37,257 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,257 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:37,264 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:37,264 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2733|]. (let ((.cse0 (select |v_#memory_int_2733| ULTIMATE.start_main_p1))) (and (= 24 .cse0) (= (store |v_#memory_int_2733| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:37,264 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:35:37,292 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:37,293 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,295 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:37,295 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,295 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:37,302 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:37,302 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2734|]. (let ((.cse0 (select |v_#memory_int_2734| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2734| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 25))) [2019-05-15 10:35:37,303 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:35:37,332 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:37,333 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,335 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:37,335 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,335 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:37,343 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:37,343 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2735|]. (let ((.cse0 (select |v_#memory_int_2735| ULTIMATE.start_main_p1))) (and (= 26 .cse0) (= (store |v_#memory_int_2735| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:37,343 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:35:37,372 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:37,373 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,375 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:37,375 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,375 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:37,382 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:37,382 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2736|]. (let ((.cse0 (select |v_#memory_int_2736| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2736| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 27 .cse0))) [2019-05-15 10:35:37,382 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:35:37,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 16 treesize of output 11 [2019-05-15 10:35:37,415 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,417 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:37,417 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,417 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:37,425 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:37,425 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2737|]. (let ((.cse0 (select |v_#memory_int_2737| ULTIMATE.start_main_p1))) (and (= .cse0 28) (= |#memory_int| (store |v_#memory_int_2737| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:37,425 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:35:37,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 16 treesize of output 11 [2019-05-15 10:35:37,459 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,461 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:37,461 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,461 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:37,469 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:37,469 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2738|]. (let ((.cse0 (select |v_#memory_int_2738| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2738| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 29))) [2019-05-15 10:35:37,469 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:35:37,500 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:37,501 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,503 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:37,503 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,504 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:37,511 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:37,511 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2739|]. (let ((.cse0 (select |v_#memory_int_2739| ULTIMATE.start_main_p1))) (and (= 30 .cse0) (= (store |v_#memory_int_2739| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:37,511 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:35:37,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 16 treesize of output 11 [2019-05-15 10:35:37,544 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,546 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:37,546 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,546 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:37,554 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:37,554 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2740|]. (let ((.cse0 (select |v_#memory_int_2740| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2740| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 31 .cse0))) [2019-05-15 10:35:37,554 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:35:37,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 16 treesize of output 11 [2019-05-15 10:35:37,588 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,590 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:37,590 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,591 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:37,598 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:37,598 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2741|]. (let ((.cse0 (select |v_#memory_int_2741| ULTIMATE.start_main_p1))) (and (= .cse0 32) (= (store |v_#memory_int_2741| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:37,598 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:35:37,633 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:37,634 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,636 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:37,636 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,636 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:37,644 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:37,644 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2742|]. (let ((.cse0 (select |v_#memory_int_2742| ULTIMATE.start_main_p1))) (and (= .cse0 33) (= (store |v_#memory_int_2742| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:37,644 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:35:37,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:37,682 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,684 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:37,684 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,685 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:37,692 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:37,692 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2743|]. (let ((.cse0 (select |v_#memory_int_2743| ULTIMATE.start_main_p1))) (and (= .cse0 34) (= |#memory_int| (store |v_#memory_int_2743| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:37,692 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:35:37,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:37,728 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,730 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:37,730 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,731 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:37,737 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:37,737 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2744|]. (let ((.cse0 (select |v_#memory_int_2744| ULTIMATE.start_main_p1))) (and (= 35 .cse0) (= |#memory_int| (store |v_#memory_int_2744| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:37,737 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:35:37,776 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:37,777 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,779 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:37,779 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,779 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:37,786 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:37,786 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2745|]. (let ((.cse0 (select |v_#memory_int_2745| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2745| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 36 .cse0))) [2019-05-15 10:35:37,787 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:35:37,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 16 treesize of output 11 [2019-05-15 10:35:37,824 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,826 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:37,826 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,827 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:37,834 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:37,834 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2746|]. (let ((.cse0 (select |v_#memory_int_2746| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2746| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 37))) [2019-05-15 10:35:37,834 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:35:37,873 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:37,874 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,876 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:37,877 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,877 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:37,884 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:37,884 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2747|]. (let ((.cse0 (select |v_#memory_int_2747| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2747| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 38 .cse0))) [2019-05-15 10:35:37,884 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:35:37,926 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:37,927 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,929 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:37,929 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,929 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:37,937 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:37,937 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2748|]. (let ((.cse0 (select |v_#memory_int_2748| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2748| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 39 .cse0))) [2019-05-15 10:35:37,937 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:35:37,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:37,977 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,979 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:37,979 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,980 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:37,987 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:37,987 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2749|]. (let ((.cse0 (select |v_#memory_int_2749| ULTIMATE.start_main_p1))) (and (= .cse0 40) (= (store |v_#memory_int_2749| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:37,987 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:35:38,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 16 treesize of output 11 [2019-05-15 10:35:38,035 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:38,037 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:38,037 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:38,037 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:38,044 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:38,045 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2750|]. (let ((.cse0 (select |v_#memory_int_2750| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2750| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 41))) [2019-05-15 10:35:38,045 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:35:38,086 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:38,086 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:38,088 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:38,089 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:38,089 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:38,096 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:38,096 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2751|]. (let ((.cse0 (select |v_#memory_int_2751| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2751| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 42 .cse0))) [2019-05-15 10:35:38,096 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:35:38,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:38,138 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:38,140 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:38,141 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:38,141 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:38,148 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:38,149 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2752|]. (let ((.cse0 (select |v_#memory_int_2752| ULTIMATE.start_main_p1))) (and (= 43 .cse0) (= (store |v_#memory_int_2752| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:38,149 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:35:38,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 16 treesize of output 11 [2019-05-15 10:35:38,193 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:38,195 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:38,196 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:38,196 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:38,203 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:38,203 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2753|]. (let ((.cse0 (select |v_#memory_int_2753| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2753| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 44))) [2019-05-15 10:35:38,203 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:35:38,246 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:38,247 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:38,249 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:38,249 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:38,250 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:38,258 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:38,258 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2754|]. (let ((.cse0 (select |v_#memory_int_2754| ULTIMATE.start_main_p1))) (and (= .cse0 45) (= |#memory_int| (store |v_#memory_int_2754| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:38,258 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:35:38,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:38,300 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:38,302 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:38,303 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:38,303 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:38,310 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:38,310 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2755|]. (let ((.cse0 (select |v_#memory_int_2755| ULTIMATE.start_main_p1))) (and (= .cse0 46) (= (store |v_#memory_int_2755| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:38,310 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:35:38,357 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:38,358 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:38,360 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:38,360 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:38,360 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:38,368 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:38,368 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2756|]. (let ((.cse0 (select |v_#memory_int_2756| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2756| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 47 .cse0))) [2019-05-15 10:35:38,368 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:35:38,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:38,413 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:38,415 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:38,415 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:38,415 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:38,423 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:38,423 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2757|]. (let ((.cse0 (select |v_#memory_int_2757| ULTIMATE.start_main_p1))) (and (= .cse0 48) (= (store |v_#memory_int_2757| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:38,423 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:35:38,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 16 treesize of output 11 [2019-05-15 10:35:38,502 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:38,504 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:38,504 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:38,504 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:38,510 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:38,510 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2758|]. (let ((.cse0 (select |v_#memory_int_2758| ULTIMATE.start_main_p1))) (and (= .cse0 49) (= |#memory_int| (store |v_#memory_int_2758| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:38,510 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:35:38,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 16 treesize of output 11 [2019-05-15 10:35:38,568 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:38,571 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:38,571 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:38,571 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:38,578 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:38,578 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2759|]. (let ((.cse0 (select |v_#memory_int_2759| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2759| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 50))) [2019-05-15 10:35:38,579 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:35:38,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:38,626 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:38,628 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:38,628 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:38,628 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:38,638 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:38,638 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2760|]. (let ((.cse0 (select |v_#memory_int_2760| ULTIMATE.start_main_p1))) (and (= .cse0 51) (= (store |v_#memory_int_2760| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:38,638 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:35:38,686 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:38,687 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:38,689 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:38,689 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:38,690 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:38,698 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:38,698 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2761|]. (let ((.cse0 (select |v_#memory_int_2761| ULTIMATE.start_main_p1))) (and (= 52 .cse0) (= (store |v_#memory_int_2761| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:38,698 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:35:38,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 16 treesize of output 11 [2019-05-15 10:35:38,748 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:38,750 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:38,751 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:38,751 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:38,758 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:38,758 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2762|]. (let ((.cse0 (select |v_#memory_int_2762| ULTIMATE.start_main_p1))) (and (= .cse0 53) (= (store |v_#memory_int_2762| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:38,758 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:35:38,810 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:38,811 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:38,813 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:38,813 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:38,813 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:38,819 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:38,820 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2763|]. (let ((.cse0 (select |v_#memory_int_2763| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2763| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 54))) [2019-05-15 10:35:38,820 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:35:38,873 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:38,874 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:38,876 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:38,876 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:38,877 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:38,883 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:38,883 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2764|]. (let ((.cse0 (select |v_#memory_int_2764| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2764| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 55 .cse0))) [2019-05-15 10:35:38,883 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:35:38,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:38,938 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:38,939 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:38,940 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:38,940 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:38,947 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:38,948 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2765|]. (let ((.cse0 (select |v_#memory_int_2765| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2765| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 56))) [2019-05-15 10:35:38,948 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:35:39,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 16 treesize of output 11 [2019-05-15 10:35:39,009 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:39,010 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:39,010 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:39,010 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:39,018 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:39,018 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2766|]. (let ((.cse0 (select |v_#memory_int_2766| ULTIMATE.start_main_p1))) (and (= 57 .cse0) (= |#memory_int| (store |v_#memory_int_2766| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:39,019 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:35:39,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 16 treesize of output 11 [2019-05-15 10:35:39,076 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:39,077 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:39,077 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:39,077 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:39,084 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:39,084 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2767|]. (let ((.cse0 (select |v_#memory_int_2767| ULTIMATE.start_main_p1))) (and (= .cse0 58) (= (store |v_#memory_int_2767| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:39,084 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:35:39,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:39,142 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:39,149 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:39,149 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:39,149 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:39,155 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:39,155 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2768|]. (let ((.cse0 (select |v_#memory_int_2768| ULTIMATE.start_main_p1))) (and (= .cse0 59) (= |#memory_int| (store |v_#memory_int_2768| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:39,155 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:35:39,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:39,209 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:39,211 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:39,211 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:39,211 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:39,218 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:39,218 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2769|]. (let ((.cse0 (select |v_#memory_int_2769| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2769| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 60))) [2019-05-15 10:35:39,218 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:35:39,274 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:39,275 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:39,277 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:39,277 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:39,277 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:39,284 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:39,284 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2770|]. (let ((.cse0 (select |v_#memory_int_2770| ULTIMATE.start_main_p1))) (and (= 61 .cse0) (= (store |v_#memory_int_2770| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:39,284 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:35:39,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:39,341 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:39,343 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:39,343 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:39,344 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:39,350 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:39,350 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2771|]. (let ((.cse0 (select |v_#memory_int_2771| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2771| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 62))) [2019-05-15 10:35:39,350 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:35:39,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 16 treesize of output 11 [2019-05-15 10:35:39,406 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:39,408 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:39,408 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:39,408 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:39,415 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:39,415 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2772|]. (let ((.cse0 (select |v_#memory_int_2772| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2772| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 63))) [2019-05-15 10:35:39,416 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 64) [2019-05-15 10:35:39,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 16 treesize of output 11 [2019-05-15 10:35:39,471 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:39,473 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:39,473 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:39,473 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:39,481 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:39,482 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2773|]. (let ((.cse0 (select |v_#memory_int_2773| ULTIMATE.start_main_p1))) (and (= 64 .cse0) (= |#memory_int| (store |v_#memory_int_2773| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:39,482 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 65) [2019-05-15 10:35:39,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:39,541 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:39,543 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:39,543 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:39,544 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:39,553 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:39,553 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2774|]. (let ((.cse0 (select |v_#memory_int_2774| ULTIMATE.start_main_p1))) (and (= .cse0 65) (= (store |v_#memory_int_2774| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:39,553 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 66) [2019-05-15 10:35:39,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 16 treesize of output 11 [2019-05-15 10:35:39,614 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:39,616 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:39,616 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:39,616 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:39,623 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:39,623 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2775|]. (let ((.cse0 (select |v_#memory_int_2775| ULTIMATE.start_main_p1))) (and (= .cse0 66) (= (store |v_#memory_int_2775| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:39,623 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 67) [2019-05-15 10:35:39,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:39,684 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:39,686 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:39,687 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:39,687 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:39,695 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:39,695 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2776|]. (let ((.cse0 (select |v_#memory_int_2776| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2776| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 67))) [2019-05-15 10:35:39,695 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 68) [2019-05-15 10:35:39,756 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:39,757 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:39,758 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:39,759 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:39,759 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:39,766 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:39,766 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2777|]. (let ((.cse0 (select |v_#memory_int_2777| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2777| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 68))) [2019-05-15 10:35:39,766 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 69) [2019-05-15 10:35:39,828 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:39,829 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:39,831 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:39,831 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:39,831 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:39,838 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:39,839 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2778|]. (let ((.cse0 (select |v_#memory_int_2778| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2778| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 69))) [2019-05-15 10:35:39,839 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 70) [2019-05-15 10:35:39,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 16 treesize of output 11 [2019-05-15 10:35:39,904 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:39,906 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:39,907 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:39,907 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:39,915 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:39,915 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2779|]. (let ((.cse0 (select |v_#memory_int_2779| ULTIMATE.start_main_p1))) (and (= 70 .cse0) (= |#memory_int| (store |v_#memory_int_2779| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:39,915 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 71) [2019-05-15 10:35:39,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:39,978 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:39,979 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:39,979 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:39,979 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:39,985 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:39,985 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2780|]. (let ((.cse0 (select |v_#memory_int_2780| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2780| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 71))) [2019-05-15 10:35:39,985 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 72) [2019-05-15 10:35: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 16 treesize of output 11 [2019-05-15 10:35:40,049 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:40,051 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:40,051 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:40,052 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:40,058 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:40,059 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2781|]. (let ((.cse0 (select |v_#memory_int_2781| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2781| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 72))) [2019-05-15 10:35:40,059 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 73) [2019-05-15 10:35:40,119 INFO L273 TraceCheckUtils]: 0: Hoare triple {23812#true} havoc main_p1; {23812#true} is VALID [2019-05-15 10:35:40,119 INFO L273 TraceCheckUtils]: 1: Hoare triple {23812#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {23812#true} is VALID [2019-05-15 10:35:40,120 INFO L273 TraceCheckUtils]: 2: Hoare triple {23812#true} #memory_int := #memory_int[main_p1 := 0]; {23823#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:35:40,120 INFO L273 TraceCheckUtils]: 3: Hoare triple {23823#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23827#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:35:40,121 INFO L273 TraceCheckUtils]: 4: Hoare triple {23827#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23831#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:35:40,122 INFO L273 TraceCheckUtils]: 5: Hoare triple {23831#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23835#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:35:40,123 INFO L273 TraceCheckUtils]: 6: Hoare triple {23835#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23839#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:35:40,123 INFO L273 TraceCheckUtils]: 7: Hoare triple {23839#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23843#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:35:40,124 INFO L273 TraceCheckUtils]: 8: Hoare triple {23843#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23847#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:35:40,125 INFO L273 TraceCheckUtils]: 9: Hoare triple {23847#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23851#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:35:40,126 INFO L273 TraceCheckUtils]: 10: Hoare triple {23851#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23855#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:35:40,126 INFO L273 TraceCheckUtils]: 11: Hoare triple {23855#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23859#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:35:40,127 INFO L273 TraceCheckUtils]: 12: Hoare triple {23859#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23863#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:35:40,128 INFO L273 TraceCheckUtils]: 13: Hoare triple {23863#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23867#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:35:40,129 INFO L273 TraceCheckUtils]: 14: Hoare triple {23867#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23871#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:35:40,129 INFO L273 TraceCheckUtils]: 15: Hoare triple {23871#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23875#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:35:40,130 INFO L273 TraceCheckUtils]: 16: Hoare triple {23875#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23879#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:35:40,131 INFO L273 TraceCheckUtils]: 17: Hoare triple {23879#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23883#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:35:40,132 INFO L273 TraceCheckUtils]: 18: Hoare triple {23883#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23887#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:35:40,132 INFO L273 TraceCheckUtils]: 19: Hoare triple {23887#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23891#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:35:40,133 INFO L273 TraceCheckUtils]: 20: Hoare triple {23891#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23895#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:35:40,134 INFO L273 TraceCheckUtils]: 21: Hoare triple {23895#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23899#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:35:40,135 INFO L273 TraceCheckUtils]: 22: Hoare triple {23899#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23903#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:35:40,135 INFO L273 TraceCheckUtils]: 23: Hoare triple {23903#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23907#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:35:40,136 INFO L273 TraceCheckUtils]: 24: Hoare triple {23907#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23911#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:35:40,137 INFO L273 TraceCheckUtils]: 25: Hoare triple {23911#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23915#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:35:40,138 INFO L273 TraceCheckUtils]: 26: Hoare triple {23915#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23919#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:35:40,138 INFO L273 TraceCheckUtils]: 27: Hoare triple {23919#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23923#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:35:40,139 INFO L273 TraceCheckUtils]: 28: Hoare triple {23923#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23927#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:35:40,140 INFO L273 TraceCheckUtils]: 29: Hoare triple {23927#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23931#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:35:40,141 INFO L273 TraceCheckUtils]: 30: Hoare triple {23931#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23935#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:35:40,141 INFO L273 TraceCheckUtils]: 31: Hoare triple {23935#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23939#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:35:40,142 INFO L273 TraceCheckUtils]: 32: Hoare triple {23939#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23943#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:35:40,143 INFO L273 TraceCheckUtils]: 33: Hoare triple {23943#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23947#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:35:40,143 INFO L273 TraceCheckUtils]: 34: Hoare triple {23947#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23951#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:35:40,144 INFO L273 TraceCheckUtils]: 35: Hoare triple {23951#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23955#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:35:40,145 INFO L273 TraceCheckUtils]: 36: Hoare triple {23955#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23959#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:35:40,146 INFO L273 TraceCheckUtils]: 37: Hoare triple {23959#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23963#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:35:40,147 INFO L273 TraceCheckUtils]: 38: Hoare triple {23963#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23967#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:35:40,147 INFO L273 TraceCheckUtils]: 39: Hoare triple {23967#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23971#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:35:40,148 INFO L273 TraceCheckUtils]: 40: Hoare triple {23971#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23975#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:35:40,149 INFO L273 TraceCheckUtils]: 41: Hoare triple {23975#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23979#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:35:40,150 INFO L273 TraceCheckUtils]: 42: Hoare triple {23979#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23983#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:35:40,150 INFO L273 TraceCheckUtils]: 43: Hoare triple {23983#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23987#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:35:40,151 INFO L273 TraceCheckUtils]: 44: Hoare triple {23987#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23991#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:35:40,152 INFO L273 TraceCheckUtils]: 45: Hoare triple {23991#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23995#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:35:40,152 INFO L273 TraceCheckUtils]: 46: Hoare triple {23995#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23999#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:35:40,153 INFO L273 TraceCheckUtils]: 47: Hoare triple {23999#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24003#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:35:40,154 INFO L273 TraceCheckUtils]: 48: Hoare triple {24003#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24007#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:35:40,155 INFO L273 TraceCheckUtils]: 49: Hoare triple {24007#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24011#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:35:40,155 INFO L273 TraceCheckUtils]: 50: Hoare triple {24011#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24015#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:35:40,156 INFO L273 TraceCheckUtils]: 51: Hoare triple {24015#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24019#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:35:40,157 INFO L273 TraceCheckUtils]: 52: Hoare triple {24019#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24023#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:35:40,158 INFO L273 TraceCheckUtils]: 53: Hoare triple {24023#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24027#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:35:40,158 INFO L273 TraceCheckUtils]: 54: Hoare triple {24027#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24031#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:35:40,159 INFO L273 TraceCheckUtils]: 55: Hoare triple {24031#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24035#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:35:40,160 INFO L273 TraceCheckUtils]: 56: Hoare triple {24035#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24039#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:35:40,161 INFO L273 TraceCheckUtils]: 57: Hoare triple {24039#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24043#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:35:40,161 INFO L273 TraceCheckUtils]: 58: Hoare triple {24043#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24047#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:35:40,162 INFO L273 TraceCheckUtils]: 59: Hoare triple {24047#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24051#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:35:40,163 INFO L273 TraceCheckUtils]: 60: Hoare triple {24051#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24055#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:35:40,164 INFO L273 TraceCheckUtils]: 61: Hoare triple {24055#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24059#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:35:40,164 INFO L273 TraceCheckUtils]: 62: Hoare triple {24059#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24063#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:35:40,165 INFO L273 TraceCheckUtils]: 63: Hoare triple {24063#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24067#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:35:40,166 INFO L273 TraceCheckUtils]: 64: Hoare triple {24067#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24071#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:35:40,167 INFO L273 TraceCheckUtils]: 65: Hoare triple {24071#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24075#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:35:40,167 INFO L273 TraceCheckUtils]: 66: Hoare triple {24075#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24079#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} is VALID [2019-05-15 10:35:40,168 INFO L273 TraceCheckUtils]: 67: Hoare triple {24079#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24083#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} is VALID [2019-05-15 10:35:40,169 INFO L273 TraceCheckUtils]: 68: Hoare triple {24083#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24087#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} is VALID [2019-05-15 10:35:40,170 INFO L273 TraceCheckUtils]: 69: Hoare triple {24087#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24091#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} is VALID [2019-05-15 10:35:40,170 INFO L273 TraceCheckUtils]: 70: Hoare triple {24091#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24095#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} is VALID [2019-05-15 10:35:40,171 INFO L273 TraceCheckUtils]: 71: Hoare triple {24095#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24099#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} is VALID [2019-05-15 10:35:40,172 INFO L273 TraceCheckUtils]: 72: Hoare triple {24099#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24103#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} is VALID [2019-05-15 10:35:40,173 INFO L273 TraceCheckUtils]: 73: Hoare triple {24103#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24107#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} is VALID [2019-05-15 10:35:40,173 INFO L273 TraceCheckUtils]: 74: Hoare triple {24107#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24111#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} is VALID [2019-05-15 10:35:40,174 INFO L273 TraceCheckUtils]: 75: Hoare triple {24111#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24115#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} is VALID [2019-05-15 10:35:40,175 INFO L273 TraceCheckUtils]: 76: Hoare triple {24115#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} assume !(#memory_int[main_p1] >= 0); {23813#false} is VALID [2019-05-15 10:35:40,183 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:35:40,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:35:40,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-05-15 10:35:40,184 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 77 [2019-05-15 10:35:40,184 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:35:40,184 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 76 states. [2019-05-15 10:35:40,248 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:35:40,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-05-15 10:35:40,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-05-15 10:35:40,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-05-15 10:35:40,250 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 76 states. [2019-05-15 10:35:51,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:35:51,411 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-05-15 10:35:51,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-05-15 10:35:51,412 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 77 [2019-05-15 10:35:51,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:35:51,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-05-15 10:35:51,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2019-05-15 10:35:51,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-05-15 10:35:51,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2019-05-15 10:35:51,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 76 states and 80 transitions. [2019-05-15 10:35:51,476 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:51,477 INFO L225 Difference]: With dead ends: 79 [2019-05-15 10:35:51,477 INFO L226 Difference]: Without dead ends: 79 [2019-05-15 10:35:51,478 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-05-15 10:35:51,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-05-15 10:35:51,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-05-15 10:35:51,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:35:51,479 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand 79 states. [2019-05-15 10:35:51,479 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 79 states. [2019-05-15 10:35:51,479 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 79 states. [2019-05-15 10:35:51,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:35:51,480 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-05-15 10:35:51,481 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-05-15 10:35:51,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:35:51,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:35:51,481 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 79 states. [2019-05-15 10:35:51,481 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 79 states. [2019-05-15 10:35:51,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:35:51,482 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-05-15 10:35:51,482 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-05-15 10:35:51,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:35:51,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:35:51,483 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:35:51,483 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:35:51,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-05-15 10:35:51,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-05-15 10:35:51,484 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-05-15 10:35:51,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:35:51,484 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-05-15 10:35:51,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-05-15 10:35:51,484 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-05-15 10:35:51,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-05-15 10:35:51,484 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:35:51,485 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1, 1] [2019-05-15 10:35:51,485 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:35:51,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:35:51,485 INFO L82 PathProgramCache]: Analyzing trace with hash -3934264, now seen corresponding path program 74 times [2019-05-15 10:35:51,486 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:35:51,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:35:51,522 WARN L254 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 76 conjunts are in the unsatisfiable core [2019-05-15 10:35:51,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:35:51,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:35:51,611 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:51,611 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,613 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:51,613 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,614 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:35:51,616 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:51,616 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2782|]. (= (store |v_#memory_int_2782| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:35:51,616 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:35:51,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:51,626 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,628 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:51,628 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,628 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:51,636 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:51,636 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2783|]. (let ((.cse0 (select |v_#memory_int_2783| ULTIMATE.start_main_p1))) (and (= 0 .cse0) (= (store |v_#memory_int_2783| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:51,636 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:35:51,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 16 treesize of output 11 [2019-05-15 10:35:51,653 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,655 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:51,655 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,655 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:51,662 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:51,663 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2784|]. (let ((.cse0 (select |v_#memory_int_2784| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2784| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 1))) [2019-05-15 10:35:51,663 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:35:51,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:51,675 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,676 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:51,677 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,677 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:51,684 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:51,684 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2785|]. (let ((.cse0 (select |v_#memory_int_2785| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2785| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 2 .cse0))) [2019-05-15 10:35:51,684 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:35:51,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 16 treesize of output 11 [2019-05-15 10:35:51,697 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,699 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:51,700 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,700 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:51,708 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:51,708 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2786|]. (let ((.cse0 (select |v_#memory_int_2786| ULTIMATE.start_main_p1))) (and (= 3 .cse0) (= (store |v_#memory_int_2786| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:51,708 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:35:51,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 16 treesize of output 11 [2019-05-15 10:35:51,722 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,724 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:51,724 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,725 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:51,732 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:51,732 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2787|]. (let ((.cse0 (select |v_#memory_int_2787| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2787| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 4 .cse0))) [2019-05-15 10:35:51,732 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:35:51,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 16 treesize of output 11 [2019-05-15 10:35:51,744 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,746 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:51,747 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,747 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:51,754 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:51,754 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2788|]. (let ((.cse0 (select |v_#memory_int_2788| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2788| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 5 .cse0))) [2019-05-15 10:35:51,754 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:35:51,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:51,768 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,770 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:51,770 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,770 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:51,777 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:51,777 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2789|]. (let ((.cse0 (select |v_#memory_int_2789| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2789| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 6))) [2019-05-15 10:35:51,777 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:35:51,792 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:51,793 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,795 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:51,795 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,795 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:51,802 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:51,802 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2790|]. (let ((.cse0 (select |v_#memory_int_2790| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2790| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 7))) [2019-05-15 10:35:51,802 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:35:51,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 16 treesize of output 11 [2019-05-15 10:35:51,819 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,821 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:51,821 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,821 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:51,827 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:51,827 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2791|]. (let ((.cse0 (select |v_#memory_int_2791| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2791| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 8))) [2019-05-15 10:35:51,827 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:35:51,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:51,844 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,846 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:51,846 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,846 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:51,854 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:51,854 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2792|]. (let ((.cse0 (select |v_#memory_int_2792| ULTIMATE.start_main_p1))) (and (= .cse0 9) (= |#memory_int| (store |v_#memory_int_2792| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:51,855 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:35:51,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 16 treesize of output 11 [2019-05-15 10:35:51,871 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,873 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:51,873 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,874 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:51,880 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:51,880 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2793|]. (let ((.cse0 (select |v_#memory_int_2793| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2793| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 10))) [2019-05-15 10:35:51,880 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:35:51,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 16 treesize of output 11 [2019-05-15 10:35:51,899 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,901 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:51,902 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,902 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:51,908 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:51,908 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2794|]. (let ((.cse0 (select |v_#memory_int_2794| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2794| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 11 .cse0))) [2019-05-15 10:35:51,909 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:35:51,925 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:51,926 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,928 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:51,928 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,929 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:51,935 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:51,936 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2795|]. (let ((.cse0 (select |v_#memory_int_2795| ULTIMATE.start_main_p1))) (and (= 12 .cse0) (= (store |v_#memory_int_2795| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:51,936 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:35:51,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 16 treesize of output 11 [2019-05-15 10:35:51,956 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,957 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:51,957 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,957 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:51,963 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:51,963 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2796|]. (let ((.cse0 (select |v_#memory_int_2796| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2796| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 13))) [2019-05-15 10:35:51,963 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:35:51,982 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:51,983 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,985 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:51,985 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,985 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:51,991 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:51,991 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2797|]. (let ((.cse0 (select |v_#memory_int_2797| ULTIMATE.start_main_p1))) (and (= 14 .cse0) (= (store |v_#memory_int_2797| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:51,991 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:35:52,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:52,012 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,014 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:52,014 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,014 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:52,021 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:52,021 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2798|]. (let ((.cse0 (select |v_#memory_int_2798| ULTIMATE.start_main_p1))) (and (= .cse0 15) (= |#memory_int| (store |v_#memory_int_2798| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:52,021 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:35:52,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 16 treesize of output 11 [2019-05-15 10:35:52,043 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,045 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 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 1 xjuncts. [2019-05-15 10:35:52,046 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:52,052 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:52,053 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2799|]. (let ((.cse0 (select |v_#memory_int_2799| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2799| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 16))) [2019-05-15 10:35:52,053 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:35:52,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:52,075 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,077 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:52,077 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,077 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:52,084 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:52,085 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2800|]. (let ((.cse0 (select |v_#memory_int_2800| ULTIMATE.start_main_p1))) (and (= 17 .cse0) (= (store |v_#memory_int_2800| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:52,085 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:35:52,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:52,108 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,110 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:52,110 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,110 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:52,118 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:52,118 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2801|]. (let ((.cse0 (select |v_#memory_int_2801| ULTIMATE.start_main_p1))) (and (= .cse0 18) (= (store |v_#memory_int_2801| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:52,118 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:35:52,140 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:52,141 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,143 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:52,144 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,144 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:52,152 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:52,152 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2802|]. (let ((.cse0 (select |v_#memory_int_2802| ULTIMATE.start_main_p1))) (and (= .cse0 19) (= (store |v_#memory_int_2802| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:52,152 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:35:52,178 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:52,179 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,181 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:52,181 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,181 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:52,189 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:52,189 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2803|]. (let ((.cse0 (select |v_#memory_int_2803| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2803| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 20))) [2019-05-15 10:35:52,189 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:35:52,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:52,215 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,217 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:52,218 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,218 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:52,224 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:52,224 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2804|]. (let ((.cse0 (select |v_#memory_int_2804| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2804| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 21))) [2019-05-15 10:35:52,224 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:35:52,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 16 treesize of output 11 [2019-05-15 10:35:52,255 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,257 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:52,257 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,257 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:52,265 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:52,265 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2805|]. (let ((.cse0 (select |v_#memory_int_2805| ULTIMATE.start_main_p1))) (and (= 22 .cse0) (= (store |v_#memory_int_2805| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:52,265 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:35:52,292 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:52,293 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,295 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:52,295 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,295 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:52,303 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:52,303 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2806|]. (let ((.cse0 (select |v_#memory_int_2806| ULTIMATE.start_main_p1))) (and (= 23 .cse0) (= (store |v_#memory_int_2806| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:52,303 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:35:52,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:52,330 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,332 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:52,333 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,333 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:52,339 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:52,339 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2807|]. (let ((.cse0 (select |v_#memory_int_2807| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2807| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 24))) [2019-05-15 10:35:52,339 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:35:52,366 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:52,367 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,369 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:52,369 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,369 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:52,377 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:52,377 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2808|]. (let ((.cse0 (select |v_#memory_int_2808| ULTIMATE.start_main_p1))) (and (= 25 .cse0) (= (store |v_#memory_int_2808| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:52,377 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:35:52,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:52,410 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,412 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:52,412 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,412 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:52,419 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:52,419 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2809|]. (let ((.cse0 (select |v_#memory_int_2809| ULTIMATE.start_main_p1))) (and (= .cse0 26) (= |#memory_int| (store |v_#memory_int_2809| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:52,420 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:35:52,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 16 treesize of output 11 [2019-05-15 10:35:52,452 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,454 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:52,455 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,455 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:52,462 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:52,462 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2810|]. (let ((.cse0 (select |v_#memory_int_2810| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2810| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 27))) [2019-05-15 10:35:52,462 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:35: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 16 treesize of output 11 [2019-05-15 10:35:52,494 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,496 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:52,496 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,497 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:52,504 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:52,504 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2811|]. (let ((.cse0 (select |v_#memory_int_2811| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2811| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 28 .cse0))) [2019-05-15 10:35:52,504 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:35:52,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:52,538 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,540 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:52,540 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,540 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:52,547 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:52,547 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2812|]. (let ((.cse0 (select |v_#memory_int_2812| ULTIMATE.start_main_p1))) (and (= 29 .cse0) (= |#memory_int| (store |v_#memory_int_2812| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:52,548 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:35:52,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 16 treesize of output 11 [2019-05-15 10:35:52,583 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,585 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:52,585 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,585 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:52,593 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:52,593 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2813|]. (let ((.cse0 (select |v_#memory_int_2813| ULTIMATE.start_main_p1))) (and (= 30 .cse0) (= |#memory_int| (store |v_#memory_int_2813| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:52,593 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:35:52,626 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:52,627 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,629 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:52,630 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,630 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:52,643 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:52,643 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2814|]. (let ((.cse0 (select |v_#memory_int_2814| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2814| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 31 .cse0))) [2019-05-15 10:35:52,643 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:35:52,676 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:52,677 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,679 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:52,679 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,679 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:52,686 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:52,686 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2815|]. (let ((.cse0 (select |v_#memory_int_2815| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2815| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 32))) [2019-05-15 10:35:52,686 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:35:52,721 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:52,722 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,723 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:52,724 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,724 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:52,732 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:52,732 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2816|]. (let ((.cse0 (select |v_#memory_int_2816| ULTIMATE.start_main_p1))) (and (= 33 .cse0) (= (store |v_#memory_int_2816| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:52,733 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:35:52,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:52,770 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,772 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:52,772 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,773 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:52,780 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:52,781 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2817|]. (let ((.cse0 (select |v_#memory_int_2817| ULTIMATE.start_main_p1))) (and (= .cse0 34) (= (store |v_#memory_int_2817| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:52,781 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:35:52,816 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:52,816 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,818 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:52,819 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,819 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [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_#memory_int_2818|]. (let ((.cse0 (select |v_#memory_int_2818| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2818| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 35))) [2019-05-15 10:35:52,826 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:35:52,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:52,863 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,865 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:52,865 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,865 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:52,873 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:52,873 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2819|]. (let ((.cse0 (select |v_#memory_int_2819| ULTIMATE.start_main_p1))) (and (= 36 .cse0) (= (store |v_#memory_int_2819| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:52,873 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:35:52,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 16 treesize of output 11 [2019-05-15 10:35:52,911 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,913 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:52,913 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,913 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:52,921 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:52,922 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2820|]. (let ((.cse0 (select |v_#memory_int_2820| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2820| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 37))) [2019-05-15 10:35:52,922 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:35:52,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 16 treesize of output 11 [2019-05-15 10:35:52,961 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,963 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:52,963 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,963 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:52,971 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:52,971 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2821|]. (let ((.cse0 (select |v_#memory_int_2821| ULTIMATE.start_main_p1))) (and (= .cse0 38) (= (store |v_#memory_int_2821| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:52,971 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:35:53,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 16 treesize of output 11 [2019-05-15 10:35:53,021 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,023 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:53,023 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,023 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:53,030 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:53,030 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2822|]. (let ((.cse0 (select |v_#memory_int_2822| ULTIMATE.start_main_p1))) (and (= 39 .cse0) (= (store |v_#memory_int_2822| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:53,030 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:35:53,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 16 treesize of output 11 [2019-05-15 10:35:53,077 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,079 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:53,079 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,079 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:53,087 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:53,087 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2823|]. (let ((.cse0 (select |v_#memory_int_2823| ULTIMATE.start_main_p1))) (and (= 40 .cse0) (= |#memory_int| (store |v_#memory_int_2823| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:53,087 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:35:53,127 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:53,128 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,130 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:53,130 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,130 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:53,136 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:53,137 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2824|]. (let ((.cse0 (select |v_#memory_int_2824| ULTIMATE.start_main_p1))) (and (= 41 .cse0) (= |#memory_int| (store |v_#memory_int_2824| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:53,137 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:35:53,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 16 treesize of output 11 [2019-05-15 10:35:53,184 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,186 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:53,187 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,187 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:53,195 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:53,195 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2825|]. (let ((.cse0 (select |v_#memory_int_2825| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2825| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 42 .cse0))) [2019-05-15 10:35:53,195 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:35:53,237 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:53,238 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,240 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:53,240 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,240 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:53,247 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:53,247 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2826|]. (let ((.cse0 (select |v_#memory_int_2826| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2826| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 43))) [2019-05-15 10:35:53,248 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:35:53,292 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:53,293 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,295 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:53,296 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,296 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:53,303 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:53,303 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2827|]. (let ((.cse0 (select |v_#memory_int_2827| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2827| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 44))) [2019-05-15 10:35:53,303 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:35:53,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:53,348 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,350 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:53,350 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,351 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:53,358 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:53,359 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2828|]. (let ((.cse0 (select |v_#memory_int_2828| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2828| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 45))) [2019-05-15 10:35:53,359 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:35: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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:53,405 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,407 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:53,408 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,408 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:53,415 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:53,415 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2829|]. (let ((.cse0 (select |v_#memory_int_2829| ULTIMATE.start_main_p1))) (and (= .cse0 46) (= (store |v_#memory_int_2829| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:53,415 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:35:53,462 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:53,463 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,465 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:53,465 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,465 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:53,473 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:53,473 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2830|]. (let ((.cse0 (select |v_#memory_int_2830| ULTIMATE.start_main_p1))) (and (= .cse0 47) (= (store |v_#memory_int_2830| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:53,473 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:35:53,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 16 treesize of output 11 [2019-05-15 10:35:53,522 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,524 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:53,524 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,524 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:53,532 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:53,533 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2831|]. (let ((.cse0 (select |v_#memory_int_2831| ULTIMATE.start_main_p1))) (and (= .cse0 48) (= (store |v_#memory_int_2831| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:53,533 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:35:53,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:53,580 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,582 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:53,582 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,583 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:53,591 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:53,591 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2832|]. (let ((.cse0 (select |v_#memory_int_2832| ULTIMATE.start_main_p1))) (and (= 49 .cse0) (= |#memory_int| (store |v_#memory_int_2832| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:53,591 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:35:53,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:53,645 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,647 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:53,647 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,648 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:53,656 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:53,656 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2833|]. (let ((.cse0 (select |v_#memory_int_2833| ULTIMATE.start_main_p1))) (and (= 50 .cse0) (= |#memory_int| (store |v_#memory_int_2833| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:53,656 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:35:53,704 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:53,705 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,707 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:53,707 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,708 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:53,715 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:53,715 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2834|]. (let ((.cse0 (select |v_#memory_int_2834| ULTIMATE.start_main_p1))) (and (= 51 .cse0) (= |#memory_int| (store |v_#memory_int_2834| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:53,715 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:35:53,764 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:53,765 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,767 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:53,767 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,767 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:53,773 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:53,774 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2835|]. (let ((.cse0 (select |v_#memory_int_2835| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2835| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 52))) [2019-05-15 10:35:53,774 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:35:53,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:53,821 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,823 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:53,824 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,824 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:53,831 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:53,832 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2836|]. (let ((.cse0 (select |v_#memory_int_2836| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2836| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 53 .cse0))) [2019-05-15 10:35:53,832 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:35:53,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 16 treesize of output 11 [2019-05-15 10:35:53,884 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,886 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:53,886 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,887 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:53,895 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:53,895 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2837|]. (let ((.cse0 (select |v_#memory_int_2837| ULTIMATE.start_main_p1))) (and (= 54 .cse0) (= (store |v_#memory_int_2837| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:53,895 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:35:53,946 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:53,947 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,949 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:53,949 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,949 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:53,955 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:53,956 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2838|]. (let ((.cse0 (select |v_#memory_int_2838| ULTIMATE.start_main_p1))) (and (= .cse0 55) (= |#memory_int| (store |v_#memory_int_2838| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:53,956 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:35:54,007 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:54,008 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:54,010 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:54,010 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:54,011 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:54,018 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:54,018 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2839|]. (let ((.cse0 (select |v_#memory_int_2839| ULTIMATE.start_main_p1))) (and (= .cse0 56) (= |#memory_int| (store |v_#memory_int_2839| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:54,018 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:35:54,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:54,074 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:54,076 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:54,077 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:54,077 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:54,084 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:54,084 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2840|]. (let ((.cse0 (select |v_#memory_int_2840| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2840| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 57))) [2019-05-15 10:35:54,084 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:35:54,136 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:54,137 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:54,139 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:54,139 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:54,139 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:54,146 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:54,147 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2841|]. (let ((.cse0 (select |v_#memory_int_2841| ULTIMATE.start_main_p1))) (and (= 58 .cse0) (= |#memory_int| (store |v_#memory_int_2841| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:54,147 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:35:54,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 16 treesize of output 11 [2019-05-15 10:35:54,203 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:54,205 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:54,205 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:54,205 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:54,212 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:54,212 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2842|]. (let ((.cse0 (select |v_#memory_int_2842| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2842| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 59))) [2019-05-15 10:35:54,213 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:35:54,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 16 treesize of output 11 [2019-05-15 10:35:54,268 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:54,270 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:54,270 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:54,270 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:54,278 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:54,278 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2843|]. (let ((.cse0 (select |v_#memory_int_2843| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2843| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 60 .cse0))) [2019-05-15 10:35:54,278 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:35:54,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 16 treesize of output 11 [2019-05-15 10:35:54,336 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:54,338 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:54,339 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:54,339 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:54,347 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:54,347 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2844|]. (let ((.cse0 (select |v_#memory_int_2844| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2844| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 61))) [2019-05-15 10:35:54,347 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:35:54,403 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [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,406 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:54,406 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:54,406 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:54,414 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:54,414 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2845|]. (let ((.cse0 (select |v_#memory_int_2845| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2845| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 62 .cse0))) [2019-05-15 10:35:54,414 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:35:54,472 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:54,473 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:54,475 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:54,475 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:54,475 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:54,482 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:54,482 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2846|]. (let ((.cse0 (select |v_#memory_int_2846| ULTIMATE.start_main_p1))) (and (= .cse0 63) (= (store |v_#memory_int_2846| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:54,482 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 64) [2019-05-15 10:35:54,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:54,543 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:54,545 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:54,545 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:54,546 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:54,553 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:54,553 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2847|]. (let ((.cse0 (select |v_#memory_int_2847| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2847| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 64 .cse0))) [2019-05-15 10:35:54,553 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 65) [2019-05-15 10:35:54,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 16 treesize of output 11 [2019-05-15 10:35:54,614 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:54,616 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:54,616 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:54,616 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:54,624 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:54,624 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2848|]. (let ((.cse0 (select |v_#memory_int_2848| ULTIMATE.start_main_p1))) (and (= .cse0 65) (= |#memory_int| (store |v_#memory_int_2848| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:54,624 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 66) [2019-05-15 10:35:54,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 16 treesize of output 11 [2019-05-15 10:35:54,690 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:54,692 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:54,693 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:54,693 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:54,701 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:54,701 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2849|]. (let ((.cse0 (select |v_#memory_int_2849| ULTIMATE.start_main_p1))) (and (= .cse0 66) (= (store |v_#memory_int_2849| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:54,701 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 67) [2019-05-15 10:35:54,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:54,761 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:54,763 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:54,764 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:54,764 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:54,771 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:54,771 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2850|]. (let ((.cse0 (select |v_#memory_int_2850| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2850| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 67))) [2019-05-15 10:35:54,771 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 68) [2019-05-15 10:35:54,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:54,830 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:54,832 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:54,832 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:54,832 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:54,841 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:54,841 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2851|]. (let ((.cse0 (select |v_#memory_int_2851| ULTIMATE.start_main_p1))) (and (= 68 .cse0) (= (store |v_#memory_int_2851| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:54,841 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 69) [2019-05-15 10:35:54,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 16 treesize of output 11 [2019-05-15 10:35:54,903 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:54,905 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:54,906 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:54,906 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:54,914 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:54,914 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2852|]. (let ((.cse0 (select |v_#memory_int_2852| ULTIMATE.start_main_p1))) (and (= .cse0 69) (= (store |v_#memory_int_2852| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:54,914 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 70) [2019-05-15 10:35:54,981 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:54,982 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:54,984 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:54,984 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:54,984 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:54,990 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:54,991 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2853|]. (let ((.cse0 (select |v_#memory_int_2853| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2853| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 70))) [2019-05-15 10:35:54,991 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 71) [2019-05-15 10:35:55,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:55,060 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:55,062 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:55,062 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:55,062 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:55,069 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:55,070 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2854|]. (let ((.cse0 (select |v_#memory_int_2854| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2854| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 71 .cse0))) [2019-05-15 10:35:55,070 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 72) [2019-05-15 10:35:55,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 16 treesize of output 11 [2019-05-15 10:35:55,134 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:55,136 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:55,136 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:55,137 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:55,144 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:55,144 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2855|]. (let ((.cse0 (select |v_#memory_int_2855| ULTIMATE.start_main_p1))) (and (= .cse0 72) (= |#memory_int| (store |v_#memory_int_2855| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:55,144 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 73) [2019-05-15 10:35:55,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 16 treesize of output 11 [2019-05-15 10:35:55,211 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:55,213 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:55,213 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:55,213 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:55,220 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:55,221 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2856|]. (let ((.cse0 (select |v_#memory_int_2856| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2856| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 73 .cse0))) [2019-05-15 10:35:55,221 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 74) [2019-05-15 10:35:55,282 INFO L273 TraceCheckUtils]: 0: Hoare triple {24434#true} havoc main_p1; {24434#true} is VALID [2019-05-15 10:35:55,283 INFO L273 TraceCheckUtils]: 1: Hoare triple {24434#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {24434#true} is VALID [2019-05-15 10:35:55,283 INFO L273 TraceCheckUtils]: 2: Hoare triple {24434#true} #memory_int := #memory_int[main_p1 := 0]; {24445#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:35:55,284 INFO L273 TraceCheckUtils]: 3: Hoare triple {24445#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24449#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:35:55,285 INFO L273 TraceCheckUtils]: 4: Hoare triple {24449#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24453#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:35:55,285 INFO L273 TraceCheckUtils]: 5: Hoare triple {24453#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24457#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:35:55,286 INFO L273 TraceCheckUtils]: 6: Hoare triple {24457#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24461#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:35:55,286 INFO L273 TraceCheckUtils]: 7: Hoare triple {24461#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24465#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:35:55,287 INFO L273 TraceCheckUtils]: 8: Hoare triple {24465#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24469#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:35:55,288 INFO L273 TraceCheckUtils]: 9: Hoare triple {24469#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24473#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:35:55,288 INFO L273 TraceCheckUtils]: 10: Hoare triple {24473#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24477#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:35:55,289 INFO L273 TraceCheckUtils]: 11: Hoare triple {24477#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24481#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:35:55,290 INFO L273 TraceCheckUtils]: 12: Hoare triple {24481#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24485#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:35:55,291 INFO L273 TraceCheckUtils]: 13: Hoare triple {24485#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24489#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:35:55,291 INFO L273 TraceCheckUtils]: 14: Hoare triple {24489#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24493#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:35:55,292 INFO L273 TraceCheckUtils]: 15: Hoare triple {24493#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24497#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:35:55,293 INFO L273 TraceCheckUtils]: 16: Hoare triple {24497#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24501#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:35:55,294 INFO L273 TraceCheckUtils]: 17: Hoare triple {24501#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24505#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:35:55,294 INFO L273 TraceCheckUtils]: 18: Hoare triple {24505#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24509#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:35:55,295 INFO L273 TraceCheckUtils]: 19: Hoare triple {24509#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24513#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:35:55,296 INFO L273 TraceCheckUtils]: 20: Hoare triple {24513#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24517#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:35:55,297 INFO L273 TraceCheckUtils]: 21: Hoare triple {24517#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24521#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:35:55,297 INFO L273 TraceCheckUtils]: 22: Hoare triple {24521#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24525#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:35:55,298 INFO L273 TraceCheckUtils]: 23: Hoare triple {24525#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24529#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:35:55,299 INFO L273 TraceCheckUtils]: 24: Hoare triple {24529#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24533#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:35:55,300 INFO L273 TraceCheckUtils]: 25: Hoare triple {24533#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24537#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:35:55,300 INFO L273 TraceCheckUtils]: 26: Hoare triple {24537#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24541#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:35:55,301 INFO L273 TraceCheckUtils]: 27: Hoare triple {24541#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24545#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:35:55,302 INFO L273 TraceCheckUtils]: 28: Hoare triple {24545#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24549#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:35:55,302 INFO L273 TraceCheckUtils]: 29: Hoare triple {24549#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24553#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:35:55,303 INFO L273 TraceCheckUtils]: 30: Hoare triple {24553#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24557#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:35:55,304 INFO L273 TraceCheckUtils]: 31: Hoare triple {24557#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24561#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:35:55,305 INFO L273 TraceCheckUtils]: 32: Hoare triple {24561#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24565#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:35:55,305 INFO L273 TraceCheckUtils]: 33: Hoare triple {24565#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24569#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:35:55,306 INFO L273 TraceCheckUtils]: 34: Hoare triple {24569#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24573#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:35:55,307 INFO L273 TraceCheckUtils]: 35: Hoare triple {24573#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24577#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:35:55,308 INFO L273 TraceCheckUtils]: 36: Hoare triple {24577#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24581#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:35:55,308 INFO L273 TraceCheckUtils]: 37: Hoare triple {24581#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24585#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:35:55,309 INFO L273 TraceCheckUtils]: 38: Hoare triple {24585#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24589#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:35:55,310 INFO L273 TraceCheckUtils]: 39: Hoare triple {24589#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24593#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:35:55,311 INFO L273 TraceCheckUtils]: 40: Hoare triple {24593#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24597#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:35:55,311 INFO L273 TraceCheckUtils]: 41: Hoare triple {24597#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24601#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:35:55,312 INFO L273 TraceCheckUtils]: 42: Hoare triple {24601#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24605#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:35:55,313 INFO L273 TraceCheckUtils]: 43: Hoare triple {24605#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24609#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:35:55,314 INFO L273 TraceCheckUtils]: 44: Hoare triple {24609#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24613#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:35:55,314 INFO L273 TraceCheckUtils]: 45: Hoare triple {24613#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24617#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:35:55,315 INFO L273 TraceCheckUtils]: 46: Hoare triple {24617#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24621#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:35:55,316 INFO L273 TraceCheckUtils]: 47: Hoare triple {24621#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24625#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:35:55,317 INFO L273 TraceCheckUtils]: 48: Hoare triple {24625#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24629#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:35:55,317 INFO L273 TraceCheckUtils]: 49: Hoare triple {24629#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24633#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:35:55,318 INFO L273 TraceCheckUtils]: 50: Hoare triple {24633#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24637#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:35:55,319 INFO L273 TraceCheckUtils]: 51: Hoare triple {24637#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24641#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:35:55,320 INFO L273 TraceCheckUtils]: 52: Hoare triple {24641#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24645#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:35:55,320 INFO L273 TraceCheckUtils]: 53: Hoare triple {24645#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24649#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:35:55,321 INFO L273 TraceCheckUtils]: 54: Hoare triple {24649#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24653#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:35:55,322 INFO L273 TraceCheckUtils]: 55: Hoare triple {24653#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24657#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:35:55,323 INFO L273 TraceCheckUtils]: 56: Hoare triple {24657#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24661#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:35:55,323 INFO L273 TraceCheckUtils]: 57: Hoare triple {24661#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24665#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:35:55,324 INFO L273 TraceCheckUtils]: 58: Hoare triple {24665#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24669#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:35:55,325 INFO L273 TraceCheckUtils]: 59: Hoare triple {24669#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24673#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:35:55,326 INFO L273 TraceCheckUtils]: 60: Hoare triple {24673#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24677#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:35:55,326 INFO L273 TraceCheckUtils]: 61: Hoare triple {24677#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24681#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:35:55,327 INFO L273 TraceCheckUtils]: 62: Hoare triple {24681#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24685#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:35:55,328 INFO L273 TraceCheckUtils]: 63: Hoare triple {24685#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24689#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:35:55,329 INFO L273 TraceCheckUtils]: 64: Hoare triple {24689#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24693#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:35:55,329 INFO L273 TraceCheckUtils]: 65: Hoare triple {24693#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24697#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:35:55,330 INFO L273 TraceCheckUtils]: 66: Hoare triple {24697#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24701#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} is VALID [2019-05-15 10:35:55,331 INFO L273 TraceCheckUtils]: 67: Hoare triple {24701#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24705#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} is VALID [2019-05-15 10:35:55,332 INFO L273 TraceCheckUtils]: 68: Hoare triple {24705#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24709#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} is VALID [2019-05-15 10:35:55,332 INFO L273 TraceCheckUtils]: 69: Hoare triple {24709#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24713#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} is VALID [2019-05-15 10:35:55,333 INFO L273 TraceCheckUtils]: 70: Hoare triple {24713#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24717#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} is VALID [2019-05-15 10:35:55,334 INFO L273 TraceCheckUtils]: 71: Hoare triple {24717#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24721#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} is VALID [2019-05-15 10:35:55,335 INFO L273 TraceCheckUtils]: 72: Hoare triple {24721#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24725#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} is VALID [2019-05-15 10:35:55,335 INFO L273 TraceCheckUtils]: 73: Hoare triple {24725#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24729#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} is VALID [2019-05-15 10:35:55,336 INFO L273 TraceCheckUtils]: 74: Hoare triple {24729#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24733#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} is VALID [2019-05-15 10:35:55,337 INFO L273 TraceCheckUtils]: 75: Hoare triple {24733#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24737#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} is VALID [2019-05-15 10:35:55,338 INFO L273 TraceCheckUtils]: 76: Hoare triple {24737#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24741#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} is VALID [2019-05-15 10:35:55,338 INFO L273 TraceCheckUtils]: 77: Hoare triple {24741#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} assume !(#memory_int[main_p1] >= 0); {24435#false} is VALID [2019-05-15 10:35:55,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:35:55,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:35:55,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-05-15 10:35:55,347 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 78 [2019-05-15 10:35:55,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:35:55,348 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 77 states. [2019-05-15 10:35:55,409 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:55,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-05-15 10:35:55,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-05-15 10:35:55,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-05-15 10:35:55,410 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 77 states. [2019-05-15 10:36:06,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:36:06,906 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-05-15 10:36:06,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-05-15 10:36:06,906 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 78 [2019-05-15 10:36:06,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:36:06,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-05-15 10:36:06,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2019-05-15 10:36:06,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-05-15 10:36:06,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2019-05-15 10:36:06,909 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 77 states and 81 transitions. [2019-05-15 10:36:06,972 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:36:06,973 INFO L225 Difference]: With dead ends: 80 [2019-05-15 10:36:06,973 INFO L226 Difference]: Without dead ends: 80 [2019-05-15 10:36:06,974 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-05-15 10:36:06,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-05-15 10:36:06,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-05-15 10:36:06,975 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:36:06,975 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 80 states. [2019-05-15 10:36:06,975 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 80 states. [2019-05-15 10:36:06,975 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 80 states. [2019-05-15 10:36:06,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:36:06,976 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-05-15 10:36:06,976 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-05-15 10:36:06,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:36:06,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:36:06,977 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 80 states. [2019-05-15 10:36:06,977 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 80 states. [2019-05-15 10:36:06,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:36:06,977 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-05-15 10:36:06,978 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-05-15 10:36:06,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:36:06,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:36:06,978 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:36:06,978 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:36:06,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-05-15 10:36:06,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-05-15 10:36:06,979 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-05-15 10:36:06,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:36:06,979 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-05-15 10:36:06,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-05-15 10:36:06,979 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-05-15 10:36:06,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-05-15 10:36:06,979 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:36:06,979 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1, 1] [2019-05-15 10:36:06,980 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:36:06,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:36:06,980 INFO L82 PathProgramCache]: Analyzing trace with hash -121962238, now seen corresponding path program 75 times [2019-05-15 10:36:06,980 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:36:06,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:36:07,005 WARN L254 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 77 conjunts are in the unsatisfiable core [2019-05-15 10:36:07,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:36:07,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:36:07,136 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:07,136 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,138 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:07,138 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,138 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:36:07,140 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:07,140 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2857|]. (= (store |v_#memory_int_2857| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:36:07,140 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:36:07,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 16 treesize of output 11 [2019-05-15 10:36:07,151 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,153 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:07,154 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,154 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:07,161 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:07,162 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2858|]. (let ((.cse0 (select |v_#memory_int_2858| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2858| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 0))) [2019-05-15 10:36:07,162 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:36:07,170 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:07,171 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,173 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:07,173 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,174 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:07,181 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:07,181 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2859|]. (let ((.cse0 (select |v_#memory_int_2859| ULTIMATE.start_main_p1))) (and (= .cse0 1) (= (store |v_#memory_int_2859| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:07,182 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:36:07,196 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:07,201 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:07,203 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,203 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:07,208 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:07,208 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2860|]. (let ((.cse0 (select |v_#memory_int_2860| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2860| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 2 .cse0))) [2019-05-15 10:36:07,208 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:36:07,220 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:07,221 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,223 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:07,223 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,224 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:07,230 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:07,230 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2861|]. (let ((.cse0 (select |v_#memory_int_2861| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2861| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 3))) [2019-05-15 10:36:07,231 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:36:07,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:07,244 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,246 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:07,246 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,246 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:07,254 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:07,254 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2862|]. (let ((.cse0 (select |v_#memory_int_2862| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2862| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 4 .cse0))) [2019-05-15 10:36:07,254 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:36:07,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 16 treesize of output 11 [2019-05-15 10:36:07,268 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,270 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:07,270 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,271 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:07,278 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:07,278 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2863|]. (let ((.cse0 (select |v_#memory_int_2863| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2863| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 5 .cse0))) [2019-05-15 10:36:07,278 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:36: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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:07,292 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,294 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:07,294 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,294 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:07,302 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:07,302 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2864|]. (let ((.cse0 (select |v_#memory_int_2864| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2864| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 6 .cse0))) [2019-05-15 10:36:07,302 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:36:07,315 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:07,316 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,318 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:07,318 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,318 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:07,324 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:07,324 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2865|]. (let ((.cse0 (select |v_#memory_int_2865| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2865| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 7 .cse0))) [2019-05-15 10:36:07,324 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:36:07,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 16 treesize of output 11 [2019-05-15 10:36:07,340 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,342 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:07,342 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,342 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:07,350 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:07,350 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2866|]. (let ((.cse0 (select |v_#memory_int_2866| ULTIMATE.start_main_p1))) (and (= .cse0 8) (= |#memory_int| (store |v_#memory_int_2866| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:07,350 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:36:07,366 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:07,367 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,369 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:07,369 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,369 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:07,376 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:07,376 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2867|]. (let ((.cse0 (select |v_#memory_int_2867| ULTIMATE.start_main_p1))) (and (= 9 .cse0) (= (store |v_#memory_int_2867| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:07,376 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:36:07,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 16 treesize of output 11 [2019-05-15 10:36:07,395 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,397 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:07,397 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,397 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:07,404 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:07,405 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2868|]. (let ((.cse0 (select |v_#memory_int_2868| ULTIMATE.start_main_p1))) (and (= 10 .cse0) (= (store |v_#memory_int_2868| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:07,405 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:36:07,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 16 treesize of output 11 [2019-05-15 10:36:07,424 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,426 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:07,426 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,432 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:07,438 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:07,438 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2869|]. (let ((.cse0 (select |v_#memory_int_2869| ULTIMATE.start_main_p1))) (and (= .cse0 11) (= (store |v_#memory_int_2869| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:07,438 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:36:07,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 16 treesize of output 11 [2019-05-15 10:36:07,458 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,460 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:07,461 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,461 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:07,468 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:07,468 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2870|]. (let ((.cse0 (select |v_#memory_int_2870| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2870| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 12))) [2019-05-15 10:36:07,468 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:36:07,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 16 treesize of output 11 [2019-05-15 10:36:07,488 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,489 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:07,490 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,490 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:07,497 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:07,498 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2871|]. (let ((.cse0 (select |v_#memory_int_2871| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2871| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 13 .cse0))) [2019-05-15 10:36:07,498 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:36:07,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 16 treesize of output 11 [2019-05-15 10:36:07,519 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,521 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:07,521 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,521 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:07,529 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:07,529 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2872|]. (let ((.cse0 (select |v_#memory_int_2872| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2872| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 14 .cse0))) [2019-05-15 10:36:07,529 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:36:07,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 16 treesize of output 11 [2019-05-15 10:36:07,551 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,553 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:07,553 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,553 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:07,560 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:07,561 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2873|]. (let ((.cse0 (select |v_#memory_int_2873| ULTIMATE.start_main_p1))) (and (= .cse0 15) (= |#memory_int| (store |v_#memory_int_2873| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:07,561 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:36:07,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 16 treesize of output 11 [2019-05-15 10:36:07,583 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,587 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:07,587 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,587 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:07,594 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:07,595 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2874|]. (let ((.cse0 (select |v_#memory_int_2874| ULTIMATE.start_main_p1))) (and (= .cse0 16) (= (store |v_#memory_int_2874| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:07,595 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:36:07,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 16 treesize of output 11 [2019-05-15 10:36:07,617 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,619 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:07,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:07,619 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:07,627 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:07,628 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2875|]. (let ((.cse0 (select |v_#memory_int_2875| ULTIMATE.start_main_p1))) (and (= .cse0 17) (= (store |v_#memory_int_2875| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:07,628 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:36:07,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 16 treesize of output 11 [2019-05-15 10:36:07,652 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,654 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:07,654 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,654 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:07,663 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:07,663 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2876|]. (let ((.cse0 (select |v_#memory_int_2876| ULTIMATE.start_main_p1))) (and (= 18 .cse0) (= |#memory_int| (store |v_#memory_int_2876| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:07,663 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:36:07,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 16 treesize of output 11 [2019-05-15 10:36:07,688 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,690 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:07,690 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,690 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:07,697 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:07,698 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2877|]. (let ((.cse0 (select |v_#memory_int_2877| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2877| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 19))) [2019-05-15 10:36:07,698 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:36:07,723 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:07,724 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,726 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:07,726 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,727 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:07,734 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:07,734 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2878|]. (let ((.cse0 (select |v_#memory_int_2878| ULTIMATE.start_main_p1))) (and (= .cse0 20) (= |#memory_int| (store |v_#memory_int_2878| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:07,734 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:36:07,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 16 treesize of output 11 [2019-05-15 10:36:07,762 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,764 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:07,764 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,764 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:07,771 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:07,771 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2879|]. (let ((.cse0 (select |v_#memory_int_2879| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2879| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 21 .cse0))) [2019-05-15 10:36:07,771 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:36:07,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 16 treesize of output 11 [2019-05-15 10:36:07,798 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,800 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:07,800 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,800 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:07,807 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:07,807 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2880|]. (let ((.cse0 (select |v_#memory_int_2880| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2880| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 22 .cse0))) [2019-05-15 10:36:07,808 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:36:07,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 16 treesize of output 11 [2019-05-15 10:36:07,835 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,837 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:07,837 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,837 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:07,844 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:07,845 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2881|]. (let ((.cse0 (select |v_#memory_int_2881| ULTIMATE.start_main_p1))) (and (= .cse0 23) (= (store |v_#memory_int_2881| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:07,845 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:36:07,873 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:07,874 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,876 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:07,876 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,876 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:07,884 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:07,884 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2882|]. (let ((.cse0 (select |v_#memory_int_2882| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2882| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 24))) [2019-05-15 10:36:07,884 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:36:07,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 16 treesize of output 11 [2019-05-15 10:36:07,911 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,913 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:07,914 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,914 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:07,921 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:07,922 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2883|]. (let ((.cse0 (select |v_#memory_int_2883| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2883| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 25))) [2019-05-15 10:36:07,922 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:36:07,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 16 treesize of output 11 [2019-05-15 10:36:07,951 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,953 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:07,953 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,953 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:07,961 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:07,961 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2884|]. (let ((.cse0 (select |v_#memory_int_2884| ULTIMATE.start_main_p1))) (and (= .cse0 26) (= (store |v_#memory_int_2884| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:07,961 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:36:07,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:07,992 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,994 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:07,995 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,995 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:08,001 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:08,001 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2885|]. (let ((.cse0 (select |v_#memory_int_2885| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2885| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 27))) [2019-05-15 10:36:08,001 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:36:08,033 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:08,034 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:08,036 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:08,036 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:08,036 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:08,044 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:08,044 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2886|]. (let ((.cse0 (select |v_#memory_int_2886| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2886| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 28))) [2019-05-15 10:36:08,044 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:36:08,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:08,220 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:08,251 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:08,251 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:08,251 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:08,269 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:08,270 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2887|]. (let ((.cse0 (select |v_#memory_int_2887| ULTIMATE.start_main_p1))) (and (= 29 .cse0) (= (store |v_#memory_int_2887| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:08,270 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:36:08,868 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:08,869 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:08,871 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:08,871 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:08,871 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:08,877 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:08,878 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2888|]. (let ((.cse0 (select |v_#memory_int_2888| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2888| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 30 .cse0))) [2019-05-15 10:36:08,878 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:36:08,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 16 treesize of output 11 [2019-05-15 10:36:08,911 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:08,913 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:08,913 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:08,913 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:08,921 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:08,921 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2889|]. (let ((.cse0 (select |v_#memory_int_2889| ULTIMATE.start_main_p1))) (and (= .cse0 31) (= (store |v_#memory_int_2889| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:08,921 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:36:08,953 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:08,954 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:08,956 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:08,956 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:08,957 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:08,965 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:08,965 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2890|]. (let ((.cse0 (select |v_#memory_int_2890| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2890| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 32))) [2019-05-15 10:36:08,965 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:36:09,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 16 treesize of output 11 [2019-05-15 10:36:09,001 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,003 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:09,004 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,004 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:09,012 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:09,012 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2891|]. (let ((.cse0 (select |v_#memory_int_2891| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2891| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 33 .cse0))) [2019-05-15 10:36:09,012 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:36:09,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:09,055 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,057 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:09,057 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,057 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:09,065 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:09,065 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2892|]. (let ((.cse0 (select |v_#memory_int_2892| ULTIMATE.start_main_p1))) (and (= .cse0 34) (= (store |v_#memory_int_2892| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:09,065 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:36:09,100 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:09,101 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,103 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:09,103 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,103 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:09,111 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:09,111 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2893|]. (let ((.cse0 (select |v_#memory_int_2893| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2893| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 35))) [2019-05-15 10:36:09,111 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:36:09,152 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:09,153 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,155 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:09,156 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,156 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:09,164 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:09,165 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2894|]. (let ((.cse0 (select |v_#memory_int_2894| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2894| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 36))) [2019-05-15 10:36:09,165 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:36:09,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 16 treesize of output 11 [2019-05-15 10:36:09,202 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,204 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:09,205 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,205 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:09,212 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:09,212 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2895|]. (let ((.cse0 (select |v_#memory_int_2895| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2895| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 37))) [2019-05-15 10:36:09,212 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:36:09,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:09,251 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,253 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:09,253 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,253 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:09,261 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:09,261 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2896|]. (let ((.cse0 (select |v_#memory_int_2896| ULTIMATE.start_main_p1))) (and (= .cse0 38) (= (store |v_#memory_int_2896| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:09,261 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:36:09,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:09,300 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,302 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:09,302 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,302 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:09,310 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:09,310 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2897|]. (let ((.cse0 (select |v_#memory_int_2897| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2897| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 39))) [2019-05-15 10:36:09,310 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:36:09,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:09,353 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,355 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:09,356 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,356 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:09,363 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:09,363 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2898|]. (let ((.cse0 (select |v_#memory_int_2898| ULTIMATE.start_main_p1))) (and (= .cse0 40) (= |#memory_int| (store |v_#memory_int_2898| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:09,363 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:36:09,402 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:09,403 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,405 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:09,405 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,405 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:09,413 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:09,413 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2899|]. (let ((.cse0 (select |v_#memory_int_2899| ULTIMATE.start_main_p1))) (and (= .cse0 41) (= (store |v_#memory_int_2899| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:09,413 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:36:09,453 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:09,454 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,456 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:09,457 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,457 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:09,464 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:09,464 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2900|]. (let ((.cse0 (select |v_#memory_int_2900| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2900| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 42 .cse0))) [2019-05-15 10:36:09,464 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:36:09,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 16 treesize of output 11 [2019-05-15 10:36:09,507 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,509 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:09,509 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,510 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:09,517 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:09,517 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2901|]. (let ((.cse0 (select |v_#memory_int_2901| ULTIMATE.start_main_p1))) (and (= .cse0 43) (= (store |v_#memory_int_2901| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:09,517 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:36:09,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:09,561 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,563 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:09,564 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,564 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:09,572 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:09,572 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2902|]. (let ((.cse0 (select |v_#memory_int_2902| ULTIMATE.start_main_p1))) (and (= 44 .cse0) (= (store |v_#memory_int_2902| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:09,572 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:36:09,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 16 treesize of output 11 [2019-05-15 10:36:09,621 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,623 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:09,623 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,623 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:09,631 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:09,631 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2903|]. (let ((.cse0 (select |v_#memory_int_2903| ULTIMATE.start_main_p1))) (and (= 45 .cse0) (= (store |v_#memory_int_2903| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:09,631 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:36:09,678 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:09,679 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,681 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:09,681 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,682 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:09,689 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:09,690 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2904|]. (let ((.cse0 (select |v_#memory_int_2904| ULTIMATE.start_main_p1))) (and (= .cse0 46) (= (store |v_#memory_int_2904| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:09,690 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:36:09,735 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:09,736 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,738 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:09,739 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,739 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:09,747 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:09,747 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2905|]. (let ((.cse0 (select |v_#memory_int_2905| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2905| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 47))) [2019-05-15 10:36:09,747 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:36:09,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 16 treesize of output 11 [2019-05-15 10:36:09,796 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,798 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:09,799 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,799 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:09,806 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:09,807 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2906|]. (let ((.cse0 (select |v_#memory_int_2906| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2906| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 48))) [2019-05-15 10:36:09,807 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:36:09,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:09,865 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,866 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:09,866 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,866 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:09,873 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:09,873 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2907|]. (let ((.cse0 (select |v_#memory_int_2907| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2907| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 49))) [2019-05-15 10:36:09,873 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:36:09,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 16 treesize of output 11 [2019-05-15 10:36:09,921 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,923 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:09,923 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,923 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:09,930 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:09,931 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2908|]. (let ((.cse0 (select |v_#memory_int_2908| ULTIMATE.start_main_p1))) (and (= 50 .cse0) (= |#memory_int| (store |v_#memory_int_2908| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:09,931 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:36:09,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:09,978 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,980 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:09,980 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,980 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:09,988 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:09,988 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2909|]. (let ((.cse0 (select |v_#memory_int_2909| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2909| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 51 .cse0))) [2019-05-15 10:36:09,988 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:36:10,035 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:10,036 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:10,038 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:10,039 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:10,039 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:10,046 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:10,047 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2910|]. (let ((.cse0 (select |v_#memory_int_2910| ULTIMATE.start_main_p1))) (and (= .cse0 52) (= (store |v_#memory_int_2910| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:10,047 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:36:10,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 16 treesize of output 11 [2019-05-15 10:36:10,097 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:10,099 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:10,099 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:10,099 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:10,106 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:10,107 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2911|]. (let ((.cse0 (select |v_#memory_int_2911| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2911| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 53 .cse0))) [2019-05-15 10:36:10,107 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:36:10,161 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:10,162 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:10,164 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:10,164 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:10,164 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:10,172 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:10,172 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2912|]. (let ((.cse0 (select |v_#memory_int_2912| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2912| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 54 .cse0))) [2019-05-15 10:36:10,172 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:36:10,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 16 treesize of output 11 [2019-05-15 10:36:10,227 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:10,229 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:10,229 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:10,229 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:10,236 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:10,237 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2913|]. (let ((.cse0 (select |v_#memory_int_2913| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2913| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 55))) [2019-05-15 10:36:10,237 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:36:10,288 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:10,289 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:10,291 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:10,291 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:10,292 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:10,299 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:10,299 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2914|]. (let ((.cse0 (select |v_#memory_int_2914| ULTIMATE.start_main_p1))) (and (= 56 .cse0) (= (store |v_#memory_int_2914| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:10,299 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:36:10,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 16 treesize of output 11 [2019-05-15 10:36:10,356 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:10,358 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:10,358 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:10,358 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:10,366 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:10,366 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2915|]. (let ((.cse0 (select |v_#memory_int_2915| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2915| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 57 .cse0))) [2019-05-15 10:36:10,366 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:36:10,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 16 treesize of output 11 [2019-05-15 10:36:10,419 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:10,421 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:10,422 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:10,422 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:10,429 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:10,429 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2916|]. (let ((.cse0 (select |v_#memory_int_2916| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2916| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 58))) [2019-05-15 10:36:10,429 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:36:10,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 16 treesize of output 11 [2019-05-15 10:36:10,483 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:10,485 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:10,486 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:10,486 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:10,493 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:10,493 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2917|]. (let ((.cse0 (select |v_#memory_int_2917| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2917| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 59 .cse0))) [2019-05-15 10:36:10,493 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:36:10,548 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:10,549 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:10,551 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:10,551 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:10,551 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:10,559 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:10,559 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2918|]. (let ((.cse0 (select |v_#memory_int_2918| ULTIMATE.start_main_p1))) (and (= 60 .cse0) (= (store |v_#memory_int_2918| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:10,559 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:36:10,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 16 treesize of output 11 [2019-05-15 10:36:10,614 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:10,616 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:10,617 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:10,617 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:10,624 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:10,624 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2919|]. (let ((.cse0 (select |v_#memory_int_2919| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2919| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 61 .cse0))) [2019-05-15 10:36:10,624 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:36:10,686 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:10,687 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:10,689 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:10,689 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:10,690 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:10,697 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:10,697 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2920|]. (let ((.cse0 (select |v_#memory_int_2920| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2920| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 62))) [2019-05-15 10:36:10,698 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:36:10,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:10,756 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:10,758 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:10,758 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:10,759 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:10,766 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:10,767 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2921|]. (let ((.cse0 (select |v_#memory_int_2921| ULTIMATE.start_main_p1))) (and (= .cse0 63) (= (store |v_#memory_int_2921| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:10,767 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 64) [2019-05-15 10:36:10,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:10,828 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:10,830 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:10,830 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:10,831 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:10,837 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:10,838 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2922|]. (let ((.cse0 (select |v_#memory_int_2922| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2922| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 64))) [2019-05-15 10:36:10,838 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 65) [2019-05-15 10:36:10,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 16 treesize of output 11 [2019-05-15 10:36:10,897 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:10,899 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:10,899 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:10,899 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:10,907 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:10,907 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2923|]. (let ((.cse0 (select |v_#memory_int_2923| ULTIMATE.start_main_p1))) (and (= 65 .cse0) (= (store |v_#memory_int_2923| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:10,907 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 66) [2019-05-15 10:36:10,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 16 treesize of output 11 [2019-05-15 10:36:10,969 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:10,971 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:10,971 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:10,971 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:10,979 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:10,979 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2924|]. (let ((.cse0 (select |v_#memory_int_2924| ULTIMATE.start_main_p1))) (and (= 66 .cse0) (= (store |v_#memory_int_2924| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:10,979 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 67) [2019-05-15 10:36:11,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:11,037 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:11,039 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:11,039 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:11,039 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:11,047 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:11,047 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2925|]. (let ((.cse0 (select |v_#memory_int_2925| ULTIMATE.start_main_p1))) (and (= .cse0 67) (= (store |v_#memory_int_2925| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:11,047 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 68) [2019-05-15 10:36:11,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 16 treesize of output 11 [2019-05-15 10:36:11,113 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:11,115 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:11,116 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:11,116 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:11,123 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:11,123 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2926|]. (let ((.cse0 (select |v_#memory_int_2926| ULTIMATE.start_main_p1))) (and (= 68 .cse0) (= |#memory_int| (store |v_#memory_int_2926| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:11,123 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 69) [2019-05-15 10:36:11,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 16 treesize of output 11 [2019-05-15 10:36:11,189 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:11,191 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:11,191 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:11,191 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:11,199 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:11,199 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2927|]. (let ((.cse0 (select |v_#memory_int_2927| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2927| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 69 .cse0))) [2019-05-15 10:36:11,199 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 70) [2019-05-15 10:36:11,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 16 treesize of output 11 [2019-05-15 10:36:11,268 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:11,270 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:11,270 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:11,270 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:11,278 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:11,278 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2928|]. (let ((.cse0 (select |v_#memory_int_2928| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2928| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 70 .cse0))) [2019-05-15 10:36:11,278 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 71) [2019-05-15 10:36:11,341 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:11,342 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:11,344 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:11,344 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:11,344 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:11,351 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:11,352 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2929|]. (let ((.cse0 (select |v_#memory_int_2929| ULTIMATE.start_main_p1))) (and (= 71 .cse0) (= (store |v_#memory_int_2929| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:11,352 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 72) [2019-05-15 10:36:11,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 16 treesize of output 11 [2019-05-15 10:36:11,415 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:11,417 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:11,418 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:11,418 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:11,425 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:11,425 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2930|]. (let ((.cse0 (select |v_#memory_int_2930| ULTIMATE.start_main_p1))) (and (= 72 .cse0) (= |#memory_int| (store |v_#memory_int_2930| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:11,425 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 73) [2019-05-15 10:36:11,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:11,490 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:11,493 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:11,493 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:11,493 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:11,501 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:11,501 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2931|]. (let ((.cse0 (select |v_#memory_int_2931| ULTIMATE.start_main_p1))) (and (= .cse0 73) (= |#memory_int| (store |v_#memory_int_2931| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:11,501 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 74) [2019-05-15 10:36:11,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 16 treesize of output 11 [2019-05-15 10:36:11,572 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:11,574 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:11,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:11,575 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:11,582 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:11,582 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2932|]. (let ((.cse0 (select |v_#memory_int_2932| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2932| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 74 .cse0))) [2019-05-15 10:36:11,582 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 75) [2019-05-15 10:36:11,642 INFO L273 TraceCheckUtils]: 0: Hoare triple {25064#true} havoc main_p1; {25064#true} is VALID [2019-05-15 10:36:11,642 INFO L273 TraceCheckUtils]: 1: Hoare triple {25064#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {25064#true} is VALID [2019-05-15 10:36:11,643 INFO L273 TraceCheckUtils]: 2: Hoare triple {25064#true} #memory_int := #memory_int[main_p1 := 0]; {25075#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:36:11,643 INFO L273 TraceCheckUtils]: 3: Hoare triple {25075#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25079#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:36:11,644 INFO L273 TraceCheckUtils]: 4: Hoare triple {25079#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25083#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:36:11,644 INFO L273 TraceCheckUtils]: 5: Hoare triple {25083#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25087#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:36:11,645 INFO L273 TraceCheckUtils]: 6: Hoare triple {25087#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25091#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:36:11,646 INFO L273 TraceCheckUtils]: 7: Hoare triple {25091#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25095#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:36:11,646 INFO L273 TraceCheckUtils]: 8: Hoare triple {25095#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25099#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:36:11,647 INFO L273 TraceCheckUtils]: 9: Hoare triple {25099#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25103#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:36:11,648 INFO L273 TraceCheckUtils]: 10: Hoare triple {25103#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25107#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:36:11,649 INFO L273 TraceCheckUtils]: 11: Hoare triple {25107#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25111#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:36:11,649 INFO L273 TraceCheckUtils]: 12: Hoare triple {25111#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25115#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:36:11,650 INFO L273 TraceCheckUtils]: 13: Hoare triple {25115#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25119#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:36:11,651 INFO L273 TraceCheckUtils]: 14: Hoare triple {25119#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25123#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:36:11,652 INFO L273 TraceCheckUtils]: 15: Hoare triple {25123#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25127#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:36:11,652 INFO L273 TraceCheckUtils]: 16: Hoare triple {25127#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25131#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:36:11,653 INFO L273 TraceCheckUtils]: 17: Hoare triple {25131#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25135#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:36:11,654 INFO L273 TraceCheckUtils]: 18: Hoare triple {25135#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25139#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:36:11,655 INFO L273 TraceCheckUtils]: 19: Hoare triple {25139#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25143#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:36:11,655 INFO L273 TraceCheckUtils]: 20: Hoare triple {25143#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25147#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:36:11,656 INFO L273 TraceCheckUtils]: 21: Hoare triple {25147#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25151#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:36:11,657 INFO L273 TraceCheckUtils]: 22: Hoare triple {25151#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25155#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:36:11,658 INFO L273 TraceCheckUtils]: 23: Hoare triple {25155#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25159#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:36:11,658 INFO L273 TraceCheckUtils]: 24: Hoare triple {25159#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25163#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:36:11,659 INFO L273 TraceCheckUtils]: 25: Hoare triple {25163#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25167#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:36:11,660 INFO L273 TraceCheckUtils]: 26: Hoare triple {25167#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25171#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:36:11,661 INFO L273 TraceCheckUtils]: 27: Hoare triple {25171#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25175#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:36:11,661 INFO L273 TraceCheckUtils]: 28: Hoare triple {25175#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25179#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:36:11,662 INFO L273 TraceCheckUtils]: 29: Hoare triple {25179#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25183#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:36:11,663 INFO L273 TraceCheckUtils]: 30: Hoare triple {25183#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25187#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:36:11,664 INFO L273 TraceCheckUtils]: 31: Hoare triple {25187#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25191#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:36:11,664 INFO L273 TraceCheckUtils]: 32: Hoare triple {25191#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25195#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:36:11,665 INFO L273 TraceCheckUtils]: 33: Hoare triple {25195#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25199#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:36:11,666 INFO L273 TraceCheckUtils]: 34: Hoare triple {25199#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25203#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:36:11,667 INFO L273 TraceCheckUtils]: 35: Hoare triple {25203#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25207#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:36:11,667 INFO L273 TraceCheckUtils]: 36: Hoare triple {25207#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25211#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:36:11,668 INFO L273 TraceCheckUtils]: 37: Hoare triple {25211#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25215#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:36:11,669 INFO L273 TraceCheckUtils]: 38: Hoare triple {25215#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25219#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:36:11,670 INFO L273 TraceCheckUtils]: 39: Hoare triple {25219#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25223#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:36:11,670 INFO L273 TraceCheckUtils]: 40: Hoare triple {25223#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25227#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:36:11,671 INFO L273 TraceCheckUtils]: 41: Hoare triple {25227#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25231#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:36:11,672 INFO L273 TraceCheckUtils]: 42: Hoare triple {25231#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25235#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:36:11,673 INFO L273 TraceCheckUtils]: 43: Hoare triple {25235#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25239#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:36:11,673 INFO L273 TraceCheckUtils]: 44: Hoare triple {25239#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25243#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:36:11,674 INFO L273 TraceCheckUtils]: 45: Hoare triple {25243#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25247#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:36:11,675 INFO L273 TraceCheckUtils]: 46: Hoare triple {25247#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25251#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:36:11,676 INFO L273 TraceCheckUtils]: 47: Hoare triple {25251#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25255#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:36:11,676 INFO L273 TraceCheckUtils]: 48: Hoare triple {25255#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25259#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:36:11,677 INFO L273 TraceCheckUtils]: 49: Hoare triple {25259#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25263#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:36:11,678 INFO L273 TraceCheckUtils]: 50: Hoare triple {25263#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25267#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:36:11,679 INFO L273 TraceCheckUtils]: 51: Hoare triple {25267#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25271#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:36:11,679 INFO L273 TraceCheckUtils]: 52: Hoare triple {25271#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25275#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:36:11,680 INFO L273 TraceCheckUtils]: 53: Hoare triple {25275#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25279#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:36:11,681 INFO L273 TraceCheckUtils]: 54: Hoare triple {25279#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25283#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:36:11,682 INFO L273 TraceCheckUtils]: 55: Hoare triple {25283#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25287#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:36:11,682 INFO L273 TraceCheckUtils]: 56: Hoare triple {25287#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25291#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:36:11,683 INFO L273 TraceCheckUtils]: 57: Hoare triple {25291#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25295#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:36:11,684 INFO L273 TraceCheckUtils]: 58: Hoare triple {25295#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25299#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:36:11,685 INFO L273 TraceCheckUtils]: 59: Hoare triple {25299#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25303#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:36:11,685 INFO L273 TraceCheckUtils]: 60: Hoare triple {25303#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25307#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:36:11,686 INFO L273 TraceCheckUtils]: 61: Hoare triple {25307#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25311#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:36:11,687 INFO L273 TraceCheckUtils]: 62: Hoare triple {25311#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25315#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:36:11,688 INFO L273 TraceCheckUtils]: 63: Hoare triple {25315#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25319#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:36:11,688 INFO L273 TraceCheckUtils]: 64: Hoare triple {25319#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25323#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:36:11,689 INFO L273 TraceCheckUtils]: 65: Hoare triple {25323#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25327#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:36:11,690 INFO L273 TraceCheckUtils]: 66: Hoare triple {25327#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25331#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} is VALID [2019-05-15 10:36:11,691 INFO L273 TraceCheckUtils]: 67: Hoare triple {25331#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25335#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} is VALID [2019-05-15 10:36:11,691 INFO L273 TraceCheckUtils]: 68: Hoare triple {25335#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25339#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} is VALID [2019-05-15 10:36:11,692 INFO L273 TraceCheckUtils]: 69: Hoare triple {25339#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25343#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} is VALID [2019-05-15 10:36:11,693 INFO L273 TraceCheckUtils]: 70: Hoare triple {25343#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25347#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} is VALID [2019-05-15 10:36:11,694 INFO L273 TraceCheckUtils]: 71: Hoare triple {25347#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25351#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} is VALID [2019-05-15 10:36:11,694 INFO L273 TraceCheckUtils]: 72: Hoare triple {25351#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25355#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} is VALID [2019-05-15 10:36:11,695 INFO L273 TraceCheckUtils]: 73: Hoare triple {25355#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25359#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} is VALID [2019-05-15 10:36:11,696 INFO L273 TraceCheckUtils]: 74: Hoare triple {25359#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25363#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} is VALID [2019-05-15 10:36:11,696 INFO L273 TraceCheckUtils]: 75: Hoare triple {25363#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25367#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} is VALID [2019-05-15 10:36:11,697 INFO L273 TraceCheckUtils]: 76: Hoare triple {25367#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25371#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} is VALID [2019-05-15 10:36:11,698 INFO L273 TraceCheckUtils]: 77: Hoare triple {25371#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25375#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} is VALID [2019-05-15 10:36:11,699 INFO L273 TraceCheckUtils]: 78: Hoare triple {25375#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} assume !(#memory_int[main_p1] >= 0); {25065#false} is VALID [2019-05-15 10:36:11,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:36:11,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:36:11,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-05-15 10:36:11,708 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 79 [2019-05-15 10:36:11,708 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:36:11,708 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 78 states. [2019-05-15 10:36:11,770 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:36:11,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-05-15 10:36:11,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-05-15 10:36:11,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-05-15 10:36:11,771 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 78 states. [2019-05-15 10:36:23,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:36:23,560 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-05-15 10:36:23,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-05-15 10:36:23,560 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 79 [2019-05-15 10:36:23,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:36:23,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-05-15 10:36:23,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2019-05-15 10:36:23,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-05-15 10:36:23,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2019-05-15 10:36:23,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 78 states and 82 transitions. [2019-05-15 10:36:23,628 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:23,629 INFO L225 Difference]: With dead ends: 81 [2019-05-15 10:36:23,629 INFO L226 Difference]: Without dead ends: 81 [2019-05-15 10:36:23,630 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-05-15 10:36:23,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-05-15 10:36:23,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-05-15 10:36:23,631 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:36:23,631 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 81 states. [2019-05-15 10:36:23,631 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 81 states. [2019-05-15 10:36:23,631 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 81 states. [2019-05-15 10:36:23,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:36:23,632 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-05-15 10:36:23,632 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-05-15 10:36:23,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:36:23,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:36:23,632 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 81 states. [2019-05-15 10:36:23,632 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 81 states. [2019-05-15 10:36:23,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:36:23,633 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-05-15 10:36:23,633 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-05-15 10:36:23,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:36:23,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:36:23,634 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:36:23,634 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:36:23,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-05-15 10:36:23,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-05-15 10:36:23,634 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-05-15 10:36:23,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:36:23,635 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-05-15 10:36:23,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-05-15 10:36:23,635 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-05-15 10:36:23,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-05-15 10:36:23,635 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:36:23,635 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1, 1] [2019-05-15 10:36:23,635 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:36:23,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:36:23,636 INFO L82 PathProgramCache]: Analyzing trace with hash 514137864, now seen corresponding path program 76 times [2019-05-15 10:36:23,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:36:23,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:36:23,674 WARN L254 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 78 conjunts are in the unsatisfiable core [2019-05-15 10:36:23,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:36:23,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:36:23,716 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:23,716 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,721 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:23,721 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,721 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:36:23,722 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:23,722 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2933|]. (= |#memory_int| (store |v_#memory_int_2933| ULTIMATE.start_main_p1 0)) [2019-05-15 10:36:23,723 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:36:23,739 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:23,739 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,741 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:23,741 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,741 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:23,748 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:23,748 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2934|]. (let ((.cse0 (select |v_#memory_int_2934| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2934| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 0))) [2019-05-15 10:36:23,748 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:36:23,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 16 treesize of output 11 [2019-05-15 10:36:23,760 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,762 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:23,762 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,762 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:23,772 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:23,772 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2935|]. (let ((.cse0 (select |v_#memory_int_2935| ULTIMATE.start_main_p1))) (and (= 1 .cse0) (= (store |v_#memory_int_2935| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:23,772 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:36:23,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 16 treesize of output 11 [2019-05-15 10:36:23,785 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,787 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:23,787 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,787 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:23,795 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:23,795 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2936|]. (let ((.cse0 (select |v_#memory_int_2936| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2936| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 2))) [2019-05-15 10:36:23,795 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:36:23,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:23,808 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,810 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:23,810 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,810 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [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_#memory_int_2937|]. (let ((.cse0 (select |v_#memory_int_2937| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2937| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 3))) [2019-05-15 10:36:23,817 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:36:23,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:23,830 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,832 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:23,832 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,832 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:23,839 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:23,840 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2938|]. (let ((.cse0 (select |v_#memory_int_2938| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2938| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 4))) [2019-05-15 10:36:23,840 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:36:23,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 16 treesize of output 11 [2019-05-15 10:36:23,853 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,855 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:23,855 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,855 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:23,861 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:23,861 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2939|]. (let ((.cse0 (select |v_#memory_int_2939| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2939| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 5))) [2019-05-15 10:36:23,861 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:36:23,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:23,876 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,878 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:23,878 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,878 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:23,885 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:23,885 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2940|]. (let ((.cse0 (select |v_#memory_int_2940| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2940| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 6))) [2019-05-15 10:36:23,885 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:36:23,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:23,900 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,902 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:23,902 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,902 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:23,910 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:23,910 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2941|]. (let ((.cse0 (select |v_#memory_int_2941| ULTIMATE.start_main_p1))) (and (= 7 .cse0) (= (store |v_#memory_int_2941| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:23,910 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:36:23,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 16 treesize of output 11 [2019-05-15 10:36:23,929 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,931 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:23,931 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,931 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:23,938 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:23,938 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2942|]. (let ((.cse0 (select |v_#memory_int_2942| ULTIMATE.start_main_p1))) (and (= 8 .cse0) (= |#memory_int| (store |v_#memory_int_2942| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:23,938 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:36:23,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:23,955 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,957 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:23,957 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,957 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:23,964 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:23,964 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2943|]. (let ((.cse0 (select |v_#memory_int_2943| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2943| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 9 .cse0))) [2019-05-15 10:36:23,964 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:36:23,982 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:23,983 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,985 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:23,985 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,985 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:23,994 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:23,994 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2944|]. (let ((.cse0 (select |v_#memory_int_2944| ULTIMATE.start_main_p1))) (and (= .cse0 10) (= (store |v_#memory_int_2944| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:23,994 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:36:24,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:24,011 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,013 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:24,013 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,013 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:24,021 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:24,021 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2945|]. (let ((.cse0 (select |v_#memory_int_2945| ULTIMATE.start_main_p1))) (and (= .cse0 11) (= (store |v_#memory_int_2945| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:24,021 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:36:24,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:24,040 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,042 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:24,042 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,042 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:24,050 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:24,050 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2946|]. (let ((.cse0 (select |v_#memory_int_2946| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2946| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 12 .cse0))) [2019-05-15 10:36:24,050 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:36:24,068 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:24,069 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:24,071 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,072 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:24,079 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:24,079 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2947|]. (let ((.cse0 (select |v_#memory_int_2947| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2947| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 13 .cse0))) [2019-05-15 10:36:24,079 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:36:24,100 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:24,100 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,102 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:24,103 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,103 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:24,109 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:24,109 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2948|]. (let ((.cse0 (select |v_#memory_int_2948| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2948| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 14))) [2019-05-15 10:36:24,109 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:36:24,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 16 treesize of output 11 [2019-05-15 10:36:24,131 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,133 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:24,133 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,133 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:24,140 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:24,141 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2949|]. (let ((.cse0 (select |v_#memory_int_2949| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2949| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 15))) [2019-05-15 10:36:24,141 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:36:24,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 16 treesize of output 11 [2019-05-15 10:36:24,164 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,166 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:24,166 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,166 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:24,173 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:24,174 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2950|]. (let ((.cse0 (select |v_#memory_int_2950| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2950| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 16 .cse0))) [2019-05-15 10:36:24,174 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:36:24,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:24,196 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,198 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:24,198 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,198 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:24,206 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:24,206 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2951|]. (let ((.cse0 (select |v_#memory_int_2951| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2951| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 17 .cse0))) [2019-05-15 10:36:24,206 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:36:24,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 16 treesize of output 11 [2019-05-15 10:36:24,230 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,232 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:24,232 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,232 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:24,240 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:24,240 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2952|]. (let ((.cse0 (select |v_#memory_int_2952| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2952| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 18))) [2019-05-15 10:36:24,240 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:36:24,264 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:24,265 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,267 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:24,267 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,267 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:24,275 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:24,275 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2953|]. (let ((.cse0 (select |v_#memory_int_2953| ULTIMATE.start_main_p1))) (and (= .cse0 19) (= (store |v_#memory_int_2953| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:24,275 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:36:24,300 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:24,301 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,303 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:24,303 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,303 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:24,310 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:24,310 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2954|]. (let ((.cse0 (select |v_#memory_int_2954| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2954| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 20 .cse0))) [2019-05-15 10:36:24,310 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:36:24,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 16 treesize of output 11 [2019-05-15 10:36:24,337 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,339 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:24,339 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,339 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:24,346 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:24,347 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2955|]. (let ((.cse0 (select |v_#memory_int_2955| ULTIMATE.start_main_p1))) (and (= 21 .cse0) (= |#memory_int| (store |v_#memory_int_2955| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:24,347 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:36:24,371 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:24,372 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,374 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:24,374 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,375 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:24,381 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:24,382 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2956|]. (let ((.cse0 (select |v_#memory_int_2956| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2956| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 22 .cse0))) [2019-05-15 10:36:24,382 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:36:24,408 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:24,409 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,411 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:24,411 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,412 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:24,419 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:24,419 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2957|]. (let ((.cse0 (select |v_#memory_int_2957| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2957| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 23))) [2019-05-15 10:36:24,419 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:36:24,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 16 treesize of output 11 [2019-05-15 10:36:24,453 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,455 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:24,455 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,455 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:24,461 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:24,461 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2958|]. (let ((.cse0 (select |v_#memory_int_2958| ULTIMATE.start_main_p1))) (and (= 24 .cse0) (= (store |v_#memory_int_2958| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:24,461 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:36:24,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:24,491 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,493 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:24,493 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,494 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:24,501 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:24,501 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2959|]. (let ((.cse0 (select |v_#memory_int_2959| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2959| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 25))) [2019-05-15 10:36:24,501 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:36:24,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 16 treesize of output 11 [2019-05-15 10:36:24,532 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,534 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:24,534 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,534 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:24,542 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:24,542 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2960|]. (let ((.cse0 (select |v_#memory_int_2960| ULTIMATE.start_main_p1))) (and (= 26 .cse0) (= |#memory_int| (store |v_#memory_int_2960| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:24,543 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:36:24,573 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:24,574 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,576 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:24,576 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,577 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:24,584 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:24,584 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2961|]. (let ((.cse0 (select |v_#memory_int_2961| ULTIMATE.start_main_p1))) (and (= .cse0 27) (= (store |v_#memory_int_2961| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:24,584 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:36:24,615 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:24,616 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,618 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:24,618 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,618 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:24,626 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:24,626 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2962|]. (let ((.cse0 (select |v_#memory_int_2962| ULTIMATE.start_main_p1))) (and (= .cse0 28) (= |#memory_int| (store |v_#memory_int_2962| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:24,627 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:36:24,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 16 treesize of output 11 [2019-05-15 10:36:24,659 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,661 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:24,661 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,661 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:24,669 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:24,669 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2963|]. (let ((.cse0 (select |v_#memory_int_2963| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2963| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 29))) [2019-05-15 10:36:24,669 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:36:24,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 16 treesize of output 11 [2019-05-15 10:36:24,710 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,712 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:24,713 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,713 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:24,721 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:24,721 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2964|]. (let ((.cse0 (select |v_#memory_int_2964| ULTIMATE.start_main_p1))) (and (= 30 .cse0) (= |#memory_int| (store |v_#memory_int_2964| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:24,721 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:36:24,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 16 treesize of output 11 [2019-05-15 10:36:24,755 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,757 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:24,757 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,758 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:24,765 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:24,765 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2965|]. (let ((.cse0 (select |v_#memory_int_2965| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2965| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 31))) [2019-05-15 10:36:24,765 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:36:24,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 16 treesize of output 11 [2019-05-15 10:36:24,801 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,803 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:24,803 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,803 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:24,811 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:24,811 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2966|]. (let ((.cse0 (select |v_#memory_int_2966| ULTIMATE.start_main_p1))) (and (= 32 .cse0) (= (store |v_#memory_int_2966| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:24,811 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:36:24,846 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:24,847 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,849 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:24,849 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,849 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:24,857 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:24,857 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2967|]. (let ((.cse0 (select |v_#memory_int_2967| ULTIMATE.start_main_p1))) (and (= .cse0 33) (= (store |v_#memory_int_2967| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:24,857 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:36:24,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:24,896 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,898 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:24,898 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,898 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:24,907 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:24,907 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2968|]. (let ((.cse0 (select |v_#memory_int_2968| ULTIMATE.start_main_p1))) (and (= .cse0 34) (= (store |v_#memory_int_2968| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:24,907 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:36:24,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:24,945 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,947 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:24,947 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,947 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:24,954 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:24,954 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2969|]. (let ((.cse0 (select |v_#memory_int_2969| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2969| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 35))) [2019-05-15 10:36:24,954 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:36:24,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:24,996 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,998 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:24,998 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,998 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:25,006 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:25,006 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2970|]. (let ((.cse0 (select |v_#memory_int_2970| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2970| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 36))) [2019-05-15 10:36:25,006 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:36:25,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 16 treesize of output 11 [2019-05-15 10:36:25,045 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,047 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:25,048 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,048 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:25,056 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:25,057 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2971|]. (let ((.cse0 (select |v_#memory_int_2971| ULTIMATE.start_main_p1))) (and (= .cse0 37) (= (store |v_#memory_int_2971| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:25,057 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:36:25,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 16 treesize of output 11 [2019-05-15 10:36:25,097 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,099 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:25,099 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,099 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:25,108 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:25,108 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2972|]. (let ((.cse0 (select |v_#memory_int_2972| ULTIMATE.start_main_p1))) (and (= 38 .cse0) (= (store |v_#memory_int_2972| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:25,108 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:36:25,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 16 treesize of output 11 [2019-05-15 10:36:25,149 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,151 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:25,151 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,151 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:25,159 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:25,159 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2973|]. (let ((.cse0 (select |v_#memory_int_2973| ULTIMATE.start_main_p1))) (and (= .cse0 39) (= (store |v_#memory_int_2973| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:25,159 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:36:25,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:25,200 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:25,202 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,202 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:25,210 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:25,210 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2974|]. (let ((.cse0 (select |v_#memory_int_2974| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2974| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 40))) [2019-05-15 10:36:25,210 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:36:25,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 16 treesize of output 11 [2019-05-15 10:36:25,249 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,251 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:25,251 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,251 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:25,259 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:25,259 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2975|]. (let ((.cse0 (select |v_#memory_int_2975| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2975| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 41))) [2019-05-15 10:36:25,259 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:36:25,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:25,307 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,309 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:25,309 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,309 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:25,317 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:25,317 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2976|]. (let ((.cse0 (select |v_#memory_int_2976| ULTIMATE.start_main_p1))) (and (= .cse0 42) (= (store |v_#memory_int_2976| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:25,317 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:36:25,358 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:25,359 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,361 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:25,361 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,362 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:25,369 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:25,369 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2977|]. (let ((.cse0 (select |v_#memory_int_2977| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2977| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 43 .cse0))) [2019-05-15 10:36:25,369 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:36:25,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 16 treesize of output 11 [2019-05-15 10:36:25,419 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,421 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:25,421 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,421 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:25,428 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:25,428 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2978|]. (let ((.cse0 (select |v_#memory_int_2978| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2978| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 44))) [2019-05-15 10:36:25,428 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:36:25,476 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:25,477 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,479 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:25,480 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,480 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:25,487 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:25,488 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2979|]. (let ((.cse0 (select |v_#memory_int_2979| ULTIMATE.start_main_p1))) (and (= 45 .cse0) (= (store |v_#memory_int_2979| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:25,488 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:36:25,534 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:25,535 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,537 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:25,537 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,537 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:25,545 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:25,545 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2980|]. (let ((.cse0 (select |v_#memory_int_2980| ULTIMATE.start_main_p1))) (and (= .cse0 46) (= |#memory_int| (store |v_#memory_int_2980| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:25,546 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:36:25,593 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:25,594 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,597 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:25,597 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,597 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:25,604 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:25,604 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2981|]. (let ((.cse0 (select |v_#memory_int_2981| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2981| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 47 .cse0))) [2019-05-15 10:36:25,605 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:36:25,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 16 treesize of output 11 [2019-05-15 10:36:25,653 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,655 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:25,656 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,656 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:25,663 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:25,663 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2982|]. (let ((.cse0 (select |v_#memory_int_2982| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2982| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 48))) [2019-05-15 10:36:25,664 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:36:25,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:25,718 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,720 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:25,720 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,721 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:25,727 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:25,728 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2983|]. (let ((.cse0 (select |v_#memory_int_2983| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2983| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 49))) [2019-05-15 10:36:25,728 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:36:25,776 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:25,777 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,779 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:25,779 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,779 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:25,787 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:25,787 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2984|]. (let ((.cse0 (select |v_#memory_int_2984| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2984| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 50 .cse0))) [2019-05-15 10:36:25,787 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:36:25,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:25,836 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,838 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:25,839 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,839 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:25,846 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:25,846 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2985|]. (let ((.cse0 (select |v_#memory_int_2985| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2985| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 51))) [2019-05-15 10:36:25,846 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:36:25,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:25,901 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,903 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:25,904 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,904 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:25,911 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:25,911 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2986|]. (let ((.cse0 (select |v_#memory_int_2986| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2986| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 52 .cse0))) [2019-05-15 10:36:25,911 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:36:25,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 16 treesize of output 11 [2019-05-15 10:36:25,963 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,965 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:25,966 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,966 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:25,974 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:25,974 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2987|]. (let ((.cse0 (select |v_#memory_int_2987| ULTIMATE.start_main_p1))) (and (= 53 .cse0) (= |#memory_int| (store |v_#memory_int_2987| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:25,974 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:36:26,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 16 treesize of output 11 [2019-05-15 10:36:26,023 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:26,025 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:26,025 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:26,025 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:26,032 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:26,032 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2988|]. (let ((.cse0 (select |v_#memory_int_2988| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2988| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 54 .cse0))) [2019-05-15 10:36:26,032 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:36: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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:26,085 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:26,087 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:26,088 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:26,088 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:26,095 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:26,095 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2989|]. (let ((.cse0 (select |v_#memory_int_2989| ULTIMATE.start_main_p1))) (and (= 55 .cse0) (= (store |v_#memory_int_2989| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:26,096 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:36:26,149 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:26,150 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:26,152 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36: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:36:26,152 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:26,160 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:26,160 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2990|]. (let ((.cse0 (select |v_#memory_int_2990| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2990| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 56))) [2019-05-15 10:36:26,160 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:36:26,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 16 treesize of output 11 [2019-05-15 10:36:26,213 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:26,215 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:26,215 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:26,215 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:26,222 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:26,222 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2991|]. (let ((.cse0 (select |v_#memory_int_2991| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2991| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 57))) [2019-05-15 10:36:26,223 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:36:26,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:26,279 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:26,281 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:26,281 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:26,282 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:26,289 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:26,289 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2992|]. (let ((.cse0 (select |v_#memory_int_2992| ULTIMATE.start_main_p1))) (and (= 58 .cse0) (= (store |v_#memory_int_2992| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:26,289 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:36:26,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:26,348 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:26,350 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:26,350 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:26,350 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:26,358 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:26,358 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2993|]. (let ((.cse0 (select |v_#memory_int_2993| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2993| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 59 .cse0))) [2019-05-15 10:36:26,358 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:36:26,415 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:26,416 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:26,418 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:26,418 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:26,418 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:26,425 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:26,425 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2994|]. (let ((.cse0 (select |v_#memory_int_2994| ULTIMATE.start_main_p1))) (and (= .cse0 60) (= (store |v_#memory_int_2994| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:26,426 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:36:26,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 16 treesize of output 11 [2019-05-15 10:36:26,484 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:26,486 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:26,487 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:26,487 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:26,495 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:26,495 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2995|]. (let ((.cse0 (select |v_#memory_int_2995| ULTIMATE.start_main_p1))) (and (= .cse0 61) (= |#memory_int| (store |v_#memory_int_2995| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:26,495 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:36:26,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 16 treesize of output 11 [2019-05-15 10:36:26,554 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:26,556 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:26,556 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:26,557 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:26,564 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:26,564 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2996|]. (let ((.cse0 (select |v_#memory_int_2996| ULTIMATE.start_main_p1))) (and (= .cse0 62) (= (store |v_#memory_int_2996| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:26,564 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:36:26,621 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:26,622 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:26,624 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:26,625 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:26,625 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:26,633 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:26,633 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2997|]. (let ((.cse0 (select |v_#memory_int_2997| ULTIMATE.start_main_p1))) (and (= 63 .cse0) (= (store |v_#memory_int_2997| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:26,633 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 64) [2019-05-15 10:36:26,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:26,696 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:26,698 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:26,698 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:26,699 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:26,706 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:26,706 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2998|]. (let ((.cse0 (select |v_#memory_int_2998| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2998| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 64 .cse0))) [2019-05-15 10:36:26,706 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 65) [2019-05-15 10:36:26,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 16 treesize of output 11 [2019-05-15 10:36:26,767 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:26,769 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:26,769 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:26,769 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:26,776 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:26,777 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2999|]. (let ((.cse0 (select |v_#memory_int_2999| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2999| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 65))) [2019-05-15 10:36:26,777 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 66) [2019-05-15 10:36: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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:26,840 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:26,842 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:26,842 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:26,842 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:26,850 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:26,850 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3000|]. (let ((.cse0 (select |v_#memory_int_3000| ULTIMATE.start_main_p1))) (and (= 66 .cse0) (= (store |v_#memory_int_3000| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:26,850 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 67) [2019-05-15 10:36:26,912 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:26,913 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:26,915 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:26,915 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:26,915 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:26,923 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:26,923 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3001|]. (let ((.cse0 (select |v_#memory_int_3001| ULTIMATE.start_main_p1))) (and (= 67 .cse0) (= |#memory_int| (store |v_#memory_int_3001| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:26,923 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 68) [2019-05-15 10:36:26,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 16 treesize of output 11 [2019-05-15 10:36:26,985 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:26,987 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:26,987 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:26,987 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:26,996 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:26,996 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3002|]. (let ((.cse0 (select |v_#memory_int_3002| ULTIMATE.start_main_p1))) (and (= .cse0 68) (= (store |v_#memory_int_3002| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:26,996 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 69) [2019-05-15 10:36:27,058 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:27,059 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:27,061 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:27,062 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:27,062 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:27,069 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:27,069 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3003|]. (let ((.cse0 (select |v_#memory_int_3003| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3003| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 69 .cse0))) [2019-05-15 10:36:27,069 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 70) [2019-05-15 10:36:27,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:27,134 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:27,137 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:27,137 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:27,137 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:27,146 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:27,146 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3004|]. (let ((.cse0 (select |v_#memory_int_3004| ULTIMATE.start_main_p1))) (and (= 70 .cse0) (= (store |v_#memory_int_3004| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:27,146 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 71) [2019-05-15 10:36:27,211 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:27,212 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:27,214 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:27,214 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:27,214 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:27,222 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:27,222 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3005|]. (let ((.cse0 (select |v_#memory_int_3005| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3005| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 71 .cse0))) [2019-05-15 10:36:27,222 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 72) [2019-05-15 10:36:27,288 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:27,289 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:27,291 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:27,291 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:27,291 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:27,298 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:27,299 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3006|]. (let ((.cse0 (select |v_#memory_int_3006| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3006| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 72))) [2019-05-15 10:36:27,299 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 73) [2019-05-15 10:36:27,366 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:27,367 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:27,369 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:27,369 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:27,369 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:27,378 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:27,379 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3007|]. (let ((.cse0 (select |v_#memory_int_3007| ULTIMATE.start_main_p1))) (and (= 73 .cse0) (= |#memory_int| (store |v_#memory_int_3007| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:27,379 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 74) [2019-05-15 10:36:27,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:27,444 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:27,446 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:27,447 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:27,447 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:27,453 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:27,454 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3008|]. (let ((.cse0 (select |v_#memory_int_3008| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3008| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 74 .cse0))) [2019-05-15 10:36:27,454 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 75) [2019-05-15 10:36:27,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 16 treesize of output 11 [2019-05-15 10:36:27,521 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:27,523 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:27,523 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:27,524 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:27,531 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:27,532 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3009|]. (let ((.cse0 (select |v_#memory_int_3009| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3009| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 75 .cse0))) [2019-05-15 10:36:27,532 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 76) [2019-05-15 10:36:27,594 INFO L273 TraceCheckUtils]: 0: Hoare triple {25702#true} havoc main_p1; {25702#true} is VALID [2019-05-15 10:36:27,595 INFO L273 TraceCheckUtils]: 1: Hoare triple {25702#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {25702#true} is VALID [2019-05-15 10:36:27,595 INFO L273 TraceCheckUtils]: 2: Hoare triple {25702#true} #memory_int := #memory_int[main_p1 := 0]; {25713#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:36:27,596 INFO L273 TraceCheckUtils]: 3: Hoare triple {25713#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25717#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:36:27,597 INFO L273 TraceCheckUtils]: 4: Hoare triple {25717#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25721#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:36:27,597 INFO L273 TraceCheckUtils]: 5: Hoare triple {25721#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25725#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:36:27,598 INFO L273 TraceCheckUtils]: 6: Hoare triple {25725#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25729#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:36:27,598 INFO L273 TraceCheckUtils]: 7: Hoare triple {25729#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25733#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:36:27,599 INFO L273 TraceCheckUtils]: 8: Hoare triple {25733#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25737#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:36:27,599 INFO L273 TraceCheckUtils]: 9: Hoare triple {25737#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25741#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:36:27,600 INFO L273 TraceCheckUtils]: 10: Hoare triple {25741#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25745#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:36:27,601 INFO L273 TraceCheckUtils]: 11: Hoare triple {25745#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25749#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:36:27,602 INFO L273 TraceCheckUtils]: 12: Hoare triple {25749#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25753#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:36:27,602 INFO L273 TraceCheckUtils]: 13: Hoare triple {25753#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25757#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:36:27,603 INFO L273 TraceCheckUtils]: 14: Hoare triple {25757#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25761#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:36:27,604 INFO L273 TraceCheckUtils]: 15: Hoare triple {25761#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25765#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:36:27,605 INFO L273 TraceCheckUtils]: 16: Hoare triple {25765#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25769#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:36:27,605 INFO L273 TraceCheckUtils]: 17: Hoare triple {25769#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25773#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:36:27,606 INFO L273 TraceCheckUtils]: 18: Hoare triple {25773#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25777#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:36:27,607 INFO L273 TraceCheckUtils]: 19: Hoare triple {25777#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25781#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:36:27,608 INFO L273 TraceCheckUtils]: 20: Hoare triple {25781#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25785#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:36:27,608 INFO L273 TraceCheckUtils]: 21: Hoare triple {25785#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25789#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:36:27,609 INFO L273 TraceCheckUtils]: 22: Hoare triple {25789#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25793#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:36:27,610 INFO L273 TraceCheckUtils]: 23: Hoare triple {25793#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25797#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:36:27,611 INFO L273 TraceCheckUtils]: 24: Hoare triple {25797#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25801#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:36:27,611 INFO L273 TraceCheckUtils]: 25: Hoare triple {25801#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25805#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:36:27,612 INFO L273 TraceCheckUtils]: 26: Hoare triple {25805#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25809#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:36:27,613 INFO L273 TraceCheckUtils]: 27: Hoare triple {25809#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25813#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:36:27,614 INFO L273 TraceCheckUtils]: 28: Hoare triple {25813#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25817#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:36:27,614 INFO L273 TraceCheckUtils]: 29: Hoare triple {25817#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25821#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:36:27,615 INFO L273 TraceCheckUtils]: 30: Hoare triple {25821#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25825#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:36:27,616 INFO L273 TraceCheckUtils]: 31: Hoare triple {25825#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25829#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:36:27,617 INFO L273 TraceCheckUtils]: 32: Hoare triple {25829#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25833#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:36:27,617 INFO L273 TraceCheckUtils]: 33: Hoare triple {25833#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25837#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:36:27,618 INFO L273 TraceCheckUtils]: 34: Hoare triple {25837#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25841#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:36:27,619 INFO L273 TraceCheckUtils]: 35: Hoare triple {25841#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25845#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:36:27,620 INFO L273 TraceCheckUtils]: 36: Hoare triple {25845#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25849#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:36:27,620 INFO L273 TraceCheckUtils]: 37: Hoare triple {25849#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25853#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:36:27,621 INFO L273 TraceCheckUtils]: 38: Hoare triple {25853#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25857#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:36:27,622 INFO L273 TraceCheckUtils]: 39: Hoare triple {25857#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25861#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:36:27,623 INFO L273 TraceCheckUtils]: 40: Hoare triple {25861#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25865#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:36:27,623 INFO L273 TraceCheckUtils]: 41: Hoare triple {25865#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25869#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:36:27,624 INFO L273 TraceCheckUtils]: 42: Hoare triple {25869#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25873#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:36:27,625 INFO L273 TraceCheckUtils]: 43: Hoare triple {25873#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25877#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:36:27,626 INFO L273 TraceCheckUtils]: 44: Hoare triple {25877#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25881#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:36:27,626 INFO L273 TraceCheckUtils]: 45: Hoare triple {25881#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25885#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:36:27,629 INFO L273 TraceCheckUtils]: 46: Hoare triple {25885#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25889#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:36:27,630 INFO L273 TraceCheckUtils]: 47: Hoare triple {25889#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25893#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:36:27,630 INFO L273 TraceCheckUtils]: 48: Hoare triple {25893#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25897#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:36:27,631 INFO L273 TraceCheckUtils]: 49: Hoare triple {25897#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25901#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:36:27,631 INFO L273 TraceCheckUtils]: 50: Hoare triple {25901#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25905#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:36:27,632 INFO L273 TraceCheckUtils]: 51: Hoare triple {25905#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25909#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:36:27,632 INFO L273 TraceCheckUtils]: 52: Hoare triple {25909#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25913#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:36:27,633 INFO L273 TraceCheckUtils]: 53: Hoare triple {25913#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25917#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:36:27,633 INFO L273 TraceCheckUtils]: 54: Hoare triple {25917#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25921#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:36:27,633 INFO L273 TraceCheckUtils]: 55: Hoare triple {25921#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25925#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:36:27,634 INFO L273 TraceCheckUtils]: 56: Hoare triple {25925#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25929#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:36:27,635 INFO L273 TraceCheckUtils]: 57: Hoare triple {25929#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25933#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:36:27,636 INFO L273 TraceCheckUtils]: 58: Hoare triple {25933#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25937#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:36:27,636 INFO L273 TraceCheckUtils]: 59: Hoare triple {25937#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25941#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:36:27,637 INFO L273 TraceCheckUtils]: 60: Hoare triple {25941#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25945#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:36:27,638 INFO L273 TraceCheckUtils]: 61: Hoare triple {25945#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25949#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:36:27,639 INFO L273 TraceCheckUtils]: 62: Hoare triple {25949#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25953#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:36:27,639 INFO L273 TraceCheckUtils]: 63: Hoare triple {25953#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25957#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:36:27,640 INFO L273 TraceCheckUtils]: 64: Hoare triple {25957#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25961#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:36:27,641 INFO L273 TraceCheckUtils]: 65: Hoare triple {25961#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25965#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:36:27,642 INFO L273 TraceCheckUtils]: 66: Hoare triple {25965#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25969#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} is VALID [2019-05-15 10:36:27,642 INFO L273 TraceCheckUtils]: 67: Hoare triple {25969#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25973#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} is VALID [2019-05-15 10:36:27,643 INFO L273 TraceCheckUtils]: 68: Hoare triple {25973#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25977#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} is VALID [2019-05-15 10:36:27,644 INFO L273 TraceCheckUtils]: 69: Hoare triple {25977#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25981#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} is VALID [2019-05-15 10:36:27,645 INFO L273 TraceCheckUtils]: 70: Hoare triple {25981#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25985#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} is VALID [2019-05-15 10:36:27,645 INFO L273 TraceCheckUtils]: 71: Hoare triple {25985#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25989#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} is VALID [2019-05-15 10:36:27,646 INFO L273 TraceCheckUtils]: 72: Hoare triple {25989#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25993#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} is VALID [2019-05-15 10:36:27,647 INFO L273 TraceCheckUtils]: 73: Hoare triple {25993#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25997#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} is VALID [2019-05-15 10:36:27,648 INFO L273 TraceCheckUtils]: 74: Hoare triple {25997#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26001#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} is VALID [2019-05-15 10:36:27,648 INFO L273 TraceCheckUtils]: 75: Hoare triple {26001#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26005#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} is VALID [2019-05-15 10:36:27,649 INFO L273 TraceCheckUtils]: 76: Hoare triple {26005#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26009#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} is VALID [2019-05-15 10:36:27,650 INFO L273 TraceCheckUtils]: 77: Hoare triple {26009#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26013#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} is VALID [2019-05-15 10:36:27,651 INFO L273 TraceCheckUtils]: 78: Hoare triple {26013#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26017#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} is VALID [2019-05-15 10:36:27,651 INFO L273 TraceCheckUtils]: 79: Hoare triple {26017#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} assume !(#memory_int[main_p1] >= 0); {25703#false} is VALID [2019-05-15 10:36:27,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:36:27,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:36:27,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-05-15 10:36:27,665 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 80 [2019-05-15 10:36:27,665 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:36:27,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 79 states. [2019-05-15 10:36:27,754 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:36:27,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-05-15 10:36:27,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-05-15 10:36:27,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-05-15 10:36:27,756 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 79 states. [2019-05-15 10:36:39,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:36:39,860 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-05-15 10:36:39,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-05-15 10:36:39,861 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 80 [2019-05-15 10:36:39,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:36:39,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-05-15 10:36:39,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2019-05-15 10:36:39,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-05-15 10:36:39,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2019-05-15 10:36:39,863 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 79 states and 83 transitions. [2019-05-15 10:36:39,928 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:36:39,929 INFO L225 Difference]: With dead ends: 82 [2019-05-15 10:36:39,930 INFO L226 Difference]: Without dead ends: 82 [2019-05-15 10:36:39,930 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-05-15 10:36:39,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-05-15 10:36:39,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-05-15 10:36:39,932 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:36:39,932 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 82 states. [2019-05-15 10:36:39,932 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 82 states. [2019-05-15 10:36:39,932 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 82 states. [2019-05-15 10:36:39,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:36:39,933 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-05-15 10:36:39,933 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-05-15 10:36:39,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:36:39,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:36:39,934 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 82 states. [2019-05-15 10:36:39,934 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 82 states. [2019-05-15 10:36:39,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:36:39,935 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-05-15 10:36:39,935 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-05-15 10:36:39,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:36:39,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:36:39,935 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:36:39,936 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:36:39,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-05-15 10:36:39,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-05-15 10:36:39,937 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-05-15 10:36:39,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:36:39,937 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-05-15 10:36:39,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-05-15 10:36:39,937 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-05-15 10:36:39,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-05-15 10:36:39,937 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:36:39,938 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1, 1] [2019-05-15 10:36:39,938 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:36:39,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:36:39,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1241595454, now seen corresponding path program 77 times [2019-05-15 10:36:39,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:36:39,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:36:39,976 WARN L254 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 79 conjunts are in the unsatisfiable core [2019-05-15 10:36:39,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:36:39,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:36:40,009 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:40,009 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,014 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:40,014 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,014 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:36:40,015 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:40,015 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3010|]. (= (store |v_#memory_int_3010| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:36:40,016 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:36:40,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 16 treesize of output 11 [2019-05-15 10:36:40,030 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,032 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:40,032 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,032 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:40,039 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:40,039 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3011|]. (let ((.cse0 (select |v_#memory_int_3011| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3011| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 0 .cse0))) [2019-05-15 10:36:40,039 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:36:40,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 16 treesize of output 11 [2019-05-15 10:36:40,051 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,052 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:40,053 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,053 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:40,060 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:40,060 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3012|]. (let ((.cse0 (select |v_#memory_int_3012| ULTIMATE.start_main_p1))) (and (= .cse0 1) (= (store |v_#memory_int_3012| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:40,060 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:36:40,069 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:40,070 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,072 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:40,072 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,072 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:40,079 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:40,079 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3013|]. (let ((.cse0 (select |v_#memory_int_3013| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3013| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 2))) [2019-05-15 10:36:40,079 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:36:40,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 16 treesize of output 11 [2019-05-15 10:36:40,092 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,094 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:40,095 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,095 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:40,102 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:40,102 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3014|]. (let ((.cse0 (select |v_#memory_int_3014| ULTIMATE.start_main_p1))) (and (= 3 .cse0) (= (store |v_#memory_int_3014| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:40,102 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:36:40,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 16 treesize of output 11 [2019-05-15 10:36:40,115 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,117 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:40,117 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,117 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:40,125 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:40,125 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3015|]. (let ((.cse0 (select |v_#memory_int_3015| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3015| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 4 .cse0))) [2019-05-15 10:36:40,125 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:36:40,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:40,139 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,141 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:40,141 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,141 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:40,148 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:40,148 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3016|]. (let ((.cse0 (select |v_#memory_int_3016| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3016| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 5 .cse0))) [2019-05-15 10:36:40,149 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:36:40,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 16 treesize of output 11 [2019-05-15 10:36:40,163 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,165 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:40,165 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,166 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:40,173 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:40,173 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3017|]. (let ((.cse0 (select |v_#memory_int_3017| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3017| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 6))) [2019-05-15 10:36:40,173 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:36:40,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 16 treesize of output 11 [2019-05-15 10:36:40,189 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,191 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:40,191 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,191 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:40,199 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:40,199 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3018|]. (let ((.cse0 (select |v_#memory_int_3018| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3018| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 7 .cse0))) [2019-05-15 10:36:40,199 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:36:40,215 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:40,216 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,218 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:40,218 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,219 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:40,226 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:40,226 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3019|]. (let ((.cse0 (select |v_#memory_int_3019| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3019| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 8 .cse0))) [2019-05-15 10:36:40,226 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:36:40,241 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:40,242 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,244 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:40,244 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,244 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:40,251 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:40,252 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3020|]. (let ((.cse0 (select |v_#memory_int_3020| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3020| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 9 .cse0))) [2019-05-15 10:36:40,252 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:36:40,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 16 treesize of output 11 [2019-05-15 10:36:40,269 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,271 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:40,271 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,271 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:40,279 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:40,279 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3021|]. (let ((.cse0 (select |v_#memory_int_3021| ULTIMATE.start_main_p1))) (and (= .cse0 10) (= |#memory_int| (store |v_#memory_int_3021| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:40,279 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:36:40,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:40,298 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,300 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:40,300 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,300 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:40,307 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:40,308 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3022|]. (let ((.cse0 (select |v_#memory_int_3022| ULTIMATE.start_main_p1))) (and (= 11 .cse0) (= |#memory_int| (store |v_#memory_int_3022| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:40,308 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:36:40,326 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:40,327 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,329 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:40,329 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,329 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:40,337 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:40,337 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3023|]. (let ((.cse0 (select |v_#memory_int_3023| ULTIMATE.start_main_p1))) (and (= 12 .cse0) (= (store |v_#memory_int_3023| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:40,337 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:36:40,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:40,357 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,359 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:40,359 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,359 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:40,366 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:40,366 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3024|]. (let ((.cse0 (select |v_#memory_int_3024| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3024| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 13 .cse0))) [2019-05-15 10:36:40,366 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:36:40,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 16 treesize of output 11 [2019-05-15 10:36:40,388 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,390 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:40,390 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,391 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:40,398 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:40,398 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3025|]. (let ((.cse0 (select |v_#memory_int_3025| ULTIMATE.start_main_p1))) (and (= .cse0 14) (= |#memory_int| (store |v_#memory_int_3025| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:40,398 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:36:40,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 16 treesize of output 11 [2019-05-15 10:36:40,419 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,421 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:40,421 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,421 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:40,429 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:40,429 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3026|]. (let ((.cse0 (select |v_#memory_int_3026| ULTIMATE.start_main_p1))) (and (= 15 .cse0) (= (store |v_#memory_int_3026| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:40,429 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:36:40,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 16 treesize of output 11 [2019-05-15 10:36:40,451 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,453 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:40,453 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,453 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:40,461 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:40,461 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3027|]. (let ((.cse0 (select |v_#memory_int_3027| ULTIMATE.start_main_p1))) (and (= .cse0 16) (= |#memory_int| (store |v_#memory_int_3027| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:40,461 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:36:40,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 16 treesize of output 11 [2019-05-15 10:36:40,483 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,485 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:40,485 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,486 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:40,492 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:40,492 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3028|]. (let ((.cse0 (select |v_#memory_int_3028| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3028| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 17 .cse0))) [2019-05-15 10:36:40,492 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:36:40,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:40,517 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,519 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:40,519 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,519 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:40,528 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:40,528 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3029|]. (let ((.cse0 (select |v_#memory_int_3029| ULTIMATE.start_main_p1))) (and (= .cse0 18) (= (store |v_#memory_int_3029| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:40,528 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:36:40,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 16 treesize of output 11 [2019-05-15 10:36:40,552 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,554 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:40,555 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,555 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:40,563 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:40,563 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3030|]. (let ((.cse0 (select |v_#memory_int_3030| ULTIMATE.start_main_p1))) (and (= .cse0 19) (= (store |v_#memory_int_3030| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:40,563 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:36:40,599 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:40,600 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,602 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:40,603 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,603 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:40,611 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:40,611 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3031|]. (let ((.cse0 (select |v_#memory_int_3031| ULTIMATE.start_main_p1))) (and (= .cse0 20) (= (store |v_#memory_int_3031| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:40,611 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:36:40,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 16 treesize of output 11 [2019-05-15 10:36:40,636 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,638 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:40,639 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,639 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:40,646 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:40,646 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3032|]. (let ((.cse0 (select |v_#memory_int_3032| ULTIMATE.start_main_p1))) (and (= .cse0 21) (= (store |v_#memory_int_3032| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:40,646 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:36:40,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 16 treesize of output 11 [2019-05-15 10:36:40,673 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,675 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:40,675 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,675 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:40,682 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:40,682 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3033|]. (let ((.cse0 (select |v_#memory_int_3033| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3033| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 22 .cse0))) [2019-05-15 10:36:40,682 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:36:40,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 16 treesize of output 11 [2019-05-15 10:36:40,709 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,711 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:40,711 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,711 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:40,718 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:40,719 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3034|]. (let ((.cse0 (select |v_#memory_int_3034| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3034| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 23))) [2019-05-15 10:36:40,719 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:36:40,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 16 treesize of output 11 [2019-05-15 10:36:40,748 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,750 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:40,750 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,750 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:40,757 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:40,757 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3035|]. (let ((.cse0 (select |v_#memory_int_3035| ULTIMATE.start_main_p1))) (and (= .cse0 24) (= (store |v_#memory_int_3035| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:40,757 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:36:40,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:40,787 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,789 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:40,789 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,789 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:40,798 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:40,798 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3036|]. (let ((.cse0 (select |v_#memory_int_3036| ULTIMATE.start_main_p1))) (and (= .cse0 25) (= (store |v_#memory_int_3036| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:40,798 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:36:40,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:40,828 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,830 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:40,830 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,831 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:40,838 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:40,838 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3037|]. (let ((.cse0 (select |v_#memory_int_3037| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3037| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 26 .cse0))) [2019-05-15 10:36:40,838 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:36:40,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 16 treesize of output 11 [2019-05-15 10:36:40,868 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,870 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:40,870 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,871 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:40,877 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:40,877 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3038|]. (let ((.cse0 (select |v_#memory_int_3038| ULTIMATE.start_main_p1))) (and (= 27 .cse0) (= (store |v_#memory_int_3038| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:40,877 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:36:40,907 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:40,908 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,910 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:40,910 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,910 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:40,918 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:40,918 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3039|]. (let ((.cse0 (select |v_#memory_int_3039| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3039| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 28))) [2019-05-15 10:36:40,918 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:36:40,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 16 treesize of output 11 [2019-05-15 10:36:40,950 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,952 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:40,952 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,952 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:40,960 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:40,960 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3040|]. (let ((.cse0 (select |v_#memory_int_3040| ULTIMATE.start_main_p1))) (and (= 29 .cse0) (= (store |v_#memory_int_3040| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:40,960 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:36:40,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 16 treesize of output 11 [2019-05-15 10:36:40,995 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,997 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:40,997 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,998 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:41,007 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:41,007 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3041|]. (let ((.cse0 (select |v_#memory_int_3041| ULTIMATE.start_main_p1))) (and (= .cse0 30) (= (store |v_#memory_int_3041| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:41,007 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:36:41,040 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:41,041 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,043 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:41,044 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,044 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:41,051 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:41,051 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3042|]. (let ((.cse0 (select |v_#memory_int_3042| ULTIMATE.start_main_p1))) (and (= .cse0 31) (= (store |v_#memory_int_3042| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:41,051 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:36:41,086 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:41,087 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,089 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:41,089 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,090 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:41,097 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:41,097 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3043|]. (let ((.cse0 (select |v_#memory_int_3043| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3043| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 32))) [2019-05-15 10:36:41,097 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:36:41,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 16 treesize of output 11 [2019-05-15 10:36:41,134 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,136 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:41,136 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,136 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:41,143 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:41,144 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3044|]. (let ((.cse0 (select |v_#memory_int_3044| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3044| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 33))) [2019-05-15 10:36:41,144 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:36:41,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:41,180 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,182 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:41,182 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,182 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:41,190 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:41,190 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3045|]. (let ((.cse0 (select |v_#memory_int_3045| ULTIMATE.start_main_p1))) (and (= 34 .cse0) (= (store |v_#memory_int_3045| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:41,190 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:36:41,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 16 treesize of output 11 [2019-05-15 10:36:41,228 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,230 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:41,231 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,231 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:41,238 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:41,238 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3046|]. (let ((.cse0 (select |v_#memory_int_3046| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3046| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 35 .cse0))) [2019-05-15 10:36:41,239 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:36:41,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:41,279 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,281 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:41,281 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,281 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:41,289 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:41,289 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3047|]. (let ((.cse0 (select |v_#memory_int_3047| ULTIMATE.start_main_p1))) (and (= .cse0 36) (= (store |v_#memory_int_3047| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:41,289 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:36:41,326 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:41,327 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,329 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:41,329 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,329 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:41,337 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:41,337 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3048|]. (let ((.cse0 (select |v_#memory_int_3048| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3048| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 37))) [2019-05-15 10:36:41,337 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:36:41,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 16 treesize of output 11 [2019-05-15 10:36:41,379 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,382 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:41,382 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,382 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:41,390 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:41,390 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3049|]. (let ((.cse0 (select |v_#memory_int_3049| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3049| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 38 .cse0))) [2019-05-15 10:36:41,390 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:36:41,429 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:41,430 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,432 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:41,433 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,433 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:41,440 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:41,440 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3050|]. (let ((.cse0 (select |v_#memory_int_3050| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3050| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 39))) [2019-05-15 10:36:41,440 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:36:41,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 16 treesize of output 11 [2019-05-15 10:36:41,487 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,489 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:41,489 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,489 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:41,498 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:41,498 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3051|]. (let ((.cse0 (select |v_#memory_int_3051| ULTIMATE.start_main_p1))) (and (= .cse0 40) (= (store |v_#memory_int_3051| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:41,498 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:36:41,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:41,539 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,541 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:41,541 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,542 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:41,548 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:41,549 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3052|]. (let ((.cse0 (select |v_#memory_int_3052| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3052| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 41))) [2019-05-15 10:36:41,549 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:36:41,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:41,596 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,598 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:41,598 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,598 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:41,605 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:41,606 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3053|]. (let ((.cse0 (select |v_#memory_int_3053| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3053| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 42))) [2019-05-15 10:36:41,606 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:36:41,646 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:41,647 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,649 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:41,649 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,650 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:41,658 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:41,658 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3054|]. (let ((.cse0 (select |v_#memory_int_3054| ULTIMATE.start_main_p1))) (and (= 43 .cse0) (= |#memory_int| (store |v_#memory_int_3054| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:41,658 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:36:41,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:41,701 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,703 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:41,703 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,703 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:41,711 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:41,711 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3055|]. (let ((.cse0 (select |v_#memory_int_3055| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3055| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 44))) [2019-05-15 10:36:41,711 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:36:41,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 16 treesize of output 11 [2019-05-15 10:36:41,753 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,755 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:41,755 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,755 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:41,763 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:41,763 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3056|]. (let ((.cse0 (select |v_#memory_int_3056| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3056| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 45 .cse0))) [2019-05-15 10:36:41,763 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:36:41,806 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:41,807 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,809 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:41,809 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,810 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:41,816 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:41,817 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3057|]. (let ((.cse0 (select |v_#memory_int_3057| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3057| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 46))) [2019-05-15 10:36:41,817 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:36:41,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:41,863 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,865 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:41,865 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,865 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:41,873 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:41,873 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3058|]. (let ((.cse0 (select |v_#memory_int_3058| ULTIMATE.start_main_p1))) (and (= 47 .cse0) (= |#memory_int| (store |v_#memory_int_3058| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:41,873 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:36:41,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 16 treesize of output 11 [2019-05-15 10:36:41,922 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,924 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:41,924 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,924 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:41,931 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:41,932 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3059|]. (let ((.cse0 (select |v_#memory_int_3059| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3059| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 48 .cse0))) [2019-05-15 10:36:41,932 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:36:41,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:41,979 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,981 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:41,981 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,981 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:41,989 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:41,989 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3060|]. (let ((.cse0 (select |v_#memory_int_3060| ULTIMATE.start_main_p1))) (and (= .cse0 49) (= (store |v_#memory_int_3060| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:41,989 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:36:42,035 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:42,036 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,038 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:42,039 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,039 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:42,046 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:42,047 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3061|]. (let ((.cse0 (select |v_#memory_int_3061| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3061| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 50))) [2019-05-15 10:36:42,047 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:36:42,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 16 treesize of output 11 [2019-05-15 10:36:42,096 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,098 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:42,099 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,099 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:42,105 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:42,105 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3062|]. (let ((.cse0 (select |v_#memory_int_3062| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3062| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 51 .cse0))) [2019-05-15 10:36:42,106 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:36:42,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 16 treesize of output 11 [2019-05-15 10:36:42,155 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,157 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:42,157 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,157 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:42,164 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:42,164 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3063|]. (let ((.cse0 (select |v_#memory_int_3063| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3063| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 52 .cse0))) [2019-05-15 10:36:42,164 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:36:42,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:42,215 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,217 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:42,217 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,217 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:42,225 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:42,225 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3064|]. (let ((.cse0 (select |v_#memory_int_3064| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3064| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 53))) [2019-05-15 10:36:42,225 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:36:42,277 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:42,278 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,280 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:42,280 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,280 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:42,289 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:42,289 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3065|]. (let ((.cse0 (select |v_#memory_int_3065| ULTIMATE.start_main_p1))) (and (= 54 .cse0) (= (store |v_#memory_int_3065| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:42,289 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:36:42,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:42,341 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,343 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:42,344 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,344 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:42,352 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:42,352 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3066|]. (let ((.cse0 (select |v_#memory_int_3066| ULTIMATE.start_main_p1))) (and (= .cse0 55) (= (store |v_#memory_int_3066| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:42,352 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:36:42,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 16 treesize of output 11 [2019-05-15 10:36:42,406 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,408 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:42,408 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,409 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:42,417 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:42,417 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3067|]. (let ((.cse0 (select |v_#memory_int_3067| ULTIMATE.start_main_p1))) (and (= 56 .cse0) (= (store |v_#memory_int_3067| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:42,417 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:36:42,471 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:42,472 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,474 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:42,474 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,474 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:42,484 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:42,484 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3068|]. (let ((.cse0 (select |v_#memory_int_3068| ULTIMATE.start_main_p1))) (and (= .cse0 57) (= (store |v_#memory_int_3068| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:42,484 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:36:42,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 16 treesize of output 11 [2019-05-15 10:36:42,544 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,546 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:42,546 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,547 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:42,553 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:42,553 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3069|]. (let ((.cse0 (select |v_#memory_int_3069| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3069| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 58))) [2019-05-15 10:36:42,553 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:36:42,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 16 treesize of output 11 [2019-05-15 10:36:42,609 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,611 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:42,611 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,611 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:42,619 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:42,619 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3070|]. (let ((.cse0 (select |v_#memory_int_3070| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3070| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 59 .cse0))) [2019-05-15 10:36:42,619 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:36:42,675 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:42,676 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,678 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:42,678 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,678 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:42,685 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:42,686 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3071|]. (let ((.cse0 (select |v_#memory_int_3071| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3071| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 60))) [2019-05-15 10:36:42,686 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:36:42,743 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:42,743 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,745 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:42,746 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,746 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:42,753 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:42,753 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3072|]. (let ((.cse0 (select |v_#memory_int_3072| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3072| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 61))) [2019-05-15 10:36:42,754 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:36:42,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 16 treesize of output 11 [2019-05-15 10:36:42,810 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,812 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:42,812 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,813 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:42,820 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:42,820 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3073|]. (let ((.cse0 (select |v_#memory_int_3073| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3073| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 62 .cse0))) [2019-05-15 10:36:42,820 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:36:42,880 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:42,881 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,883 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:42,883 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,883 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:42,891 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:42,891 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3074|]. (let ((.cse0 (select |v_#memory_int_3074| ULTIMATE.start_main_p1))) (and (= 63 .cse0) (= (store |v_#memory_int_3074| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:42,891 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 64) [2019-05-15 10:36:42,953 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:42,954 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,956 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:42,956 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,956 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:42,964 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:42,964 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3075|]. (let ((.cse0 (select |v_#memory_int_3075| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3075| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 64))) [2019-05-15 10:36:42,964 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 65) [2019-05-15 10:36:43,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 16 treesize of output 11 [2019-05-15 10:36:43,023 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:43,025 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:43,025 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:43,025 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:43,033 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:43,033 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3076|]. (let ((.cse0 (select |v_#memory_int_3076| ULTIMATE.start_main_p1))) (and (= 65 .cse0) (= (store |v_#memory_int_3076| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:43,033 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 66) [2019-05-15 10:36:43,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 16 treesize of output 11 [2019-05-15 10:36:43,097 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:43,099 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:43,099 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:43,099 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:43,108 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:43,108 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3077|]. (let ((.cse0 (select |v_#memory_int_3077| ULTIMATE.start_main_p1))) (and (= .cse0 66) (= (store |v_#memory_int_3077| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:43,108 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 67) [2019-05-15 10:36:43,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:43,173 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:43,175 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:43,176 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:43,176 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:43,183 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:43,183 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3078|]. (let ((.cse0 (select |v_#memory_int_3078| ULTIMATE.start_main_p1))) (and (= 67 .cse0) (= (store |v_#memory_int_3078| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:43,183 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 68) [2019-05-15 10:36:43,247 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:43,248 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:43,250 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:43,250 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:43,251 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:43,258 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:43,258 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3079|]. (let ((.cse0 (select |v_#memory_int_3079| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3079| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 68 .cse0))) [2019-05-15 10:36:43,258 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 69) [2019-05-15 10:36:43,320 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:43,321 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:43,323 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:43,324 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:43,324 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:43,331 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:43,332 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3080|]. (let ((.cse0 (select |v_#memory_int_3080| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3080| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 69))) [2019-05-15 10:36:43,332 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 70) [2019-05-15 10:36:43,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 16 treesize of output 11 [2019-05-15 10:36:43,398 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:43,400 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:43,400 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:43,400 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:43,407 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:43,407 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3081|]. (let ((.cse0 (select |v_#memory_int_3081| ULTIMATE.start_main_p1))) (and (= .cse0 70) (= |#memory_int| (store |v_#memory_int_3081| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:43,408 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 71) [2019-05-15 10:36:43,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 16 treesize of output 11 [2019-05-15 10:36:43,485 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:43,487 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:43,487 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:43,487 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:43,494 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:43,495 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3082|]. (let ((.cse0 (select |v_#memory_int_3082| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3082| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 71))) [2019-05-15 10:36:43,495 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 72) [2019-05-15 10:36:43,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:43,561 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:43,563 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:43,564 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:43,564 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:43,571 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:43,572 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3083|]. (let ((.cse0 (select |v_#memory_int_3083| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3083| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 72))) [2019-05-15 10:36:43,572 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 73) [2019-05-15 10:36:43,639 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:43,640 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:43,642 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:43,643 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:43,643 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:43,650 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:43,651 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3084|]. (let ((.cse0 (select |v_#memory_int_3084| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3084| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 73))) [2019-05-15 10:36:43,651 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 74) [2019-05-15 10:36:43,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:43,718 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:43,720 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:43,721 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:43,721 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:43,728 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:43,728 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3085|]. (let ((.cse0 (select |v_#memory_int_3085| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3085| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 74))) [2019-05-15 10:36:43,728 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 75) [2019-05-15 10:36:43,798 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:43,799 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:43,801 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:43,801 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:43,801 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:43,809 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:43,810 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3086|]. (let ((.cse0 (select |v_#memory_int_3086| ULTIMATE.start_main_p1))) (and (= 75 .cse0) (= |#memory_int| (store |v_#memory_int_3086| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:43,810 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 76) [2019-05-15 10:36:43,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 16 treesize of output 11 [2019-05-15 10:36:43,880 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:43,882 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:43,882 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:43,882 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:43,890 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:43,890 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3087|]. (let ((.cse0 (select |v_#memory_int_3087| ULTIMATE.start_main_p1))) (and (= .cse0 76) (= |#memory_int| (store |v_#memory_int_3087| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:43,890 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 77) [2019-05-15 10:36:43,952 INFO L273 TraceCheckUtils]: 0: Hoare triple {26348#true} havoc main_p1; {26348#true} is VALID [2019-05-15 10:36:43,953 INFO L273 TraceCheckUtils]: 1: Hoare triple {26348#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {26348#true} is VALID [2019-05-15 10:36:43,953 INFO L273 TraceCheckUtils]: 2: Hoare triple {26348#true} #memory_int := #memory_int[main_p1 := 0]; {26359#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:36:43,954 INFO L273 TraceCheckUtils]: 3: Hoare triple {26359#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26363#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:36:43,955 INFO L273 TraceCheckUtils]: 4: Hoare triple {26363#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26367#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:36:43,956 INFO L273 TraceCheckUtils]: 5: Hoare triple {26367#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26371#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:36:43,956 INFO L273 TraceCheckUtils]: 6: Hoare triple {26371#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26375#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:36:43,957 INFO L273 TraceCheckUtils]: 7: Hoare triple {26375#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26379#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:36:43,958 INFO L273 TraceCheckUtils]: 8: Hoare triple {26379#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26383#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:36:43,959 INFO L273 TraceCheckUtils]: 9: Hoare triple {26383#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26387#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:36:43,959 INFO L273 TraceCheckUtils]: 10: Hoare triple {26387#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26391#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:36:43,960 INFO L273 TraceCheckUtils]: 11: Hoare triple {26391#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26395#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:36:43,961 INFO L273 TraceCheckUtils]: 12: Hoare triple {26395#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26399#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:36:43,962 INFO L273 TraceCheckUtils]: 13: Hoare triple {26399#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26403#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:36:43,962 INFO L273 TraceCheckUtils]: 14: Hoare triple {26403#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26407#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:36:43,963 INFO L273 TraceCheckUtils]: 15: Hoare triple {26407#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26411#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:36:43,964 INFO L273 TraceCheckUtils]: 16: Hoare triple {26411#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26415#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:36:43,965 INFO L273 TraceCheckUtils]: 17: Hoare triple {26415#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26419#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:36:43,965 INFO L273 TraceCheckUtils]: 18: Hoare triple {26419#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26423#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:36:43,966 INFO L273 TraceCheckUtils]: 19: Hoare triple {26423#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26427#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:36:43,967 INFO L273 TraceCheckUtils]: 20: Hoare triple {26427#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26431#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:36:43,968 INFO L273 TraceCheckUtils]: 21: Hoare triple {26431#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26435#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:36:43,968 INFO L273 TraceCheckUtils]: 22: Hoare triple {26435#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26439#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:36:43,969 INFO L273 TraceCheckUtils]: 23: Hoare triple {26439#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26443#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:36:43,970 INFO L273 TraceCheckUtils]: 24: Hoare triple {26443#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26447#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:36:43,971 INFO L273 TraceCheckUtils]: 25: Hoare triple {26447#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26451#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:36:43,971 INFO L273 TraceCheckUtils]: 26: Hoare triple {26451#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26455#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:36:43,972 INFO L273 TraceCheckUtils]: 27: Hoare triple {26455#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26459#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:36:43,973 INFO L273 TraceCheckUtils]: 28: Hoare triple {26459#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26463#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:36:43,974 INFO L273 TraceCheckUtils]: 29: Hoare triple {26463#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26467#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:36:43,995 INFO L273 TraceCheckUtils]: 30: Hoare triple {26467#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26471#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:36:43,997 INFO L273 TraceCheckUtils]: 31: Hoare triple {26471#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26475#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:36:43,997 INFO L273 TraceCheckUtils]: 32: Hoare triple {26475#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26479#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:36:43,998 INFO L273 TraceCheckUtils]: 33: Hoare triple {26479#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26483#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:36:43,998 INFO L273 TraceCheckUtils]: 34: Hoare triple {26483#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26487#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:36:43,999 INFO L273 TraceCheckUtils]: 35: Hoare triple {26487#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26491#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:36:43,999 INFO L273 TraceCheckUtils]: 36: Hoare triple {26491#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26495#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:36:44,000 INFO L273 TraceCheckUtils]: 37: Hoare triple {26495#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26499#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:36:44,000 INFO L273 TraceCheckUtils]: 38: Hoare triple {26499#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26503#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:36:44,001 INFO L273 TraceCheckUtils]: 39: Hoare triple {26503#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26507#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:36:44,002 INFO L273 TraceCheckUtils]: 40: Hoare triple {26507#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26511#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:36:44,003 INFO L273 TraceCheckUtils]: 41: Hoare triple {26511#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26515#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:36:44,003 INFO L273 TraceCheckUtils]: 42: Hoare triple {26515#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26519#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:36:44,022 INFO L273 TraceCheckUtils]: 43: Hoare triple {26519#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26523#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:36:44,036 INFO L273 TraceCheckUtils]: 44: Hoare triple {26523#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26527#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:36:44,045 INFO L273 TraceCheckUtils]: 45: Hoare triple {26527#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26531#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:36:44,058 INFO L273 TraceCheckUtils]: 46: Hoare triple {26531#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26535#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:36:44,067 INFO L273 TraceCheckUtils]: 47: Hoare triple {26535#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26539#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:36:44,082 INFO L273 TraceCheckUtils]: 48: Hoare triple {26539#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26543#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:36:44,091 INFO L273 TraceCheckUtils]: 49: Hoare triple {26543#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26547#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:36:44,103 INFO L273 TraceCheckUtils]: 50: Hoare triple {26547#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26551#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:36:44,118 INFO L273 TraceCheckUtils]: 51: Hoare triple {26551#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26555#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:36:44,127 INFO L273 TraceCheckUtils]: 52: Hoare triple {26555#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26559#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:36:44,142 INFO L273 TraceCheckUtils]: 53: Hoare triple {26559#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26563#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:36:44,151 INFO L273 TraceCheckUtils]: 54: Hoare triple {26563#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26567#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:36:44,162 INFO L273 TraceCheckUtils]: 55: Hoare triple {26567#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26571#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:36:44,163 INFO L273 TraceCheckUtils]: 56: Hoare triple {26571#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26575#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:36:44,163 INFO L273 TraceCheckUtils]: 57: Hoare triple {26575#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26579#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:36:44,164 INFO L273 TraceCheckUtils]: 58: Hoare triple {26579#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26583#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:36:44,164 INFO L273 TraceCheckUtils]: 59: Hoare triple {26583#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26587#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:36:44,165 INFO L273 TraceCheckUtils]: 60: Hoare triple {26587#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26591#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:36:44,166 INFO L273 TraceCheckUtils]: 61: Hoare triple {26591#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26595#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:36:44,166 INFO L273 TraceCheckUtils]: 62: Hoare triple {26595#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26599#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:36:44,167 INFO L273 TraceCheckUtils]: 63: Hoare triple {26599#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26603#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:36:44,168 INFO L273 TraceCheckUtils]: 64: Hoare triple {26603#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26607#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:36:44,169 INFO L273 TraceCheckUtils]: 65: Hoare triple {26607#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26611#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:36:44,169 INFO L273 TraceCheckUtils]: 66: Hoare triple {26611#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26615#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} is VALID [2019-05-15 10:36:44,170 INFO L273 TraceCheckUtils]: 67: Hoare triple {26615#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26619#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} is VALID [2019-05-15 10:36:44,171 INFO L273 TraceCheckUtils]: 68: Hoare triple {26619#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26623#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} is VALID [2019-05-15 10:36:44,172 INFO L273 TraceCheckUtils]: 69: Hoare triple {26623#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26627#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} is VALID [2019-05-15 10:36:44,172 INFO L273 TraceCheckUtils]: 70: Hoare triple {26627#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26631#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} is VALID [2019-05-15 10:36:44,173 INFO L273 TraceCheckUtils]: 71: Hoare triple {26631#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26635#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} is VALID [2019-05-15 10:36:44,174 INFO L273 TraceCheckUtils]: 72: Hoare triple {26635#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26639#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} is VALID [2019-05-15 10:36:44,175 INFO L273 TraceCheckUtils]: 73: Hoare triple {26639#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26643#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} is VALID [2019-05-15 10:36:44,175 INFO L273 TraceCheckUtils]: 74: Hoare triple {26643#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26647#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} is VALID [2019-05-15 10:36:44,176 INFO L273 TraceCheckUtils]: 75: Hoare triple {26647#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26651#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} is VALID [2019-05-15 10:36:44,177 INFO L273 TraceCheckUtils]: 76: Hoare triple {26651#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26655#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} is VALID [2019-05-15 10:36:44,178 INFO L273 TraceCheckUtils]: 77: Hoare triple {26655#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26659#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} is VALID [2019-05-15 10:36:44,178 INFO L273 TraceCheckUtils]: 78: Hoare triple {26659#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26663#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} is VALID [2019-05-15 10:36:44,179 INFO L273 TraceCheckUtils]: 79: Hoare triple {26663#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26667#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} is VALID [2019-05-15 10:36:44,180 INFO L273 TraceCheckUtils]: 80: Hoare triple {26667#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} assume !(#memory_int[main_p1] >= 0); {26349#false} is VALID [2019-05-15 10:36:44,188 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:36:44,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:36:44,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-05-15 10:36:44,189 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 81 [2019-05-15 10:36:44,189 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:36:44,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 80 states. [2019-05-15 10:36:44,253 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:36:44,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-05-15 10:36:44,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-05-15 10:36:44,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-05-15 10:36:44,254 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 80 states. [2019-05-15 10:36:56,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:36:56,658 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-05-15 10:36:56,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-05-15 10:36:56,658 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 81 [2019-05-15 10:36:56,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:36:56,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-05-15 10:36:56,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2019-05-15 10:36:56,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-05-15 10:36:56,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2019-05-15 10:36:56,661 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 80 states and 84 transitions. [2019-05-15 10:36:56,727 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:56,728 INFO L225 Difference]: With dead ends: 83 [2019-05-15 10:36:56,729 INFO L226 Difference]: Without dead ends: 83 [2019-05-15 10:36:56,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-05-15 10:36:56,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-05-15 10:36:56,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-05-15 10:36:56,730 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:36:56,731 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 83 states. [2019-05-15 10:36:56,731 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 83 states. [2019-05-15 10:36:56,731 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 83 states. [2019-05-15 10:36:56,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:36:56,732 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-05-15 10:36:56,732 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-05-15 10:36:56,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:36:56,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:36:56,732 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 83 states. [2019-05-15 10:36:56,733 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 83 states. [2019-05-15 10:36:56,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:36:56,734 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-05-15 10:36:56,734 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-05-15 10:36:56,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:36:56,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:36:56,734 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:36:56,734 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:36:56,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-05-15 10:36:56,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-05-15 10:36:56,735 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-05-15 10:36:56,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:36:56,735 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-05-15 10:36:56,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-05-15 10:36:56,735 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-05-15 10:36:56,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-05-15 10:36:56,736 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:36:56,736 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1, 1] [2019-05-15 10:36:56,736 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:36:56,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:36:56,736 INFO L82 PathProgramCache]: Analyzing trace with hash 165246536, now seen corresponding path program 78 times [2019-05-15 10:36:56,737 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:36:56,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:36:56,773 WARN L254 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 80 conjunts are in the unsatisfiable core [2019-05-15 10:36:56,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:36:56,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:36:56,800 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:56,800 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:56,805 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:56,806 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:56,806 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:36:56,807 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:56,807 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3088|]. (= (store |v_#memory_int_3088| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:36:56,807 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:36:56,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 16 treesize of output 11 [2019-05-15 10:36:56,824 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:56,826 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:56,826 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:56,826 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:56,834 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:56,834 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3089|]. (let ((.cse0 (select |v_#memory_int_3089| ULTIMATE.start_main_p1))) (and (= 0 .cse0) (= (store |v_#memory_int_3089| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:56,834 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:36:56,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:56,845 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:56,847 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:56,847 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:56,847 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:56,855 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:56,856 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3090|]. (let ((.cse0 (select |v_#memory_int_3090| ULTIMATE.start_main_p1))) (and (= 1 .cse0) (= |#memory_int| (store |v_#memory_int_3090| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:56,856 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:36:56,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:56,867 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:56,869 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:56,869 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:56,870 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:56,876 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:56,877 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3091|]. (let ((.cse0 (select |v_#memory_int_3091| ULTIMATE.start_main_p1))) (and (= .cse0 2) (= (store |v_#memory_int_3091| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:56,877 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:36:56,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 16 treesize of output 11 [2019-05-15 10:36:56,889 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:56,891 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:56,891 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:56,891 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:56,899 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:56,899 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3092|]. (let ((.cse0 (select |v_#memory_int_3092| ULTIMATE.start_main_p1))) (and (= 3 .cse0) (= |#memory_int| (store |v_#memory_int_3092| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:56,899 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:36:56,912 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:56,913 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:56,915 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:56,915 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:56,916 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:56,923 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:56,923 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3093|]. (let ((.cse0 (select |v_#memory_int_3093| ULTIMATE.start_main_p1))) (and (= 4 .cse0) (= (store |v_#memory_int_3093| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:56,923 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:36:56,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:56,936 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:56,938 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:56,939 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:56,939 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:56,947 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:56,947 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3094|]. (let ((.cse0 (select |v_#memory_int_3094| ULTIMATE.start_main_p1))) (and (= 5 .cse0) (= |#memory_int| (store |v_#memory_int_3094| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:56,947 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:36:56,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 16 treesize of output 11 [2019-05-15 10:36:56,963 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:56,965 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:56,965 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:56,965 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:56,972 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:56,973 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3095|]. (let ((.cse0 (select |v_#memory_int_3095| ULTIMATE.start_main_p1))) (and (= .cse0 6) (= (store |v_#memory_int_3095| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:56,973 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:36:56,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:56,989 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:56,991 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:56,991 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:56,991 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:56,998 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:56,998 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3096|]. (let ((.cse0 (select |v_#memory_int_3096| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3096| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 7))) [2019-05-15 10:36:56,998 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:36:57,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:57,015 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,017 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,017 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,017 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:57,025 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,026 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3097|]. (let ((.cse0 (select |v_#memory_int_3097| ULTIMATE.start_main_p1))) (and (= 8 .cse0) (= |#memory_int| (store |v_#memory_int_3097| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:57,026 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:36:57,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 16 treesize of output 11 [2019-05-15 10:36:57,045 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,047 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,047 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,047 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:57,055 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,056 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3098|]. (let ((.cse0 (select |v_#memory_int_3098| ULTIMATE.start_main_p1))) (and (= 9 .cse0) (= (store |v_#memory_int_3098| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:57,056 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:36:57,079 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:57,080 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,082 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,082 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,082 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:57,089 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,089 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3099|]. (let ((.cse0 (select |v_#memory_int_3099| ULTIMATE.start_main_p1))) (and (= 10 .cse0) (= |#memory_int| (store |v_#memory_int_3099| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:57,090 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:36:57,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:57,108 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,110 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,110 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,110 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:57,117 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,118 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3100|]. (let ((.cse0 (select |v_#memory_int_3100| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3100| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 11 .cse0))) [2019-05-15 10:36:57,118 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:36:57,135 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:57,136 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,138 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,138 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,139 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:57,146 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,146 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3101|]. (let ((.cse0 (select |v_#memory_int_3101| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3101| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 12))) [2019-05-15 10:36:57,146 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:36:57,164 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:57,165 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,167 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,167 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,167 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:57,174 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,175 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3102|]. (let ((.cse0 (select |v_#memory_int_3102| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3102| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 13))) [2019-05-15 10:36:57,175 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:36:57,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:57,196 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,198 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,198 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,198 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:57,206 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,206 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3103|]. (let ((.cse0 (select |v_#memory_int_3103| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3103| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 14 .cse0))) [2019-05-15 10:36:57,206 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:36:57,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:57,226 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,228 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,228 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,228 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:57,237 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,237 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3104|]. (let ((.cse0 (select |v_#memory_int_3104| ULTIMATE.start_main_p1))) (and (= 15 .cse0) (= (store |v_#memory_int_3104| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:57,237 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:36:57,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 16 treesize of output 11 [2019-05-15 10:36:57,261 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,263 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,263 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,263 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:57,271 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,271 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3105|]. (let ((.cse0 (select |v_#memory_int_3105| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3105| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 16))) [2019-05-15 10:36:57,271 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:36:57,293 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:57,294 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,296 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,296 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,296 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:57,306 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,306 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3106|]. (let ((.cse0 (select |v_#memory_int_3106| ULTIMATE.start_main_p1))) (and (= 17 .cse0) (= |#memory_int| (store |v_#memory_int_3106| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:57,306 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:36:57,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:57,331 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,333 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,333 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,333 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:57,339 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,339 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3107|]. (let ((.cse0 (select |v_#memory_int_3107| ULTIMATE.start_main_p1))) (and (= 18 .cse0) (= |#memory_int| (store |v_#memory_int_3107| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:57,339 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:36:57,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 16 treesize of output 11 [2019-05-15 10:36:57,365 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,367 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,367 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,367 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:57,375 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,375 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3108|]. (let ((.cse0 (select |v_#memory_int_3108| ULTIMATE.start_main_p1))) (and (= 19 .cse0) (= (store |v_#memory_int_3108| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:57,375 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:36:57,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 16 treesize of output 11 [2019-05-15 10:36:57,401 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,403 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,403 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,403 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:57,410 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,410 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3109|]. (let ((.cse0 (select |v_#memory_int_3109| ULTIMATE.start_main_p1))) (and (= .cse0 20) (= |#memory_int| (store |v_#memory_int_3109| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:57,410 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:36:57,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 16 treesize of output 11 [2019-05-15 10:36:57,436 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,438 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,439 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,439 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:57,446 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,446 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3110|]. (let ((.cse0 (select |v_#memory_int_3110| ULTIMATE.start_main_p1))) (and (= 21 .cse0) (= |#memory_int| (store |v_#memory_int_3110| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:57,447 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:36:57,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:57,475 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,477 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,477 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,477 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:57,484 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,484 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3111|]. (let ((.cse0 (select |v_#memory_int_3111| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3111| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 22))) [2019-05-15 10:36:57,484 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:36:57,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 16 treesize of output 11 [2019-05-15 10:36:57,513 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,515 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36: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:36:57,516 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:57,524 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,525 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3112|]. (let ((.cse0 (select |v_#memory_int_3112| ULTIMATE.start_main_p1))) (and (= 23 .cse0) (= |#memory_int| (store |v_#memory_int_3112| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:57,525 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:36:57,554 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:57,555 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,557 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,557 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,557 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:57,565 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,565 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3113|]. (let ((.cse0 (select |v_#memory_int_3113| ULTIMATE.start_main_p1))) (and (= 24 .cse0) (= (store |v_#memory_int_3113| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:57,565 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:36:57,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 16 treesize of output 11 [2019-05-15 10:36:57,597 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,599 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,599 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,599 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:57,607 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,607 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3114|]. (let ((.cse0 (select |v_#memory_int_3114| ULTIMATE.start_main_p1))) (and (= 25 .cse0) (= (store |v_#memory_int_3114| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:57,607 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:36:57,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 16 treesize of output 11 [2019-05-15 10:36:57,638 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,640 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,640 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,640 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:57,648 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,648 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3115|]. (let ((.cse0 (select |v_#memory_int_3115| ULTIMATE.start_main_p1))) (and (= 26 .cse0) (= (store |v_#memory_int_3115| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:57,648 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:36:57,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 16 treesize of output 11 [2019-05-15 10:36:57,678 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,680 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,680 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,681 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:57,688 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,688 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3116|]. (let ((.cse0 (select |v_#memory_int_3116| ULTIMATE.start_main_p1))) (and (= .cse0 27) (= (store |v_#memory_int_3116| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:57,688 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:36:57,721 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:57,722 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,724 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,724 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,724 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:57,731 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,732 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3117|]. (let ((.cse0 (select |v_#memory_int_3117| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3117| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 28))) [2019-05-15 10:36:57,732 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:36:57,764 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:57,765 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,767 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,767 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,767 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:57,775 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,775 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3118|]. (let ((.cse0 (select |v_#memory_int_3118| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3118| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 29))) [2019-05-15 10:36:57,775 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:36:57,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:57,808 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,810 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,810 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,810 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:57,819 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,819 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3119|]. (let ((.cse0 (select |v_#memory_int_3119| ULTIMATE.start_main_p1))) (and (= 30 .cse0) (= |#memory_int| (store |v_#memory_int_3119| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:57,819 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:36: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 16 treesize of output 11 [2019-05-15 10:36:57,854 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,856 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,856 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,856 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:57,865 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,865 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3120|]. (let ((.cse0 (select |v_#memory_int_3120| ULTIMATE.start_main_p1))) (and (= .cse0 31) (= (store |v_#memory_int_3120| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:57,865 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:36:57,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:57,909 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,911 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,911 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,911 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:57,919 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,919 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3121|]. (let ((.cse0 (select |v_#memory_int_3121| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3121| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 32 .cse0))) [2019-05-15 10:36:57,919 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:36:57,953 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:57,954 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,956 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,956 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,957 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:57,964 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,964 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3122|]. (let ((.cse0 (select |v_#memory_int_3122| ULTIMATE.start_main_p1))) (and (= .cse0 33) (= (store |v_#memory_int_3122| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:57,964 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:36:57,998 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:57,999 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:58,001 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:58,001 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:58,001 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:58,009 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:58,009 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3123|]. (let ((.cse0 (select |v_#memory_int_3123| ULTIMATE.start_main_p1))) (and (= .cse0 34) (= |#memory_int| (store |v_#memory_int_3123| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:58,009 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:36:58,049 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:58,050 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:58,052 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:58,052 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:58,052 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:58,061 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:58,061 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3124|]. (let ((.cse0 (select |v_#memory_int_3124| ULTIMATE.start_main_p1))) (and (= .cse0 35) (= (store |v_#memory_int_3124| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:58,061 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:36:58,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:58,100 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:58,102 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:58,102 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:58,102 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:58,110 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:58,110 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3125|]. (let ((.cse0 (select |v_#memory_int_3125| ULTIMATE.start_main_p1))) (and (= 36 .cse0) (= |#memory_int| (store |v_#memory_int_3125| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:58,110 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:36:58,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 16 treesize of output 11 [2019-05-15 10:36:58,155 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:58,157 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:58,157 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:58,158 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:58,165 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:58,165 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3126|]. (let ((.cse0 (select |v_#memory_int_3126| ULTIMATE.start_main_p1))) (and (= 37 .cse0) (= |#memory_int| (store |v_#memory_int_3126| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:58,166 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:36:58,205 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:58,206 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:58,208 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:58,208 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:58,208 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:58,216 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:58,216 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3127|]. (let ((.cse0 (select |v_#memory_int_3127| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3127| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 38))) [2019-05-15 10:36:58,216 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:36:58,255 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:58,256 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:58,258 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:58,258 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:58,258 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:58,266 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:58,266 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3128|]. (let ((.cse0 (select |v_#memory_int_3128| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3128| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 39 .cse0))) [2019-05-15 10:36:58,266 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:36:58,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:58,307 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:58,309 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:58,309 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:58,309 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:58,317 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:58,317 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3129|]. (let ((.cse0 (select |v_#memory_int_3129| ULTIMATE.start_main_p1))) (and (= .cse0 40) (= (store |v_#memory_int_3129| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:58,317 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:36:58,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:58,357 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:58,359 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:58,360 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:58,360 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:58,368 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:58,368 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3130|]. (let ((.cse0 (select |v_#memory_int_3130| ULTIMATE.start_main_p1))) (and (= .cse0 41) (= (store |v_#memory_int_3130| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:58,369 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:36:58,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 16 treesize of output 11 [2019-05-15 10:36:58,411 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:58,413 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:58,413 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:58,413 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:58,421 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:58,421 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3131|]. (let ((.cse0 (select |v_#memory_int_3131| ULTIMATE.start_main_p1))) (and (= .cse0 42) (= |#memory_int| (store |v_#memory_int_3131| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:58,421 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:36:58,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:58,466 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:58,468 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:58,468 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:58,468 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:58,476 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:58,476 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3132|]. (let ((.cse0 (select |v_#memory_int_3132| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3132| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 43))) [2019-05-15 10:36:58,477 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:36:58,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 16 treesize of output 11 [2019-05-15 10:36:58,522 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:58,524 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:58,524 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:58,524 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:58,532 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:58,532 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3133|]. (let ((.cse0 (select |v_#memory_int_3133| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3133| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 44 .cse0))) [2019-05-15 10:36:58,532 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:36:58,575 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:58,576 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:58,578 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:58,579 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:58,579 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:58,586 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:58,587 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3134|]. (let ((.cse0 (select |v_#memory_int_3134| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3134| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 45))) [2019-05-15 10:36:58,587 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:36:58,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 16 treesize of output 11 [2019-05-15 10:36:58,631 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:58,633 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:58,633 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:58,633 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:58,641 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:58,641 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3135|]. (let ((.cse0 (select |v_#memory_int_3135| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3135| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 46))) [2019-05-15 10:36:58,641 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:36: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 16 treesize of output 11 [2019-05-15 10:36:58,688 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:58,690 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:58,690 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:58,690 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:58,697 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:58,697 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3136|]. (let ((.cse0 (select |v_#memory_int_3136| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3136| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 47))) [2019-05-15 10:36:58,697 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:36:58,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 16 treesize of output 11 [2019-05-15 10:36:58,750 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:58,752 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:58,752 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:58,752 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:58,760 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:58,760 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3137|]. (let ((.cse0 (select |v_#memory_int_3137| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3137| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 48))) [2019-05-15 10:36:58,760 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:36:58,813 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:58,814 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:58,816 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:58,816 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:58,816 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:58,824 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:58,824 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3138|]. (let ((.cse0 (select |v_#memory_int_3138| ULTIMATE.start_main_p1))) (and (= .cse0 49) (= (store |v_#memory_int_3138| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:58,825 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:36:58,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 16 treesize of output 11 [2019-05-15 10:36:58,873 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:58,875 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:58,875 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:58,875 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:58,883 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:58,883 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3139|]. (let ((.cse0 (select |v_#memory_int_3139| ULTIMATE.start_main_p1))) (and (= .cse0 50) (= (store |v_#memory_int_3139| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:58,883 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:36:58,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 16 treesize of output 11 [2019-05-15 10:36:58,932 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:58,934 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:58,935 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:58,935 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:58,942 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:58,942 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3140|]. (let ((.cse0 (select |v_#memory_int_3140| ULTIMATE.start_main_p1))) (and (= .cse0 51) (= |#memory_int| (store |v_#memory_int_3140| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:58,943 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:36:58,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:58,992 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:58,994 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:58,995 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:58,995 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:59,002 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:59,003 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3141|]. (let ((.cse0 (select |v_#memory_int_3141| ULTIMATE.start_main_p1))) (and (= 52 .cse0) (= (store |v_#memory_int_3141| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:59,003 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:36:59,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 16 treesize of output 11 [2019-05-15 10:36:59,052 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,054 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:59,054 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,054 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:59,062 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:59,063 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3142|]. (let ((.cse0 (select |v_#memory_int_3142| ULTIMATE.start_main_p1))) (and (= 53 .cse0) (= (store |v_#memory_int_3142| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:59,063 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:36:59,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 16 treesize of output 11 [2019-05-15 10:36:59,115 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,117 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:59,117 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,117 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:59,124 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:59,124 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3143|]. (let ((.cse0 (select |v_#memory_int_3143| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3143| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 54 .cse0))) [2019-05-15 10:36:59,125 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:36:59,177 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:59,178 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,180 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:59,180 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,180 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:59,188 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:59,189 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3144|]. (let ((.cse0 (select |v_#memory_int_3144| ULTIMATE.start_main_p1))) (and (= .cse0 55) (= (store |v_#memory_int_3144| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:59,189 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:36:59,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:59,244 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,246 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:59,247 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,247 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:59,254 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:59,254 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3145|]. (let ((.cse0 (select |v_#memory_int_3145| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3145| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 56))) [2019-05-15 10:36:59,254 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:36:59,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 16 treesize of output 11 [2019-05-15 10:36:59,309 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,311 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:59,311 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,311 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:59,319 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:59,319 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3146|]. (let ((.cse0 (select |v_#memory_int_3146| ULTIMATE.start_main_p1))) (and (= 57 .cse0) (= (store |v_#memory_int_3146| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:59,319 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:36:59,371 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:59,372 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,374 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:59,375 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,375 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:59,385 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:59,385 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3147|]. (let ((.cse0 (select |v_#memory_int_3147| ULTIMATE.start_main_p1))) (and (= 58 .cse0) (= |#memory_int| (store |v_#memory_int_3147| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:59,385 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:36:59,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:59,439 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:59,442 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,442 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:59,448 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:59,448 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3148|]. (let ((.cse0 (select |v_#memory_int_3148| ULTIMATE.start_main_p1))) (and (= .cse0 59) (= (store |v_#memory_int_3148| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:59,448 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:36:59,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 16 treesize of output 11 [2019-05-15 10:36:59,507 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,509 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:59,509 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,509 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:59,516 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:59,517 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3149|]. (let ((.cse0 (select |v_#memory_int_3149| ULTIMATE.start_main_p1))) (and (= .cse0 60) (= (store |v_#memory_int_3149| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:59,517 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:36:59,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:59,579 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,581 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:59,581 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,581 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:59,589 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:59,589 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3150|]. (let ((.cse0 (select |v_#memory_int_3150| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3150| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 61 .cse0))) [2019-05-15 10:36:59,590 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:36:59,646 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:59,647 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,649 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:59,649 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,649 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:59,657 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:59,657 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3151|]. (let ((.cse0 (select |v_#memory_int_3151| ULTIMATE.start_main_p1))) (and (= .cse0 62) (= (store |v_#memory_int_3151| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:59,657 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:36:59,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 16 treesize of output 11 [2019-05-15 10:36:59,716 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,718 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:59,718 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,718 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:59,726 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:59,727 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3152|]. (let ((.cse0 (select |v_#memory_int_3152| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3152| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 63))) [2019-05-15 10:36:59,727 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 64) [2019-05-15 10:36:59,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 16 treesize of output 11 [2019-05-15 10:36:59,789 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,791 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:59,792 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,792 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:59,800 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:59,800 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3153|]. (let ((.cse0 (select |v_#memory_int_3153| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3153| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 64 .cse0))) [2019-05-15 10:36:59,800 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 65) [2019-05-15 10:36:59,857 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:59,858 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,860 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:59,860 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,861 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:59,869 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:59,869 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3154|]. (let ((.cse0 (select |v_#memory_int_3154| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3154| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 65))) [2019-05-15 10:36:59,869 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 66) [2019-05-15 10:36:59,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 16 treesize of output 11 [2019-05-15 10:36:59,932 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,934 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:59,934 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,935 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:59,942 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:59,943 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3155|]. (let ((.cse0 (select |v_#memory_int_3155| ULTIMATE.start_main_p1))) (and (= .cse0 66) (= |#memory_int| (store |v_#memory_int_3155| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:59,943 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 67) [2019-05-15 10:37:00,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:00,010 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,012 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:00,012 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,012 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:00,020 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:00,020 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3156|]. (let ((.cse0 (select |v_#memory_int_3156| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3156| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 67 .cse0))) [2019-05-15 10:37:00,020 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 68) [2019-05-15 10:37:00,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 16 treesize of output 11 [2019-05-15 10:37:00,085 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,087 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:00,087 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,087 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:00,095 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:00,095 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3157|]. (let ((.cse0 (select |v_#memory_int_3157| ULTIMATE.start_main_p1))) (and (= 68 .cse0) (= (store |v_#memory_int_3157| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:00,095 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 69) [2019-05-15 10:37:00,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 16 treesize of output 11 [2019-05-15 10:37:00,158 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,160 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:00,160 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,160 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:00,169 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:00,169 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3158|]. (let ((.cse0 (select |v_#memory_int_3158| ULTIMATE.start_main_p1))) (and (= 69 .cse0) (= (store |v_#memory_int_3158| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:00,169 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 70) [2019-05-15 10:37:00,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 16 treesize of output 11 [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,237 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:00,237 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,237 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:00,245 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:00,245 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3159|]. (let ((.cse0 (select |v_#memory_int_3159| ULTIMATE.start_main_p1))) (and (= .cse0 70) (= (store |v_#memory_int_3159| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:00,245 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 71) [2019-05-15 10:37:00,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 16 treesize of output 11 [2019-05-15 10:37:00,309 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,311 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:00,312 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,312 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:00,320 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:00,320 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3160|]. (let ((.cse0 (select |v_#memory_int_3160| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3160| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 71))) [2019-05-15 10:37:00,320 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 72) [2019-05-15 10:37:00,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:00,384 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,386 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:00,387 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,387 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:00,394 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:00,394 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3161|]. (let ((.cse0 (select |v_#memory_int_3161| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3161| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 72))) [2019-05-15 10:37:00,395 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 73) [2019-05-15 10:37:00,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:00,466 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,468 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:00,468 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,469 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:00,476 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:00,477 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3162|]. (let ((.cse0 (select |v_#memory_int_3162| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3162| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 73))) [2019-05-15 10:37:00,477 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 74) [2019-05-15 10:37:00,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 16 treesize of output 11 [2019-05-15 10:37:00,544 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,546 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:00,546 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,546 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:00,557 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:00,558 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3163|]. (let ((.cse0 (select |v_#memory_int_3163| ULTIMATE.start_main_p1))) (and (= .cse0 74) (= |#memory_int| (store |v_#memory_int_3163| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:00,558 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 75) [2019-05-15 10:37:00,626 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:00,627 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,629 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:00,629 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,630 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:00,637 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:00,637 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3164|]. (let ((.cse0 (select |v_#memory_int_3164| ULTIMATE.start_main_p1))) (and (= 75 .cse0) (= (store |v_#memory_int_3164| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:00,637 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 76) [2019-05-15 10:37:00,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:00,707 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,709 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:00,709 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,710 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:00,718 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:00,719 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3165|]. (let ((.cse0 (select |v_#memory_int_3165| ULTIMATE.start_main_p1))) (and (= .cse0 76) (= |#memory_int| (store |v_#memory_int_3165| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:00,719 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 77) [2019-05-15 10:37:00,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 16 treesize of output 11 [2019-05-15 10:37:00,789 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,791 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:00,792 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,792 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:00,799 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:00,800 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3166|]. (let ((.cse0 (select |v_#memory_int_3166| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3166| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 77 .cse0))) [2019-05-15 10:37:00,800 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 78) [2019-05-15 10:37:00,863 INFO L273 TraceCheckUtils]: 0: Hoare triple {27002#true} havoc main_p1; {27002#true} is VALID [2019-05-15 10:37:00,863 INFO L273 TraceCheckUtils]: 1: Hoare triple {27002#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {27002#true} is VALID [2019-05-15 10:37:00,864 INFO L273 TraceCheckUtils]: 2: Hoare triple {27002#true} #memory_int := #memory_int[main_p1 := 0]; {27013#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:37:00,864 INFO L273 TraceCheckUtils]: 3: Hoare triple {27013#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27017#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:37:00,865 INFO L273 TraceCheckUtils]: 4: Hoare triple {27017#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27021#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:37:00,866 INFO L273 TraceCheckUtils]: 5: Hoare triple {27021#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27025#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:37:00,867 INFO L273 TraceCheckUtils]: 6: Hoare triple {27025#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27029#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:37:00,867 INFO L273 TraceCheckUtils]: 7: Hoare triple {27029#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27033#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:37:00,868 INFO L273 TraceCheckUtils]: 8: Hoare triple {27033#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27037#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:37:00,869 INFO L273 TraceCheckUtils]: 9: Hoare triple {27037#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27041#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:37:00,870 INFO L273 TraceCheckUtils]: 10: Hoare triple {27041#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27045#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:37:00,870 INFO L273 TraceCheckUtils]: 11: Hoare triple {27045#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27049#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:37:00,871 INFO L273 TraceCheckUtils]: 12: Hoare triple {27049#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27053#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:37:00,872 INFO L273 TraceCheckUtils]: 13: Hoare triple {27053#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27057#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:37:00,873 INFO L273 TraceCheckUtils]: 14: Hoare triple {27057#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27061#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:37:00,873 INFO L273 TraceCheckUtils]: 15: Hoare triple {27061#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27065#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:37:00,874 INFO L273 TraceCheckUtils]: 16: Hoare triple {27065#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27069#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:37:00,875 INFO L273 TraceCheckUtils]: 17: Hoare triple {27069#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27073#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:37:00,875 INFO L273 TraceCheckUtils]: 18: Hoare triple {27073#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27077#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:37:00,876 INFO L273 TraceCheckUtils]: 19: Hoare triple {27077#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27081#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:37:00,877 INFO L273 TraceCheckUtils]: 20: Hoare triple {27081#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27085#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:37:00,878 INFO L273 TraceCheckUtils]: 21: Hoare triple {27085#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27089#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:37:00,878 INFO L273 TraceCheckUtils]: 22: Hoare triple {27089#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27093#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:37:00,879 INFO L273 TraceCheckUtils]: 23: Hoare triple {27093#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27097#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:37:00,880 INFO L273 TraceCheckUtils]: 24: Hoare triple {27097#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27101#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:37:00,881 INFO L273 TraceCheckUtils]: 25: Hoare triple {27101#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27105#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:37:00,881 INFO L273 TraceCheckUtils]: 26: Hoare triple {27105#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27109#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:37:00,882 INFO L273 TraceCheckUtils]: 27: Hoare triple {27109#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27113#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:37:00,883 INFO L273 TraceCheckUtils]: 28: Hoare triple {27113#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27117#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:37:00,884 INFO L273 TraceCheckUtils]: 29: Hoare triple {27117#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27121#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:37:00,884 INFO L273 TraceCheckUtils]: 30: Hoare triple {27121#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27125#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:37:00,885 INFO L273 TraceCheckUtils]: 31: Hoare triple {27125#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27129#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:37:00,886 INFO L273 TraceCheckUtils]: 32: Hoare triple {27129#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27133#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:37:00,887 INFO L273 TraceCheckUtils]: 33: Hoare triple {27133#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27137#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:37:00,887 INFO L273 TraceCheckUtils]: 34: Hoare triple {27137#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27141#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:37:00,888 INFO L273 TraceCheckUtils]: 35: Hoare triple {27141#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27145#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:37:00,889 INFO L273 TraceCheckUtils]: 36: Hoare triple {27145#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27149#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:37:00,890 INFO L273 TraceCheckUtils]: 37: Hoare triple {27149#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27153#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:37:00,890 INFO L273 TraceCheckUtils]: 38: Hoare triple {27153#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27157#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:37:00,891 INFO L273 TraceCheckUtils]: 39: Hoare triple {27157#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27161#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:37:00,892 INFO L273 TraceCheckUtils]: 40: Hoare triple {27161#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27165#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:37:00,893 INFO L273 TraceCheckUtils]: 41: Hoare triple {27165#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27169#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:37:00,893 INFO L273 TraceCheckUtils]: 42: Hoare triple {27169#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27173#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:37:00,894 INFO L273 TraceCheckUtils]: 43: Hoare triple {27173#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27177#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:37:00,895 INFO L273 TraceCheckUtils]: 44: Hoare triple {27177#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27181#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:37:00,896 INFO L273 TraceCheckUtils]: 45: Hoare triple {27181#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27185#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:37:00,896 INFO L273 TraceCheckUtils]: 46: Hoare triple {27185#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27189#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:37:00,897 INFO L273 TraceCheckUtils]: 47: Hoare triple {27189#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27193#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:37:00,898 INFO L273 TraceCheckUtils]: 48: Hoare triple {27193#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27197#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:37:00,899 INFO L273 TraceCheckUtils]: 49: Hoare triple {27197#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27201#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:37:00,899 INFO L273 TraceCheckUtils]: 50: Hoare triple {27201#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27205#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:37:00,900 INFO L273 TraceCheckUtils]: 51: Hoare triple {27205#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27209#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:37:00,901 INFO L273 TraceCheckUtils]: 52: Hoare triple {27209#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27213#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:37:00,902 INFO L273 TraceCheckUtils]: 53: Hoare triple {27213#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27217#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:37:00,902 INFO L273 TraceCheckUtils]: 54: Hoare triple {27217#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27221#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:37:00,903 INFO L273 TraceCheckUtils]: 55: Hoare triple {27221#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27225#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:37:00,904 INFO L273 TraceCheckUtils]: 56: Hoare triple {27225#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27229#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:37:00,905 INFO L273 TraceCheckUtils]: 57: Hoare triple {27229#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27233#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:37:00,905 INFO L273 TraceCheckUtils]: 58: Hoare triple {27233#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27237#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:37:00,906 INFO L273 TraceCheckUtils]: 59: Hoare triple {27237#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27241#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:37:00,907 INFO L273 TraceCheckUtils]: 60: Hoare triple {27241#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27245#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:37:00,908 INFO L273 TraceCheckUtils]: 61: Hoare triple {27245#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27249#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:37:00,908 INFO L273 TraceCheckUtils]: 62: Hoare triple {27249#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27253#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:37:00,909 INFO L273 TraceCheckUtils]: 63: Hoare triple {27253#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27257#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:37:00,910 INFO L273 TraceCheckUtils]: 64: Hoare triple {27257#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27261#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:37:00,911 INFO L273 TraceCheckUtils]: 65: Hoare triple {27261#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27265#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:37:00,911 INFO L273 TraceCheckUtils]: 66: Hoare triple {27265#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27269#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} is VALID [2019-05-15 10:37:00,912 INFO L273 TraceCheckUtils]: 67: Hoare triple {27269#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27273#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} is VALID [2019-05-15 10:37:00,913 INFO L273 TraceCheckUtils]: 68: Hoare triple {27273#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27277#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} is VALID [2019-05-15 10:37:00,914 INFO L273 TraceCheckUtils]: 69: Hoare triple {27277#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27281#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} is VALID [2019-05-15 10:37:00,914 INFO L273 TraceCheckUtils]: 70: Hoare triple {27281#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27285#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} is VALID [2019-05-15 10:37:00,915 INFO L273 TraceCheckUtils]: 71: Hoare triple {27285#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27289#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} is VALID [2019-05-15 10:37:00,916 INFO L273 TraceCheckUtils]: 72: Hoare triple {27289#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27293#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} is VALID [2019-05-15 10:37:00,917 INFO L273 TraceCheckUtils]: 73: Hoare triple {27293#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27297#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} is VALID [2019-05-15 10:37:00,917 INFO L273 TraceCheckUtils]: 74: Hoare triple {27297#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27301#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} is VALID [2019-05-15 10:37:00,918 INFO L273 TraceCheckUtils]: 75: Hoare triple {27301#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27305#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} is VALID [2019-05-15 10:37:00,919 INFO L273 TraceCheckUtils]: 76: Hoare triple {27305#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27309#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} is VALID [2019-05-15 10:37:00,919 INFO L273 TraceCheckUtils]: 77: Hoare triple {27309#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27313#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} is VALID [2019-05-15 10:37:00,920 INFO L273 TraceCheckUtils]: 78: Hoare triple {27313#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27317#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} is VALID [2019-05-15 10:37:00,921 INFO L273 TraceCheckUtils]: 79: Hoare triple {27317#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27321#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} is VALID [2019-05-15 10:37:00,922 INFO L273 TraceCheckUtils]: 80: Hoare triple {27321#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27325#(= (select |#memory_int| ULTIMATE.start_main_p1) 78)} is VALID [2019-05-15 10:37:00,922 INFO L273 TraceCheckUtils]: 81: Hoare triple {27325#(= (select |#memory_int| ULTIMATE.start_main_p1) 78)} assume !(#memory_int[main_p1] >= 0); {27003#false} is VALID [2019-05-15 10:37:00,931 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:37:00,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:37:00,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-05-15 10:37:00,932 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 82 [2019-05-15 10:37:00,932 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:37:00,932 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 81 states. [2019-05-15 10:37:00,999 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:37:00,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-05-15 10:37:01,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-05-15 10:37:01,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2019-05-15 10:37:01,000 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 81 states. [2019-05-15 10:37:13,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:37:13,740 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-05-15 10:37:13,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-05-15 10:37:13,740 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 82 [2019-05-15 10:37:13,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:37:13,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-05-15 10:37:13,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2019-05-15 10:37:13,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-05-15 10:37:13,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2019-05-15 10:37:13,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 81 states and 85 transitions. [2019-05-15 10:37:13,809 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:37:13,810 INFO L225 Difference]: With dead ends: 84 [2019-05-15 10:37:13,811 INFO L226 Difference]: Without dead ends: 84 [2019-05-15 10:37:13,811 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2019-05-15 10:37:13,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-05-15 10:37:13,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-05-15 10:37:13,812 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:37:13,812 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 84 states. [2019-05-15 10:37:13,812 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 84 states. [2019-05-15 10:37:13,812 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 84 states. [2019-05-15 10:37:13,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:37:13,813 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-05-15 10:37:13,813 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-05-15 10:37:13,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:37:13,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:37:13,813 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 84 states. [2019-05-15 10:37:13,814 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 84 states. [2019-05-15 10:37:13,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:37:13,814 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-05-15 10:37:13,814 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-05-15 10:37:13,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:37:13,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:37:13,815 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:37:13,815 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:37:13,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-05-15 10:37:13,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-05-15 10:37:13,816 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-05-15 10:37:13,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:37:13,816 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-05-15 10:37:13,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-05-15 10:37:13,816 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-05-15 10:37:13,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-05-15 10:37:13,816 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:37:13,816 INFO L399 BasicCegarLoop]: trace histogram [79, 1, 1, 1, 1] [2019-05-15 10:37:13,816 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:37:13,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:37:13,817 INFO L82 PathProgramCache]: Analyzing trace with hash 827675266, now seen corresponding path program 79 times [2019-05-15 10:37:13,817 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:37:13,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:37:13,847 WARN L254 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 81 conjunts are in the unsatisfiable core [2019-05-15 10:37:13,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:37:13,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:37:13,906 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:13,906 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:13,908 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:13,909 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:13,909 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:37:13,910 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:13,911 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3167|]. (= (store |v_#memory_int_3167| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:37:13,911 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:37:13,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 16 treesize of output 11 [2019-05-15 10:37:13,922 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:13,924 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:13,924 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:13,925 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:13,932 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:13,932 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3168|]. (let ((.cse0 (select |v_#memory_int_3168| ULTIMATE.start_main_p1))) (and (= .cse0 0) (= |#memory_int| (store |v_#memory_int_3168| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:13,932 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:37:13,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 16 treesize of output 11 [2019-05-15 10:37:13,944 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:13,946 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:13,946 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:13,946 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:13,953 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:13,953 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3169|]. (let ((.cse0 (select |v_#memory_int_3169| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3169| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 1 .cse0))) [2019-05-15 10:37:13,953 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:37:13,965 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:13,966 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:13,968 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:13,969 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:13,969 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:13,975 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:13,975 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3170|]. (let ((.cse0 (select |v_#memory_int_3170| ULTIMATE.start_main_p1))) (and (= .cse0 2) (= (store |v_#memory_int_3170| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:13,976 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:37:13,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:13,987 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:13,989 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:13,990 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:13,990 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:13,997 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:13,997 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3171|]. (let ((.cse0 (select |v_#memory_int_3171| ULTIMATE.start_main_p1))) (and (= 3 .cse0) (= (store |v_#memory_int_3171| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:13,997 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:37:14,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:14,011 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,013 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:14,013 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,013 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:14,021 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:14,021 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3172|]. (let ((.cse0 (select |v_#memory_int_3172| ULTIMATE.start_main_p1))) (and (= 4 .cse0) (= (store |v_#memory_int_3172| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:14,021 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:37:14,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 16 treesize of output 11 [2019-05-15 10:37:14,035 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,037 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:14,037 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,037 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:14,045 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:14,045 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3173|]. (let ((.cse0 (select |v_#memory_int_3173| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3173| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 5))) [2019-05-15 10:37:14,045 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:37:14,058 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:14,059 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,061 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:14,061 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,061 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:14,068 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:14,069 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3174|]. (let ((.cse0 (select |v_#memory_int_3174| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3174| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 6))) [2019-05-15 10:37:14,069 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:37:14,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:14,086 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,088 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:14,089 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,089 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:14,099 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:14,099 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3175|]. (let ((.cse0 (select |v_#memory_int_3175| ULTIMATE.start_main_p1))) (and (= 7 .cse0) (= (store |v_#memory_int_3175| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:14,100 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:37:14,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 16 treesize of output 11 [2019-05-15 10:37:14,117 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,119 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:14,119 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,120 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:14,127 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:14,128 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3176|]. (let ((.cse0 (select |v_#memory_int_3176| ULTIMATE.start_main_p1))) (and (= .cse0 8) (= |#memory_int| (store |v_#memory_int_3176| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:14,128 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:37:14,145 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:14,146 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,148 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:14,148 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,149 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:14,156 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:14,156 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3177|]. (let ((.cse0 (select |v_#memory_int_3177| ULTIMATE.start_main_p1))) (and (= 9 .cse0) (= (store |v_#memory_int_3177| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:14,156 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:37:14,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:14,173 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,175 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:14,175 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,176 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:14,183 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:14,183 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3178|]. (let ((.cse0 (select |v_#memory_int_3178| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3178| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 10 .cse0))) [2019-05-15 10:37:14,183 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:37:14,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 16 treesize of output 11 [2019-05-15 10:37:14,203 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,205 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:14,206 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,206 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:14,213 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:14,213 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3179|]. (let ((.cse0 (select |v_#memory_int_3179| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3179| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 11))) [2019-05-15 10:37:14,213 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:37:14,231 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:14,232 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,234 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:14,234 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,234 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:14,242 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:14,242 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3180|]. (let ((.cse0 (select |v_#memory_int_3180| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3180| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 12 .cse0))) [2019-05-15 10:37:14,242 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:37:14,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 16 treesize of output 11 [2019-05-15 10:37:14,261 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,263 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:14,263 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,264 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:14,271 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:14,271 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3181|]. (let ((.cse0 (select |v_#memory_int_3181| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3181| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 13 .cse0))) [2019-05-15 10:37:14,271 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:37:14,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 16 treesize of output 11 [2019-05-15 10:37:14,291 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,293 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:14,293 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,293 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:14,302 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:14,302 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3182|]. (let ((.cse0 (select |v_#memory_int_3182| ULTIMATE.start_main_p1))) (and (= .cse0 14) (= |#memory_int| (store |v_#memory_int_3182| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:14,302 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:37:14,322 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:14,323 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,325 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:14,325 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,325 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:14,333 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:14,333 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3183|]. (let ((.cse0 (select |v_#memory_int_3183| ULTIMATE.start_main_p1))) (and (= .cse0 15) (= (store |v_#memory_int_3183| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:14,333 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:37:14,358 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:14,359 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,361 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:14,362 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,362 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:14,369 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:14,369 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3184|]. (let ((.cse0 (select |v_#memory_int_3184| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3184| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 16 .cse0))) [2019-05-15 10:37:14,370 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:37:14,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:14,394 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,396 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:14,396 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,396 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:14,404 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:14,404 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3185|]. (let ((.cse0 (select |v_#memory_int_3185| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3185| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 17 .cse0))) [2019-05-15 10:37:14,404 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:37:14,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:14,431 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,433 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:14,433 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,433 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:14,445 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:14,445 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3186|]. (let ((.cse0 (select |v_#memory_int_3186| ULTIMATE.start_main_p1))) (and (= 18 .cse0) (= (store |v_#memory_int_3186| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:14,445 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:37:14,471 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:14,472 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,474 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:14,474 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,475 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:14,481 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:14,482 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3187|]. (let ((.cse0 (select |v_#memory_int_3187| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3187| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 19))) [2019-05-15 10:37:14,482 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:37:14,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:14,509 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,511 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:14,511 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,511 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:14,518 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:14,519 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3188|]. (let ((.cse0 (select |v_#memory_int_3188| ULTIMATE.start_main_p1))) (and (= .cse0 20) (= (store |v_#memory_int_3188| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:14,519 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:37:14,545 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:14,546 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,549 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:14,549 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,549 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:14,556 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:14,557 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3189|]. (let ((.cse0 (select |v_#memory_int_3189| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3189| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 21 .cse0))) [2019-05-15 10:37:14,557 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:37:14,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 16 treesize of output 11 [2019-05-15 10:37:14,585 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,587 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:14,587 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,587 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:14,595 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:14,595 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3190|]. (let ((.cse0 (select |v_#memory_int_3190| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3190| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 22 .cse0))) [2019-05-15 10:37:14,595 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:37:14,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 16 treesize of output 11 [2019-05-15 10:37:14,621 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,623 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:14,624 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,624 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:14,631 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:14,632 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3191|]. (let ((.cse0 (select |v_#memory_int_3191| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3191| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 23))) [2019-05-15 10:37:14,632 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:37:14,661 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:14,662 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,664 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:14,664 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,665 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:14,672 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:14,672 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3192|]. (let ((.cse0 (select |v_#memory_int_3192| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3192| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 24))) [2019-05-15 10:37:14,672 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:37:14,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:14,704 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,707 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:14,707 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,713 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:14,720 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:14,720 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3193|]. (let ((.cse0 (select |v_#memory_int_3193| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3193| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 25))) [2019-05-15 10:37:14,720 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:37:14,750 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:14,751 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,753 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:14,754 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,754 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:14,761 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:14,761 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3194|]. (let ((.cse0 (select |v_#memory_int_3194| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3194| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 26))) [2019-05-15 10:37:14,762 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:37:14,790 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:14,791 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,793 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:14,793 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,794 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:14,802 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:14,803 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3195|]. (let ((.cse0 (select |v_#memory_int_3195| ULTIMATE.start_main_p1))) (and (= .cse0 27) (= (store |v_#memory_int_3195| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:14,803 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:37:14,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:14,834 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,836 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:14,836 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,836 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:14,843 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:14,843 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3196|]. (let ((.cse0 (select |v_#memory_int_3196| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3196| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 28))) [2019-05-15 10:37:14,843 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:37:14,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:14,875 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,877 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:14,877 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,877 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:14,886 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:14,886 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3197|]. (let ((.cse0 (select |v_#memory_int_3197| ULTIMATE.start_main_p1))) (and (= .cse0 29) (= (store |v_#memory_int_3197| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:14,886 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:37:14,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:14,920 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,922 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:14,922 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,923 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:14,929 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:14,930 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3198|]. (let ((.cse0 (select |v_#memory_int_3198| ULTIMATE.start_main_p1))) (and (= .cse0 30) (= |#memory_int| (store |v_#memory_int_3198| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:14,930 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:37:14,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 16 treesize of output 11 [2019-05-15 10:37:14,963 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,965 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:14,965 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:14,966 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:14,973 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:14,973 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3199|]. (let ((.cse0 (select |v_#memory_int_3199| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3199| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 31))) [2019-05-15 10:37:14,973 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:37:15,007 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:15,008 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,010 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:15,010 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,011 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:15,018 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:15,018 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3200|]. (let ((.cse0 (select |v_#memory_int_3200| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3200| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 32))) [2019-05-15 10:37:15,019 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:37:15,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:15,053 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,055 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:15,056 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,056 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:15,063 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:15,064 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3201|]. (let ((.cse0 (select |v_#memory_int_3201| ULTIMATE.start_main_p1))) (and (= 33 .cse0) (= (store |v_#memory_int_3201| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:15,064 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:37:15,100 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:15,101 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,103 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:15,103 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,104 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:15,112 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:15,112 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3202|]. (let ((.cse0 (select |v_#memory_int_3202| ULTIMATE.start_main_p1))) (and (= .cse0 34) (= (store |v_#memory_int_3202| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:15,112 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:37:15,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 16 treesize of output 11 [2019-05-15 10:37:15,151 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,153 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:15,153 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,153 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:15,161 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:15,161 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3203|]. (let ((.cse0 (select |v_#memory_int_3203| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3203| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 35))) [2019-05-15 10:37:15,162 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:37:15,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:15,200 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:15,202 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,202 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:15,210 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:15,210 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3204|]. (let ((.cse0 (select |v_#memory_int_3204| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3204| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 36))) [2019-05-15 10:37:15,210 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:37: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 16 treesize of output 11 [2019-05-15 10:37:15,249 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,251 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:15,251 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,251 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:15,259 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:15,259 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3205|]. (let ((.cse0 (select |v_#memory_int_3205| ULTIMATE.start_main_p1))) (and (= .cse0 37) (= (store |v_#memory_int_3205| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:15,259 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:37:15,348 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:15,362 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,396 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:15,396 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,396 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:15,409 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:15,410 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3206|]. (let ((.cse0 (select |v_#memory_int_3206| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3206| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 38 .cse0))) [2019-05-15 10:37:15,410 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:37:16,005 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:16,006 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,008 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:16,008 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,008 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:16,017 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:16,017 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3207|]. (let ((.cse0 (select |v_#memory_int_3207| ULTIMATE.start_main_p1))) (and (= .cse0 39) (= (store |v_#memory_int_3207| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:16,017 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:37:16,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 16 treesize of output 11 [2019-05-15 10:37:16,058 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,060 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:16,061 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,061 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:16,069 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:16,069 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3208|]. (let ((.cse0 (select |v_#memory_int_3208| ULTIMATE.start_main_p1))) (and (= 40 .cse0) (= (store |v_#memory_int_3208| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:16,069 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:37:16,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 16 treesize of output 11 [2019-05-15 10:37:16,110 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,112 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:16,112 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,112 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:16,120 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:16,120 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3209|]. (let ((.cse0 (select |v_#memory_int_3209| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3209| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 41 .cse0))) [2019-05-15 10:37:16,120 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:37:16,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 16 treesize of output 11 [2019-05-15 10:37:16,172 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,174 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:16,174 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,174 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:16,181 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:16,182 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3210|]. (let ((.cse0 (select |v_#memory_int_3210| ULTIMATE.start_main_p1))) (and (= 42 .cse0) (= |#memory_int| (store |v_#memory_int_3210| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:16,182 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:37:16,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 16 treesize of output 11 [2019-05-15 10:37:16,227 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,229 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:16,230 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,230 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:16,238 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:16,238 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3211|]. (let ((.cse0 (select |v_#memory_int_3211| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3211| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 43 .cse0))) [2019-05-15 10:37:16,238 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:37:16,281 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:16,282 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,284 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:16,284 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,284 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:16,292 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:16,292 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3212|]. (let ((.cse0 (select |v_#memory_int_3212| ULTIMATE.start_main_p1))) (and (= .cse0 44) (= (store |v_#memory_int_3212| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:16,292 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:37:16,333 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:16,334 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,336 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:16,336 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,336 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:16,345 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:16,345 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3213|]. (let ((.cse0 (select |v_#memory_int_3213| ULTIMATE.start_main_p1))) (and (= 45 .cse0) (= |#memory_int| (store |v_#memory_int_3213| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:16,345 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:37:16,390 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:16,391 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,393 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:16,393 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,393 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:16,402 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:16,402 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3214|]. (let ((.cse0 (select |v_#memory_int_3214| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3214| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 46))) [2019-05-15 10:37:16,402 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:37:16,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 16 treesize of output 11 [2019-05-15 10:37:16,448 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,450 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:16,450 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,450 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:16,458 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:16,458 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3215|]. (let ((.cse0 (select |v_#memory_int_3215| ULTIMATE.start_main_p1))) (and (= .cse0 47) (= |#memory_int| (store |v_#memory_int_3215| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:16,458 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:37:16,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 16 treesize of output 11 [2019-05-15 10:37:16,508 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,510 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:16,510 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,510 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:16,517 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:16,518 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3216|]. (let ((.cse0 (select |v_#memory_int_3216| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3216| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 48))) [2019-05-15 10:37:16,518 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:37:16,563 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:16,564 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,566 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:16,567 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,567 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:16,574 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:16,574 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3217|]. (let ((.cse0 (select |v_#memory_int_3217| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3217| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 49))) [2019-05-15 10:37:16,575 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:37:16,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 16 treesize of output 11 [2019-05-15 10:37:16,629 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,631 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:16,631 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,631 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:16,639 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:16,639 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3218|]. (let ((.cse0 (select |v_#memory_int_3218| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3218| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 50 .cse0))) [2019-05-15 10:37:16,639 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:37:16,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 16 treesize of output 11 [2019-05-15 10:37:16,688 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,690 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:16,691 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,691 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:16,698 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:16,699 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3219|]. (let ((.cse0 (select |v_#memory_int_3219| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3219| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 51 .cse0))) [2019-05-15 10:37:16,699 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:37:16,748 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:16,749 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,751 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:16,751 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,752 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:16,759 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:16,759 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3220|]. (let ((.cse0 (select |v_#memory_int_3220| ULTIMATE.start_main_p1))) (and (= 52 .cse0) (= |#memory_int| (store |v_#memory_int_3220| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:16,759 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:37:16,808 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:16,809 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,811 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:16,811 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,812 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:16,819 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:16,819 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3221|]. (let ((.cse0 (select |v_#memory_int_3221| ULTIMATE.start_main_p1))) (and (= 53 .cse0) (= (store |v_#memory_int_3221| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:16,819 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:37:16,877 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:16,878 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,880 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:16,880 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,880 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:16,888 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:16,888 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3222|]. (let ((.cse0 (select |v_#memory_int_3222| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3222| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 54))) [2019-05-15 10:37:16,888 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:37:16,939 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:16,940 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,942 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:16,943 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,943 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:16,950 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:16,950 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3223|]. (let ((.cse0 (select |v_#memory_int_3223| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3223| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 55))) [2019-05-15 10:37:16,950 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:37:17,003 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:17,004 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,006 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:17,006 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,007 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:17,014 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:17,014 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3224|]. (let ((.cse0 (select |v_#memory_int_3224| ULTIMATE.start_main_p1))) (and (= 56 .cse0) (= (store |v_#memory_int_3224| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:17,014 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:37:17,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 16 treesize of output 11 [2019-05-15 10:37:17,067 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,069 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:17,069 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,069 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:17,078 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:17,078 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3225|]. (let ((.cse0 (select |v_#memory_int_3225| ULTIMATE.start_main_p1))) (and (= 57 .cse0) (= (store |v_#memory_int_3225| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:17,078 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:37:17,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:17,135 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,137 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:17,137 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,137 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:17,145 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:17,145 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3226|]. (let ((.cse0 (select |v_#memory_int_3226| ULTIMATE.start_main_p1))) (and (= .cse0 58) (= (store |v_#memory_int_3226| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:17,145 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:37:17,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 16 treesize of output 11 [2019-05-15 10:37:17,202 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,204 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:17,205 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,205 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:17,211 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:17,211 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3227|]. (let ((.cse0 (select |v_#memory_int_3227| ULTIMATE.start_main_p1))) (and (= 59 .cse0) (= (store |v_#memory_int_3227| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:17,212 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:37:17,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 16 treesize of output 11 [2019-05-15 10:37:17,268 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,270 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:17,271 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,271 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:17,278 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:17,278 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3228|]. (let ((.cse0 (select |v_#memory_int_3228| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3228| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 60 .cse0))) [2019-05-15 10:37:17,278 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:37:17,332 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:17,332 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,335 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:17,335 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,335 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:17,342 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:17,342 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3229|]. (let ((.cse0 (select |v_#memory_int_3229| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3229| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 61 .cse0))) [2019-05-15 10:37:17,342 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:37:17,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:17,399 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,401 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:17,401 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,401 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:17,408 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:17,408 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3230|]. (let ((.cse0 (select |v_#memory_int_3230| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3230| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 62))) [2019-05-15 10:37:17,408 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:37:17,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:17,467 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,469 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:17,469 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,470 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:17,477 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:17,477 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3231|]. (let ((.cse0 (select |v_#memory_int_3231| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3231| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 63))) [2019-05-15 10:37:17,477 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 64) [2019-05-15 10:37:17,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:17,538 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,540 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:17,540 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,540 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:17,549 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:17,549 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3232|]. (let ((.cse0 (select |v_#memory_int_3232| ULTIMATE.start_main_p1))) (and (= .cse0 64) (= (store |v_#memory_int_3232| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:17,549 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 65) [2019-05-15 10:37:17,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 16 treesize of output 11 [2019-05-15 10:37:17,615 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,617 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:17,617 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,618 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:17,625 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:17,625 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3233|]. (let ((.cse0 (select |v_#memory_int_3233| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3233| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 65))) [2019-05-15 10:37:17,625 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 66) [2019-05-15 10:37:17,686 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:17,687 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,689 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:17,689 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,689 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:17,696 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:17,696 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3234|]. (let ((.cse0 (select |v_#memory_int_3234| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3234| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 66 .cse0))) [2019-05-15 10:37:17,697 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 67) [2019-05-15 10:37:17,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:17,759 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,761 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:17,761 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,761 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:17,768 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:17,769 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3235|]. (let ((.cse0 (select |v_#memory_int_3235| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3235| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 67 .cse0))) [2019-05-15 10:37:17,769 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 68) [2019-05-15 10:37:17,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:17,830 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,832 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:17,833 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,833 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:17,839 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:17,840 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3236|]. (let ((.cse0 (select |v_#memory_int_3236| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3236| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 68))) [2019-05-15 10:37:17,840 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 69) [2019-05-15 10:37:17,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 16 treesize of output 11 [2019-05-15 10:37:17,904 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,906 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:17,906 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,907 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:17,914 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:17,915 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3237|]. (let ((.cse0 (select |v_#memory_int_3237| ULTIMATE.start_main_p1))) (and (= .cse0 69) (= (store |v_#memory_int_3237| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:17,915 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 70) [2019-05-15 10:37:17,981 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:17,982 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,984 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:17,984 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,984 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:17,991 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:17,992 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3238|]. (let ((.cse0 (select |v_#memory_int_3238| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3238| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 70))) [2019-05-15 10:37:17,992 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 71) [2019-05-15 10:37:18,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:18,056 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:18,058 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:18,059 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:18,059 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:18,066 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:18,066 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3239|]. (let ((.cse0 (select |v_#memory_int_3239| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3239| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 71 .cse0))) [2019-05-15 10:37:18,066 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 72) [2019-05-15 10:37:18,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 16 treesize of output 11 [2019-05-15 10:37:18,131 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:18,133 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:18,133 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:18,133 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:18,145 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:18,145 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3240|]. (let ((.cse0 (select |v_#memory_int_3240| ULTIMATE.start_main_p1))) (and (= .cse0 72) (= (store |v_#memory_int_3240| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:18,145 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 73) [2019-05-15 10:37:18,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 16 treesize of output 11 [2019-05-15 10:37:18,213 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:18,215 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:18,215 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:18,216 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:18,222 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:18,222 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3241|]. (let ((.cse0 (select |v_#memory_int_3241| ULTIMATE.start_main_p1))) (and (= 73 .cse0) (= |#memory_int| (store |v_#memory_int_3241| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:18,222 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 74) [2019-05-15 10:37:18,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:18,290 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:18,292 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:18,293 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:18,293 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:18,301 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:18,301 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3242|]. (let ((.cse0 (select |v_#memory_int_3242| ULTIMATE.start_main_p1))) (and (= .cse0 74) (= (store |v_#memory_int_3242| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:18,301 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 75) [2019-05-15 10:37:18,369 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:18,370 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:18,372 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:18,373 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:18,373 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:18,381 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:18,381 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3243|]. (let ((.cse0 (select |v_#memory_int_3243| ULTIMATE.start_main_p1))) (and (= 75 .cse0) (= (store |v_#memory_int_3243| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:18,381 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 76) [2019-05-15 10:37:18,454 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:18,455 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:18,457 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:18,457 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:18,457 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:18,464 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:18,465 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3244|]. (let ((.cse0 (select |v_#memory_int_3244| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3244| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 76 .cse0))) [2019-05-15 10:37:18,465 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 77) [2019-05-15 10:37:18,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 16 treesize of output 11 [2019-05-15 10:37:18,536 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:18,538 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:18,538 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:18,538 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:18,546 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:18,546 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3245|]. (let ((.cse0 (select |v_#memory_int_3245| ULTIMATE.start_main_p1))) (and (= .cse0 77) (= (store |v_#memory_int_3245| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:18,546 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 78) [2019-05-15 10:37:18,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 16 treesize of output 11 [2019-05-15 10:37:18,634 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:18,642 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:18,642 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:18,642 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:18,650 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:18,650 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3246|]. (let ((.cse0 (select |v_#memory_int_3246| ULTIMATE.start_main_p1))) (and (= .cse0 78) (= (store |v_#memory_int_3246| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:18,650 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 79) [2019-05-15 10:37:18,719 INFO L273 TraceCheckUtils]: 0: Hoare triple {27664#true} havoc main_p1; {27664#true} is VALID [2019-05-15 10:37:18,720 INFO L273 TraceCheckUtils]: 1: Hoare triple {27664#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {27664#true} is VALID [2019-05-15 10:37:18,720 INFO L273 TraceCheckUtils]: 2: Hoare triple {27664#true} #memory_int := #memory_int[main_p1 := 0]; {27675#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:37:18,721 INFO L273 TraceCheckUtils]: 3: Hoare triple {27675#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27679#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:37:18,722 INFO L273 TraceCheckUtils]: 4: Hoare triple {27679#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27683#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:37:18,722 INFO L273 TraceCheckUtils]: 5: Hoare triple {27683#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27687#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:37:18,723 INFO L273 TraceCheckUtils]: 6: Hoare triple {27687#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27691#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:37:18,724 INFO L273 TraceCheckUtils]: 7: Hoare triple {27691#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27695#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:37:18,725 INFO L273 TraceCheckUtils]: 8: Hoare triple {27695#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27699#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:37:18,725 INFO L273 TraceCheckUtils]: 9: Hoare triple {27699#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27703#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:37:18,726 INFO L273 TraceCheckUtils]: 10: Hoare triple {27703#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27707#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:37:18,727 INFO L273 TraceCheckUtils]: 11: Hoare triple {27707#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27711#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:37:18,728 INFO L273 TraceCheckUtils]: 12: Hoare triple {27711#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27715#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:37:18,728 INFO L273 TraceCheckUtils]: 13: Hoare triple {27715#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27719#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:37:18,729 INFO L273 TraceCheckUtils]: 14: Hoare triple {27719#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27723#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:37:18,730 INFO L273 TraceCheckUtils]: 15: Hoare triple {27723#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27727#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:37:18,731 INFO L273 TraceCheckUtils]: 16: Hoare triple {27727#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27731#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:37:18,731 INFO L273 TraceCheckUtils]: 17: Hoare triple {27731#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27735#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:37:18,732 INFO L273 TraceCheckUtils]: 18: Hoare triple {27735#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27739#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:37:18,733 INFO L273 TraceCheckUtils]: 19: Hoare triple {27739#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27743#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:37:18,734 INFO L273 TraceCheckUtils]: 20: Hoare triple {27743#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27747#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:37:18,734 INFO L273 TraceCheckUtils]: 21: Hoare triple {27747#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27751#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:37:18,735 INFO L273 TraceCheckUtils]: 22: Hoare triple {27751#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27755#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:37:18,736 INFO L273 TraceCheckUtils]: 23: Hoare triple {27755#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27759#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:37:18,737 INFO L273 TraceCheckUtils]: 24: Hoare triple {27759#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27763#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:37:18,737 INFO L273 TraceCheckUtils]: 25: Hoare triple {27763#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27767#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:37:18,738 INFO L273 TraceCheckUtils]: 26: Hoare triple {27767#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27771#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:37:18,739 INFO L273 TraceCheckUtils]: 27: Hoare triple {27771#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27775#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:37:18,740 INFO L273 TraceCheckUtils]: 28: Hoare triple {27775#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27779#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:37:18,740 INFO L273 TraceCheckUtils]: 29: Hoare triple {27779#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27783#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:37:18,741 INFO L273 TraceCheckUtils]: 30: Hoare triple {27783#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27787#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:37:18,742 INFO L273 TraceCheckUtils]: 31: Hoare triple {27787#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27791#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:37:18,743 INFO L273 TraceCheckUtils]: 32: Hoare triple {27791#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27795#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:37:18,743 INFO L273 TraceCheckUtils]: 33: Hoare triple {27795#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27799#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:37:18,744 INFO L273 TraceCheckUtils]: 34: Hoare triple {27799#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27803#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:37:18,745 INFO L273 TraceCheckUtils]: 35: Hoare triple {27803#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27807#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:37:18,745 INFO L273 TraceCheckUtils]: 36: Hoare triple {27807#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27811#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:37:18,746 INFO L273 TraceCheckUtils]: 37: Hoare triple {27811#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27815#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:37:18,747 INFO L273 TraceCheckUtils]: 38: Hoare triple {27815#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27819#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:37:18,748 INFO L273 TraceCheckUtils]: 39: Hoare triple {27819#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27823#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:37:18,748 INFO L273 TraceCheckUtils]: 40: Hoare triple {27823#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27827#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:37:18,749 INFO L273 TraceCheckUtils]: 41: Hoare triple {27827#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27831#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:37:18,750 INFO L273 TraceCheckUtils]: 42: Hoare triple {27831#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27835#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:37:18,751 INFO L273 TraceCheckUtils]: 43: Hoare triple {27835#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27839#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:37:18,751 INFO L273 TraceCheckUtils]: 44: Hoare triple {27839#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27843#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:37:18,752 INFO L273 TraceCheckUtils]: 45: Hoare triple {27843#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27847#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:37:18,753 INFO L273 TraceCheckUtils]: 46: Hoare triple {27847#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27851#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:37:18,754 INFO L273 TraceCheckUtils]: 47: Hoare triple {27851#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27855#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:37:18,754 INFO L273 TraceCheckUtils]: 48: Hoare triple {27855#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27859#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:37:18,755 INFO L273 TraceCheckUtils]: 49: Hoare triple {27859#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27863#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:37:18,756 INFO L273 TraceCheckUtils]: 50: Hoare triple {27863#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27867#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:37:18,757 INFO L273 TraceCheckUtils]: 51: Hoare triple {27867#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27871#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:37:18,757 INFO L273 TraceCheckUtils]: 52: Hoare triple {27871#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27875#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:37:18,758 INFO L273 TraceCheckUtils]: 53: Hoare triple {27875#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27879#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:37:18,759 INFO L273 TraceCheckUtils]: 54: Hoare triple {27879#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27883#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:37:18,760 INFO L273 TraceCheckUtils]: 55: Hoare triple {27883#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27887#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:37:18,760 INFO L273 TraceCheckUtils]: 56: Hoare triple {27887#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27891#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:37:18,761 INFO L273 TraceCheckUtils]: 57: Hoare triple {27891#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27895#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:37:18,762 INFO L273 TraceCheckUtils]: 58: Hoare triple {27895#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27899#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:37:18,763 INFO L273 TraceCheckUtils]: 59: Hoare triple {27899#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27903#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:37:18,763 INFO L273 TraceCheckUtils]: 60: Hoare triple {27903#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27907#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:37:18,764 INFO L273 TraceCheckUtils]: 61: Hoare triple {27907#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27911#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:37:18,765 INFO L273 TraceCheckUtils]: 62: Hoare triple {27911#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27915#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:37:18,766 INFO L273 TraceCheckUtils]: 63: Hoare triple {27915#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27919#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:37:18,766 INFO L273 TraceCheckUtils]: 64: Hoare triple {27919#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27923#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:37:18,767 INFO L273 TraceCheckUtils]: 65: Hoare triple {27923#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27927#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:37:18,768 INFO L273 TraceCheckUtils]: 66: Hoare triple {27927#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27931#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} is VALID [2019-05-15 10:37:18,769 INFO L273 TraceCheckUtils]: 67: Hoare triple {27931#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27935#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} is VALID [2019-05-15 10:37:18,769 INFO L273 TraceCheckUtils]: 68: Hoare triple {27935#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27939#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} is VALID [2019-05-15 10:37:18,770 INFO L273 TraceCheckUtils]: 69: Hoare triple {27939#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27943#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} is VALID [2019-05-15 10:37:18,771 INFO L273 TraceCheckUtils]: 70: Hoare triple {27943#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27947#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} is VALID [2019-05-15 10:37:18,772 INFO L273 TraceCheckUtils]: 71: Hoare triple {27947#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27951#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} is VALID [2019-05-15 10:37:18,772 INFO L273 TraceCheckUtils]: 72: Hoare triple {27951#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27955#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} is VALID [2019-05-15 10:37:18,773 INFO L273 TraceCheckUtils]: 73: Hoare triple {27955#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27959#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} is VALID [2019-05-15 10:37:18,774 INFO L273 TraceCheckUtils]: 74: Hoare triple {27959#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27963#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} is VALID [2019-05-15 10:37:18,774 INFO L273 TraceCheckUtils]: 75: Hoare triple {27963#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27967#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} is VALID [2019-05-15 10:37:18,775 INFO L273 TraceCheckUtils]: 76: Hoare triple {27967#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27971#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} is VALID [2019-05-15 10:37:18,776 INFO L273 TraceCheckUtils]: 77: Hoare triple {27971#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27975#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} is VALID [2019-05-15 10:37:18,777 INFO L273 TraceCheckUtils]: 78: Hoare triple {27975#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27979#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} is VALID [2019-05-15 10:37:18,777 INFO L273 TraceCheckUtils]: 79: Hoare triple {27979#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27983#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} is VALID [2019-05-15 10:37:18,778 INFO L273 TraceCheckUtils]: 80: Hoare triple {27983#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27987#(= (select |#memory_int| ULTIMATE.start_main_p1) 78)} is VALID [2019-05-15 10:37:18,779 INFO L273 TraceCheckUtils]: 81: Hoare triple {27987#(= (select |#memory_int| ULTIMATE.start_main_p1) 78)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27991#(= (select |#memory_int| ULTIMATE.start_main_p1) 79)} is VALID [2019-05-15 10:37:18,780 INFO L273 TraceCheckUtils]: 82: Hoare triple {27991#(= (select |#memory_int| ULTIMATE.start_main_p1) 79)} assume !(#memory_int[main_p1] >= 0); {27665#false} is VALID [2019-05-15 10:37:18,788 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:37:18,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:37:18,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-05-15 10:37:18,788 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 83 [2019-05-15 10:37:18,788 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:37:18,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 82 states. [2019-05-15 10:37:18,853 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:37:18,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-05-15 10:37:18,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-05-15 10:37:18,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2019-05-15 10:37:18,854 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 82 states. [2019-05-15 10:37:31,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:37:31,911 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-05-15 10:37:31,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-05-15 10:37:31,911 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 83 [2019-05-15 10:37:31,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:37:31,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-05-15 10:37:31,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2019-05-15 10:37:31,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-05-15 10:37:31,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2019-05-15 10:37:31,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 82 states and 86 transitions. [2019-05-15 10:37:31,985 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:31,986 INFO L225 Difference]: With dead ends: 85 [2019-05-15 10:37:31,986 INFO L226 Difference]: Without dead ends: 85 [2019-05-15 10:37:31,987 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2019-05-15 10:37:31,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-05-15 10:37:31,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-05-15 10:37:31,988 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:37:31,988 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 85 states. [2019-05-15 10:37:31,988 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 85 states. [2019-05-15 10:37:31,988 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 85 states. [2019-05-15 10:37:31,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:37:31,989 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-05-15 10:37:31,989 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-05-15 10:37:31,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:37:31,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:37:31,989 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 85 states. [2019-05-15 10:37:31,989 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 85 states. [2019-05-15 10:37:31,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:37:31,990 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-05-15 10:37:31,990 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-05-15 10:37:31,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:37:31,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:37:31,990 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:37:31,990 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:37:31,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-05-15 10:37:31,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-05-15 10:37:31,991 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-05-15 10:37:31,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:37:31,991 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-05-15 10:37:31,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-05-15 10:37:31,991 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-05-15 10:37:31,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-05-15 10:37:31,992 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:37:31,992 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1, 1, 1] [2019-05-15 10:37:31,992 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:37:31,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:37:31,992 INFO L82 PathProgramCache]: Analyzing trace with hash -111870584, now seen corresponding path program 80 times [2019-05-15 10:37:31,993 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:37:32,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:37:32,031 WARN L254 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 82 conjunts are in the unsatisfiable core [2019-05-15 10:37:32,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:37:32,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:37:32,063 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:32,063 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,066 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:32,067 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,067 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:37:32,069 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:32,069 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3247|]. (= (store |v_#memory_int_3247| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:37:32,069 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:37:32,088 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:32,088 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,090 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:32,091 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,091 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:32,098 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:32,099 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3248|]. (let ((.cse0 (select |v_#memory_int_3248| ULTIMATE.start_main_p1))) (and (= .cse0 0) (= |#memory_int| (store |v_#memory_int_3248| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:32,099 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:37:32,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 16 treesize of output 11 [2019-05-15 10:37:32,109 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:32,112 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,112 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:32,120 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:32,120 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3249|]. (let ((.cse0 (select |v_#memory_int_3249| ULTIMATE.start_main_p1))) (and (= .cse0 1) (= |#memory_int| (store |v_#memory_int_3249| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:32,120 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:37:32,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 16 treesize of output 11 [2019-05-15 10:37:32,131 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,133 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:32,133 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,133 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:32,141 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:32,141 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3250|]. (let ((.cse0 (select |v_#memory_int_3250| ULTIMATE.start_main_p1))) (and (= 2 .cse0) (= |#memory_int| (store |v_#memory_int_3250| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:32,141 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:37:32,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 16 treesize of output 11 [2019-05-15 10:37:32,154 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,156 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:32,157 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,157 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:32,165 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:32,165 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3251|]. (let ((.cse0 (select |v_#memory_int_3251| ULTIMATE.start_main_p1))) (and (= .cse0 3) (= (store |v_#memory_int_3251| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:32,165 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:37:32,178 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [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,180 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:32,181 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,181 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:32,188 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:32,189 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3252|]. (let ((.cse0 (select |v_#memory_int_3252| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3252| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 4 .cse0))) [2019-05-15 10:37:32,189 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:37:32,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 16 treesize of output 11 [2019-05-15 10:37:32,204 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,206 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:32,207 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,207 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:32,214 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:32,214 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3253|]. (let ((.cse0 (select |v_#memory_int_3253| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3253| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 5 .cse0))) [2019-05-15 10:37:32,214 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:37:32,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 16 treesize of output 11 [2019-05-15 10:37:32,228 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,230 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:32,231 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,231 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:32,238 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:32,238 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3254|]. (let ((.cse0 (select |v_#memory_int_3254| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3254| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 6))) [2019-05-15 10:37:32,238 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:37:32,255 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:32,256 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,258 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:32,258 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,258 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:32,265 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:32,265 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3255|]. (let ((.cse0 (select |v_#memory_int_3255| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3255| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 7 .cse0))) [2019-05-15 10:37:32,266 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:37:32,280 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:32,281 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,283 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:32,283 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,283 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:32,290 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:32,291 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3256|]. (let ((.cse0 (select |v_#memory_int_3256| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3256| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 8))) [2019-05-15 10:37:32,291 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:37:32,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 16 treesize of output 11 [2019-05-15 10:37:32,309 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,311 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:32,311 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,311 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:32,318 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:32,318 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3257|]. (let ((.cse0 (select |v_#memory_int_3257| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3257| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 9))) [2019-05-15 10:37:32,318 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:37:32,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:32,341 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,343 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:32,343 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,343 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:32,350 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:32,350 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3258|]. (let ((.cse0 (select |v_#memory_int_3258| ULTIMATE.start_main_p1))) (and (= 10 .cse0) (= (store |v_#memory_int_3258| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:32,350 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:37: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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:32,368 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,370 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:32,371 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,371 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [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_#memory_int_3259|]. (let ((.cse0 (select |v_#memory_int_3259| ULTIMATE.start_main_p1))) (and (= .cse0 11) (= (store |v_#memory_int_3259| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:32,378 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:37:32,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 16 treesize of output 11 [2019-05-15 10:37:32,398 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,400 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:32,401 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,401 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:32,408 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:32,408 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3260|]. (let ((.cse0 (select |v_#memory_int_3260| ULTIMATE.start_main_p1))) (and (= 12 .cse0) (= |#memory_int| (store |v_#memory_int_3260| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:32,408 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:37:32,427 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:32,428 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,430 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:32,431 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,431 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:32,438 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:32,438 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3261|]. (let ((.cse0 (select |v_#memory_int_3261| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3261| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 13))) [2019-05-15 10:37:32,438 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:37:32,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 16 treesize of output 11 [2019-05-15 10:37:32,459 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,461 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:32,461 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,461 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:32,468 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:32,468 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3262|]. (let ((.cse0 (select |v_#memory_int_3262| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3262| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 14 .cse0))) [2019-05-15 10:37:32,469 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:37:32,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 16 treesize of output 11 [2019-05-15 10:37:32,493 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,495 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:32,495 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,495 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:32,503 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:32,503 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3263|]. (let ((.cse0 (select |v_#memory_int_3263| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3263| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 15 .cse0))) [2019-05-15 10:37:32,503 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:37:32,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:32,525 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,527 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:32,527 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,528 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:32,535 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:32,535 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3264|]. (let ((.cse0 (select |v_#memory_int_3264| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3264| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 16))) [2019-05-15 10:37:32,535 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:37:32,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:32,560 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,562 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:32,563 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,563 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:32,570 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:32,571 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3265|]. (let ((.cse0 (select |v_#memory_int_3265| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3265| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 17))) [2019-05-15 10:37:32,571 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:37:32,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:32,596 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,598 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:32,598 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,598 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:32,605 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:32,605 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3266|]. (let ((.cse0 (select |v_#memory_int_3266| ULTIMATE.start_main_p1))) (and (= .cse0 18) (= (store |v_#memory_int_3266| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:32,605 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:37:32,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 16 treesize of output 11 [2019-05-15 10:37:32,629 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,631 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:32,631 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,631 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:32,639 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:32,639 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3267|]. (let ((.cse0 (select |v_#memory_int_3267| ULTIMATE.start_main_p1))) (and (= 19 .cse0) (= (store |v_#memory_int_3267| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:32,639 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:37:32,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 16 treesize of output 11 [2019-05-15 10:37:32,667 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,669 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:32,670 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,670 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:32,677 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:32,677 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3268|]. (let ((.cse0 (select |v_#memory_int_3268| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3268| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 20 .cse0))) [2019-05-15 10:37:32,677 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:37:32,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 16 treesize of output 11 [2019-05-15 10:37:32,709 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,711 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:32,712 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,712 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:32,719 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:32,720 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3269|]. (let ((.cse0 (select |v_#memory_int_3269| ULTIMATE.start_main_p1))) (and (= .cse0 21) (= |#memory_int| (store |v_#memory_int_3269| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:32,720 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:37:32,756 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:32,756 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,758 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:32,759 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,759 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:32,767 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:32,767 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3270|]. (let ((.cse0 (select |v_#memory_int_3270| ULTIMATE.start_main_p1))) (and (= 22 .cse0) (= (store |v_#memory_int_3270| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:32,767 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:37:32,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 16 treesize of output 11 [2019-05-15 10:37:32,794 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,796 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:32,796 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,796 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:32,803 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:32,803 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3271|]. (let ((.cse0 (select |v_#memory_int_3271| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3271| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 23))) [2019-05-15 10:37:32,803 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:37:32,831 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:32,832 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,834 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:32,834 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,834 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:32,841 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:32,841 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3272|]. (let ((.cse0 (select |v_#memory_int_3272| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3272| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 24 .cse0))) [2019-05-15 10:37:32,841 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:37:32,868 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:32,869 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,871 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:32,872 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,872 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:32,879 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:32,879 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3273|]. (let ((.cse0 (select |v_#memory_int_3273| ULTIMATE.start_main_p1))) (and (= .cse0 25) (= |#memory_int| (store |v_#memory_int_3273| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:32,879 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:37:32,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:32,909 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,911 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:32,911 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,911 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:32,919 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:32,919 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3274|]. (let ((.cse0 (select |v_#memory_int_3274| ULTIMATE.start_main_p1))) (and (= 26 .cse0) (= (store |v_#memory_int_3274| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:32,919 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:37:32,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:32,948 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,950 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:32,950 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,950 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:32,958 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:32,958 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3275|]. (let ((.cse0 (select |v_#memory_int_3275| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3275| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 27 .cse0))) [2019-05-15 10:37:32,958 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:37:32,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:32,989 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,990 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:32,991 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:32,991 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:32,998 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:32,998 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3276|]. (let ((.cse0 (select |v_#memory_int_3276| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3276| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 28))) [2019-05-15 10:37:32,998 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:37:33,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 16 treesize of output 11 [2019-05-15 10:37:33,031 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:33,033 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:33,033 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:33,033 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:33,041 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:33,041 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3277|]. (let ((.cse0 (select |v_#memory_int_3277| ULTIMATE.start_main_p1))) (and (= 29 .cse0) (= |#memory_int| (store |v_#memory_int_3277| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:33,041 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:37:33,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:33,075 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:33,077 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:33,077 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:33,078 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:33,086 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:33,086 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3278|]. (let ((.cse0 (select |v_#memory_int_3278| ULTIMATE.start_main_p1))) (and (= 30 .cse0) (= |#memory_int| (store |v_#memory_int_3278| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:33,086 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:37:33,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 16 treesize of output 11 [2019-05-15 10:37:33,121 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:33,123 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:33,123 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:33,123 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:33,131 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:33,132 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3279|]. (let ((.cse0 (select |v_#memory_int_3279| ULTIMATE.start_main_p1))) (and (= .cse0 31) (= (store |v_#memory_int_3279| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:33,132 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:37:33,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 16 treesize of output 11 [2019-05-15 10:37:33,166 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:33,168 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:33,168 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:33,168 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:33,175 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:33,176 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3280|]. (let ((.cse0 (select |v_#memory_int_3280| ULTIMATE.start_main_p1))) (and (= 32 .cse0) (= (store |v_#memory_int_3280| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:33,176 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:37:33,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 16 treesize of output 11 [2019-05-15 10:37:33,210 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:33,212 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:33,212 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:33,213 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:33,220 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:33,220 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3281|]. (let ((.cse0 (select |v_#memory_int_3281| ULTIMATE.start_main_p1))) (and (= .cse0 33) (= (store |v_#memory_int_3281| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:33,221 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:37:33,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 16 treesize of output 11 [2019-05-15 10:37:33,255 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:33,257 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:33,257 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:33,257 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:33,265 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:33,265 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3282|]. (let ((.cse0 (select |v_#memory_int_3282| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3282| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 34))) [2019-05-15 10:37:33,265 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:37:33,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 16 treesize of output 11 [2019-05-15 10:37:33,302 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:33,304 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:33,304 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:33,305 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:33,312 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:33,313 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3283|]. (let ((.cse0 (select |v_#memory_int_3283| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3283| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 35))) [2019-05-15 10:37:33,313 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:37: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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:33,351 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:33,353 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 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 1 xjuncts. [2019-05-15 10:37:33,354 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:33,361 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:33,361 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3284|]. (let ((.cse0 (select |v_#memory_int_3284| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3284| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 36 .cse0))) [2019-05-15 10:37:33,361 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:37:33,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:33,400 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:33,402 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:33,402 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:33,402 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:33,410 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:33,410 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3285|]. (let ((.cse0 (select |v_#memory_int_3285| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3285| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 37 .cse0))) [2019-05-15 10:37:33,410 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:37:33,453 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:33,454 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:33,456 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:33,456 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:33,457 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:33,463 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:33,463 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3286|]. (let ((.cse0 (select |v_#memory_int_3286| ULTIMATE.start_main_p1))) (and (= 38 .cse0) (= |#memory_int| (store |v_#memory_int_3286| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:33,463 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:37:33,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 16 treesize of output 11 [2019-05-15 10:37:33,504 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:33,506 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:33,506 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:33,506 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:33,512 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:33,512 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3287|]. (let ((.cse0 (select |v_#memory_int_3287| ULTIMATE.start_main_p1))) (and (= .cse0 39) (= |#memory_int| (store |v_#memory_int_3287| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:33,512 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:37:33,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 16 treesize of output 11 [2019-05-15 10:37:33,552 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:33,554 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:33,554 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:33,555 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:33,562 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:33,562 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3288|]. (let ((.cse0 (select |v_#memory_int_3288| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3288| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 40))) [2019-05-15 10:37:33,562 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:37:33,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:33,604 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:33,606 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:33,606 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:33,606 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:33,613 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:33,614 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3289|]. (let ((.cse0 (select |v_#memory_int_3289| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3289| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 41))) [2019-05-15 10:37:33,614 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:37:33,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:33,656 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:33,658 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:33,658 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:33,658 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:33,665 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:33,666 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3290|]. (let ((.cse0 (select |v_#memory_int_3290| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3290| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 42))) [2019-05-15 10:37:33,666 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:37:33,711 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:33,712 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:33,714 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:33,714 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:33,714 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:33,722 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:33,722 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3291|]. (let ((.cse0 (select |v_#memory_int_3291| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3291| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 43))) [2019-05-15 10:37:33,722 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:37:33,764 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:33,765 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:33,767 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:33,768 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:33,768 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:33,775 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:33,775 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3292|]. (let ((.cse0 (select |v_#memory_int_3292| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3292| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 44 .cse0))) [2019-05-15 10:37:33,775 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:37:33,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 16 treesize of output 11 [2019-05-15 10:37:33,819 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:33,821 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:33,822 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:33,822 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:33,829 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:33,830 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3293|]. (let ((.cse0 (select |v_#memory_int_3293| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3293| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 45 .cse0))) [2019-05-15 10:37:33,830 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:37:33,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:33,876 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:33,878 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:33,878 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:33,878 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:33,884 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:33,885 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3294|]. (let ((.cse0 (select |v_#memory_int_3294| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3294| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 46))) [2019-05-15 10:37:33,885 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:37:33,929 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:33,930 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:33,932 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:33,932 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:33,932 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:33,940 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:33,940 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3295|]. (let ((.cse0 (select |v_#memory_int_3295| ULTIMATE.start_main_p1))) (and (= .cse0 47) (= (store |v_#memory_int_3295| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:33,940 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:37:33,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 16 treesize of output 11 [2019-05-15 10:37:33,988 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:33,990 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:33,990 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:33,990 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:33,998 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:33,998 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3296|]. (let ((.cse0 (select |v_#memory_int_3296| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3296| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 48))) [2019-05-15 10:37:33,998 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:37:34,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 16 treesize of output 11 [2019-05-15 10:37:34,044 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:34,046 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:34,046 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:34,046 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:34,053 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:34,054 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3297|]. (let ((.cse0 (select |v_#memory_int_3297| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3297| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 49 .cse0))) [2019-05-15 10:37:34,054 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:37:34,102 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:34,103 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:34,105 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:34,105 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:34,105 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:34,113 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:34,113 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3298|]. (let ((.cse0 (select |v_#memory_int_3298| ULTIMATE.start_main_p1))) (and (= 50 .cse0) (= (store |v_#memory_int_3298| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:34,113 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:37:34,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 16 treesize of output 11 [2019-05-15 10:37:34,169 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:34,170 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:34,170 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:34,171 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:34,178 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:34,178 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3299|]. (let ((.cse0 (select |v_#memory_int_3299| ULTIMATE.start_main_p1))) (and (= .cse0 51) (= (store |v_#memory_int_3299| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:34,178 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:37:34,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 16 treesize of output 11 [2019-05-15 10:37:34,227 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:34,229 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:34,230 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:34,230 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:34,238 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:34,238 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3300|]. (let ((.cse0 (select |v_#memory_int_3300| ULTIMATE.start_main_p1))) (and (= 52 .cse0) (= (store |v_#memory_int_3300| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:34,238 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:37:34,286 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:34,287 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:34,289 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:34,289 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:34,289 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:34,297 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:34,297 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3301|]. (let ((.cse0 (select |v_#memory_int_3301| ULTIMATE.start_main_p1))) (and (= 53 .cse0) (= |#memory_int| (store |v_#memory_int_3301| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:34,297 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:37:34,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:34,350 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:34,352 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:34,352 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:34,353 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:34,360 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:34,360 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3302|]. (let ((.cse0 (select |v_#memory_int_3302| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3302| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 54 .cse0))) [2019-05-15 10:37:34,360 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:37:34,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:34,413 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:34,415 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:34,415 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:34,415 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:34,425 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:34,425 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3303|]. (let ((.cse0 (select |v_#memory_int_3303| ULTIMATE.start_main_p1))) (and (= .cse0 55) (= |#memory_int| (store |v_#memory_int_3303| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:34,425 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:37:34,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 16 treesize of output 11 [2019-05-15 10:37:34,482 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:34,484 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:34,484 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:34,484 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:34,492 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:34,492 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3304|]. (let ((.cse0 (select |v_#memory_int_3304| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3304| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 56))) [2019-05-15 10:37:34,492 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:37:34,547 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:34,548 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:34,550 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:34,550 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:34,550 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:34,557 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:34,557 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3305|]. (let ((.cse0 (select |v_#memory_int_3305| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3305| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 57))) [2019-05-15 10:37:34,557 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:37:34,611 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:34,612 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:34,614 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:34,614 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:34,615 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:34,622 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:34,622 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3306|]. (let ((.cse0 (select |v_#memory_int_3306| ULTIMATE.start_main_p1))) (and (= 58 .cse0) (= (store |v_#memory_int_3306| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:34,622 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:37:34,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:34,681 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:34,683 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:34,684 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:34,684 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:34,691 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:34,691 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3307|]. (let ((.cse0 (select |v_#memory_int_3307| ULTIMATE.start_main_p1))) (and (= 59 .cse0) (= (store |v_#memory_int_3307| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:34,692 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:37:34,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 16 treesize of output 11 [2019-05-15 10:37:34,748 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:34,750 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:34,750 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:34,751 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:34,757 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:34,757 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3308|]. (let ((.cse0 (select |v_#memory_int_3308| ULTIMATE.start_main_p1))) (and (= .cse0 60) (= (store |v_#memory_int_3308| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:34,757 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:37:34,811 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:34,812 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:34,814 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:34,814 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:34,815 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:34,822 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:34,822 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3309|]. (let ((.cse0 (select |v_#memory_int_3309| ULTIMATE.start_main_p1))) (and (= 61 .cse0) (= (store |v_#memory_int_3309| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:34,822 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:37:34,877 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:34,878 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:34,880 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:34,880 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:34,880 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:34,888 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:34,889 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3310|]. (let ((.cse0 (select |v_#memory_int_3310| ULTIMATE.start_main_p1))) (and (= 62 .cse0) (= (store |v_#memory_int_3310| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:34,889 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:37:34,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:34,948 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:34,951 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:34,951 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:34,951 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:34,959 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:34,959 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3311|]. (let ((.cse0 (select |v_#memory_int_3311| ULTIMATE.start_main_p1))) (and (= .cse0 63) (= |#memory_int| (store |v_#memory_int_3311| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:34,959 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 64) [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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [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,032 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:35,032 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,032 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:35,041 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:35,041 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3312|]. (let ((.cse0 (select |v_#memory_int_3312| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3312| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 64))) [2019-05-15 10:37:35,041 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 65) [2019-05-15 10:37:35,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:35,100 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,102 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:35,103 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,103 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:35,114 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:35,114 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3313|]. (let ((.cse0 (select |v_#memory_int_3313| ULTIMATE.start_main_p1))) (and (= 65 .cse0) (= (store |v_#memory_int_3313| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:35,114 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 66) [2019-05-15 10:37:35,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 16 treesize of output 11 [2019-05-15 10:37:35,181 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,183 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:35,183 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,183 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:35,190 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:35,190 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3314|]. (let ((.cse0 (select |v_#memory_int_3314| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3314| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 66 .cse0))) [2019-05-15 10:37:35,191 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 67) [2019-05-15 10:37:35,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:35,250 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,252 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:35,252 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,252 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:35,260 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:35,260 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3315|]. (let ((.cse0 (select |v_#memory_int_3315| ULTIMATE.start_main_p1))) (and (= 67 .cse0) (= (store |v_#memory_int_3315| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:35,260 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 68) [2019-05-15 10:37:35,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 16 treesize of output 11 [2019-05-15 10:37:35,324 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,326 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:35,327 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,327 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:35,336 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:35,336 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3316|]. (let ((.cse0 (select |v_#memory_int_3316| ULTIMATE.start_main_p1))) (and (= 68 .cse0) (= |#memory_int| (store |v_#memory_int_3316| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:35,336 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 69) [2019-05-15 10:37:35,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 16 treesize of output 11 [2019-05-15 10:37:35,398 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,400 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:35,400 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,400 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:35,408 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:35,408 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3317|]. (let ((.cse0 (select |v_#memory_int_3317| ULTIMATE.start_main_p1))) (and (= 69 .cse0) (= (store |v_#memory_int_3317| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:35,408 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 70) [2019-05-15 10:37:35,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 16 treesize of output 11 [2019-05-15 10:37:35,476 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,478 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:35,478 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,478 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:35,485 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:35,485 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3318|]. (let ((.cse0 (select |v_#memory_int_3318| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3318| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 70 .cse0))) [2019-05-15 10:37:35,485 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 71) [2019-05-15 10:37:35,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 16 treesize of output 11 [2019-05-15 10:37:35,551 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,553 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:35,554 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,554 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:35,562 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:35,562 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3319|]. (let ((.cse0 (select |v_#memory_int_3319| ULTIMATE.start_main_p1))) (and (= .cse0 71) (= (store |v_#memory_int_3319| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:35,562 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 72) [2019-05-15 10:37:35,626 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:35,627 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,629 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:35,629 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,629 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:35,636 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:35,636 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3320|]. (let ((.cse0 (select |v_#memory_int_3320| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3320| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 72 .cse0))) [2019-05-15 10:37:35,636 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 73) [2019-05-15 10:37:35,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:35,702 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,704 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:35,704 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,704 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:35,711 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:35,712 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3321|]. (let ((.cse0 (select |v_#memory_int_3321| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3321| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 73))) [2019-05-15 10:37:35,712 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 74) [2019-05-15 10:37:35,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 16 treesize of output 11 [2019-05-15 10:37:35,778 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,780 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:35,780 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,780 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:35,787 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:35,788 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3322|]. (let ((.cse0 (select |v_#memory_int_3322| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3322| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 74))) [2019-05-15 10:37:35,788 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 75) [2019-05-15 10:37:35,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 16 treesize of output 11 [2019-05-15 10:37:35,860 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,862 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:35,862 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,863 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:35,870 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:35,871 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3323|]. (let ((.cse0 (select |v_#memory_int_3323| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3323| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 75))) [2019-05-15 10:37:35,871 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 76) [2019-05-15 10:37:35,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:35,938 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,940 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:35,941 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,941 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:35,947 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:35,947 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3324|]. (let ((.cse0 (select |v_#memory_int_3324| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3324| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 76))) [2019-05-15 10:37:35,947 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 77) [2019-05-15 10:37:36,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:36,014 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:36,016 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:36,016 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:36,016 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:36,022 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:36,023 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3325|]. (let ((.cse0 (select |v_#memory_int_3325| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3325| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 77 .cse0))) [2019-05-15 10:37:36,023 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 78) [2019-05-15 10:37:36,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 16 treesize of output 11 [2019-05-15 10:37:36,092 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:36,094 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:36,094 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:36,094 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:36,101 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:36,102 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3326|]. (let ((.cse0 (select |v_#memory_int_3326| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3326| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 78 .cse0))) [2019-05-15 10:37:36,102 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 79) [2019-05-15 10:37:36,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:36,174 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:36,176 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:36,177 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:36,177 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:36,185 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:36,185 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3327|]. (let ((.cse0 (select |v_#memory_int_3327| ULTIMATE.start_main_p1))) (and (= .cse0 79) (= (store |v_#memory_int_3327| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:36,185 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 80) [2019-05-15 10:37:36,253 INFO L273 TraceCheckUtils]: 0: Hoare triple {28334#true} havoc main_p1; {28334#true} is VALID [2019-05-15 10:37:36,254 INFO L273 TraceCheckUtils]: 1: Hoare triple {28334#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {28334#true} is VALID [2019-05-15 10:37:36,254 INFO L273 TraceCheckUtils]: 2: Hoare triple {28334#true} #memory_int := #memory_int[main_p1 := 0]; {28345#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:37:36,255 INFO L273 TraceCheckUtils]: 3: Hoare triple {28345#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28349#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:37:36,255 INFO L273 TraceCheckUtils]: 4: Hoare triple {28349#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28353#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:37:36,256 INFO L273 TraceCheckUtils]: 5: Hoare triple {28353#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28357#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:37:36,257 INFO L273 TraceCheckUtils]: 6: Hoare triple {28357#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28361#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:37:36,258 INFO L273 TraceCheckUtils]: 7: Hoare triple {28361#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28365#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:37:36,258 INFO L273 TraceCheckUtils]: 8: Hoare triple {28365#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28369#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:37:36,259 INFO L273 TraceCheckUtils]: 9: Hoare triple {28369#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28373#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:37:36,260 INFO L273 TraceCheckUtils]: 10: Hoare triple {28373#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28377#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:37:36,261 INFO L273 TraceCheckUtils]: 11: Hoare triple {28377#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28381#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:37:36,261 INFO L273 TraceCheckUtils]: 12: Hoare triple {28381#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28385#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:37:36,262 INFO L273 TraceCheckUtils]: 13: Hoare triple {28385#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28389#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:37:36,263 INFO L273 TraceCheckUtils]: 14: Hoare triple {28389#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28393#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:37:36,264 INFO L273 TraceCheckUtils]: 15: Hoare triple {28393#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28397#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:37:36,264 INFO L273 TraceCheckUtils]: 16: Hoare triple {28397#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28401#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:37:36,265 INFO L273 TraceCheckUtils]: 17: Hoare triple {28401#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28405#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:37:36,266 INFO L273 TraceCheckUtils]: 18: Hoare triple {28405#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28409#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:37:36,266 INFO L273 TraceCheckUtils]: 19: Hoare triple {28409#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28413#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:37:36,267 INFO L273 TraceCheckUtils]: 20: Hoare triple {28413#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28417#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:37:36,268 INFO L273 TraceCheckUtils]: 21: Hoare triple {28417#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28421#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:37:36,269 INFO L273 TraceCheckUtils]: 22: Hoare triple {28421#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28425#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:37:36,269 INFO L273 TraceCheckUtils]: 23: Hoare triple {28425#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28429#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:37:36,270 INFO L273 TraceCheckUtils]: 24: Hoare triple {28429#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28433#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:37:36,271 INFO L273 TraceCheckUtils]: 25: Hoare triple {28433#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28437#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:37:36,272 INFO L273 TraceCheckUtils]: 26: Hoare triple {28437#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28441#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:37:36,272 INFO L273 TraceCheckUtils]: 27: Hoare triple {28441#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28445#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:37:36,273 INFO L273 TraceCheckUtils]: 28: Hoare triple {28445#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28449#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:37:36,274 INFO L273 TraceCheckUtils]: 29: Hoare triple {28449#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28453#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:37:36,275 INFO L273 TraceCheckUtils]: 30: Hoare triple {28453#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28457#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:37:36,275 INFO L273 TraceCheckUtils]: 31: Hoare triple {28457#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28461#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:37:36,276 INFO L273 TraceCheckUtils]: 32: Hoare triple {28461#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28465#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:37:36,277 INFO L273 TraceCheckUtils]: 33: Hoare triple {28465#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28469#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:37:36,278 INFO L273 TraceCheckUtils]: 34: Hoare triple {28469#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28473#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:37:36,278 INFO L273 TraceCheckUtils]: 35: Hoare triple {28473#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28477#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:37:36,279 INFO L273 TraceCheckUtils]: 36: Hoare triple {28477#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28481#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:37:36,280 INFO L273 TraceCheckUtils]: 37: Hoare triple {28481#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28485#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:37:36,281 INFO L273 TraceCheckUtils]: 38: Hoare triple {28485#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28489#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:37:36,281 INFO L273 TraceCheckUtils]: 39: Hoare triple {28489#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28493#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:37:36,282 INFO L273 TraceCheckUtils]: 40: Hoare triple {28493#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28497#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:37:36,283 INFO L273 TraceCheckUtils]: 41: Hoare triple {28497#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28501#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:37:36,284 INFO L273 TraceCheckUtils]: 42: Hoare triple {28501#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28505#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:37:36,284 INFO L273 TraceCheckUtils]: 43: Hoare triple {28505#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28509#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:37:36,285 INFO L273 TraceCheckUtils]: 44: Hoare triple {28509#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28513#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:37:36,286 INFO L273 TraceCheckUtils]: 45: Hoare triple {28513#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28517#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:37:36,287 INFO L273 TraceCheckUtils]: 46: Hoare triple {28517#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28521#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:37:36,287 INFO L273 TraceCheckUtils]: 47: Hoare triple {28521#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28525#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:37:36,288 INFO L273 TraceCheckUtils]: 48: Hoare triple {28525#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28529#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:37:36,289 INFO L273 TraceCheckUtils]: 49: Hoare triple {28529#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28533#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:37:36,290 INFO L273 TraceCheckUtils]: 50: Hoare triple {28533#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28537#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:37:36,290 INFO L273 TraceCheckUtils]: 51: Hoare triple {28537#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28541#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:37:36,291 INFO L273 TraceCheckUtils]: 52: Hoare triple {28541#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28545#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:37:36,292 INFO L273 TraceCheckUtils]: 53: Hoare triple {28545#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28549#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:37:36,293 INFO L273 TraceCheckUtils]: 54: Hoare triple {28549#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28553#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:37:36,293 INFO L273 TraceCheckUtils]: 55: Hoare triple {28553#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28557#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:37:36,294 INFO L273 TraceCheckUtils]: 56: Hoare triple {28557#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28561#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:37:36,295 INFO L273 TraceCheckUtils]: 57: Hoare triple {28561#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28565#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:37:36,296 INFO L273 TraceCheckUtils]: 58: Hoare triple {28565#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28569#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:37:36,296 INFO L273 TraceCheckUtils]: 59: Hoare triple {28569#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28573#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:37:36,297 INFO L273 TraceCheckUtils]: 60: Hoare triple {28573#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28577#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:37:36,298 INFO L273 TraceCheckUtils]: 61: Hoare triple {28577#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28581#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:37:36,299 INFO L273 TraceCheckUtils]: 62: Hoare triple {28581#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28585#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:37:36,299 INFO L273 TraceCheckUtils]: 63: Hoare triple {28585#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28589#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:37:36,300 INFO L273 TraceCheckUtils]: 64: Hoare triple {28589#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28593#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:37:36,301 INFO L273 TraceCheckUtils]: 65: Hoare triple {28593#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28597#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:37:36,302 INFO L273 TraceCheckUtils]: 66: Hoare triple {28597#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28601#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} is VALID [2019-05-15 10:37:36,302 INFO L273 TraceCheckUtils]: 67: Hoare triple {28601#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28605#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} is VALID [2019-05-15 10:37:36,303 INFO L273 TraceCheckUtils]: 68: Hoare triple {28605#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28609#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} is VALID [2019-05-15 10:37:36,304 INFO L273 TraceCheckUtils]: 69: Hoare triple {28609#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28613#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} is VALID [2019-05-15 10:37:36,305 INFO L273 TraceCheckUtils]: 70: Hoare triple {28613#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28617#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} is VALID [2019-05-15 10:37:36,305 INFO L273 TraceCheckUtils]: 71: Hoare triple {28617#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28621#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} is VALID [2019-05-15 10:37:36,306 INFO L273 TraceCheckUtils]: 72: Hoare triple {28621#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28625#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} is VALID [2019-05-15 10:37:36,307 INFO L273 TraceCheckUtils]: 73: Hoare triple {28625#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28629#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} is VALID [2019-05-15 10:37:36,308 INFO L273 TraceCheckUtils]: 74: Hoare triple {28629#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28633#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} is VALID [2019-05-15 10:37:36,308 INFO L273 TraceCheckUtils]: 75: Hoare triple {28633#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28637#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} is VALID [2019-05-15 10:37:36,309 INFO L273 TraceCheckUtils]: 76: Hoare triple {28637#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28641#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} is VALID [2019-05-15 10:37:36,310 INFO L273 TraceCheckUtils]: 77: Hoare triple {28641#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28645#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} is VALID [2019-05-15 10:37:36,311 INFO L273 TraceCheckUtils]: 78: Hoare triple {28645#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28649#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} is VALID [2019-05-15 10:37:36,311 INFO L273 TraceCheckUtils]: 79: Hoare triple {28649#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28653#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} is VALID [2019-05-15 10:37:36,312 INFO L273 TraceCheckUtils]: 80: Hoare triple {28653#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28657#(= (select |#memory_int| ULTIMATE.start_main_p1) 78)} is VALID [2019-05-15 10:37:36,313 INFO L273 TraceCheckUtils]: 81: Hoare triple {28657#(= (select |#memory_int| ULTIMATE.start_main_p1) 78)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28661#(= (select |#memory_int| ULTIMATE.start_main_p1) 79)} is VALID [2019-05-15 10:37:36,313 INFO L273 TraceCheckUtils]: 82: Hoare triple {28661#(= (select |#memory_int| ULTIMATE.start_main_p1) 79)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28665#(= (select |#memory_int| ULTIMATE.start_main_p1) 80)} is VALID [2019-05-15 10:37:36,314 INFO L273 TraceCheckUtils]: 83: Hoare triple {28665#(= (select |#memory_int| ULTIMATE.start_main_p1) 80)} assume !(#memory_int[main_p1] >= 0); {28335#false} is VALID [2019-05-15 10:37:36,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:37:36,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:37:36,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-05-15 10:37:36,324 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 84 [2019-05-15 10:37:36,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:37:36,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 83 states. [2019-05-15 10:37:36,390 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:37:36,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-05-15 10:37:36,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-05-15 10:37:36,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2019-05-15 10:37:36,391 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 83 states. [2019-05-15 10:37:49,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:37:49,767 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-05-15 10:37:49,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-05-15 10:37:49,768 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 84 [2019-05-15 10:37:49,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:37:49,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-05-15 10:37:49,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2019-05-15 10:37:49,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-05-15 10:37:49,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2019-05-15 10:37:49,769 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 83 states and 87 transitions. [2019-05-15 10:37:49,837 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:37:49,839 INFO L225 Difference]: With dead ends: 86 [2019-05-15 10:37:49,839 INFO L226 Difference]: Without dead ends: 86 [2019-05-15 10:37:49,839 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2019-05-15 10:37:49,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-05-15 10:37:49,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-05-15 10:37:49,840 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:37:49,840 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 86 states. [2019-05-15 10:37:49,840 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 86 states. [2019-05-15 10:37:49,840 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 86 states. [2019-05-15 10:37:49,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:37:49,841 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-05-15 10:37:49,841 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-05-15 10:37:49,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:37:49,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:37:49,842 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 86 states. [2019-05-15 10:37:49,842 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 86 states. [2019-05-15 10:37:49,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:37:49,842 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-05-15 10:37:49,843 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-05-15 10:37:49,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:37:49,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:37:49,843 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:37:49,843 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:37:49,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-05-15 10:37:49,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-05-15 10:37:49,844 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-05-15 10:37:49,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:37:49,844 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-05-15 10:37:49,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-05-15 10:37:49,844 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-05-15 10:37:49,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-05-15 10:37:49,844 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:37:49,844 INFO L399 BasicCegarLoop]: trace histogram [81, 1, 1, 1, 1] [2019-05-15 10:37:49,845 INFO L418 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:37:49,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:37:49,845 INFO L82 PathProgramCache]: Analyzing trace with hash 826979138, now seen corresponding path program 81 times [2019-05-15 10:37:49,845 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:37:49,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:37:49,884 WARN L254 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 83 conjunts are in the unsatisfiable core [2019-05-15 10:37:49,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:37:49,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:37:50,041 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:50,041 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:50,081 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:50,081 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:50,081 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:37:50,090 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:50,091 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3328|]. (= (store |v_#memory_int_3328| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:37:50,091 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:37:50,170 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:50,171 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:50,173 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:50,174 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:50,174 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:50,182 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:50,182 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3329|]. (let ((.cse0 (select |v_#memory_int_3329| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3329| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 0))) [2019-05-15 10:37:50,182 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:37:50,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 16 treesize of output 11 [2019-05-15 10:37:50,194 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:50,195 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:50,196 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:50,196 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:50,204 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:50,204 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3330|]. (let ((.cse0 (select |v_#memory_int_3330| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3330| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 1))) [2019-05-15 10:37:50,204 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:37:50,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 16 treesize of output 11 [2019-05-15 10:37:50,217 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:50,219 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:50,219 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:50,219 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:50,227 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:50,227 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3331|]. (let ((.cse0 (select |v_#memory_int_3331| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3331| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 2))) [2019-05-15 10:37:50,227 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:37:50,239 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:50,239 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:50,241 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:50,242 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:50,242 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:50,249 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:50,250 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3332|]. (let ((.cse0 (select |v_#memory_int_3332| ULTIMATE.start_main_p1))) (and (= .cse0 3) (= (store |v_#memory_int_3332| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:50,250 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:37:50,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 16 treesize of output 11 [2019-05-15 10:37:50,264 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:50,266 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:50,266 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:50,266 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:50,274 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:50,274 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3333|]. (let ((.cse0 (select |v_#memory_int_3333| ULTIMATE.start_main_p1))) (and (= 4 .cse0) (= (store |v_#memory_int_3333| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:50,274 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:37:50,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:50,370 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:50,396 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:50,396 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:50,397 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:50,412 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:50,413 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3334|]. (let ((.cse0 (select |v_#memory_int_3334| ULTIMATE.start_main_p1))) (and (= .cse0 5) (= (store |v_#memory_int_3334| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:50,413 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:37:50,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:50,707 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:50,709 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:50,709 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:50,709 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:50,716 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:50,717 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3335|]. (let ((.cse0 (select |v_#memory_int_3335| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3335| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 6))) [2019-05-15 10:37:50,717 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:37:50,733 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:50,734 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:50,736 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:50,736 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:50,736 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:50,743 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:50,743 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3336|]. (let ((.cse0 (select |v_#memory_int_3336| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3336| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 7))) [2019-05-15 10:37:50,743 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:37:50,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 16 treesize of output 11 [2019-05-15 10:37:50,760 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:50,762 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:50,762 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:50,763 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:50,770 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:50,770 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3337|]. (let ((.cse0 (select |v_#memory_int_3337| ULTIMATE.start_main_p1))) (and (= .cse0 8) (= (store |v_#memory_int_3337| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:50,771 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:37:50,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 16 treesize of output 11 [2019-05-15 10:37:50,788 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:50,790 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:50,790 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:50,791 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:50,798 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:50,798 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3338|]. (let ((.cse0 (select |v_#memory_int_3338| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3338| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 9))) [2019-05-15 10:37:50,798 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:37:50,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 16 treesize of output 11 [2019-05-15 10:37:50,819 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:50,821 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:50,821 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:50,821 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:50,828 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:50,829 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3339|]. (let ((.cse0 (select |v_#memory_int_3339| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3339| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 10))) [2019-05-15 10:37:50,829 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:37:50,846 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:50,847 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:50,849 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:50,849 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:50,849 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:50,856 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:50,856 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3340|]. (let ((.cse0 (select |v_#memory_int_3340| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3340| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 11 .cse0))) [2019-05-15 10:37:50,856 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:37:50,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:50,876 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:50,878 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:50,878 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:50,879 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:50,886 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:50,886 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3341|]. (let ((.cse0 (select |v_#memory_int_3341| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3341| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 12 .cse0))) [2019-05-15 10:37:50,886 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:37:50,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 16 treesize of output 11 [2019-05-15 10:37:50,905 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:50,907 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:50,907 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:50,907 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:50,914 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:50,915 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3342|]. (let ((.cse0 (select |v_#memory_int_3342| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3342| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 13 .cse0))) [2019-05-15 10:37:50,915 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:37:50,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:50,936 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:50,938 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:50,938 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:50,938 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:50,946 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:50,946 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3343|]. (let ((.cse0 (select |v_#memory_int_3343| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3343| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 14))) [2019-05-15 10:37:50,946 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:37:50,969 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:50,970 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:50,972 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:50,972 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:50,972 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:50,979 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:50,980 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3344|]. (let ((.cse0 (select |v_#memory_int_3344| ULTIMATE.start_main_p1))) (and (= 15 .cse0) (= (store |v_#memory_int_3344| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:50,980 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:37:51,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:51,002 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:51,004 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:51,004 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:51,004 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:51,011 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:51,012 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3345|]. (let ((.cse0 (select |v_#memory_int_3345| ULTIMATE.start_main_p1))) (and (= .cse0 16) (= (store |v_#memory_int_3345| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:51,012 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:37:51,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 16 treesize of output 11 [2019-05-15 10:37:51,035 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:51,037 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:51,037 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:51,037 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:51,044 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:51,044 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3346|]. (let ((.cse0 (select |v_#memory_int_3346| ULTIMATE.start_main_p1))) (and (= 17 .cse0) (= (store |v_#memory_int_3346| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:51,045 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:37:51,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 16 treesize of output 11 [2019-05-15 10:37:51,068 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:51,070 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:51,070 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:51,071 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:51,076 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:51,076 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3347|]. (let ((.cse0 (select |v_#memory_int_3347| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3347| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 18 .cse0))) [2019-05-15 10:37:51,077 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:37:51,100 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:51,101 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:51,103 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:51,103 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:51,103 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:51,109 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:51,109 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3348|]. (let ((.cse0 (select |v_#memory_int_3348| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3348| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 19))) [2019-05-15 10:37:51,109 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:37:51,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 16 treesize of output 11 [2019-05-15 10:37:51,134 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:51,136 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:51,136 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:51,136 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:51,144 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:51,144 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3349|]. (let ((.cse0 (select |v_#memory_int_3349| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3349| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 20))) [2019-05-15 10:37:51,144 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:37:51,168 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:51,169 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:51,171 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:51,171 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:51,172 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:51,179 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:51,179 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3350|]. (let ((.cse0 (select |v_#memory_int_3350| ULTIMATE.start_main_p1))) (and (= 21 .cse0) (= (store |v_#memory_int_3350| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:51,179 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:37:51,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:51,207 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:51,209 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:51,209 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:51,209 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:51,216 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:51,216 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3351|]. (let ((.cse0 (select |v_#memory_int_3351| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3351| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 22 .cse0))) [2019-05-15 10:37:51,217 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:37:51,244 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:51,245 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:51,247 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:51,247 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:51,247 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:51,255 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:51,255 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3352|]. (let ((.cse0 (select |v_#memory_int_3352| ULTIMATE.start_main_p1))) (and (= 23 .cse0) (= (store |v_#memory_int_3352| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:51,255 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:37:51,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 16 treesize of output 11 [2019-05-15 10:37:51,284 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:51,286 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:51,286 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:51,287 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:51,295 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:51,295 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3353|]. (let ((.cse0 (select |v_#memory_int_3353| ULTIMATE.start_main_p1))) (and (= 24 .cse0) (= (store |v_#memory_int_3353| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:51,295 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:37:51,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 16 treesize of output 11 [2019-05-15 10:37:51,325 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:51,327 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:51,327 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:51,328 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:51,335 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:51,335 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3354|]. (let ((.cse0 (select |v_#memory_int_3354| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3354| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 25))) [2019-05-15 10:37:51,335 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:37:51,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:51,366 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:51,368 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:51,368 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:51,369 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:51,375 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:51,375 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3355|]. (let ((.cse0 (select |v_#memory_int_3355| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3355| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 26))) [2019-05-15 10:37:51,376 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:37:51,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 16 treesize of output 11 [2019-05-15 10:37:51,406 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:51,408 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:51,408 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:51,408 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:51,416 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:51,416 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3356|]. (let ((.cse0 (select |v_#memory_int_3356| ULTIMATE.start_main_p1))) (and (= .cse0 27) (= (store |v_#memory_int_3356| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:51,416 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:37:51,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 16 treesize of output 11 [2019-05-15 10:37:51,448 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:51,450 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:51,450 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:51,450 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:51,457 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:51,457 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3357|]. (let ((.cse0 (select |v_#memory_int_3357| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3357| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 28 .cse0))) [2019-05-15 10:37:51,457 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:37:51,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:51,492 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:51,494 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:51,494 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:51,495 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:51,502 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:51,502 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3358|]. (let ((.cse0 (select |v_#memory_int_3358| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3358| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 29 .cse0))) [2019-05-15 10:37:51,502 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:37:51,541 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:51,542 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:51,544 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:51,545 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:51,545 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:51,552 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:51,552 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3359|]. (let ((.cse0 (select |v_#memory_int_3359| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3359| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 30 .cse0))) [2019-05-15 10:37:51,553 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:37:51,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 16 treesize of output 11 [2019-05-15 10:37:51,585 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:51,587 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:51,587 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:51,588 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:51,595 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:51,595 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3360|]. (let ((.cse0 (select |v_#memory_int_3360| ULTIMATE.start_main_p1))) (and (= .cse0 31) (= (store |v_#memory_int_3360| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:51,595 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:37:51,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 16 treesize of output 11 [2019-05-15 10:37:51,629 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:51,631 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:51,632 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:51,632 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:51,639 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:51,639 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3361|]. (let ((.cse0 (select |v_#memory_int_3361| ULTIMATE.start_main_p1))) (and (= 32 .cse0) (= (store |v_#memory_int_3361| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:51,639 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:37:51,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:51,672 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:51,674 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:51,674 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:51,674 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:51,682 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:51,682 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3362|]. (let ((.cse0 (select |v_#memory_int_3362| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3362| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 33 .cse0))) [2019-05-15 10:37:51,683 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:37:51,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 16 treesize of output 11 [2019-05-15 10:37:51,717 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:51,719 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:51,719 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:51,719 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:51,727 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:51,727 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3363|]. (let ((.cse0 (select |v_#memory_int_3363| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3363| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 34))) [2019-05-15 10:37:51,727 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:37:51,764 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:51,765 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:51,767 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:51,767 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:51,767 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:51,775 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:51,775 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3364|]. (let ((.cse0 (select |v_#memory_int_3364| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3364| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 35 .cse0))) [2019-05-15 10:37:51,775 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:37:51,811 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:51,812 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:51,814 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:51,814 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:51,814 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:51,823 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:51,823 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3365|]. (let ((.cse0 (select |v_#memory_int_3365| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3365| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 36))) [2019-05-15 10:37:51,823 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:37:51,861 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:51,862 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:51,864 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:51,865 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:51,865 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:51,872 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:51,873 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3366|]. (let ((.cse0 (select |v_#memory_int_3366| ULTIMATE.start_main_p1))) (and (= 37 .cse0) (= (store |v_#memory_int_3366| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:51,873 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:37:51,909 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:51,910 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:51,912 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:51,913 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:51,913 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:51,920 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:51,920 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3367|]. (let ((.cse0 (select |v_#memory_int_3367| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3367| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 38 .cse0))) [2019-05-15 10:37:51,920 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:37:51,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 16 treesize of output 11 [2019-05-15 10:37:51,961 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:51,963 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:51,963 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:51,964 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:51,971 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:51,971 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3368|]. (let ((.cse0 (select |v_#memory_int_3368| ULTIMATE.start_main_p1))) (and (= .cse0 39) (= (store |v_#memory_int_3368| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:51,971 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:37:52,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:52,014 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:52,016 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:52,016 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:52,017 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:52,025 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:52,025 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3369|]. (let ((.cse0 (select |v_#memory_int_3369| ULTIMATE.start_main_p1))) (and (= .cse0 40) (= (store |v_#memory_int_3369| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:52,025 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:37:52,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 16 treesize of output 11 [2019-05-15 10:37:52,067 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:52,069 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:52,069 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:52,069 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:52,077 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:52,077 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3370|]. (let ((.cse0 (select |v_#memory_int_3370| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3370| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 41))) [2019-05-15 10:37:52,077 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:37:52,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:52,122 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:52,124 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:52,124 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:52,124 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:52,132 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:52,132 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3371|]. (let ((.cse0 (select |v_#memory_int_3371| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3371| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 42))) [2019-05-15 10:37:52,132 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:37: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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:52,174 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:52,176 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:52,177 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:52,177 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:52,185 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:52,185 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3372|]. (let ((.cse0 (select |v_#memory_int_3372| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3372| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 43))) [2019-05-15 10:37:52,185 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:37:52,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:52,233 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:52,235 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:52,235 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:52,235 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:52,243 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:52,243 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3373|]. (let ((.cse0 (select |v_#memory_int_3373| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3373| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 44))) [2019-05-15 10:37:52,243 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:37:52,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:52,286 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:52,288 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:52,288 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:52,288 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:52,296 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:52,296 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3374|]. (let ((.cse0 (select |v_#memory_int_3374| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3374| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 45 .cse0))) [2019-05-15 10:37:52,296 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:37:52,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:52,339 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:52,341 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:52,342 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:52,342 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:52,349 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:52,349 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3375|]. (let ((.cse0 (select |v_#memory_int_3375| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3375| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 46))) [2019-05-15 10:37:52,349 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:37:52,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 16 treesize of output 11 [2019-05-15 10:37:52,395 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:52,397 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:52,397 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:52,398 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:52,405 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:52,405 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3376|]. (let ((.cse0 (select |v_#memory_int_3376| ULTIMATE.start_main_p1))) (and (= .cse0 47) (= (store |v_#memory_int_3376| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:52,406 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:37:52,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 16 treesize of output 11 [2019-05-15 10:37:52,451 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:52,453 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:52,453 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:52,453 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:52,461 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:52,461 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3377|]. (let ((.cse0 (select |v_#memory_int_3377| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3377| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 48))) [2019-05-15 10:37:52,461 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:37:52,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 16 treesize of output 11 [2019-05-15 10:37:52,511 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:52,513 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:52,513 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:52,514 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:52,522 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:52,522 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3378|]. (let ((.cse0 (select |v_#memory_int_3378| ULTIMATE.start_main_p1))) (and (= 49 .cse0) (= (store |v_#memory_int_3378| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:52,522 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:37:52,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 16 treesize of output 11 [2019-05-15 10:37:52,569 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:52,571 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:52,571 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:52,571 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:52,579 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:52,579 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3379|]. (let ((.cse0 (select |v_#memory_int_3379| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3379| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 50))) [2019-05-15 10:37:52,579 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:37:52,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 16 treesize of output 11 [2019-05-15 10:37:52,629 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:52,631 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:52,632 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:52,632 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:52,639 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:52,639 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3380|]. (let ((.cse0 (select |v_#memory_int_3380| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3380| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 51 .cse0))) [2019-05-15 10:37:52,639 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:37:52,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:52,689 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:52,691 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:52,691 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:52,692 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:52,700 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:52,700 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3381|]. (let ((.cse0 (select |v_#memory_int_3381| ULTIMATE.start_main_p1))) (and (= 52 .cse0) (= |#memory_int| (store |v_#memory_int_3381| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:52,701 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:37:52,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 16 treesize of output 11 [2019-05-15 10:37:52,752 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:52,754 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:52,754 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:52,755 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:52,761 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:52,761 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3382|]. (let ((.cse0 (select |v_#memory_int_3382| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3382| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 53))) [2019-05-15 10:37:52,761 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:37:52,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 16 treesize of output 11 [2019-05-15 10:37:52,813 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:52,815 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:52,815 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:52,815 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:52,823 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:52,823 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3383|]. (let ((.cse0 (select |v_#memory_int_3383| ULTIMATE.start_main_p1))) (and (= .cse0 54) (= |#memory_int| (store |v_#memory_int_3383| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:52,823 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:37:52,878 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:52,879 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:52,881 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:52,881 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:52,881 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:52,888 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:52,888 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3384|]. (let ((.cse0 (select |v_#memory_int_3384| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3384| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 55 .cse0))) [2019-05-15 10:37:52,888 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:37:52,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:52,941 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:52,943 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:52,943 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:52,943 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:52,950 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:52,950 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3385|]. (let ((.cse0 (select |v_#memory_int_3385| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3385| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 56 .cse0))) [2019-05-15 10:37:52,950 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:37:53,003 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:53,004 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,006 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:53,006 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,006 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:53,014 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:53,014 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3386|]. (let ((.cse0 (select |v_#memory_int_3386| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3386| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 57 .cse0))) [2019-05-15 10:37:53,014 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:37:53,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 16 treesize of output 11 [2019-05-15 10:37:53,068 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,070 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:53,070 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,070 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:53,077 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:53,078 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3387|]. (let ((.cse0 (select |v_#memory_int_3387| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3387| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 58))) [2019-05-15 10:37:53,078 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:37:53,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 16 treesize of output 11 [2019-05-15 10:37:53,131 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,133 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:53,133 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,133 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:53,141 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:53,141 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3388|]. (let ((.cse0 (select |v_#memory_int_3388| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3388| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 59 .cse0))) [2019-05-15 10:37:53,141 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:37:53,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 16 treesize of output 11 [2019-05-15 10:37:53,198 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,200 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:53,200 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,200 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:53,207 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:53,207 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3389|]. (let ((.cse0 (select |v_#memory_int_3389| ULTIMATE.start_main_p1))) (and (= 60 .cse0) (= (store |v_#memory_int_3389| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:53,207 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:37:53,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 16 treesize of output 11 [2019-05-15 10:37:53,263 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,265 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:53,266 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,266 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:53,273 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:53,273 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3390|]. (let ((.cse0 (select |v_#memory_int_3390| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3390| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 61))) [2019-05-15 10:37:53,273 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:37:53,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:53,331 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,333 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:53,333 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,333 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:53,341 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:53,341 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3391|]. (let ((.cse0 (select |v_#memory_int_3391| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3391| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 62))) [2019-05-15 10:37:53,341 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:37:53,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:53,400 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,402 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:53,402 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,402 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:53,411 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:53,411 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3392|]. (let ((.cse0 (select |v_#memory_int_3392| ULTIMATE.start_main_p1))) (and (= 63 .cse0) (= (store |v_#memory_int_3392| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:53,411 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 64) [2019-05-15 10:37:53,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:53,475 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,477 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:53,477 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,478 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:53,485 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:53,485 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3393|]. (let ((.cse0 (select |v_#memory_int_3393| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3393| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 64 .cse0))) [2019-05-15 10:37:53,485 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 65) [2019-05-15 10:37:53,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 16 treesize of output 11 [2019-05-15 10:37:53,544 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,546 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:53,547 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,547 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:53,556 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:53,557 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3394|]. (let ((.cse0 (select |v_#memory_int_3394| ULTIMATE.start_main_p1))) (and (= .cse0 65) (= (store |v_#memory_int_3394| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:53,557 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 66) [2019-05-15 10:37:53,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:53,620 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,622 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:53,622 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,622 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:53,629 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:53,630 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3395|]. (let ((.cse0 (select |v_#memory_int_3395| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3395| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 66 .cse0))) [2019-05-15 10:37:53,630 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 67) [2019-05-15 10:37:53,690 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:53,691 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,693 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:53,693 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,693 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:53,702 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:53,702 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3396|]. (let ((.cse0 (select |v_#memory_int_3396| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3396| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 67))) [2019-05-15 10:37:53,702 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 68) [2019-05-15 10:37:53,763 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:53,764 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,766 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:53,766 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,766 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:53,775 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:53,775 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3397|]. (let ((.cse0 (select |v_#memory_int_3397| ULTIMATE.start_main_p1))) (and (= .cse0 68) (= (store |v_#memory_int_3397| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:53,775 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 69) [2019-05-15 10:37:53,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 16 treesize of output 11 [2019-05-15 10:37:53,840 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,842 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:53,842 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,842 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:53,849 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:53,849 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3398|]. (let ((.cse0 (select |v_#memory_int_3398| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3398| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 69 .cse0))) [2019-05-15 10:37:53,850 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 70) [2019-05-15 10:37:53,912 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:53,913 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,915 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:53,915 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,916 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:53,923 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:53,924 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3399|]. (let ((.cse0 (select |v_#memory_int_3399| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3399| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 70 .cse0))) [2019-05-15 10:37:53,924 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 71) [2019-05-15 10:37:53,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 16 treesize of output 11 [2019-05-15 10:37:53,990 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,992 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:53,992 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,992 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:54,000 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:54,000 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3400|]. (let ((.cse0 (select |v_#memory_int_3400| ULTIMATE.start_main_p1))) (and (= 71 .cse0) (= (store |v_#memory_int_3400| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:54,001 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 72) [2019-05-15 10:37:54,068 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:54,069 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:54,071 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,071 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:54,078 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:54,079 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3401|]. (let ((.cse0 (select |v_#memory_int_3401| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3401| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 72))) [2019-05-15 10:37:54,079 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 73) [2019-05-15 10:37:54,149 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:54,150 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,152 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:54,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:54,153 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:54,160 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:54,161 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3402|]. (let ((.cse0 (select |v_#memory_int_3402| ULTIMATE.start_main_p1))) (and (= .cse0 73) (= |#memory_int| (store |v_#memory_int_3402| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:54,161 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 74) [2019-05-15 10:37:54,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 16 treesize of output 11 [2019-05-15 10:37:54,229 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,231 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:54,232 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,232 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:54,241 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:54,241 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3403|]. (let ((.cse0 (select |v_#memory_int_3403| ULTIMATE.start_main_p1))) (and (= 74 .cse0) (= (store |v_#memory_int_3403| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:54,241 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 75) [2019-05-15 10:37:54,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:54,310 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,312 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:54,313 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,313 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:54,322 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:54,323 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3404|]. (let ((.cse0 (select |v_#memory_int_3404| ULTIMATE.start_main_p1))) (and (= 75 .cse0) (= |#memory_int| (store |v_#memory_int_3404| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:54,323 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 76) [2019-05-15 10:37:54,390 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:54,391 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,393 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:54,393 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,393 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:54,402 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:54,402 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3405|]. (let ((.cse0 (select |v_#memory_int_3405| ULTIMATE.start_main_p1))) (and (= .cse0 76) (= (store |v_#memory_int_3405| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:54,402 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 77) [2019-05-15 10:37:54,471 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:54,472 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,474 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:54,474 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,474 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:54,481 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:54,481 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3406|]. (let ((.cse0 (select |v_#memory_int_3406| ULTIMATE.start_main_p1))) (and (= 77 .cse0) (= (store |v_#memory_int_3406| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:54,481 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 78) [2019-05-15 10:37:54,547 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:54,548 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,550 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:54,551 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,551 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:54,558 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:54,558 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3407|]. (let ((.cse0 (select |v_#memory_int_3407| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3407| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 78))) [2019-05-15 10:37:54,558 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 79) [2019-05-15 10:37:54,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 16 treesize of output 11 [2019-05-15 10:37:54,638 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,640 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:54,640 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,640 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:54,647 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:54,647 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3408|]. (let ((.cse0 (select |v_#memory_int_3408| ULTIMATE.start_main_p1))) (and (= .cse0 79) (= (store |v_#memory_int_3408| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:54,647 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 80) [2019-05-15 10:37:54,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 16 treesize of output 11 [2019-05-15 10:37:54,716 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,718 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:54,718 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,718 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:54,726 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:54,726 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3409|]. (let ((.cse0 (select |v_#memory_int_3409| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3409| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 80 .cse0))) [2019-05-15 10:37:54,726 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 81) [2019-05-15 10:37:54,797 INFO L273 TraceCheckUtils]: 0: Hoare triple {29012#true} havoc main_p1; {29012#true} is VALID [2019-05-15 10:37:54,797 INFO L273 TraceCheckUtils]: 1: Hoare triple {29012#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {29012#true} is VALID [2019-05-15 10:37:54,798 INFO L273 TraceCheckUtils]: 2: Hoare triple {29012#true} #memory_int := #memory_int[main_p1 := 0]; {29023#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:37:54,798 INFO L273 TraceCheckUtils]: 3: Hoare triple {29023#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29027#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:37:54,799 INFO L273 TraceCheckUtils]: 4: Hoare triple {29027#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29031#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:37:54,799 INFO L273 TraceCheckUtils]: 5: Hoare triple {29031#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29035#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:37:54,800 INFO L273 TraceCheckUtils]: 6: Hoare triple {29035#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29039#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:37:54,800 INFO L273 TraceCheckUtils]: 7: Hoare triple {29039#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29043#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:37:54,801 INFO L273 TraceCheckUtils]: 8: Hoare triple {29043#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29047#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:37:54,801 INFO L273 TraceCheckUtils]: 9: Hoare triple {29047#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29051#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:37:54,802 INFO L273 TraceCheckUtils]: 10: Hoare triple {29051#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29055#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:37:54,803 INFO L273 TraceCheckUtils]: 11: Hoare triple {29055#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29059#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:37:54,804 INFO L273 TraceCheckUtils]: 12: Hoare triple {29059#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29063#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:37:54,804 INFO L273 TraceCheckUtils]: 13: Hoare triple {29063#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29067#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:37:54,805 INFO L273 TraceCheckUtils]: 14: Hoare triple {29067#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29071#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:37:54,806 INFO L273 TraceCheckUtils]: 15: Hoare triple {29071#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29075#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:37:54,807 INFO L273 TraceCheckUtils]: 16: Hoare triple {29075#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29079#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:37:54,807 INFO L273 TraceCheckUtils]: 17: Hoare triple {29079#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29083#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:37:54,808 INFO L273 TraceCheckUtils]: 18: Hoare triple {29083#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29087#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:37:54,809 INFO L273 TraceCheckUtils]: 19: Hoare triple {29087#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29091#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:37:54,810 INFO L273 TraceCheckUtils]: 20: Hoare triple {29091#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29095#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:37:54,810 INFO L273 TraceCheckUtils]: 21: Hoare triple {29095#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29099#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:37:54,811 INFO L273 TraceCheckUtils]: 22: Hoare triple {29099#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29103#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:37:54,812 INFO L273 TraceCheckUtils]: 23: Hoare triple {29103#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29107#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:37:54,813 INFO L273 TraceCheckUtils]: 24: Hoare triple {29107#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29111#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:37:54,813 INFO L273 TraceCheckUtils]: 25: Hoare triple {29111#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29115#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:37:54,814 INFO L273 TraceCheckUtils]: 26: Hoare triple {29115#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29119#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:37:54,815 INFO L273 TraceCheckUtils]: 27: Hoare triple {29119#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29123#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:37:54,815 INFO L273 TraceCheckUtils]: 28: Hoare triple {29123#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29127#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:37:54,816 INFO L273 TraceCheckUtils]: 29: Hoare triple {29127#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29131#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:37:54,817 INFO L273 TraceCheckUtils]: 30: Hoare triple {29131#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29135#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:37:54,818 INFO L273 TraceCheckUtils]: 31: Hoare triple {29135#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29139#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:37:54,818 INFO L273 TraceCheckUtils]: 32: Hoare triple {29139#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29143#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:37:54,819 INFO L273 TraceCheckUtils]: 33: Hoare triple {29143#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29147#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:37:54,820 INFO L273 TraceCheckUtils]: 34: Hoare triple {29147#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29151#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:37:54,821 INFO L273 TraceCheckUtils]: 35: Hoare triple {29151#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29155#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:37:54,821 INFO L273 TraceCheckUtils]: 36: Hoare triple {29155#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29159#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:37:54,822 INFO L273 TraceCheckUtils]: 37: Hoare triple {29159#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29163#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:37:54,823 INFO L273 TraceCheckUtils]: 38: Hoare triple {29163#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29167#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:37:54,824 INFO L273 TraceCheckUtils]: 39: Hoare triple {29167#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29171#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:37:54,824 INFO L273 TraceCheckUtils]: 40: Hoare triple {29171#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29175#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:37:54,825 INFO L273 TraceCheckUtils]: 41: Hoare triple {29175#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29179#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:37:54,826 INFO L273 TraceCheckUtils]: 42: Hoare triple {29179#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29183#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:37:54,827 INFO L273 TraceCheckUtils]: 43: Hoare triple {29183#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29187#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:37:54,827 INFO L273 TraceCheckUtils]: 44: Hoare triple {29187#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29191#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:37:54,828 INFO L273 TraceCheckUtils]: 45: Hoare triple {29191#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29195#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:37:54,829 INFO L273 TraceCheckUtils]: 46: Hoare triple {29195#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29199#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:37:54,830 INFO L273 TraceCheckUtils]: 47: Hoare triple {29199#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29203#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:37:54,830 INFO L273 TraceCheckUtils]: 48: Hoare triple {29203#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29207#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:37:54,831 INFO L273 TraceCheckUtils]: 49: Hoare triple {29207#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29211#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:37:54,832 INFO L273 TraceCheckUtils]: 50: Hoare triple {29211#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29215#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:37:54,833 INFO L273 TraceCheckUtils]: 51: Hoare triple {29215#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29219#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:37:54,833 INFO L273 TraceCheckUtils]: 52: Hoare triple {29219#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29223#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:37:54,834 INFO L273 TraceCheckUtils]: 53: Hoare triple {29223#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29227#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:37:54,835 INFO L273 TraceCheckUtils]: 54: Hoare triple {29227#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29231#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:37:54,836 INFO L273 TraceCheckUtils]: 55: Hoare triple {29231#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29235#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:37:54,836 INFO L273 TraceCheckUtils]: 56: Hoare triple {29235#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29239#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:37:54,837 INFO L273 TraceCheckUtils]: 57: Hoare triple {29239#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29243#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:37:54,838 INFO L273 TraceCheckUtils]: 58: Hoare triple {29243#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29247#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:37:54,839 INFO L273 TraceCheckUtils]: 59: Hoare triple {29247#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29251#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:37:54,839 INFO L273 TraceCheckUtils]: 60: Hoare triple {29251#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29255#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:37:54,840 INFO L273 TraceCheckUtils]: 61: Hoare triple {29255#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29259#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:37:54,841 INFO L273 TraceCheckUtils]: 62: Hoare triple {29259#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29263#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:37:54,842 INFO L273 TraceCheckUtils]: 63: Hoare triple {29263#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29267#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:37:54,842 INFO L273 TraceCheckUtils]: 64: Hoare triple {29267#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29271#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:37:54,843 INFO L273 TraceCheckUtils]: 65: Hoare triple {29271#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29275#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:37:54,844 INFO L273 TraceCheckUtils]: 66: Hoare triple {29275#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29279#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} is VALID [2019-05-15 10:37:54,845 INFO L273 TraceCheckUtils]: 67: Hoare triple {29279#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29283#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} is VALID [2019-05-15 10:37:54,845 INFO L273 TraceCheckUtils]: 68: Hoare triple {29283#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29287#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} is VALID [2019-05-15 10:37:54,846 INFO L273 TraceCheckUtils]: 69: Hoare triple {29287#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29291#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} is VALID [2019-05-15 10:37:54,847 INFO L273 TraceCheckUtils]: 70: Hoare triple {29291#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29295#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} is VALID [2019-05-15 10:37:54,847 INFO L273 TraceCheckUtils]: 71: Hoare triple {29295#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29299#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} is VALID [2019-05-15 10:37:54,848 INFO L273 TraceCheckUtils]: 72: Hoare triple {29299#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29303#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} is VALID [2019-05-15 10:37:54,849 INFO L273 TraceCheckUtils]: 73: Hoare triple {29303#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29307#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} is VALID [2019-05-15 10:37:54,850 INFO L273 TraceCheckUtils]: 74: Hoare triple {29307#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29311#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} is VALID [2019-05-15 10:37:54,850 INFO L273 TraceCheckUtils]: 75: Hoare triple {29311#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29315#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} is VALID [2019-05-15 10:37:54,851 INFO L273 TraceCheckUtils]: 76: Hoare triple {29315#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29319#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} is VALID [2019-05-15 10:37:54,852 INFO L273 TraceCheckUtils]: 77: Hoare triple {29319#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29323#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} is VALID [2019-05-15 10:37:54,853 INFO L273 TraceCheckUtils]: 78: Hoare triple {29323#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29327#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} is VALID [2019-05-15 10:37:54,853 INFO L273 TraceCheckUtils]: 79: Hoare triple {29327#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29331#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} is VALID [2019-05-15 10:37:54,854 INFO L273 TraceCheckUtils]: 80: Hoare triple {29331#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29335#(= (select |#memory_int| ULTIMATE.start_main_p1) 78)} is VALID [2019-05-15 10:37:54,855 INFO L273 TraceCheckUtils]: 81: Hoare triple {29335#(= (select |#memory_int| ULTIMATE.start_main_p1) 78)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29339#(= (select |#memory_int| ULTIMATE.start_main_p1) 79)} is VALID [2019-05-15 10:37:54,856 INFO L273 TraceCheckUtils]: 82: Hoare triple {29339#(= (select |#memory_int| ULTIMATE.start_main_p1) 79)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29343#(= (select |#memory_int| ULTIMATE.start_main_p1) 80)} is VALID [2019-05-15 10:37:54,856 INFO L273 TraceCheckUtils]: 83: Hoare triple {29343#(= (select |#memory_int| ULTIMATE.start_main_p1) 80)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29347#(= (select |#memory_int| ULTIMATE.start_main_p1) 81)} is VALID [2019-05-15 10:37:54,857 INFO L273 TraceCheckUtils]: 84: Hoare triple {29347#(= (select |#memory_int| ULTIMATE.start_main_p1) 81)} assume !(#memory_int[main_p1] >= 0); {29013#false} is VALID [2019-05-15 10:37:54,867 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:37:54,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:37:54,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-05-15 10:37:54,867 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 85 [2019-05-15 10:37:54,867 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:37:54,867 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 84 states. [2019-05-15 10:37:54,933 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:37:54,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-05-15 10:37:54,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-05-15 10:37:54,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2019-05-15 10:37:54,934 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 84 states. [2019-05-15 10:38:08,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:38:08,654 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-05-15 10:38:08,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-05-15 10:38:08,655 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 85 [2019-05-15 10:38:08,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:38:08,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-05-15 10:38:08,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2019-05-15 10:38:08,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-05-15 10:38:08,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2019-05-15 10:38:08,657 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 84 states and 88 transitions. [2019-05-15 10:38:08,725 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:38:08,727 INFO L225 Difference]: With dead ends: 87 [2019-05-15 10:38:08,727 INFO L226 Difference]: Without dead ends: 87 [2019-05-15 10:38:08,727 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2019-05-15 10:38:08,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-05-15 10:38:08,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-05-15 10:38:08,729 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:38:08,729 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 87 states. [2019-05-15 10:38:08,729 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 87 states. [2019-05-15 10:38:08,729 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 87 states. [2019-05-15 10:38:08,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:38:08,730 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-05-15 10:38:08,730 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-05-15 10:38:08,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:38:08,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:38:08,730 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 87 states. [2019-05-15 10:38:08,730 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 87 states. [2019-05-15 10:38:08,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:38:08,731 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-05-15 10:38:08,731 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-05-15 10:38:08,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:38:08,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:38:08,731 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:38:08,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:38:08,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-05-15 10:38:08,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-05-15 10:38:08,732 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-05-15 10:38:08,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:38:08,732 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-05-15 10:38:08,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-05-15 10:38:08,732 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-05-15 10:38:08,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-05-15 10:38:08,733 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:38:08,733 INFO L399 BasicCegarLoop]: trace histogram [82, 1, 1, 1, 1] [2019-05-15 10:38:08,733 INFO L418 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:38:08,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:38:08,733 INFO L82 PathProgramCache]: Analyzing trace with hash -133450552, now seen corresponding path program 82 times [2019-05-15 10:38:08,734 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:38:08,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:38:08,772 WARN L254 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 84 conjunts are in the unsatisfiable core [2019-05-15 10:38:08,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:38:08,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:38:08,816 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:08,817 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:08,818 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:08,818 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:08,819 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:38:08,820 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:08,820 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3410|]. (= (store |v_#memory_int_3410| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:38:08,821 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:38:08,830 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:08,831 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:08,833 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:08,833 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:08,833 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:08,841 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:08,841 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3411|]. (let ((.cse0 (select |v_#memory_int_3411| ULTIMATE.start_main_p1))) (and (= .cse0 0) (= |#memory_int| (store |v_#memory_int_3411| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:08,841 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:38:08,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 16 treesize of output 11 [2019-05-15 10:38:08,852 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:08,854 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:08,854 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:08,854 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:08,862 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:08,862 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3412|]. (let ((.cse0 (select |v_#memory_int_3412| ULTIMATE.start_main_p1))) (and (= .cse0 1) (= (store |v_#memory_int_3412| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:08,862 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:38:08,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 16 treesize of output 11 [2019-05-15 10:38:08,873 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:08,875 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:08,875 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:08,875 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:08,883 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:08,884 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3413|]. (let ((.cse0 (select |v_#memory_int_3413| ULTIMATE.start_main_p1))) (and (= .cse0 2) (= (store |v_#memory_int_3413| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:08,884 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:38:08,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 16 treesize of output 11 [2019-05-15 10:38:08,895 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:08,897 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:08,897 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:08,898 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:08,905 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:08,906 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3414|]. (let ((.cse0 (select |v_#memory_int_3414| ULTIMATE.start_main_p1))) (and (= .cse0 3) (= (store |v_#memory_int_3414| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:08,906 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:38:08,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:08,918 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:08,920 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:08,920 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:08,920 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:08,927 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:08,928 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3415|]. (let ((.cse0 (select |v_#memory_int_3415| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3415| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 4))) [2019-05-15 10:38:08,928 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:38:08,941 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:08,942 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:08,944 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:08,944 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:08,944 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:08,952 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:08,952 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3416|]. (let ((.cse0 (select |v_#memory_int_3416| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3416| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 5))) [2019-05-15 10:38:08,952 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:38:08,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 16 treesize of output 11 [2019-05-15 10:38:08,967 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:08,969 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:08,969 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:08,970 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:08,977 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:08,977 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3417|]. (let ((.cse0 (select |v_#memory_int_3417| ULTIMATE.start_main_p1))) (and (= 6 .cse0) (= |#memory_int| (store |v_#memory_int_3417| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:08,977 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:38:08,992 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:08,993 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:08,995 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:08,995 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:08,995 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:09,002 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:09,002 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3418|]. (let ((.cse0 (select |v_#memory_int_3418| ULTIMATE.start_main_p1))) (and (= 7 .cse0) (= (store |v_#memory_int_3418| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:09,002 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:38:09,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:09,017 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,019 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:09,020 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,020 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:09,027 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:09,028 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3419|]. (let ((.cse0 (select |v_#memory_int_3419| ULTIMATE.start_main_p1))) (and (= 8 .cse0) (= |#memory_int| (store |v_#memory_int_3419| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:09,028 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:38:09,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 16 treesize of output 11 [2019-05-15 10:38:09,044 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,046 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:09,046 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,046 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:09,053 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:09,053 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3420|]. (let ((.cse0 (select |v_#memory_int_3420| ULTIMATE.start_main_p1))) (and (= 9 .cse0) (= (store |v_#memory_int_3420| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:09,054 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:38:09,072 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:09,073 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,075 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:09,075 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,075 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:09,082 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:09,083 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3421|]. (let ((.cse0 (select |v_#memory_int_3421| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3421| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 10))) [2019-05-15 10:38:09,083 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:38:09,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:09,100 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,102 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:09,102 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,103 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:09,110 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:09,110 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3422|]. (let ((.cse0 (select |v_#memory_int_3422| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3422| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 11 .cse0))) [2019-05-15 10:38:09,110 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:38:09,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:09,135 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,137 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:09,137 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,137 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:09,145 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:09,145 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3423|]. (let ((.cse0 (select |v_#memory_int_3423| ULTIMATE.start_main_p1))) (and (= 12 .cse0) (= (store |v_#memory_int_3423| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:09,145 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:38:09,164 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:09,165 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,167 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:09,167 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,168 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:09,176 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:09,176 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3424|]. (let ((.cse0 (select |v_#memory_int_3424| ULTIMATE.start_main_p1))) (and (= 13 .cse0) (= (store |v_#memory_int_3424| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:09,176 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:38:09,196 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:09,197 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,199 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:09,199 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,200 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:09,207 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:09,207 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3425|]. (let ((.cse0 (select |v_#memory_int_3425| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3425| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 14))) [2019-05-15 10:38:09,207 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:38:09,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 16 treesize of output 11 [2019-05-15 10:38:09,227 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,229 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:09,230 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,230 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:09,236 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:09,236 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3426|]. (let ((.cse0 (select |v_#memory_int_3426| ULTIMATE.start_main_p1))) (and (= .cse0 15) (= (store |v_#memory_int_3426| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:09,236 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:38:09,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 16 treesize of output 11 [2019-05-15 10:38:09,258 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,260 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:09,260 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,261 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:09,267 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:09,268 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3427|]. (let ((.cse0 (select |v_#memory_int_3427| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3427| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 16 .cse0))) [2019-05-15 10:38:09,268 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:38:09,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:09,290 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,292 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:09,292 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,292 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:09,299 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:09,299 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3428|]. (let ((.cse0 (select |v_#memory_int_3428| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3428| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 17 .cse0))) [2019-05-15 10:38:09,299 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:38:09,322 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:09,323 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,325 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:09,325 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,326 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:09,332 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:09,333 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3429|]. (let ((.cse0 (select |v_#memory_int_3429| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3429| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 18 .cse0))) [2019-05-15 10:38:09,333 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:38:09,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:09,357 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,359 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:09,360 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,360 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:09,367 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:09,367 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3430|]. (let ((.cse0 (select |v_#memory_int_3430| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3430| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 19 .cse0))) [2019-05-15 10:38:09,367 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:38:09,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:09,393 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,395 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:09,395 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,395 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:09,403 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:09,403 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3431|]. (let ((.cse0 (select |v_#memory_int_3431| ULTIMATE.start_main_p1))) (and (= .cse0 20) (= (store |v_#memory_int_3431| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:09,403 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:38:09,427 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:09,428 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,430 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:09,430 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,430 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:09,438 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:09,438 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3432|]. (let ((.cse0 (select |v_#memory_int_3432| ULTIMATE.start_main_p1))) (and (= .cse0 21) (= |#memory_int| (store |v_#memory_int_3432| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:09,438 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:38:09,464 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:09,465 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,467 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:09,467 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,467 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:09,475 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:09,475 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3433|]. (let ((.cse0 (select |v_#memory_int_3433| ULTIMATE.start_main_p1))) (and (= 22 .cse0) (= (store |v_#memory_int_3433| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:09,475 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:38:09,502 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:09,503 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,505 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:09,505 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,505 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:09,513 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:09,513 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3434|]. (let ((.cse0 (select |v_#memory_int_3434| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3434| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 23 .cse0))) [2019-05-15 10:38:09,513 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:38:09,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 16 treesize of output 11 [2019-05-15 10:38:09,540 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,542 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:09,542 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,543 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:09,550 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:09,550 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3435|]. (let ((.cse0 (select |v_#memory_int_3435| ULTIMATE.start_main_p1))) (and (= .cse0 24) (= (store |v_#memory_int_3435| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:09,550 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:38:09,581 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:09,582 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,584 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:09,584 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,584 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:09,592 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:09,593 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3436|]. (let ((.cse0 (select |v_#memory_int_3436| ULTIMATE.start_main_p1))) (and (= 25 .cse0) (= (store |v_#memory_int_3436| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:09,593 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:38:09,622 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:09,623 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,625 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:09,625 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,626 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:09,633 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:09,634 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3437|]. (let ((.cse0 (select |v_#memory_int_3437| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3437| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 26))) [2019-05-15 10:38:09,634 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:38:09,665 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:09,666 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,668 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:09,668 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,668 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:09,675 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:09,676 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3438|]. (let ((.cse0 (select |v_#memory_int_3438| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3438| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 27))) [2019-05-15 10:38:09,676 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:38:09,710 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:09,711 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,713 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:09,713 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,713 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:09,721 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:09,721 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3439|]. (let ((.cse0 (select |v_#memory_int_3439| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3439| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 28 .cse0))) [2019-05-15 10:38:09,721 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:38:09,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 16 treesize of output 11 [2019-05-15 10:38:09,755 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,757 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:09,757 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,757 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:09,764 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:09,764 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3440|]. (let ((.cse0 (select |v_#memory_int_3440| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3440| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 29 .cse0))) [2019-05-15 10:38:09,765 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:38:09,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 16 treesize of output 11 [2019-05-15 10:38:09,803 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,805 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:09,805 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,805 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:09,813 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:09,813 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3441|]. (let ((.cse0 (select |v_#memory_int_3441| ULTIMATE.start_main_p1))) (and (= 30 .cse0) (= (store |v_#memory_int_3441| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:09,813 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:38:09,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:09,845 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,847 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:09,847 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,847 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:09,855 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:09,855 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3442|]. (let ((.cse0 (select |v_#memory_int_3442| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3442| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 31))) [2019-05-15 10:38:09,855 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:38:09,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:09,890 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,892 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:09,892 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,893 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:09,900 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:09,901 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3443|]. (let ((.cse0 (select |v_#memory_int_3443| ULTIMATE.start_main_p1))) (and (= 32 .cse0) (= (store |v_#memory_int_3443| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:09,901 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:38:09,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:09,936 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,938 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:09,938 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,939 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:09,946 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:09,947 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3444|]. (let ((.cse0 (select |v_#memory_int_3444| ULTIMATE.start_main_p1))) (and (= 33 .cse0) (= (store |v_#memory_int_3444| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:09,947 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:38:09,982 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:09,983 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,985 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:09,985 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:09,986 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:09,993 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:09,993 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3445|]. (let ((.cse0 (select |v_#memory_int_3445| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3445| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 34))) [2019-05-15 10:38:09,993 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:38:10,029 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:10,030 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:10,032 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:10,032 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:10,032 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:10,040 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:10,040 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3446|]. (let ((.cse0 (select |v_#memory_int_3446| ULTIMATE.start_main_p1))) (and (= .cse0 35) (= (store |v_#memory_int_3446| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:10,040 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:38:10,079 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:10,080 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:10,082 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:10,083 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:10,083 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:10,091 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:10,091 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3447|]. (let ((.cse0 (select |v_#memory_int_3447| ULTIMATE.start_main_p1))) (and (= 36 .cse0) (= (store |v_#memory_int_3447| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:10,091 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:38:10,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 16 treesize of output 11 [2019-05-15 10:38:10,129 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:10,131 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:10,131 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:10,131 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:10,139 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:10,140 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3448|]. (let ((.cse0 (select |v_#memory_int_3448| ULTIMATE.start_main_p1))) (and (= .cse0 37) (= |#memory_int| (store |v_#memory_int_3448| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:10,140 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:38:10,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:10,180 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:10,182 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:10,182 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:10,182 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:10,190 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:10,190 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3449|]. (let ((.cse0 (select |v_#memory_int_3449| ULTIMATE.start_main_p1))) (and (= 38 .cse0) (= (store |v_#memory_int_3449| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:10,190 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:38:10,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 16 treesize of output 11 [2019-05-15 10:38:10,229 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:10,231 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:10,232 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:10,232 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:10,240 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:10,240 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3450|]. (let ((.cse0 (select |v_#memory_int_3450| ULTIMATE.start_main_p1))) (and (= .cse0 39) (= (store |v_#memory_int_3450| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:10,240 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:38:10,280 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:10,281 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:10,283 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:10,283 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:10,283 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:10,291 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:10,291 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3451|]. (let ((.cse0 (select |v_#memory_int_3451| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3451| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 40))) [2019-05-15 10:38:10,291 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:38:10,333 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:10,334 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:10,336 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:10,337 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:10,337 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:10,345 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:10,345 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3452|]. (let ((.cse0 (select |v_#memory_int_3452| ULTIMATE.start_main_p1))) (and (= .cse0 41) (= (store |v_#memory_int_3452| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:10,346 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:38:10,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:10,394 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:10,396 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:10,396 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:10,396 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:10,403 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:10,403 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3453|]. (let ((.cse0 (select |v_#memory_int_3453| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3453| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 42))) [2019-05-15 10:38:10,403 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:38:10,446 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:10,446 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:10,448 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:10,449 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:10,449 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:10,456 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:10,456 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3454|]. (let ((.cse0 (select |v_#memory_int_3454| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3454| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 43))) [2019-05-15 10:38:10,456 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:38:10,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:10,505 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:10,507 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:10,507 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:10,507 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:10,515 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:10,515 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3455|]. (let ((.cse0 (select |v_#memory_int_3455| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3455| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 44))) [2019-05-15 10:38:10,515 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:38:10,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:10,560 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:10,562 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:10,562 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:10,562 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:10,569 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:10,569 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3456|]. (let ((.cse0 (select |v_#memory_int_3456| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3456| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 45))) [2019-05-15 10:38:10,569 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:38:10,612 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:10,613 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:10,615 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:10,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:10,616 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:10,623 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:10,623 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3457|]. (let ((.cse0 (select |v_#memory_int_3457| ULTIMATE.start_main_p1))) (and (= .cse0 46) (= |#memory_int| (store |v_#memory_int_3457| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:10,623 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:38:10,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:10,668 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:10,670 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:10,670 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:10,670 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:10,678 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:10,678 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3458|]. (let ((.cse0 (select |v_#memory_int_3458| ULTIMATE.start_main_p1))) (and (= .cse0 47) (= (store |v_#memory_int_3458| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:10,678 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:38:10,725 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:10,725 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:10,727 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:10,728 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:10,728 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:10,736 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:10,736 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3459|]. (let ((.cse0 (select |v_#memory_int_3459| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3459| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 48 .cse0))) [2019-05-15 10:38:10,736 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:38:10,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 16 treesize of output 11 [2019-05-15 10:38:10,785 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:10,787 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:10,787 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:10,787 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:10,794 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:10,794 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3460|]. (let ((.cse0 (select |v_#memory_int_3460| ULTIMATE.start_main_p1))) (and (= 49 .cse0) (= (store |v_#memory_int_3460| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:10,794 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:38:10,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:10,844 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:10,846 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:10,847 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:10,847 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:10,854 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:10,854 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3461|]. (let ((.cse0 (select |v_#memory_int_3461| ULTIMATE.start_main_p1))) (and (= .cse0 50) (= |#memory_int| (store |v_#memory_int_3461| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:10,854 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:38:10,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 16 treesize of output 11 [2019-05-15 10:38:10,903 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:10,905 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:10,905 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:10,905 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:10,915 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:10,915 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3462|]. (let ((.cse0 (select |v_#memory_int_3462| ULTIMATE.start_main_p1))) (and (= 51 .cse0) (= |#memory_int| (store |v_#memory_int_3462| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:10,915 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:38:10,964 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:10,965 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:10,967 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:10,967 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:10,967 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:10,975 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:10,975 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3463|]. (let ((.cse0 (select |v_#memory_int_3463| ULTIMATE.start_main_p1))) (and (= 52 .cse0) (= (store |v_#memory_int_3463| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:10,976 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:38:11,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 16 treesize of output 11 [2019-05-15 10:38:11,033 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:11,035 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:11,035 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:11,035 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:11,043 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:11,043 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3464|]. (let ((.cse0 (select |v_#memory_int_3464| ULTIMATE.start_main_p1))) (and (= .cse0 53) (= (store |v_#memory_int_3464| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:11,043 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:38:11,094 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:11,095 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:11,097 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:11,097 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:11,097 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:11,105 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:11,105 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3465|]. (let ((.cse0 (select |v_#memory_int_3465| ULTIMATE.start_main_p1))) (and (= .cse0 54) (= (store |v_#memory_int_3465| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:11,105 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:38:11,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 16 treesize of output 11 [2019-05-15 10:38:11,155 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:11,158 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:11,158 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:11,158 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:11,165 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:11,165 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3466|]. (let ((.cse0 (select |v_#memory_int_3466| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3466| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 55 .cse0))) [2019-05-15 10:38:11,166 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:38:11,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 16 treesize of output 11 [2019-05-15 10:38:11,220 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:11,222 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:11,222 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:11,223 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:11,231 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:11,231 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3467|]. (let ((.cse0 (select |v_#memory_int_3467| ULTIMATE.start_main_p1))) (and (= 56 .cse0) (= (store |v_#memory_int_3467| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:11,231 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:38:11,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 16 treesize of output 11 [2019-05-15 10:38:11,288 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:11,290 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:11,291 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:11,291 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:11,300 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:11,300 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3468|]. (let ((.cse0 (select |v_#memory_int_3468| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3468| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 57))) [2019-05-15 10:38:11,300 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:38:11,353 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:11,354 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:11,356 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:11,356 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:11,357 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:11,365 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:11,365 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3469|]. (let ((.cse0 (select |v_#memory_int_3469| ULTIMATE.start_main_p1))) (and (= .cse0 58) (= (store |v_#memory_int_3469| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:11,365 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:38:11,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 16 treesize of output 11 [2019-05-15 10:38:11,421 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:11,423 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:11,423 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:11,423 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:11,431 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:11,431 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3470|]. (let ((.cse0 (select |v_#memory_int_3470| ULTIMATE.start_main_p1))) (and (= .cse0 59) (= (store |v_#memory_int_3470| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:11,432 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:38:11,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 16 treesize of output 11 [2019-05-15 10:38:11,489 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:11,491 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:11,491 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:11,491 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:11,498 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:11,499 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3471|]. (let ((.cse0 (select |v_#memory_int_3471| ULTIMATE.start_main_p1))) (and (= 60 .cse0) (= (store |v_#memory_int_3471| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:11,499 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:38:11,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:11,557 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:11,559 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:11,559 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:11,559 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:11,567 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:11,568 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3472|]. (let ((.cse0 (select |v_#memory_int_3472| ULTIMATE.start_main_p1))) (and (= 61 .cse0) (= (store |v_#memory_int_3472| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:11,568 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:38:11,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:11,625 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:11,627 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:11,627 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:11,627 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:11,634 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:11,634 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3473|]. (let ((.cse0 (select |v_#memory_int_3473| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3473| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 62 .cse0))) [2019-05-15 10:38:11,635 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:38:11,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 16 treesize of output 11 [2019-05-15 10:38:11,694 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:11,696 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:11,696 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:11,696 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:11,702 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:11,702 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3474|]. (let ((.cse0 (select |v_#memory_int_3474| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3474| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 63))) [2019-05-15 10:38:11,702 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 64) [2019-05-15 10:38:11,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 16 treesize of output 11 [2019-05-15 10:38:11,760 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:11,762 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:11,762 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:11,763 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:11,771 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:11,771 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3475|]. (let ((.cse0 (select |v_#memory_int_3475| ULTIMATE.start_main_p1))) (and (= .cse0 64) (= |#memory_int| (store |v_#memory_int_3475| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:11,771 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 65) [2019-05-15 10:38:11,830 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:11,831 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:11,833 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:11,833 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:11,833 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:11,841 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:11,841 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3476|]. (let ((.cse0 (select |v_#memory_int_3476| ULTIMATE.start_main_p1))) (and (= 65 .cse0) (= (store |v_#memory_int_3476| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:11,841 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 66) [2019-05-15 10:38:11,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:11,901 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:11,903 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:11,903 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:11,903 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:11,911 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:11,911 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3477|]. (let ((.cse0 (select |v_#memory_int_3477| ULTIMATE.start_main_p1))) (and (= 66 .cse0) (= (store |v_#memory_int_3477| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:11,911 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 67) [2019-05-15 10:38:11,973 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:11,974 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:11,976 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:11,976 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:11,976 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:11,984 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:11,984 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3478|]. (let ((.cse0 (select |v_#memory_int_3478| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3478| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 67))) [2019-05-15 10:38:11,984 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 68) [2019-05-15 10:38:12,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:12,048 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,050 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:12,051 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,051 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:12,058 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:12,058 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3479|]. (let ((.cse0 (select |v_#memory_int_3479| ULTIMATE.start_main_p1))) (and (= .cse0 68) (= |#memory_int| (store |v_#memory_int_3479| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:12,058 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 69) [2019-05-15 10:38:12,119 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:12,119 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,121 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:12,122 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,122 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:12,128 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:12,128 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3480|]. (let ((.cse0 (select |v_#memory_int_3480| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3480| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 69))) [2019-05-15 10:38:12,128 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 70) [2019-05-15 10:38:12,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 16 treesize of output 11 [2019-05-15 10:38:12,189 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,191 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38: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:38:12,192 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:12,200 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:12,201 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3481|]. (let ((.cse0 (select |v_#memory_int_3481| ULTIMATE.start_main_p1))) (and (= 70 .cse0) (= (store |v_#memory_int_3481| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:12,201 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 71) [2019-05-15 10:38:12,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 16 treesize of output 11 [2019-05-15 10:38:12,266 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,268 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:12,269 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,269 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:12,276 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:12,277 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3482|]. (let ((.cse0 (select |v_#memory_int_3482| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3482| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 71 .cse0))) [2019-05-15 10:38:12,277 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 72) [2019-05-15 10:38:12,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 16 treesize of output 11 [2019-05-15 10:38:12,347 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,348 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:12,348 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,349 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:12,355 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:12,355 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3483|]. (let ((.cse0 (select |v_#memory_int_3483| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3483| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 72))) [2019-05-15 10:38:12,355 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 73) [2019-05-15 10:38:12,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:12,417 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,419 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:12,419 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,420 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:12,427 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:12,427 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3484|]. (let ((.cse0 (select |v_#memory_int_3484| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3484| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 73))) [2019-05-15 10:38:12,427 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 74) [2019-05-15 10:38:12,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 16 treesize of output 11 [2019-05-15 10:38:12,495 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,497 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:12,497 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,497 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:12,505 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:12,505 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3485|]. (let ((.cse0 (select |v_#memory_int_3485| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3485| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 74))) [2019-05-15 10:38:12,505 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 75) [2019-05-15 10:38:12,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 16 treesize of output 11 [2019-05-15 10:38:12,573 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,575 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:12,575 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,576 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:12,582 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:12,583 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3486|]. (let ((.cse0 (select |v_#memory_int_3486| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3486| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 75 .cse0))) [2019-05-15 10:38:12,583 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 76) [2019-05-15 10:38:12,648 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:12,649 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,651 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:12,651 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,651 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:12,657 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:12,657 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3487|]. (let ((.cse0 (select |v_#memory_int_3487| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3487| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 76))) [2019-05-15 10:38:12,658 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 77) [2019-05-15 10:38:12,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 16 treesize of output 11 [2019-05-15 10:38:12,727 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,729 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:12,729 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,729 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:12,736 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:12,737 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3488|]. (let ((.cse0 (select |v_#memory_int_3488| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3488| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 77))) [2019-05-15 10:38:12,737 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 78) [2019-05-15 10:38:12,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:12,806 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,808 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:12,809 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,809 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [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,817 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3489|]. (let ((.cse0 (select |v_#memory_int_3489| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3489| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 78))) [2019-05-15 10:38:12,817 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 79) [2019-05-15 10:38:12,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:12,888 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,890 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:12,890 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,890 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:12,899 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:12,899 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3490|]. (let ((.cse0 (select |v_#memory_int_3490| ULTIMATE.start_main_p1))) (and (= .cse0 79) (= (store |v_#memory_int_3490| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:12,899 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 80) [2019-05-15 10:38:12,972 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:12,973 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,975 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:12,975 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,975 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:12,984 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:12,984 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3491|]. (let ((.cse0 (select |v_#memory_int_3491| ULTIMATE.start_main_p1))) (and (= 80 .cse0) (= (store |v_#memory_int_3491| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:12,984 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 81) [2019-05-15 10:38:13,063 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:13,064 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:13,066 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:13,067 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:13,067 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:13,076 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:13,076 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3492|]. (let ((.cse0 (select |v_#memory_int_3492| ULTIMATE.start_main_p1))) (and (= 81 .cse0) (= (store |v_#memory_int_3492| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:13,076 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 82) [2019-05-15 10:38:13,143 INFO L273 TraceCheckUtils]: 0: Hoare triple {29698#true} havoc main_p1; {29698#true} is VALID [2019-05-15 10:38:13,144 INFO L273 TraceCheckUtils]: 1: Hoare triple {29698#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {29698#true} is VALID [2019-05-15 10:38:13,144 INFO L273 TraceCheckUtils]: 2: Hoare triple {29698#true} #memory_int := #memory_int[main_p1 := 0]; {29709#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:38:13,144 INFO L273 TraceCheckUtils]: 3: Hoare triple {29709#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29713#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:38:13,145 INFO L273 TraceCheckUtils]: 4: Hoare triple {29713#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29717#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:38:13,146 INFO L273 TraceCheckUtils]: 5: Hoare triple {29717#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29721#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:38:13,147 INFO L273 TraceCheckUtils]: 6: Hoare triple {29721#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29725#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:38:13,147 INFO L273 TraceCheckUtils]: 7: Hoare triple {29725#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29729#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:38:13,148 INFO L273 TraceCheckUtils]: 8: Hoare triple {29729#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29733#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:38:13,149 INFO L273 TraceCheckUtils]: 9: Hoare triple {29733#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29737#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:38:13,150 INFO L273 TraceCheckUtils]: 10: Hoare triple {29737#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29741#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:38:13,150 INFO L273 TraceCheckUtils]: 11: Hoare triple {29741#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29745#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:38:13,151 INFO L273 TraceCheckUtils]: 12: Hoare triple {29745#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29749#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:38:13,152 INFO L273 TraceCheckUtils]: 13: Hoare triple {29749#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29753#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:38:13,153 INFO L273 TraceCheckUtils]: 14: Hoare triple {29753#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29757#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:38:13,153 INFO L273 TraceCheckUtils]: 15: Hoare triple {29757#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29761#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:38:13,154 INFO L273 TraceCheckUtils]: 16: Hoare triple {29761#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29765#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:38:13,155 INFO L273 TraceCheckUtils]: 17: Hoare triple {29765#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29769#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:38:13,156 INFO L273 TraceCheckUtils]: 18: Hoare triple {29769#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29773#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:38:13,156 INFO L273 TraceCheckUtils]: 19: Hoare triple {29773#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29777#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:38:13,157 INFO L273 TraceCheckUtils]: 20: Hoare triple {29777#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29781#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:38:13,158 INFO L273 TraceCheckUtils]: 21: Hoare triple {29781#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29785#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:38:13,159 INFO L273 TraceCheckUtils]: 22: Hoare triple {29785#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29789#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:38:13,159 INFO L273 TraceCheckUtils]: 23: Hoare triple {29789#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29793#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:38:13,160 INFO L273 TraceCheckUtils]: 24: Hoare triple {29793#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29797#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:38:13,161 INFO L273 TraceCheckUtils]: 25: Hoare triple {29797#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29801#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:38:13,162 INFO L273 TraceCheckUtils]: 26: Hoare triple {29801#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29805#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:38:13,162 INFO L273 TraceCheckUtils]: 27: Hoare triple {29805#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29809#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:38:13,163 INFO L273 TraceCheckUtils]: 28: Hoare triple {29809#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29813#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:38:13,164 INFO L273 TraceCheckUtils]: 29: Hoare triple {29813#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29817#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:38:13,165 INFO L273 TraceCheckUtils]: 30: Hoare triple {29817#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29821#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:38:13,165 INFO L273 TraceCheckUtils]: 31: Hoare triple {29821#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29825#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:38:13,166 INFO L273 TraceCheckUtils]: 32: Hoare triple {29825#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29829#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:38:13,167 INFO L273 TraceCheckUtils]: 33: Hoare triple {29829#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29833#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:38:13,168 INFO L273 TraceCheckUtils]: 34: Hoare triple {29833#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29837#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:38:13,168 INFO L273 TraceCheckUtils]: 35: Hoare triple {29837#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29841#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:38:13,169 INFO L273 TraceCheckUtils]: 36: Hoare triple {29841#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29845#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:38:13,170 INFO L273 TraceCheckUtils]: 37: Hoare triple {29845#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29849#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:38:13,171 INFO L273 TraceCheckUtils]: 38: Hoare triple {29849#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29853#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:38:13,171 INFO L273 TraceCheckUtils]: 39: Hoare triple {29853#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29857#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:38:13,172 INFO L273 TraceCheckUtils]: 40: Hoare triple {29857#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29861#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:38:13,173 INFO L273 TraceCheckUtils]: 41: Hoare triple {29861#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29865#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:38:13,173 INFO L273 TraceCheckUtils]: 42: Hoare triple {29865#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29869#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:38:13,174 INFO L273 TraceCheckUtils]: 43: Hoare triple {29869#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29873#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:38:13,175 INFO L273 TraceCheckUtils]: 44: Hoare triple {29873#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29877#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:38:13,176 INFO L273 TraceCheckUtils]: 45: Hoare triple {29877#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29881#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:38:13,176 INFO L273 TraceCheckUtils]: 46: Hoare triple {29881#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29885#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:38:13,177 INFO L273 TraceCheckUtils]: 47: Hoare triple {29885#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29889#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:38:13,178 INFO L273 TraceCheckUtils]: 48: Hoare triple {29889#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29893#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:38:13,179 INFO L273 TraceCheckUtils]: 49: Hoare triple {29893#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29897#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:38:13,179 INFO L273 TraceCheckUtils]: 50: Hoare triple {29897#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29901#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:38:13,180 INFO L273 TraceCheckUtils]: 51: Hoare triple {29901#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29905#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:38:13,181 INFO L273 TraceCheckUtils]: 52: Hoare triple {29905#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29909#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:38:13,182 INFO L273 TraceCheckUtils]: 53: Hoare triple {29909#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29913#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:38:13,182 INFO L273 TraceCheckUtils]: 54: Hoare triple {29913#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29917#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:38:13,183 INFO L273 TraceCheckUtils]: 55: Hoare triple {29917#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29921#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:38:13,184 INFO L273 TraceCheckUtils]: 56: Hoare triple {29921#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29925#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:38:13,185 INFO L273 TraceCheckUtils]: 57: Hoare triple {29925#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29929#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:38:13,185 INFO L273 TraceCheckUtils]: 58: Hoare triple {29929#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29933#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:38:13,186 INFO L273 TraceCheckUtils]: 59: Hoare triple {29933#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29937#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:38:13,187 INFO L273 TraceCheckUtils]: 60: Hoare triple {29937#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29941#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:38:13,188 INFO L273 TraceCheckUtils]: 61: Hoare triple {29941#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29945#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:38:13,188 INFO L273 TraceCheckUtils]: 62: Hoare triple {29945#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29949#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:38:13,189 INFO L273 TraceCheckUtils]: 63: Hoare triple {29949#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29953#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:38:13,190 INFO L273 TraceCheckUtils]: 64: Hoare triple {29953#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29957#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:38:13,191 INFO L273 TraceCheckUtils]: 65: Hoare triple {29957#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29961#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:38:13,191 INFO L273 TraceCheckUtils]: 66: Hoare triple {29961#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29965#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} is VALID [2019-05-15 10:38:13,192 INFO L273 TraceCheckUtils]: 67: Hoare triple {29965#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29969#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} is VALID [2019-05-15 10:38:13,193 INFO L273 TraceCheckUtils]: 68: Hoare triple {29969#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29973#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} is VALID [2019-05-15 10:38:13,194 INFO L273 TraceCheckUtils]: 69: Hoare triple {29973#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29977#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} is VALID [2019-05-15 10:38:13,194 INFO L273 TraceCheckUtils]: 70: Hoare triple {29977#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29981#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} is VALID [2019-05-15 10:38:13,195 INFO L273 TraceCheckUtils]: 71: Hoare triple {29981#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29985#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} is VALID [2019-05-15 10:38:13,196 INFO L273 TraceCheckUtils]: 72: Hoare triple {29985#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29989#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} is VALID [2019-05-15 10:38:13,197 INFO L273 TraceCheckUtils]: 73: Hoare triple {29989#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29993#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} is VALID [2019-05-15 10:38:13,197 INFO L273 TraceCheckUtils]: 74: Hoare triple {29993#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29997#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} is VALID [2019-05-15 10:38:13,198 INFO L273 TraceCheckUtils]: 75: Hoare triple {29997#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30001#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} is VALID [2019-05-15 10:38:13,199 INFO L273 TraceCheckUtils]: 76: Hoare triple {30001#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30005#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} is VALID [2019-05-15 10:38:13,199 INFO L273 TraceCheckUtils]: 77: Hoare triple {30005#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30009#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} is VALID [2019-05-15 10:38:13,200 INFO L273 TraceCheckUtils]: 78: Hoare triple {30009#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30013#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} is VALID [2019-05-15 10:38:13,201 INFO L273 TraceCheckUtils]: 79: Hoare triple {30013#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30017#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} is VALID [2019-05-15 10:38:13,202 INFO L273 TraceCheckUtils]: 80: Hoare triple {30017#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30021#(= (select |#memory_int| ULTIMATE.start_main_p1) 78)} is VALID [2019-05-15 10:38:13,202 INFO L273 TraceCheckUtils]: 81: Hoare triple {30021#(= (select |#memory_int| ULTIMATE.start_main_p1) 78)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30025#(= (select |#memory_int| ULTIMATE.start_main_p1) 79)} is VALID [2019-05-15 10:38:13,203 INFO L273 TraceCheckUtils]: 82: Hoare triple {30025#(= (select |#memory_int| ULTIMATE.start_main_p1) 79)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30029#(= (select |#memory_int| ULTIMATE.start_main_p1) 80)} is VALID [2019-05-15 10:38:13,204 INFO L273 TraceCheckUtils]: 83: Hoare triple {30029#(= (select |#memory_int| ULTIMATE.start_main_p1) 80)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30033#(= (select |#memory_int| ULTIMATE.start_main_p1) 81)} is VALID [2019-05-15 10:38:13,205 INFO L273 TraceCheckUtils]: 84: Hoare triple {30033#(= (select |#memory_int| ULTIMATE.start_main_p1) 81)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30037#(= (select |#memory_int| ULTIMATE.start_main_p1) 82)} is VALID [2019-05-15 10:38:13,205 INFO L273 TraceCheckUtils]: 85: Hoare triple {30037#(= (select |#memory_int| ULTIMATE.start_main_p1) 82)} assume !(#memory_int[main_p1] >= 0); {29699#false} is VALID [2019-05-15 10:38:13,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:38:13,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:38:13,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-05-15 10:38:13,215 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 86 [2019-05-15 10:38:13,215 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:38:13,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 85 states. [2019-05-15 10:38:13,283 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:38:13,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-05-15 10:38:13,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-05-15 10:38:13,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2019-05-15 10:38:13,284 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 85 states. [2019-05-15 10:38:27,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:38:27,311 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-05-15 10:38:27,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-05-15 10:38:27,311 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 86 [2019-05-15 10:38:27,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:38:27,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-05-15 10:38:27,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2019-05-15 10:38:27,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-05-15 10:38:27,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2019-05-15 10:38:27,313 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 85 states and 89 transitions. [2019-05-15 10:38:27,382 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:38:27,383 INFO L225 Difference]: With dead ends: 88 [2019-05-15 10:38:27,384 INFO L226 Difference]: Without dead ends: 88 [2019-05-15 10:38:27,384 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2019-05-15 10:38:27,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-05-15 10:38:27,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-05-15 10:38:27,385 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:38:27,385 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 88 states. [2019-05-15 10:38:27,386 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 88 states. [2019-05-15 10:38:27,386 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 88 states. [2019-05-15 10:38:27,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:38:27,387 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-05-15 10:38:27,387 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-05-15 10:38:27,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:38:27,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:38:27,387 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 88 states. [2019-05-15 10:38:27,387 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 88 states. [2019-05-15 10:38:27,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:38:27,388 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-05-15 10:38:27,388 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-05-15 10:38:27,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:38:27,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:38:27,388 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:38:27,388 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:38:27,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-05-15 10:38:27,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-05-15 10:38:27,389 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2019-05-15 10:38:27,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:38:27,389 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-05-15 10:38:27,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-05-15 10:38:27,389 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-05-15 10:38:27,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-05-15 10:38:27,390 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:38:27,390 INFO L399 BasicCegarLoop]: trace histogram [83, 1, 1, 1, 1] [2019-05-15 10:38:27,390 INFO L418 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:38:27,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:38:27,390 INFO L82 PathProgramCache]: Analyzing trace with hash 158000130, now seen corresponding path program 83 times [2019-05-15 10:38:27,390 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:38:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:38:27,430 WARN L254 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 85 conjunts are in the unsatisfiable core [2019-05-15 10:38:27,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:38:27,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:38:27,467 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:27,467 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:27,469 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:27,469 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:27,469 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:38:27,471 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:27,471 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3493|]. (= |#memory_int| (store |v_#memory_int_3493| ULTIMATE.start_main_p1 0)) [2019-05-15 10:38:27,471 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:38:27,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 16 treesize of output 11 [2019-05-15 10:38:27,483 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:27,486 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:27,486 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:27,486 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:27,492 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:27,493 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3494|]. (let ((.cse0 (select |v_#memory_int_3494| ULTIMATE.start_main_p1))) (and (= 0 .cse0) (= |#memory_int| (store |v_#memory_int_3494| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:27,493 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:38:27,502 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:27,503 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:27,505 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:27,505 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:27,506 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:27,512 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:27,512 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3495|]. (let ((.cse0 (select |v_#memory_int_3495| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3495| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 1))) [2019-05-15 10:38:27,512 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:38:27,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 16 treesize of output 11 [2019-05-15 10:38:27,524 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:27,526 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:27,526 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:27,526 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:27,533 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:27,534 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3496|]. (let ((.cse0 (select |v_#memory_int_3496| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3496| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 2 .cse0))) [2019-05-15 10:38:27,534 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:38:27,545 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:27,546 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:27,548 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:27,548 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:27,548 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:27,556 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:27,556 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3497|]. (let ((.cse0 (select |v_#memory_int_3497| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3497| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 3 .cse0))) [2019-05-15 10:38:27,556 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:38:27,570 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:27,571 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:27,573 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:27,573 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:27,573 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:27,580 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:27,581 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3498|]. (let ((.cse0 (select |v_#memory_int_3498| ULTIMATE.start_main_p1))) (and (= 4 .cse0) (= |#memory_int| (store |v_#memory_int_3498| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:27,581 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:38:27,593 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:27,594 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:27,596 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:27,596 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:27,597 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:27,604 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:27,604 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3499|]. (let ((.cse0 (select |v_#memory_int_3499| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3499| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 5))) [2019-05-15 10:38:27,604 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:38:27,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 16 treesize of output 11 [2019-05-15 10:38:27,619 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:27,621 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:27,621 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:27,622 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:27,630 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:27,630 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3500|]. (let ((.cse0 (select |v_#memory_int_3500| ULTIMATE.start_main_p1))) (and (= .cse0 6) (= (store |v_#memory_int_3500| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:27,630 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:38:27,647 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:27,647 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:27,650 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:27,650 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:27,650 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:27,658 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:27,658 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3501|]. (let ((.cse0 (select |v_#memory_int_3501| ULTIMATE.start_main_p1))) (and (= 7 .cse0) (= |#memory_int| (store |v_#memory_int_3501| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:27,658 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:38:27,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:27,675 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:27,677 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:27,677 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:27,677 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:27,685 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:27,685 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3502|]. (let ((.cse0 (select |v_#memory_int_3502| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3502| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 8 .cse0))) [2019-05-15 10:38:27,685 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:38:27,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 16 treesize of output 11 [2019-05-15 10:38:27,702 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:27,711 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:27,711 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:27,711 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:27,717 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:27,717 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3503|]. (let ((.cse0 (select |v_#memory_int_3503| ULTIMATE.start_main_p1))) (and (= .cse0 9) (= (store |v_#memory_int_3503| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:27,717 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:38:27,735 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:27,736 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:27,738 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:27,738 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:27,738 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:27,745 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:27,745 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3504|]. (let ((.cse0 (select |v_#memory_int_3504| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3504| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 10))) [2019-05-15 10:38:27,745 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:38:27,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 16 treesize of output 11 [2019-05-15 10:38:27,763 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:27,765 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:27,765 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:27,765 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:27,772 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:27,772 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3505|]. (let ((.cse0 (select |v_#memory_int_3505| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3505| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 11))) [2019-05-15 10:38:27,772 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:38:27,790 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:27,791 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:27,793 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:27,793 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:27,793 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:27,800 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:27,800 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3506|]. (let ((.cse0 (select |v_#memory_int_3506| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3506| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 12))) [2019-05-15 10:38:27,800 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:38:27,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:27,820 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:27,822 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:27,823 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:27,823 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:27,830 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:27,830 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3507|]. (let ((.cse0 (select |v_#memory_int_3507| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3507| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 13))) [2019-05-15 10:38:27,830 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:38:27,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 16 treesize of output 11 [2019-05-15 10:38:27,853 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:27,855 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:27,855 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:27,855 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:27,864 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:27,864 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3508|]. (let ((.cse0 (select |v_#memory_int_3508| ULTIMATE.start_main_p1))) (and (= .cse0 14) (= (store |v_#memory_int_3508| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:27,864 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:38:27,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 16 treesize of output 11 [2019-05-15 10:38:27,884 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:27,886 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:27,886 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:27,886 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:27,894 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:27,894 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3509|]. (let ((.cse0 (select |v_#memory_int_3509| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3509| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 15 .cse0))) [2019-05-15 10:38:27,894 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:38:27,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 16 treesize of output 11 [2019-05-15 10:38:27,915 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:27,917 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:27,918 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:27,918 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:27,925 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:27,925 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3510|]. (let ((.cse0 (select |v_#memory_int_3510| ULTIMATE.start_main_p1))) (and (= .cse0 16) (= |#memory_int| (store |v_#memory_int_3510| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:27,925 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:38:27,948 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:27,949 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:27,951 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:27,951 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:27,951 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:27,957 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:27,957 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3511|]. (let ((.cse0 (select |v_#memory_int_3511| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3511| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 17 .cse0))) [2019-05-15 10:38:27,957 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:38:27,980 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:27,981 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:27,983 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:27,983 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:27,983 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:27,991 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:27,991 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3512|]. (let ((.cse0 (select |v_#memory_int_3512| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3512| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 18))) [2019-05-15 10:38:27,991 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:38:28,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:28,015 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:28,017 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:28,017 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:28,017 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:28,024 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:28,025 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3513|]. (let ((.cse0 (select |v_#memory_int_3513| ULTIMATE.start_main_p1))) (and (= .cse0 19) (= (store |v_#memory_int_3513| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:28,025 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:38:28,049 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:28,050 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:28,052 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:28,052 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:28,052 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:28,060 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:28,060 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3514|]. (let ((.cse0 (select |v_#memory_int_3514| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3514| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 20))) [2019-05-15 10:38:28,060 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:38:28,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:28,090 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:28,092 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:28,092 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:28,092 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:28,101 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:28,102 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3515|]. (let ((.cse0 (select |v_#memory_int_3515| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3515| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 21 .cse0))) [2019-05-15 10:38:28,102 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:38:28,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 16 treesize of output 11 [2019-05-15 10:38:28,129 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:28,131 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:28,131 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:28,131 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:28,139 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:28,139 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3516|]. (let ((.cse0 (select |v_#memory_int_3516| ULTIMATE.start_main_p1))) (and (= .cse0 22) (= |#memory_int| (store |v_#memory_int_3516| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:28,139 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:38:28,166 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:28,167 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:28,169 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:28,169 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:28,169 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:28,178 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:28,178 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3517|]. (let ((.cse0 (select |v_#memory_int_3517| ULTIMATE.start_main_p1))) (and (= 23 .cse0) (= (store |v_#memory_int_3517| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:28,178 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:38:28,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 16 treesize of output 11 [2019-05-15 10:38:28,208 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:28,210 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:28,211 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:28,211 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:28,219 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:28,219 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3518|]. (let ((.cse0 (select |v_#memory_int_3518| ULTIMATE.start_main_p1))) (and (= .cse0 24) (= (store |v_#memory_int_3518| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:28,220 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:38:28,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:28,250 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:28,252 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:28,252 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:28,252 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:28,260 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:28,260 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3519|]. (let ((.cse0 (select |v_#memory_int_3519| ULTIMATE.start_main_p1))) (and (= .cse0 25) (= (store |v_#memory_int_3519| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:28,260 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:38:28,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:28,298 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:28,300 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:28,300 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:28,300 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:28,308 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:28,308 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3520|]. (let ((.cse0 (select |v_#memory_int_3520| ULTIMATE.start_main_p1))) (and (= 26 .cse0) (= |#memory_int| (store |v_#memory_int_3520| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:28,309 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:38:28,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:28,339 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:28,341 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:28,341 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:28,341 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:28,349 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:28,349 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3521|]. (let ((.cse0 (select |v_#memory_int_3521| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3521| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 27 .cse0))) [2019-05-15 10:38:28,349 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:38:28,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:28,382 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:28,384 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:28,384 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:28,384 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:28,392 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:28,393 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3522|]. (let ((.cse0 (select |v_#memory_int_3522| ULTIMATE.start_main_p1))) (and (= .cse0 28) (= (store |v_#memory_int_3522| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:28,393 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:38:28,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 16 treesize of output 11 [2019-05-15 10:38:28,425 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:28,427 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:28,427 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:28,427 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:28,436 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:28,436 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3523|]. (let ((.cse0 (select |v_#memory_int_3523| ULTIMATE.start_main_p1))) (and (= 29 .cse0) (= (store |v_#memory_int_3523| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:28,436 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:38:28,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:28,469 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:28,471 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:28,471 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:28,472 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:28,479 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:28,479 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3524|]. (let ((.cse0 (select |v_#memory_int_3524| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3524| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 30))) [2019-05-15 10:38:28,480 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:38:28,511 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:28,512 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:28,514 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:28,514 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:28,514 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:28,522 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:28,522 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3525|]. (let ((.cse0 (select |v_#memory_int_3525| ULTIMATE.start_main_p1))) (and (= .cse0 31) (= (store |v_#memory_int_3525| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:28,523 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:38:28,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 16 treesize of output 11 [2019-05-15 10:38:28,556 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:28,558 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:28,558 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:28,558 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:28,566 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:28,566 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3526|]. (let ((.cse0 (select |v_#memory_int_3526| ULTIMATE.start_main_p1))) (and (= 32 .cse0) (= (store |v_#memory_int_3526| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:28,566 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:38:28,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:28,604 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:28,606 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:28,606 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:28,606 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:28,613 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:28,614 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3527|]. (let ((.cse0 (select |v_#memory_int_3527| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3527| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 33 .cse0))) [2019-05-15 10:38:28,614 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:38:28,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 16 treesize of output 11 [2019-05-15 10:38:28,652 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:28,654 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:28,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:28,654 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:28,661 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:28,661 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3528|]. (let ((.cse0 (select |v_#memory_int_3528| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3528| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 34))) [2019-05-15 10:38:28,662 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:38:28,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 16 treesize of output 11 [2019-05-15 10:38:28,698 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:28,700 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:28,700 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:28,700 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:28,707 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:28,707 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3529|]. (let ((.cse0 (select |v_#memory_int_3529| ULTIMATE.start_main_p1))) (and (= 35 .cse0) (= (store |v_#memory_int_3529| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:28,707 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:38:28,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 16 treesize of output 11 [2019-05-15 10:38:28,745 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:28,747 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:28,748 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:28,748 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:28,756 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:28,756 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3530|]. (let ((.cse0 (select |v_#memory_int_3530| ULTIMATE.start_main_p1))) (and (= .cse0 36) (= |#memory_int| (store |v_#memory_int_3530| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:28,756 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:38:28,794 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:28,795 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:28,797 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:28,797 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:28,797 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:28,804 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:28,804 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3531|]. (let ((.cse0 (select |v_#memory_int_3531| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3531| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 37))) [2019-05-15 10:38:28,804 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:38: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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:28,849 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:28,851 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:28,851 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:28,852 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:28,858 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:28,858 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3532|]. (let ((.cse0 (select |v_#memory_int_3532| ULTIMATE.start_main_p1))) (and (= 38 .cse0) (= (store |v_#memory_int_3532| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:28,859 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:38:28,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 16 treesize of output 11 [2019-05-15 10:38:28,899 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:28,901 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:28,902 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:28,902 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:28,909 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:28,909 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3533|]. (let ((.cse0 (select |v_#memory_int_3533| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3533| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 39 .cse0))) [2019-05-15 10:38:28,909 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:38:28,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 16 treesize of output 11 [2019-05-15 10:38:28,950 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:28,952 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:28,953 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:28,953 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:28,962 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:28,962 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3534|]. (let ((.cse0 (select |v_#memory_int_3534| ULTIMATE.start_main_p1))) (and (= 40 .cse0) (= (store |v_#memory_int_3534| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:28,963 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:38:29,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:29,002 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:29,004 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:29,004 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:29,005 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:29,013 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:29,013 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3535|]. (let ((.cse0 (select |v_#memory_int_3535| ULTIMATE.start_main_p1))) (and (= 41 .cse0) (= |#memory_int| (store |v_#memory_int_3535| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:29,013 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:38:29,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:29,055 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:29,057 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:29,057 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:29,057 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:29,066 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:29,067 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3536|]. (let ((.cse0 (select |v_#memory_int_3536| ULTIMATE.start_main_p1))) (and (= .cse0 42) (= |#memory_int| (store |v_#memory_int_3536| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:29,067 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:38:29,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 16 treesize of output 11 [2019-05-15 10:38:29,112 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:29,114 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:29,114 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:29,114 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:29,122 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:29,123 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3537|]. (let ((.cse0 (select |v_#memory_int_3537| ULTIMATE.start_main_p1))) (and (= 43 .cse0) (= |#memory_int| (store |v_#memory_int_3537| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:29,123 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:38:29,166 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:29,167 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:29,169 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:29,169 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:29,169 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:29,179 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:29,179 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3538|]. (let ((.cse0 (select |v_#memory_int_3538| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3538| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 44 .cse0))) [2019-05-15 10:38:29,179 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:38:29,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 16 treesize of output 11 [2019-05-15 10:38:29,224 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:29,226 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:29,227 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:29,227 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:29,235 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:29,235 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3539|]. (let ((.cse0 (select |v_#memory_int_3539| ULTIMATE.start_main_p1))) (and (= .cse0 45) (= (store |v_#memory_int_3539| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:29,235 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:38:29,280 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:29,281 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:29,283 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:29,284 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:29,284 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:29,292 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:29,292 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3540|]. (let ((.cse0 (select |v_#memory_int_3540| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3540| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 46))) [2019-05-15 10:38:29,292 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:38:29,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:29,339 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:29,341 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:29,341 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:29,342 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:29,349 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:29,349 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3541|]. (let ((.cse0 (select |v_#memory_int_3541| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3541| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 47 .cse0))) [2019-05-15 10:38:29,349 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:38:29,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 16 treesize of output 11 [2019-05-15 10:38:29,395 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:29,397 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:29,397 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:29,397 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:29,404 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:29,405 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3542|]. (let ((.cse0 (select |v_#memory_int_3542| ULTIMATE.start_main_p1))) (and (= 48 .cse0) (= (store |v_#memory_int_3542| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:29,405 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:38:29,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 16 treesize of output 11 [2019-05-15 10:38:29,458 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:29,460 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:29,461 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:29,461 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:29,468 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:29,468 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3543|]. (let ((.cse0 (select |v_#memory_int_3543| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3543| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 49 .cse0))) [2019-05-15 10:38:29,469 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:38:29,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:29,520 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:29,522 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:29,522 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:29,522 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:29,528 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:29,528 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3544|]. (let ((.cse0 (select |v_#memory_int_3544| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3544| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 50))) [2019-05-15 10:38:29,528 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:38:29,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:29,578 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:29,580 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:29,580 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:29,580 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:29,588 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:29,588 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3545|]. (let ((.cse0 (select |v_#memory_int_3545| ULTIMATE.start_main_p1))) (and (= .cse0 51) (= |#memory_int| (store |v_#memory_int_3545| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:29,588 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:38:29,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 16 treesize of output 11 [2019-05-15 10:38:29,639 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:29,641 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:29,641 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:29,642 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:29,649 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:29,649 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3546|]. (let ((.cse0 (select |v_#memory_int_3546| ULTIMATE.start_main_p1))) (and (= 52 .cse0) (= (store |v_#memory_int_3546| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:29,649 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:38:29,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 16 treesize of output 11 [2019-05-15 10:38:29,698 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:29,700 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:29,700 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:29,701 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:29,710 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:29,710 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3547|]. (let ((.cse0 (select |v_#memory_int_3547| ULTIMATE.start_main_p1))) (and (= 53 .cse0) (= (store |v_#memory_int_3547| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:29,710 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:38:29,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 16 treesize of output 11 [2019-05-15 10:38:29,762 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:29,764 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:29,764 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:29,764 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:29,772 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:29,772 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3548|]. (let ((.cse0 (select |v_#memory_int_3548| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3548| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 54))) [2019-05-15 10:38:29,772 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:38:29,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 16 treesize of output 11 [2019-05-15 10:38:29,824 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:29,826 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:29,826 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:29,827 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:29,836 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:29,837 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3549|]. (let ((.cse0 (select |v_#memory_int_3549| ULTIMATE.start_main_p1))) (and (= 55 .cse0) (= |#memory_int| (store |v_#memory_int_3549| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:29,837 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:38:29,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:29,890 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:29,892 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:29,892 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:29,893 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:29,900 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:29,900 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3550|]. (let ((.cse0 (select |v_#memory_int_3550| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3550| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 56))) [2019-05-15 10:38:29,900 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:38:29,953 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:29,954 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:29,956 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:29,956 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:29,957 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:29,963 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:29,964 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3551|]. (let ((.cse0 (select |v_#memory_int_3551| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3551| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 57 .cse0))) [2019-05-15 10:38:29,964 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:38:30,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 16 treesize of output 11 [2019-05-15 10:38:30,019 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:30,021 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:30,022 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:30,022 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:30,029 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:30,029 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3552|]. (let ((.cse0 (select |v_#memory_int_3552| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3552| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 58))) [2019-05-15 10:38:30,029 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:38:30,088 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:30,089 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:30,091 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:30,091 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:30,091 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:30,099 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:30,099 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3553|]. (let ((.cse0 (select |v_#memory_int_3553| ULTIMATE.start_main_p1))) (and (= 59 .cse0) (= (store |v_#memory_int_3553| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:30,099 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:38:30,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 16 treesize of output 11 [2019-05-15 10:38:30,156 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:30,158 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:30,158 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:30,158 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:30,166 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:30,166 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3554|]. (let ((.cse0 (select |v_#memory_int_3554| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3554| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 60))) [2019-05-15 10:38:30,166 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:38:30,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:30,225 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:30,227 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:30,227 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:30,227 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:30,235 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:30,235 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3555|]. (let ((.cse0 (select |v_#memory_int_3555| ULTIMATE.start_main_p1))) (and (= .cse0 61) (= (store |v_#memory_int_3555| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:30,235 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:38:30,293 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:30,294 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:30,296 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:30,296 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:30,297 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:30,304 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:30,304 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3556|]. (let ((.cse0 (select |v_#memory_int_3556| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3556| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 62 .cse0))) [2019-05-15 10:38:30,304 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:38:30,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:30,363 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:30,365 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:30,365 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:30,366 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:30,373 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:30,373 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3557|]. (let ((.cse0 (select |v_#memory_int_3557| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3557| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 63))) [2019-05-15 10:38:30,373 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 64) [2019-05-15 10:38:30,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:30,433 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:30,435 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:30,435 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:30,435 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:30,442 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:30,442 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3558|]. (let ((.cse0 (select |v_#memory_int_3558| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3558| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 64))) [2019-05-15 10:38:30,442 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 65) [2019-05-15 10:38:30,502 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:30,503 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:30,505 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:30,505 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:30,506 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:30,513 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:30,513 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3559|]. (let ((.cse0 (select |v_#memory_int_3559| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3559| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 65))) [2019-05-15 10:38:30,513 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 66) [2019-05-15 10:38:30,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:30,575 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:30,577 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:30,577 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:30,577 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:30,586 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:30,586 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3560|]. (let ((.cse0 (select |v_#memory_int_3560| ULTIMATE.start_main_p1))) (and (= 66 .cse0) (= (store |v_#memory_int_3560| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:30,586 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 67) [2019-05-15 10:38:30,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:30,654 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:30,656 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:30,657 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:30,657 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:30,664 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:30,664 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3561|]. (let ((.cse0 (select |v_#memory_int_3561| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3561| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 67))) [2019-05-15 10:38:30,664 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 68) [2019-05-15 10:38:30,733 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:30,734 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:30,736 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:30,736 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:30,736 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:30,744 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:30,745 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3562|]. (let ((.cse0 (select |v_#memory_int_3562| ULTIMATE.start_main_p1))) (and (= 68 .cse0) (= (store |v_#memory_int_3562| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:30,745 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 69) [2019-05-15 10:38:30,808 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:30,809 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:30,811 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:30,812 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:30,812 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:30,819 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:30,820 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3563|]. (let ((.cse0 (select |v_#memory_int_3563| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3563| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 69))) [2019-05-15 10:38:30,820 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 70) [2019-05-15 10:38:30,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 16 treesize of output 11 [2019-05-15 10:38:30,884 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:30,886 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:30,886 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:30,886 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:30,894 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:30,894 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3564|]. (let ((.cse0 (select |v_#memory_int_3564| ULTIMATE.start_main_p1))) (and (= 70 .cse0) (= |#memory_int| (store |v_#memory_int_3564| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:30,894 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 71) [2019-05-15 10:38:30,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 16 treesize of output 11 [2019-05-15 10:38:30,962 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:30,964 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:30,965 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:30,965 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:30,972 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:30,972 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3565|]. (let ((.cse0 (select |v_#memory_int_3565| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3565| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 71 .cse0))) [2019-05-15 10:38:30,972 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 72) [2019-05-15 10:38:31,038 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:31,039 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:31,041 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:31,041 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:31,041 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:31,049 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:31,049 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3566|]. (let ((.cse0 (select |v_#memory_int_3566| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3566| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 72))) [2019-05-15 10:38:31,049 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 73) [2019-05-15 10:38:31,117 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:31,117 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:31,120 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:31,120 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:31,120 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:31,126 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:31,126 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3567|]. (let ((.cse0 (select |v_#memory_int_3567| ULTIMATE.start_main_p1))) (and (= .cse0 73) (= (store |v_#memory_int_3567| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:31,127 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 74) [2019-05-15 10:38: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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:31,196 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:31,198 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:31,198 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:31,198 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:31,206 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:31,206 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3568|]. (let ((.cse0 (select |v_#memory_int_3568| ULTIMATE.start_main_p1))) (and (= 74 .cse0) (= (store |v_#memory_int_3568| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:31,207 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 75) [2019-05-15 10:38:31,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 16 treesize of output 11 [2019-05-15 10:38:31,272 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:31,274 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:31,274 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:31,275 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:31,282 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:31,282 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3569|]. (let ((.cse0 (select |v_#memory_int_3569| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3569| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 75))) [2019-05-15 10:38:31,282 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 76) [2019-05-15 10:38:31,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:31,351 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:31,353 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:31,353 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:31,353 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:31,360 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:31,360 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3570|]. (let ((.cse0 (select |v_#memory_int_3570| ULTIMATE.start_main_p1))) (and (= .cse0 76) (= (store |v_#memory_int_3570| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:31,361 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 77) [2019-05-15 10:38:31,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 16 treesize of output 11 [2019-05-15 10:38:31,435 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:31,437 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:31,437 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:31,437 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:31,444 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:31,444 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3571|]. (let ((.cse0 (select |v_#memory_int_3571| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3571| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 77 .cse0))) [2019-05-15 10:38:31,445 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 78) [2019-05-15 10:38:31,511 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:31,512 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:31,514 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:31,514 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:31,514 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:31,522 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:31,522 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3572|]. (let ((.cse0 (select |v_#memory_int_3572| ULTIMATE.start_main_p1))) (and (= .cse0 78) (= (store |v_#memory_int_3572| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:31,522 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 79) [2019-05-15 10:38:31,593 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:31,594 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:31,596 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:31,596 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:31,597 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:31,604 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:31,604 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3573|]. (let ((.cse0 (select |v_#memory_int_3573| ULTIMATE.start_main_p1))) (and (= 79 .cse0) (= |#memory_int| (store |v_#memory_int_3573| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:31,605 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 80) [2019-05-15 10:38:31,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:31,674 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:31,676 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:31,676 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:31,676 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:31,684 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:31,684 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3574|]. (let ((.cse0 (select |v_#memory_int_3574| ULTIMATE.start_main_p1))) (and (= 80 .cse0) (= (store |v_#memory_int_3574| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:31,684 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 81) [2019-05-15 10:38:31,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:31,758 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:31,760 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:31,760 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:31,760 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:31,767 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:31,768 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3575|]. (let ((.cse0 (select |v_#memory_int_3575| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3575| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 81 .cse0))) [2019-05-15 10:38:31,768 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 82) [2019-05-15 10:38:31,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:31,841 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:31,843 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:31,843 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:31,843 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:31,851 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:31,851 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3576|]. (let ((.cse0 (select |v_#memory_int_3576| ULTIMATE.start_main_p1))) (and (= .cse0 82) (= (store |v_#memory_int_3576| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:31,852 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 83) [2019-05-15 10:38:31,921 INFO L273 TraceCheckUtils]: 0: Hoare triple {30392#true} havoc main_p1; {30392#true} is VALID [2019-05-15 10:38:31,921 INFO L273 TraceCheckUtils]: 1: Hoare triple {30392#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {30392#true} is VALID [2019-05-15 10:38:31,922 INFO L273 TraceCheckUtils]: 2: Hoare triple {30392#true} #memory_int := #memory_int[main_p1 := 0]; {30403#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:38:31,923 INFO L273 TraceCheckUtils]: 3: Hoare triple {30403#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30407#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:38:31,923 INFO L273 TraceCheckUtils]: 4: Hoare triple {30407#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30411#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:38:31,924 INFO L273 TraceCheckUtils]: 5: Hoare triple {30411#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30415#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:38:31,924 INFO L273 TraceCheckUtils]: 6: Hoare triple {30415#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30419#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:38:31,925 INFO L273 TraceCheckUtils]: 7: Hoare triple {30419#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30423#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:38:31,925 INFO L273 TraceCheckUtils]: 8: Hoare triple {30423#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30427#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:38:31,926 INFO L273 TraceCheckUtils]: 9: Hoare triple {30427#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30431#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:38:31,927 INFO L273 TraceCheckUtils]: 10: Hoare triple {30431#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30435#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:38:31,927 INFO L273 TraceCheckUtils]: 11: Hoare triple {30435#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30439#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:38:31,928 INFO L273 TraceCheckUtils]: 12: Hoare triple {30439#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30443#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:38:31,929 INFO L273 TraceCheckUtils]: 13: Hoare triple {30443#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30447#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:38:31,930 INFO L273 TraceCheckUtils]: 14: Hoare triple {30447#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30451#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:38:31,930 INFO L273 TraceCheckUtils]: 15: Hoare triple {30451#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30455#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:38:31,931 INFO L273 TraceCheckUtils]: 16: Hoare triple {30455#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30459#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:38:31,932 INFO L273 TraceCheckUtils]: 17: Hoare triple {30459#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30463#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:38:31,933 INFO L273 TraceCheckUtils]: 18: Hoare triple {30463#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30467#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:38:31,933 INFO L273 TraceCheckUtils]: 19: Hoare triple {30467#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30471#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:38:31,934 INFO L273 TraceCheckUtils]: 20: Hoare triple {30471#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30475#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:38:31,935 INFO L273 TraceCheckUtils]: 21: Hoare triple {30475#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30479#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:38:31,936 INFO L273 TraceCheckUtils]: 22: Hoare triple {30479#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30483#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:38:31,936 INFO L273 TraceCheckUtils]: 23: Hoare triple {30483#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30487#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:38:31,937 INFO L273 TraceCheckUtils]: 24: Hoare triple {30487#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30491#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:38:31,938 INFO L273 TraceCheckUtils]: 25: Hoare triple {30491#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30495#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:38:31,939 INFO L273 TraceCheckUtils]: 26: Hoare triple {30495#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30499#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:38:31,939 INFO L273 TraceCheckUtils]: 27: Hoare triple {30499#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30503#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:38:31,940 INFO L273 TraceCheckUtils]: 28: Hoare triple {30503#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30507#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:38:31,941 INFO L273 TraceCheckUtils]: 29: Hoare triple {30507#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30511#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:38:31,942 INFO L273 TraceCheckUtils]: 30: Hoare triple {30511#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30515#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:38:31,942 INFO L273 TraceCheckUtils]: 31: Hoare triple {30515#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30519#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:38:31,943 INFO L273 TraceCheckUtils]: 32: Hoare triple {30519#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30523#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:38:31,944 INFO L273 TraceCheckUtils]: 33: Hoare triple {30523#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30527#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:38:31,944 INFO L273 TraceCheckUtils]: 34: Hoare triple {30527#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30531#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:38:31,945 INFO L273 TraceCheckUtils]: 35: Hoare triple {30531#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30535#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:38:31,946 INFO L273 TraceCheckUtils]: 36: Hoare triple {30535#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30539#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:38:31,947 INFO L273 TraceCheckUtils]: 37: Hoare triple {30539#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30543#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:38:31,947 INFO L273 TraceCheckUtils]: 38: Hoare triple {30543#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30547#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:38:31,948 INFO L273 TraceCheckUtils]: 39: Hoare triple {30547#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30551#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:38:31,949 INFO L273 TraceCheckUtils]: 40: Hoare triple {30551#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30555#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:38:31,950 INFO L273 TraceCheckUtils]: 41: Hoare triple {30555#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30559#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:38:31,950 INFO L273 TraceCheckUtils]: 42: Hoare triple {30559#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30563#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:38:31,951 INFO L273 TraceCheckUtils]: 43: Hoare triple {30563#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30567#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:38:31,952 INFO L273 TraceCheckUtils]: 44: Hoare triple {30567#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30571#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:38:31,953 INFO L273 TraceCheckUtils]: 45: Hoare triple {30571#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30575#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:38:31,953 INFO L273 TraceCheckUtils]: 46: Hoare triple {30575#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30579#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:38:31,954 INFO L273 TraceCheckUtils]: 47: Hoare triple {30579#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30583#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:38:31,955 INFO L273 TraceCheckUtils]: 48: Hoare triple {30583#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30587#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:38:31,956 INFO L273 TraceCheckUtils]: 49: Hoare triple {30587#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30591#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:38:31,956 INFO L273 TraceCheckUtils]: 50: Hoare triple {30591#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30595#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:38:31,957 INFO L273 TraceCheckUtils]: 51: Hoare triple {30595#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30599#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:38:31,958 INFO L273 TraceCheckUtils]: 52: Hoare triple {30599#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30603#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:38:31,959 INFO L273 TraceCheckUtils]: 53: Hoare triple {30603#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30607#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:38:31,959 INFO L273 TraceCheckUtils]: 54: Hoare triple {30607#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30611#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:38:31,960 INFO L273 TraceCheckUtils]: 55: Hoare triple {30611#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30615#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:38:31,961 INFO L273 TraceCheckUtils]: 56: Hoare triple {30615#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30619#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:38:31,962 INFO L273 TraceCheckUtils]: 57: Hoare triple {30619#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30623#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:38:31,962 INFO L273 TraceCheckUtils]: 58: Hoare triple {30623#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30627#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:38:31,963 INFO L273 TraceCheckUtils]: 59: Hoare triple {30627#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30631#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:38:31,964 INFO L273 TraceCheckUtils]: 60: Hoare triple {30631#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30635#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:38:31,965 INFO L273 TraceCheckUtils]: 61: Hoare triple {30635#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30639#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:38:31,965 INFO L273 TraceCheckUtils]: 62: Hoare triple {30639#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30643#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:38:31,966 INFO L273 TraceCheckUtils]: 63: Hoare triple {30643#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30647#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:38:31,967 INFO L273 TraceCheckUtils]: 64: Hoare triple {30647#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30651#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:38:31,967 INFO L273 TraceCheckUtils]: 65: Hoare triple {30651#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30655#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:38:31,968 INFO L273 TraceCheckUtils]: 66: Hoare triple {30655#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30659#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} is VALID [2019-05-15 10:38:31,969 INFO L273 TraceCheckUtils]: 67: Hoare triple {30659#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30663#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} is VALID [2019-05-15 10:38:31,970 INFO L273 TraceCheckUtils]: 68: Hoare triple {30663#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30667#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} is VALID [2019-05-15 10:38:31,970 INFO L273 TraceCheckUtils]: 69: Hoare triple {30667#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30671#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} is VALID [2019-05-15 10:38:31,971 INFO L273 TraceCheckUtils]: 70: Hoare triple {30671#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30675#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} is VALID [2019-05-15 10:38:31,972 INFO L273 TraceCheckUtils]: 71: Hoare triple {30675#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30679#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} is VALID [2019-05-15 10:38:31,973 INFO L273 TraceCheckUtils]: 72: Hoare triple {30679#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30683#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} is VALID [2019-05-15 10:38:31,973 INFO L273 TraceCheckUtils]: 73: Hoare triple {30683#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30687#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} is VALID [2019-05-15 10:38:31,974 INFO L273 TraceCheckUtils]: 74: Hoare triple {30687#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30691#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} is VALID [2019-05-15 10:38:31,975 INFO L273 TraceCheckUtils]: 75: Hoare triple {30691#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30695#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} is VALID [2019-05-15 10:38:31,976 INFO L273 TraceCheckUtils]: 76: Hoare triple {30695#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30699#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} is VALID [2019-05-15 10:38:31,976 INFO L273 TraceCheckUtils]: 77: Hoare triple {30699#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30703#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} is VALID [2019-05-15 10:38:31,977 INFO L273 TraceCheckUtils]: 78: Hoare triple {30703#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30707#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} is VALID [2019-05-15 10:38:31,978 INFO L273 TraceCheckUtils]: 79: Hoare triple {30707#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30711#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} is VALID [2019-05-15 10:38:31,979 INFO L273 TraceCheckUtils]: 80: Hoare triple {30711#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30715#(= (select |#memory_int| ULTIMATE.start_main_p1) 78)} is VALID [2019-05-15 10:38:31,979 INFO L273 TraceCheckUtils]: 81: Hoare triple {30715#(= (select |#memory_int| ULTIMATE.start_main_p1) 78)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30719#(= (select |#memory_int| ULTIMATE.start_main_p1) 79)} is VALID [2019-05-15 10:38:31,980 INFO L273 TraceCheckUtils]: 82: Hoare triple {30719#(= (select |#memory_int| ULTIMATE.start_main_p1) 79)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30723#(= (select |#memory_int| ULTIMATE.start_main_p1) 80)} is VALID [2019-05-15 10:38:31,981 INFO L273 TraceCheckUtils]: 83: Hoare triple {30723#(= (select |#memory_int| ULTIMATE.start_main_p1) 80)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30727#(= (select |#memory_int| ULTIMATE.start_main_p1) 81)} is VALID [2019-05-15 10:38:31,982 INFO L273 TraceCheckUtils]: 84: Hoare triple {30727#(= (select |#memory_int| ULTIMATE.start_main_p1) 81)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30731#(= (select |#memory_int| ULTIMATE.start_main_p1) 82)} is VALID [2019-05-15 10:38:31,982 INFO L273 TraceCheckUtils]: 85: Hoare triple {30731#(= (select |#memory_int| ULTIMATE.start_main_p1) 82)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30735#(= (select |#memory_int| ULTIMATE.start_main_p1) 83)} is VALID [2019-05-15 10:38:31,983 INFO L273 TraceCheckUtils]: 86: Hoare triple {30735#(= (select |#memory_int| ULTIMATE.start_main_p1) 83)} assume !(#memory_int[main_p1] >= 0); {30393#false} is VALID [2019-05-15 10:38:31,993 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:38:31,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:38:31,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-05-15 10:38:31,993 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 87 [2019-05-15 10:38:31,994 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:38:31,994 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 86 states. [2019-05-15 10:38:32,134 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:38:32,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-05-15 10:38:32,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-05-15 10:38:32,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2019-05-15 10:38:32,135 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 86 states. [2019-05-15 10:38:46,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:38:46,488 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-05-15 10:38:46,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-05-15 10:38:46,488 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 87 [2019-05-15 10:38:46,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:38:46,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-05-15 10:38:46,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2019-05-15 10:38:46,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-05-15 10:38:46,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2019-05-15 10:38:46,491 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 86 states and 90 transitions. [2019-05-15 10:38:46,561 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:46,562 INFO L225 Difference]: With dead ends: 89 [2019-05-15 10:38:46,562 INFO L226 Difference]: Without dead ends: 89 [2019-05-15 10:38:46,562 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2019-05-15 10:38:46,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-05-15 10:38:46,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-05-15 10:38:46,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:38:46,564 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 89 states. [2019-05-15 10:38:46,564 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 89 states. [2019-05-15 10:38:46,564 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 89 states. [2019-05-15 10:38:46,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:38:46,565 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-05-15 10:38:46,565 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-05-15 10:38:46,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:38:46,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:38:46,565 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 89 states. [2019-05-15 10:38:46,565 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 89 states. [2019-05-15 10:38:46,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:38:46,566 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-05-15 10:38:46,566 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-05-15 10:38:46,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:38:46,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:38:46,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:38:46,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:38:46,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-05-15 10:38:46,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-05-15 10:38:46,567 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2019-05-15 10:38:46,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:38:46,567 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-05-15 10:38:46,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-05-15 10:38:46,567 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-05-15 10:38:46,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-05-15 10:38:46,568 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:38:46,568 INFO L399 BasicCegarLoop]: trace histogram [84, 1, 1, 1, 1] [2019-05-15 10:38:46,568 INFO L418 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:38:46,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:38:46,568 INFO L82 PathProgramCache]: Analyzing trace with hash 603036680, now seen corresponding path program 84 times [2019-05-15 10:38:46,569 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:38:46,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:38:46,609 WARN L254 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 86 conjunts are in the unsatisfiable core [2019-05-15 10:38:46,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:38:46,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:38:46,716 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:46,716 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:46,717 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:46,718 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:46,718 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:38:46,720 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:46,720 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3577|]. (= (store |v_#memory_int_3577| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:38:46,720 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:38:46,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:46,730 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:46,732 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:46,732 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:46,733 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:46,741 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:46,742 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3578|]. (let ((.cse0 (select |v_#memory_int_3578| ULTIMATE.start_main_p1))) (and (= 0 .cse0) (= (store |v_#memory_int_3578| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:46,742 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:38:46,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 16 treesize of output 11 [2019-05-15 10:38:46,753 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:46,755 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:46,755 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:46,756 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:46,764 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:46,764 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3579|]. (let ((.cse0 (select |v_#memory_int_3579| ULTIMATE.start_main_p1))) (and (= 1 .cse0) (= (store |v_#memory_int_3579| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:46,764 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:38:46,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 16 treesize of output 11 [2019-05-15 10:38:46,776 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:46,778 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:46,778 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:46,778 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:46,785 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:46,785 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3580|]. (let ((.cse0 (select |v_#memory_int_3580| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3580| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 2))) [2019-05-15 10:38:46,786 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:38:46,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 16 treesize of output 11 [2019-05-15 10:38:46,797 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:46,799 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:46,799 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:46,799 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:46,808 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:46,808 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3581|]. (let ((.cse0 (select |v_#memory_int_3581| ULTIMATE.start_main_p1))) (and (= 3 .cse0) (= (store |v_#memory_int_3581| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:46,808 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:38:46,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 16 treesize of output 11 [2019-05-15 10:38:46,822 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:46,824 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:46,825 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:46,825 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:46,832 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:46,833 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3582|]. (let ((.cse0 (select |v_#memory_int_3582| ULTIMATE.start_main_p1))) (and (= .cse0 4) (= (store |v_#memory_int_3582| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:46,833 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:38:46,846 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:46,852 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:46,853 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:46,854 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:46,854 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:46,860 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:46,860 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3583|]. (let ((.cse0 (select |v_#memory_int_3583| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3583| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 5 .cse0))) [2019-05-15 10:38:46,861 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:38:46,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:46,876 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:46,878 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:46,878 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:46,879 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:46,887 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:46,887 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3584|]. (let ((.cse0 (select |v_#memory_int_3584| ULTIMATE.start_main_p1))) (and (= .cse0 6) (= (store |v_#memory_int_3584| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:46,888 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:38:46,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 16 treesize of output 11 [2019-05-15 10:38:46,902 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:46,904 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:46,904 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:46,905 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:46,912 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:46,912 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3585|]. (let ((.cse0 (select |v_#memory_int_3585| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3585| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 7))) [2019-05-15 10:38:46,912 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:38:46,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 16 treesize of output 11 [2019-05-15 10:38:46,928 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:46,930 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:46,930 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:46,931 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:46,937 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:46,937 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3586|]. (let ((.cse0 (select |v_#memory_int_3586| ULTIMATE.start_main_p1))) (and (= 8 .cse0) (= |#memory_int| (store |v_#memory_int_3586| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:46,937 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:38:46,953 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:46,953 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:46,955 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:46,956 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:46,956 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:46,963 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:46,963 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3587|]. (let ((.cse0 (select |v_#memory_int_3587| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3587| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 9 .cse0))) [2019-05-15 10:38:46,963 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:38:46,981 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:46,982 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:46,984 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:46,984 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:46,984 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:46,992 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:46,992 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3588|]. (let ((.cse0 (select |v_#memory_int_3588| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3588| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 10 .cse0))) [2019-05-15 10:38:46,992 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:38:47,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:47,010 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,012 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:47,013 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,013 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:47,020 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:47,020 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3589|]. (let ((.cse0 (select |v_#memory_int_3589| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3589| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 11))) [2019-05-15 10:38:47,020 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:38:47,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:47,039 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,041 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:47,042 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,042 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:47,049 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:47,049 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3590|]. (let ((.cse0 (select |v_#memory_int_3590| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3590| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 12))) [2019-05-15 10:38:47,050 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:38:47,068 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:47,069 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,070 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:47,071 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,071 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:47,078 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:47,079 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3591|]. (let ((.cse0 (select |v_#memory_int_3591| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3591| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 13))) [2019-05-15 10:38:47,079 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:38:47,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:47,102 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,104 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:47,104 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,104 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:47,112 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:47,112 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3592|]. (let ((.cse0 (select |v_#memory_int_3592| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3592| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 14))) [2019-05-15 10:38:47,112 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:38:47,132 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:47,133 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,135 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:47,135 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,136 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:47,143 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:47,143 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3593|]. (let ((.cse0 (select |v_#memory_int_3593| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3593| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 15))) [2019-05-15 10:38:47,143 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:38:47,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 16 treesize of output 11 [2019-05-15 10:38:47,166 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,168 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:47,168 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,168 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:47,176 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:47,176 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3594|]. (let ((.cse0 (select |v_#memory_int_3594| ULTIMATE.start_main_p1))) (and (= 16 .cse0) (= |#memory_int| (store |v_#memory_int_3594| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:47,176 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:38:47,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:47,200 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:47,203 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,203 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:47,210 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:47,210 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3595|]. (let ((.cse0 (select |v_#memory_int_3595| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3595| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 17))) [2019-05-15 10:38:47,210 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:38:47,231 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:47,232 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,234 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:47,235 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,235 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:47,242 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:47,243 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3596|]. (let ((.cse0 (select |v_#memory_int_3596| ULTIMATE.start_main_p1))) (and (= 18 .cse0) (= (store |v_#memory_int_3596| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:47,243 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:38:47,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 16 treesize of output 11 [2019-05-15 10:38:47,266 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,268 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:47,269 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,269 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:47,277 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:47,277 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3597|]. (let ((.cse0 (select |v_#memory_int_3597| ULTIMATE.start_main_p1))) (and (= .cse0 19) (= (store |v_#memory_int_3597| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:47,277 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:38:47,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 16 treesize of output 11 [2019-05-15 10:38:47,303 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,305 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:47,305 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,305 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:47,312 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:47,312 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3598|]. (let ((.cse0 (select |v_#memory_int_3598| ULTIMATE.start_main_p1))) (and (= 20 .cse0) (= (store |v_#memory_int_3598| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:47,312 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:38:47,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 16 treesize of output 11 [2019-05-15 10:38:47,338 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,340 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:47,340 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,340 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:47,347 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:47,347 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3599|]. (let ((.cse0 (select |v_#memory_int_3599| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3599| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 21 .cse0))) [2019-05-15 10:38:47,348 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:38:47,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:47,375 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,377 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:47,377 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,378 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:47,385 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:47,385 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3600|]. (let ((.cse0 (select |v_#memory_int_3600| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3600| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 22 .cse0))) [2019-05-15 10:38:47,385 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:38:47,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:47,413 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,415 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:47,415 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,415 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:47,423 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:47,423 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3601|]. (let ((.cse0 (select |v_#memory_int_3601| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3601| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 23))) [2019-05-15 10:38:47,423 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:38:47,454 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:47,455 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,457 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:47,457 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,457 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:47,464 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:47,464 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3602|]. (let ((.cse0 (select |v_#memory_int_3602| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3602| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 24 .cse0))) [2019-05-15 10:38:47,465 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:38:47,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 16 treesize of output 11 [2019-05-15 10:38:47,494 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,496 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:47,496 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,496 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:47,504 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:47,504 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3603|]. (let ((.cse0 (select |v_#memory_int_3603| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3603| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 25 .cse0))) [2019-05-15 10:38:47,504 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:38:47,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:47,539 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,541 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:47,541 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,541 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:47,548 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:47,549 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3604|]. (let ((.cse0 (select |v_#memory_int_3604| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3604| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 26 .cse0))) [2019-05-15 10:38:47,549 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:38:47,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:47,578 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,580 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:47,580 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,581 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:47,588 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:47,588 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3605|]. (let ((.cse0 (select |v_#memory_int_3605| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3605| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 27))) [2019-05-15 10:38:47,588 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:38:47,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:47,620 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,622 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:47,622 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,623 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:47,631 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:47,631 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3606|]. (let ((.cse0 (select |v_#memory_int_3606| ULTIMATE.start_main_p1))) (and (= .cse0 28) (= (store |v_#memory_int_3606| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:47,631 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:38:47,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:47,663 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,665 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:47,666 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,666 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:47,674 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:47,674 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3607|]. (let ((.cse0 (select |v_#memory_int_3607| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3607| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 29 .cse0))) [2019-05-15 10:38:47,674 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:38:47,705 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:47,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,708 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:47,709 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,709 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:47,716 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:47,716 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3608|]. (let ((.cse0 (select |v_#memory_int_3608| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3608| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 30))) [2019-05-15 10:38:47,717 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:38:47,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 16 treesize of output 11 [2019-05-15 10:38:47,750 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,752 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:47,752 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,752 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:47,760 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:47,760 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3609|]. (let ((.cse0 (select |v_#memory_int_3609| ULTIMATE.start_main_p1))) (and (= 31 .cse0) (= (store |v_#memory_int_3609| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:47,760 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:38:47,792 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:47,792 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,794 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:47,795 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,795 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:47,803 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:47,803 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3610|]. (let ((.cse0 (select |v_#memory_int_3610| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3610| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 32 .cse0))) [2019-05-15 10:38:47,803 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:38:47,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 16 treesize of output 11 [2019-05-15 10:38:47,837 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,839 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:47,840 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,840 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:47,846 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:47,846 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3611|]. (let ((.cse0 (select |v_#memory_int_3611| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3611| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 33))) [2019-05-15 10:38:47,846 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:38:47,882 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:47,883 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,885 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:47,885 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,885 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:47,893 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:47,893 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3612|]. (let ((.cse0 (select |v_#memory_int_3612| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3612| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 34 .cse0))) [2019-05-15 10:38:47,894 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:38:47,929 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:47,930 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,932 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:47,932 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,933 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:47,941 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:47,941 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3613|]. (let ((.cse0 (select |v_#memory_int_3613| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3613| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 35))) [2019-05-15 10:38:47,941 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:38:47,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:47,977 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,979 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:47,979 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:47,980 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [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_#memory_int_3614|]. (let ((.cse0 (select |v_#memory_int_3614| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3614| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 36))) [2019-05-15 10:38:47,988 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:38:48,024 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:48,025 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:48,027 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:48,028 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:48,028 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:48,036 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:48,036 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3615|]. (let ((.cse0 (select |v_#memory_int_3615| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3615| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 37))) [2019-05-15 10:38:48,036 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:38:48,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 16 treesize of output 11 [2019-05-15 10:38:48,076 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:48,078 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:48,078 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:48,078 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:48,087 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:48,087 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3616|]. (let ((.cse0 (select |v_#memory_int_3616| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3616| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 38 .cse0))) [2019-05-15 10:38:48,087 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:38:48,131 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:48,131 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:48,134 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:48,134 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:48,134 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:48,142 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:48,142 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3617|]. (let ((.cse0 (select |v_#memory_int_3617| ULTIMATE.start_main_p1))) (and (= .cse0 39) (= (store |v_#memory_int_3617| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:48,142 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:38:48,181 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:48,182 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:48,184 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:48,184 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:48,185 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:48,192 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:48,192 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3618|]. (let ((.cse0 (select |v_#memory_int_3618| ULTIMATE.start_main_p1))) (and (= .cse0 40) (= (store |v_#memory_int_3618| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:48,192 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:38:48,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 16 treesize of output 11 [2019-05-15 10:38:48,234 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:48,236 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:48,237 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:48,237 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:48,244 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:48,244 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3619|]. (let ((.cse0 (select |v_#memory_int_3619| ULTIMATE.start_main_p1))) (and (= 41 .cse0) (= (store |v_#memory_int_3619| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:48,245 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:38:48,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:48,286 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:48,288 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:48,289 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:48,289 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:48,296 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:48,297 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3620|]. (let ((.cse0 (select |v_#memory_int_3620| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3620| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 42 .cse0))) [2019-05-15 10:38:48,297 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:38:48,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:48,341 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:48,343 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:48,343 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:48,343 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:48,350 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:48,351 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3621|]. (let ((.cse0 (select |v_#memory_int_3621| ULTIMATE.start_main_p1))) (and (= .cse0 43) (= (store |v_#memory_int_3621| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:48,351 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:38:48,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 16 treesize of output 11 [2019-05-15 10:38:48,397 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:48,399 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:48,399 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:48,399 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:48,408 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:48,408 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3622|]. (let ((.cse0 (select |v_#memory_int_3622| ULTIMATE.start_main_p1))) (and (= 44 .cse0) (= (store |v_#memory_int_3622| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:48,408 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:38:48,453 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:48,454 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:48,456 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:48,456 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:48,456 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:48,464 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:48,464 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3623|]. (let ((.cse0 (select |v_#memory_int_3623| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3623| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 45))) [2019-05-15 10:38:48,464 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:38:48,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 16 treesize of output 11 [2019-05-15 10:38:48,507 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:48,509 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:48,509 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:48,509 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:48,517 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:48,517 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3624|]. (let ((.cse0 (select |v_#memory_int_3624| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3624| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 46))) [2019-05-15 10:38:48,517 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:38:48,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:48,563 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:48,565 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:48,565 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:48,565 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:48,573 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:48,573 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3625|]. (let ((.cse0 (select |v_#memory_int_3625| ULTIMATE.start_main_p1))) (and (= 47 .cse0) (= (store |v_#memory_int_3625| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:48,573 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:38:48,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 16 treesize of output 11 [2019-05-15 10:38:48,617 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:48,619 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:48,619 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:48,620 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:48,628 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:48,628 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3626|]. (let ((.cse0 (select |v_#memory_int_3626| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3626| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 48))) [2019-05-15 10:38:48,628 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:38:48,676 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:48,677 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:48,679 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:48,679 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:48,680 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:48,687 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:48,687 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3627|]. (let ((.cse0 (select |v_#memory_int_3627| ULTIMATE.start_main_p1))) (and (= .cse0 49) (= (store |v_#memory_int_3627| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:48,688 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:38:48,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 16 treesize of output 11 [2019-05-15 10:38:48,737 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:48,739 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:48,740 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:48,740 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:48,748 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:48,748 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3628|]. (let ((.cse0 (select |v_#memory_int_3628| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3628| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 50 .cse0))) [2019-05-15 10:38:48,748 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:38:48,798 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:48,799 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:48,801 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:48,801 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:48,801 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:48,809 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:48,809 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3629|]. (let ((.cse0 (select |v_#memory_int_3629| ULTIMATE.start_main_p1))) (and (= .cse0 51) (= (store |v_#memory_int_3629| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:48,809 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:38:48,857 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:48,858 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:48,860 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:48,860 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:48,860 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:48,868 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:48,868 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3630|]. (let ((.cse0 (select |v_#memory_int_3630| ULTIMATE.start_main_p1))) (and (= 52 .cse0) (= (store |v_#memory_int_3630| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:48,868 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:38:48,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 16 treesize of output 11 [2019-05-15 10:38:48,919 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:48,921 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:48,922 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:48,922 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:48,929 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:48,930 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3631|]. (let ((.cse0 (select |v_#memory_int_3631| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3631| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 53))) [2019-05-15 10:38:48,930 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:38:48,980 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:48,981 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:48,983 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:48,983 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:48,984 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:48,991 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:48,991 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3632|]. (let ((.cse0 (select |v_#memory_int_3632| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3632| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 54))) [2019-05-15 10:38:48,991 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:38:49,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 16 treesize of output 11 [2019-05-15 10:38:49,042 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:49,044 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:49,044 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:49,045 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:49,053 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:49,054 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3633|]. (let ((.cse0 (select |v_#memory_int_3633| ULTIMATE.start_main_p1))) (and (= .cse0 55) (= |#memory_int| (store |v_#memory_int_3633| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:49,054 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:38:49,105 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:49,106 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:49,108 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:49,108 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:49,108 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:49,116 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:49,117 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3634|]. (let ((.cse0 (select |v_#memory_int_3634| ULTIMATE.start_main_p1))) (and (= 56 .cse0) (= (store |v_#memory_int_3634| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:49,117 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:38:49,170 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:49,171 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:49,173 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:49,173 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:49,173 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:49,180 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:49,181 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3635|]. (let ((.cse0 (select |v_#memory_int_3635| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3635| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 57 .cse0))) [2019-05-15 10:38:49,181 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:38:49,244 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:49,245 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:49,247 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:49,247 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:49,248 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [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_#memory_int_3636|]. (let ((.cse0 (select |v_#memory_int_3636| ULTIMATE.start_main_p1))) (and (= .cse0 58) (= (store |v_#memory_int_3636| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:49,255 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:38:49,307 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:49,308 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:49,310 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:49,310 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:49,310 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:49,318 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:49,318 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3637|]. (let ((.cse0 (select |v_#memory_int_3637| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3637| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 59))) [2019-05-15 10:38:49,318 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:38:49,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 16 treesize of output 11 [2019-05-15 10:38:49,374 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:49,376 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:49,377 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:49,377 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:49,384 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:49,384 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3638|]. (let ((.cse0 (select |v_#memory_int_3638| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3638| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 60 .cse0))) [2019-05-15 10:38:49,384 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:38:49,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:49,442 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:49,444 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:49,444 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:49,445 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:49,452 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:49,452 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3639|]. (let ((.cse0 (select |v_#memory_int_3639| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3639| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 61))) [2019-05-15 10:38:49,452 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:38:49,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 16 treesize of output 11 [2019-05-15 10:38:49,510 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:49,512 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:49,513 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:49,513 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:49,520 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:49,520 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3640|]. (let ((.cse0 (select |v_#memory_int_3640| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3640| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 62 .cse0))) [2019-05-15 10:38:49,520 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:38:49,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:49,578 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:49,580 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:49,581 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:49,581 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:49,588 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:49,588 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3641|]. (let ((.cse0 (select |v_#memory_int_3641| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3641| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 63 .cse0))) [2019-05-15 10:38:49,589 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 64) [2019-05-15 10:38:49,648 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:49,649 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:49,651 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:49,651 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:49,651 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:49,659 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:49,659 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3642|]. (let ((.cse0 (select |v_#memory_int_3642| ULTIMATE.start_main_p1))) (and (= 64 .cse0) (= (store |v_#memory_int_3642| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:49,659 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 65) [2019-05-15 10:38:49,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 16 treesize of output 11 [2019-05-15 10:38:49,720 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:49,722 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:49,722 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:49,722 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:49,729 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:49,730 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3643|]. (let ((.cse0 (select |v_#memory_int_3643| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3643| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 65 .cse0))) [2019-05-15 10:38:49,730 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 66) [2019-05-15 10:38:49,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 16 treesize of output 11 [2019-05-15 10:38:49,794 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:49,796 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:49,796 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:49,797 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:49,805 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:49,805 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3644|]. (let ((.cse0 (select |v_#memory_int_3644| ULTIMATE.start_main_p1))) (and (= .cse0 66) (= |#memory_int| (store |v_#memory_int_3644| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:49,805 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 67) [2019-05-15 10:38:49,863 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:49,864 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:49,866 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:49,866 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:49,867 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:49,875 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:49,875 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3645|]. (let ((.cse0 (select |v_#memory_int_3645| ULTIMATE.start_main_p1))) (and (= .cse0 67) (= (store |v_#memory_int_3645| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:49,875 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 68) [2019-05-15 10:38:49,939 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:49,940 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:49,942 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:49,942 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:49,942 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:49,950 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:49,950 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3646|]. (let ((.cse0 (select |v_#memory_int_3646| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3646| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 68))) [2019-05-15 10:38:49,950 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 69) [2019-05-15 10:38:50,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:50,012 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:50,014 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:50,014 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:50,014 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:50,021 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:50,021 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3647|]. (let ((.cse0 (select |v_#memory_int_3647| ULTIMATE.start_main_p1))) (and (= 69 .cse0) (= |#memory_int| (store |v_#memory_int_3647| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:50,021 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 70) [2019-05-15 10:38:50,086 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:50,087 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:50,089 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:50,089 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:50,089 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:50,098 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:50,098 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3648|]. (let ((.cse0 (select |v_#memory_int_3648| ULTIMATE.start_main_p1))) (and (= 70 .cse0) (= (store |v_#memory_int_3648| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:50,098 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 71) [2019-05-15 10:38:50,160 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:50,161 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:50,163 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:50,163 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:50,163 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:50,171 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:50,171 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3649|]. (let ((.cse0 (select |v_#memory_int_3649| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3649| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 71))) [2019-05-15 10:38:50,171 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 72) [2019-05-15 10:38:50,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 16 treesize of output 11 [2019-05-15 10:38:50,236 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:50,238 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:50,238 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:50,238 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:50,246 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:50,246 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3650|]. (let ((.cse0 (select |v_#memory_int_3650| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3650| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 72 .cse0))) [2019-05-15 10:38:50,246 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 73) [2019-05-15 10:38:50,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 16 treesize of output 11 [2019-05-15 10:38:50,316 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:50,318 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:50,319 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:50,319 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:50,326 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:50,326 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3651|]. (let ((.cse0 (select |v_#memory_int_3651| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3651| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 73 .cse0))) [2019-05-15 10:38:50,326 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 74) [2019-05-15 10:38:50,389 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:50,390 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:50,392 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:50,393 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:50,393 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:50,400 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:50,400 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3652|]. (let ((.cse0 (select |v_#memory_int_3652| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3652| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 74))) [2019-05-15 10:38:50,400 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 75) [2019-05-15 10:38:50,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 16 treesize of output 11 [2019-05-15 10:38:50,470 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:50,472 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:50,472 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:50,472 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:50,479 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:50,479 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3653|]. (let ((.cse0 (select |v_#memory_int_3653| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3653| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 75))) [2019-05-15 10:38:50,479 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 76) [2019-05-15 10:38:50,546 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:50,547 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:50,549 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:50,549 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:50,549 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:50,556 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:50,556 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3654|]. (let ((.cse0 (select |v_#memory_int_3654| ULTIMATE.start_main_p1))) (and (= 76 .cse0) (= (store |v_#memory_int_3654| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:50,556 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 77) [2019-05-15 10:38: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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:50,626 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:50,628 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:50,628 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:50,628 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:50,635 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:50,636 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3655|]. (let ((.cse0 (select |v_#memory_int_3655| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3655| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 77 .cse0))) [2019-05-15 10:38:50,636 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 78) [2019-05-15 10:38:50,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:50,704 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:50,706 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:50,706 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:50,707 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:50,714 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:50,714 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3656|]. (let ((.cse0 (select |v_#memory_int_3656| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3656| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 78 .cse0))) [2019-05-15 10:38:50,714 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 79) [2019-05-15 10:38:50,783 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:50,784 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:50,786 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:50,786 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:50,786 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:50,795 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:50,795 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3657|]. (let ((.cse0 (select |v_#memory_int_3657| ULTIMATE.start_main_p1))) (and (= 79 .cse0) (= (store |v_#memory_int_3657| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:50,795 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 80) [2019-05-15 10:38:50,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 16 treesize of output 11 [2019-05-15 10:38:50,860 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:50,862 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:50,863 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:50,863 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:50,870 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:50,871 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3658|]. (let ((.cse0 (select |v_#memory_int_3658| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3658| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 80 .cse0))) [2019-05-15 10:38:50,871 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 81) [2019-05-15 10:38:50,946 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:50,947 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:50,949 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:50,949 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:50,950 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:50,956 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:50,956 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3659|]. (let ((.cse0 (select |v_#memory_int_3659| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3659| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 81))) [2019-05-15 10:38:50,956 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 82) [2019-05-15 10:38:51,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:51,027 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:51,029 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:51,029 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:51,029 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:51,036 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:51,037 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3660|]. (let ((.cse0 (select |v_#memory_int_3660| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3660| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 82 .cse0))) [2019-05-15 10:38:51,037 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 83) [2019-05-15 10:38:51,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 16 treesize of output 11 [2019-05-15 10:38:51,110 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:51,112 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:51,112 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:51,112 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:51,120 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:51,121 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3661|]. (let ((.cse0 (select |v_#memory_int_3661| ULTIMATE.start_main_p1))) (and (= .cse0 83) (= (store |v_#memory_int_3661| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:51,121 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 84) [2019-05-15 10:38:51,191 INFO L273 TraceCheckUtils]: 0: Hoare triple {31094#true} havoc main_p1; {31094#true} is VALID [2019-05-15 10:38:51,191 INFO L273 TraceCheckUtils]: 1: Hoare triple {31094#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {31094#true} is VALID [2019-05-15 10:38:51,192 INFO L273 TraceCheckUtils]: 2: Hoare triple {31094#true} #memory_int := #memory_int[main_p1 := 0]; {31105#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:38:51,192 INFO L273 TraceCheckUtils]: 3: Hoare triple {31105#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31109#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:38:51,193 INFO L273 TraceCheckUtils]: 4: Hoare triple {31109#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31113#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:38:51,194 INFO L273 TraceCheckUtils]: 5: Hoare triple {31113#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31117#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:38:51,195 INFO L273 TraceCheckUtils]: 6: Hoare triple {31117#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31121#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:38:51,195 INFO L273 TraceCheckUtils]: 7: Hoare triple {31121#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31125#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:38:51,196 INFO L273 TraceCheckUtils]: 8: Hoare triple {31125#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31129#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:38:51,197 INFO L273 TraceCheckUtils]: 9: Hoare triple {31129#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31133#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:38:51,198 INFO L273 TraceCheckUtils]: 10: Hoare triple {31133#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31137#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:38:51,198 INFO L273 TraceCheckUtils]: 11: Hoare triple {31137#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31141#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:38:51,199 INFO L273 TraceCheckUtils]: 12: Hoare triple {31141#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31145#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:38:51,200 INFO L273 TraceCheckUtils]: 13: Hoare triple {31145#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31149#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:38:51,200 INFO L273 TraceCheckUtils]: 14: Hoare triple {31149#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31153#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:38:51,201 INFO L273 TraceCheckUtils]: 15: Hoare triple {31153#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31157#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:38:51,202 INFO L273 TraceCheckUtils]: 16: Hoare triple {31157#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31161#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:38:51,203 INFO L273 TraceCheckUtils]: 17: Hoare triple {31161#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31165#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:38:51,203 INFO L273 TraceCheckUtils]: 18: Hoare triple {31165#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31169#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:38:51,204 INFO L273 TraceCheckUtils]: 19: Hoare triple {31169#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31173#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:38:51,205 INFO L273 TraceCheckUtils]: 20: Hoare triple {31173#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31177#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:38:51,206 INFO L273 TraceCheckUtils]: 21: Hoare triple {31177#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31181#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:38:51,206 INFO L273 TraceCheckUtils]: 22: Hoare triple {31181#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31185#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:38:51,207 INFO L273 TraceCheckUtils]: 23: Hoare triple {31185#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31189#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:38:51,208 INFO L273 TraceCheckUtils]: 24: Hoare triple {31189#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31193#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:38:51,209 INFO L273 TraceCheckUtils]: 25: Hoare triple {31193#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31197#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:38:51,209 INFO L273 TraceCheckUtils]: 26: Hoare triple {31197#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31201#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:38:51,210 INFO L273 TraceCheckUtils]: 27: Hoare triple {31201#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31205#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:38:51,211 INFO L273 TraceCheckUtils]: 28: Hoare triple {31205#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31209#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:38:51,212 INFO L273 TraceCheckUtils]: 29: Hoare triple {31209#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31213#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:38:51,212 INFO L273 TraceCheckUtils]: 30: Hoare triple {31213#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31217#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:38:51,213 INFO L273 TraceCheckUtils]: 31: Hoare triple {31217#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31221#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:38:51,214 INFO L273 TraceCheckUtils]: 32: Hoare triple {31221#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31225#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:38:51,215 INFO L273 TraceCheckUtils]: 33: Hoare triple {31225#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31229#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:38:51,215 INFO L273 TraceCheckUtils]: 34: Hoare triple {31229#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31233#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:38:51,216 INFO L273 TraceCheckUtils]: 35: Hoare triple {31233#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31237#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:38:51,217 INFO L273 TraceCheckUtils]: 36: Hoare triple {31237#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31241#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:38:51,218 INFO L273 TraceCheckUtils]: 37: Hoare triple {31241#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31245#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:38:51,218 INFO L273 TraceCheckUtils]: 38: Hoare triple {31245#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31249#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:38:51,219 INFO L273 TraceCheckUtils]: 39: Hoare triple {31249#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31253#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:38:51,220 INFO L273 TraceCheckUtils]: 40: Hoare triple {31253#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31257#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:38:51,221 INFO L273 TraceCheckUtils]: 41: Hoare triple {31257#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31261#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:38:51,221 INFO L273 TraceCheckUtils]: 42: Hoare triple {31261#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31265#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:38:51,222 INFO L273 TraceCheckUtils]: 43: Hoare triple {31265#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31269#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:38:51,223 INFO L273 TraceCheckUtils]: 44: Hoare triple {31269#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31273#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:38:51,223 INFO L273 TraceCheckUtils]: 45: Hoare triple {31273#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31277#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:38:51,224 INFO L273 TraceCheckUtils]: 46: Hoare triple {31277#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31281#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:38:51,225 INFO L273 TraceCheckUtils]: 47: Hoare triple {31281#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31285#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:38:51,226 INFO L273 TraceCheckUtils]: 48: Hoare triple {31285#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31289#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:38:51,226 INFO L273 TraceCheckUtils]: 49: Hoare triple {31289#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31293#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:38:51,227 INFO L273 TraceCheckUtils]: 50: Hoare triple {31293#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31297#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:38:51,228 INFO L273 TraceCheckUtils]: 51: Hoare triple {31297#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31301#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:38:51,229 INFO L273 TraceCheckUtils]: 52: Hoare triple {31301#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31305#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:38:51,229 INFO L273 TraceCheckUtils]: 53: Hoare triple {31305#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31309#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:38:51,230 INFO L273 TraceCheckUtils]: 54: Hoare triple {31309#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31313#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:38:51,231 INFO L273 TraceCheckUtils]: 55: Hoare triple {31313#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31317#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:38:51,232 INFO L273 TraceCheckUtils]: 56: Hoare triple {31317#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31321#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:38:51,232 INFO L273 TraceCheckUtils]: 57: Hoare triple {31321#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31325#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:38:51,233 INFO L273 TraceCheckUtils]: 58: Hoare triple {31325#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31329#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:38:51,234 INFO L273 TraceCheckUtils]: 59: Hoare triple {31329#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31333#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:38:51,235 INFO L273 TraceCheckUtils]: 60: Hoare triple {31333#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31337#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:38:51,235 INFO L273 TraceCheckUtils]: 61: Hoare triple {31337#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31341#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:38:51,236 INFO L273 TraceCheckUtils]: 62: Hoare triple {31341#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31345#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:38:51,237 INFO L273 TraceCheckUtils]: 63: Hoare triple {31345#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31349#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:38:51,238 INFO L273 TraceCheckUtils]: 64: Hoare triple {31349#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31353#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:38:51,238 INFO L273 TraceCheckUtils]: 65: Hoare triple {31353#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31357#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:38:51,239 INFO L273 TraceCheckUtils]: 66: Hoare triple {31357#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31361#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} is VALID [2019-05-15 10:38:51,240 INFO L273 TraceCheckUtils]: 67: Hoare triple {31361#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31365#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} is VALID [2019-05-15 10:38:51,241 INFO L273 TraceCheckUtils]: 68: Hoare triple {31365#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31369#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} is VALID [2019-05-15 10:38:51,241 INFO L273 TraceCheckUtils]: 69: Hoare triple {31369#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31373#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} is VALID [2019-05-15 10:38:51,242 INFO L273 TraceCheckUtils]: 70: Hoare triple {31373#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31377#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} is VALID [2019-05-15 10:38:51,243 INFO L273 TraceCheckUtils]: 71: Hoare triple {31377#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31381#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} is VALID [2019-05-15 10:38:51,244 INFO L273 TraceCheckUtils]: 72: Hoare triple {31381#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31385#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} is VALID [2019-05-15 10:38:51,244 INFO L273 TraceCheckUtils]: 73: Hoare triple {31385#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31389#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} is VALID [2019-05-15 10:38:51,245 INFO L273 TraceCheckUtils]: 74: Hoare triple {31389#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31393#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} is VALID [2019-05-15 10:38:51,246 INFO L273 TraceCheckUtils]: 75: Hoare triple {31393#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31397#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} is VALID [2019-05-15 10:38:51,246 INFO L273 TraceCheckUtils]: 76: Hoare triple {31397#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31401#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} is VALID [2019-05-15 10:38:51,247 INFO L273 TraceCheckUtils]: 77: Hoare triple {31401#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31405#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} is VALID [2019-05-15 10:38:51,248 INFO L273 TraceCheckUtils]: 78: Hoare triple {31405#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31409#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} is VALID [2019-05-15 10:38:51,249 INFO L273 TraceCheckUtils]: 79: Hoare triple {31409#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31413#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} is VALID [2019-05-15 10:38:51,249 INFO L273 TraceCheckUtils]: 80: Hoare triple {31413#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31417#(= (select |#memory_int| ULTIMATE.start_main_p1) 78)} is VALID [2019-05-15 10:38:51,250 INFO L273 TraceCheckUtils]: 81: Hoare triple {31417#(= (select |#memory_int| ULTIMATE.start_main_p1) 78)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31421#(= (select |#memory_int| ULTIMATE.start_main_p1) 79)} is VALID [2019-05-15 10:38:51,251 INFO L273 TraceCheckUtils]: 82: Hoare triple {31421#(= (select |#memory_int| ULTIMATE.start_main_p1) 79)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31425#(= (select |#memory_int| ULTIMATE.start_main_p1) 80)} is VALID [2019-05-15 10:38:51,252 INFO L273 TraceCheckUtils]: 83: Hoare triple {31425#(= (select |#memory_int| ULTIMATE.start_main_p1) 80)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31429#(= (select |#memory_int| ULTIMATE.start_main_p1) 81)} is VALID [2019-05-15 10:38:51,252 INFO L273 TraceCheckUtils]: 84: Hoare triple {31429#(= (select |#memory_int| ULTIMATE.start_main_p1) 81)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31433#(= (select |#memory_int| ULTIMATE.start_main_p1) 82)} is VALID [2019-05-15 10:38:51,253 INFO L273 TraceCheckUtils]: 85: Hoare triple {31433#(= (select |#memory_int| ULTIMATE.start_main_p1) 82)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31437#(= (select |#memory_int| ULTIMATE.start_main_p1) 83)} is VALID [2019-05-15 10:38:51,254 INFO L273 TraceCheckUtils]: 86: Hoare triple {31437#(= (select |#memory_int| ULTIMATE.start_main_p1) 83)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31441#(= (select |#memory_int| ULTIMATE.start_main_p1) 84)} is VALID [2019-05-15 10:38:51,254 INFO L273 TraceCheckUtils]: 87: Hoare triple {31441#(= (select |#memory_int| ULTIMATE.start_main_p1) 84)} assume !(#memory_int[main_p1] >= 0); {31095#false} is VALID [2019-05-15 10:38:51,264 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:38:51,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:38:51,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-05-15 10:38:51,265 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 88 [2019-05-15 10:38:51,265 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:38:51,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 87 states. [2019-05-15 10:38:51,333 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:38:51,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-05-15 10:38:51,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-05-15 10:38:51,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2019-05-15 10:38:51,334 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 87 states. [2019-05-15 10:39:06,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:39:06,013 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-05-15 10:39:06,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-05-15 10:39:06,014 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 88 [2019-05-15 10:39:06,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:39:06,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-05-15 10:39:06,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2019-05-15 10:39:06,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-05-15 10:39:06,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2019-05-15 10:39:06,016 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 87 states and 91 transitions. [2019-05-15 10:39:06,089 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:39:06,091 INFO L225 Difference]: With dead ends: 90 [2019-05-15 10:39:06,091 INFO L226 Difference]: Without dead ends: 90 [2019-05-15 10:39:06,091 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2019-05-15 10:39:06,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-05-15 10:39:06,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-05-15 10:39:06,093 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:39:06,093 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 90 states. [2019-05-15 10:39:06,093 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 90 states. [2019-05-15 10:39:06,093 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 90 states. [2019-05-15 10:39:06,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:39:06,094 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-05-15 10:39:06,095 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-05-15 10:39:06,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:39:06,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:39:06,095 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 90 states. [2019-05-15 10:39:06,095 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 90 states. [2019-05-15 10:39:06,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:39:06,096 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-05-15 10:39:06,096 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-05-15 10:39:06,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:39:06,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:39:06,097 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:39:06,097 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:39:06,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-05-15 10:39:06,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-05-15 10:39:06,098 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2019-05-15 10:39:06,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:39:06,098 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-05-15 10:39:06,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-05-15 10:39:06,098 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-05-15 10:39:06,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-05-15 10:39:06,098 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:39:06,098 INFO L399 BasicCegarLoop]: trace histogram [85, 1, 1, 1, 1] [2019-05-15 10:39:06,099 INFO L418 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:39:06,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:39:06,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1514267842, now seen corresponding path program 85 times [2019-05-15 10:39:06,099 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:39:06,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:39:06,126 WARN L254 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 87 conjunts are in the unsatisfiable core [2019-05-15 10:39:06,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:39:06,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:39:06,153 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:06,153 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,155 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:06,155 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,155 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:39:06,157 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:06,157 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3662|]. (= (store |v_#memory_int_3662| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:39:06,157 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:39:06,168 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:06,169 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,171 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:06,171 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,171 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:06,178 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:06,178 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3663|]. (let ((.cse0 (select |v_#memory_int_3663| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3663| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 0 .cse0))) [2019-05-15 10:39:06,178 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:39:06,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 16 treesize of output 11 [2019-05-15 10:39:06,189 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,191 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:06,191 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,192 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:06,198 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:06,199 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3664|]. (let ((.cse0 (select |v_#memory_int_3664| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3664| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 1 .cse0))) [2019-05-15 10:39:06,199 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:39:06,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 16 treesize of output 11 [2019-05-15 10:39:06,210 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,212 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:06,212 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,212 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:06,219 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:06,219 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3665|]. (let ((.cse0 (select |v_#memory_int_3665| ULTIMATE.start_main_p1))) (and (= 2 .cse0) (= (store |v_#memory_int_3665| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:06,219 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:39:06,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 16 treesize of output 11 [2019-05-15 10:39:06,231 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,233 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:06,233 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,233 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:06,240 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:06,241 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3666|]. (let ((.cse0 (select |v_#memory_int_3666| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3666| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 3))) [2019-05-15 10:39:06,241 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:39:06,253 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:06,254 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,256 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:06,256 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,256 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:06,264 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:06,264 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3667|]. (let ((.cse0 (select |v_#memory_int_3667| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3667| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 4))) [2019-05-15 10:39:06,264 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:39:06,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:06,279 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,281 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:06,281 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,281 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:06,288 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:06,288 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3668|]. (let ((.cse0 (select |v_#memory_int_3668| ULTIMATE.start_main_p1))) (and (= 5 .cse0) (= |#memory_int| (store |v_#memory_int_3668| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:06,288 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:39:06,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 16 treesize of output 11 [2019-05-15 10:39:06,303 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,305 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:06,305 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,305 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:06,313 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:06,313 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3669|]. (let ((.cse0 (select |v_#memory_int_3669| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3669| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 6 .cse0))) [2019-05-15 10:39:06,313 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:39:06,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 16 treesize of output 11 [2019-05-15 10:39:06,328 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,330 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:06,330 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,330 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:06,336 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:06,336 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3670|]. (let ((.cse0 (select |v_#memory_int_3670| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3670| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 7))) [2019-05-15 10:39:06,336 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:39:06,351 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:06,352 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,354 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:06,354 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,355 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:06,365 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:06,366 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3671|]. (let ((.cse0 (select |v_#memory_int_3671| ULTIMATE.start_main_p1))) (and (= .cse0 8) (= |#memory_int| (store |v_#memory_int_3671| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:06,366 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:39:06,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:06,382 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,384 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:06,384 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,385 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:06,392 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:06,392 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3672|]. (let ((.cse0 (select |v_#memory_int_3672| ULTIMATE.start_main_p1))) (and (= .cse0 9) (= |#memory_int| (store |v_#memory_int_3672| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:06,392 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:39:06,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:06,410 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,412 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:06,412 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,413 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:06,420 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:06,420 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3673|]. (let ((.cse0 (select |v_#memory_int_3673| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3673| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 10))) [2019-05-15 10:39:06,420 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:39:06,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:06,437 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,439 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:06,440 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,440 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:06,447 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:06,447 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3674|]. (let ((.cse0 (select |v_#memory_int_3674| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3674| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 11))) [2019-05-15 10:39:06,448 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:39:06,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:06,467 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,469 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:06,469 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,469 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:06,477 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:06,477 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3675|]. (let ((.cse0 (select |v_#memory_int_3675| ULTIMATE.start_main_p1))) (and (= .cse0 12) (= (store |v_#memory_int_3675| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:06,477 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:39:06,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 16 treesize of output 11 [2019-05-15 10:39:06,496 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,498 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:06,498 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,498 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:06,505 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:06,505 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3676|]. (let ((.cse0 (select |v_#memory_int_3676| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3676| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 13))) [2019-05-15 10:39:06,505 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:39:06,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 16 treesize of output 11 [2019-05-15 10:39:06,528 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,530 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:06,530 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,530 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:06,537 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:06,537 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3677|]. (let ((.cse0 (select |v_#memory_int_3677| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3677| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 14))) [2019-05-15 10:39:06,537 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:39:06,557 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:06,558 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,560 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:06,561 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,561 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:06,568 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:06,568 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3678|]. (let ((.cse0 (select |v_#memory_int_3678| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3678| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 15))) [2019-05-15 10:39:06,568 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:39:06,594 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:06,595 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,597 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:06,597 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,598 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:06,604 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:06,604 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3679|]. (let ((.cse0 (select |v_#memory_int_3679| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3679| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 16))) [2019-05-15 10:39:06,604 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:39:06,626 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:06,627 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,629 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:06,629 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,630 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:06,637 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:06,637 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3680|]. (let ((.cse0 (select |v_#memory_int_3680| ULTIMATE.start_main_p1))) (and (= 17 .cse0) (= (store |v_#memory_int_3680| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:06,637 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:39:06,662 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:06,662 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,664 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:06,665 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,665 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:06,672 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:06,672 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3681|]. (let ((.cse0 (select |v_#memory_int_3681| ULTIMATE.start_main_p1))) (and (= 18 .cse0) (= (store |v_#memory_int_3681| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:06,672 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:39:06,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:06,696 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,698 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:06,698 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,698 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:06,705 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:06,705 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3682|]. (let ((.cse0 (select |v_#memory_int_3682| ULTIMATE.start_main_p1))) (and (= .cse0 19) (= (store |v_#memory_int_3682| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:06,705 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:39:06,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:06,730 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,732 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:06,732 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,733 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:06,738 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:06,738 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3683|]. (let ((.cse0 (select |v_#memory_int_3683| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3683| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 20 .cse0))) [2019-05-15 10:39:06,739 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:39:06,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 16 treesize of output 11 [2019-05-15 10:39:06,766 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,768 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:06,768 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,768 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:06,776 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:06,776 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3684|]. (let ((.cse0 (select |v_#memory_int_3684| ULTIMATE.start_main_p1))) (and (= 21 .cse0) (= (store |v_#memory_int_3684| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:06,776 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:39:06,806 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:06,807 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,809 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:06,809 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,809 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:06,816 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:06,816 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3685|]. (let ((.cse0 (select |v_#memory_int_3685| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3685| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 22 .cse0))) [2019-05-15 10:39:06,817 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:39:06,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:06,842 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,844 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:06,844 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,845 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:06,852 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:06,852 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3686|]. (let ((.cse0 (select |v_#memory_int_3686| ULTIMATE.start_main_p1))) (and (= 23 .cse0) (= (store |v_#memory_int_3686| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:06,853 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:39:06,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 16 treesize of output 11 [2019-05-15 10:39:06,880 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,882 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:06,883 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,883 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:06,890 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:06,890 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3687|]. (let ((.cse0 (select |v_#memory_int_3687| ULTIMATE.start_main_p1))) (and (= 24 .cse0) (= |#memory_int| (store |v_#memory_int_3687| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:06,890 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:39:06,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:06,920 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,922 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:06,922 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,922 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:06,930 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:06,930 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3688|]. (let ((.cse0 (select |v_#memory_int_3688| ULTIMATE.start_main_p1))) (and (= 25 .cse0) (= |#memory_int| (store |v_#memory_int_3688| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:06,930 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:39:06,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 16 treesize of output 11 [2019-05-15 10:39:06,962 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,964 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:06,964 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:06,964 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:06,971 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:06,972 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3689|]. (let ((.cse0 (select |v_#memory_int_3689| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3689| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 26 .cse0))) [2019-05-15 10:39:06,972 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:39:07,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 16 treesize of output 11 [2019-05-15 10:39:07,003 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:07,005 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:07,005 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:07,005 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:07,013 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:07,013 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3690|]. (let ((.cse0 (select |v_#memory_int_3690| ULTIMATE.start_main_p1))) (and (= 27 .cse0) (= |#memory_int| (store |v_#memory_int_3690| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:07,013 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:39:07,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 16 treesize of output 11 [2019-05-15 10:39:07,047 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:07,049 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:07,050 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:07,050 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:07,056 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:07,056 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3691|]. (let ((.cse0 (select |v_#memory_int_3691| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3691| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 28 .cse0))) [2019-05-15 10:39:07,056 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:39:07,092 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:07,093 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:07,095 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:07,095 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:07,095 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:07,103 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:07,103 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3692|]. (let ((.cse0 (select |v_#memory_int_3692| ULTIMATE.start_main_p1))) (and (= 29 .cse0) (= (store |v_#memory_int_3692| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:07,103 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:39:07,135 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:07,136 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:07,138 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:07,138 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:07,139 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:07,144 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:07,145 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3693|]. (let ((.cse0 (select |v_#memory_int_3693| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3693| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 30 .cse0))) [2019-05-15 10:39:07,145 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:39:07,178 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:07,179 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:07,181 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:07,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:07,182 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:07,190 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:07,190 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3694|]. (let ((.cse0 (select |v_#memory_int_3694| ULTIMATE.start_main_p1))) (and (= .cse0 31) (= (store |v_#memory_int_3694| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:07,190 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:39:07,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 16 treesize of output 11 [2019-05-15 10:39:07,224 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:07,226 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:07,226 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:07,226 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:07,234 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:07,234 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3695|]. (let ((.cse0 (select |v_#memory_int_3695| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3695| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 32 .cse0))) [2019-05-15 10:39:07,234 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:39:07,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 16 treesize of output 11 [2019-05-15 10:39:07,267 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:07,269 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:07,270 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:07,270 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:07,277 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:07,277 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3696|]. (let ((.cse0 (select |v_#memory_int_3696| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3696| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 33 .cse0))) [2019-05-15 10:39:07,277 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:39:07,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:07,311 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:07,313 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:07,313 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:07,314 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:07,320 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:07,320 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3697|]. (let ((.cse0 (select |v_#memory_int_3697| ULTIMATE.start_main_p1))) (and (= .cse0 34) (= (store |v_#memory_int_3697| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:07,320 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:39:07,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:07,357 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:07,359 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:07,360 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:07,360 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:07,368 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:07,368 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3698|]. (let ((.cse0 (select |v_#memory_int_3698| ULTIMATE.start_main_p1))) (and (= 35 .cse0) (= |#memory_int| (store |v_#memory_int_3698| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:07,368 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:39:07,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 16 treesize of output 11 [2019-05-15 10:39:07,406 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:07,408 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:07,408 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:07,408 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:07,414 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:07,414 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3699|]. (let ((.cse0 (select |v_#memory_int_3699| ULTIMATE.start_main_p1))) (and (= 36 .cse0) (= (store |v_#memory_int_3699| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:07,414 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:39:07,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 16 treesize of output 11 [2019-05-15 10:39:07,452 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:07,454 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:07,455 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:07,455 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:07,462 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:07,462 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3700|]. (let ((.cse0 (select |v_#memory_int_3700| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3700| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 37))) [2019-05-15 10:39:07,462 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:39:07,502 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:07,503 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:07,505 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:07,505 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:07,506 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:07,513 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:07,513 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3701|]. (let ((.cse0 (select |v_#memory_int_3701| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3701| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 38))) [2019-05-15 10:39:07,513 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:39:07,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 16 treesize of output 11 [2019-05-15 10:39:07,554 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:07,556 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:07,556 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:07,556 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:07,564 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:07,564 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3702|]. (let ((.cse0 (select |v_#memory_int_3702| ULTIMATE.start_main_p1))) (and (= 39 .cse0) (= (store |v_#memory_int_3702| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:07,565 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:39:07,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 16 treesize of output 11 [2019-05-15 10:39:07,605 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:07,607 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:07,607 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:07,607 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:07,614 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:07,615 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3703|]. (let ((.cse0 (select |v_#memory_int_3703| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3703| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 40 .cse0))) [2019-05-15 10:39:07,615 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:39:07,662 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:07,663 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:07,665 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:07,665 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:07,665 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:07,673 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:07,673 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3704|]. (let ((.cse0 (select |v_#memory_int_3704| ULTIMATE.start_main_p1))) (and (= .cse0 41) (= |#memory_int| (store |v_#memory_int_3704| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:07,673 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:39:07,713 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:07,714 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:07,716 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:07,716 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:07,716 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:07,724 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:07,725 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3705|]. (let ((.cse0 (select |v_#memory_int_3705| ULTIMATE.start_main_p1))) (and (= .cse0 42) (= |#memory_int| (store |v_#memory_int_3705| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:07,725 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:39:07,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 16 treesize of output 11 [2019-05-15 10:39:07,767 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:07,769 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:07,769 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:07,769 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:07,777 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:07,778 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3706|]. (let ((.cse0 (select |v_#memory_int_3706| ULTIMATE.start_main_p1))) (and (= 43 .cse0) (= |#memory_int| (store |v_#memory_int_3706| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:07,778 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:39:07,822 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:07,823 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:07,825 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:07,825 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:07,825 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:07,835 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:07,835 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3707|]. (let ((.cse0 (select |v_#memory_int_3707| ULTIMATE.start_main_p1))) (and (= 44 .cse0) (= (store |v_#memory_int_3707| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:07,836 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:39:07,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 16 treesize of output 11 [2019-05-15 10:39:07,880 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:07,882 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:07,882 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:07,882 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:07,888 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:07,888 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3708|]. (let ((.cse0 (select |v_#memory_int_3708| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3708| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 45))) [2019-05-15 10:39:07,888 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:39:07,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 16 treesize of output 11 [2019-05-15 10:39:07,933 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:07,935 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:07,935 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:07,935 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:07,941 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:07,941 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3709|]. (let ((.cse0 (select |v_#memory_int_3709| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3709| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 46 .cse0))) [2019-05-15 10:39:07,941 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:39:07,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:07,987 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:07,989 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:07,989 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:07,989 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:07,997 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:07,998 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3710|]. (let ((.cse0 (select |v_#memory_int_3710| ULTIMATE.start_main_p1))) (and (= 47 .cse0) (= (store |v_#memory_int_3710| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:07,998 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:39:08,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 16 treesize of output 11 [2019-05-15 10:39:08,044 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:08,046 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:08,046 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:08,046 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:08,053 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:08,053 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3711|]. (let ((.cse0 (select |v_#memory_int_3711| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3711| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 48))) [2019-05-15 10:39:08,053 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:39:08,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:08,102 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:08,104 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:08,105 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:08,105 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:08,113 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:08,113 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3712|]. (let ((.cse0 (select |v_#memory_int_3712| ULTIMATE.start_main_p1))) (and (= 49 .cse0) (= (store |v_#memory_int_3712| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:08,113 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:39:08,166 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:08,167 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:08,169 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:08,169 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:08,169 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:08,177 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:08,177 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3713|]. (let ((.cse0 (select |v_#memory_int_3713| ULTIMATE.start_main_p1))) (and (= .cse0 50) (= (store |v_#memory_int_3713| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:08,178 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:39:08,231 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:08,232 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:08,234 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:08,234 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:08,234 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:08,242 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:08,242 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3714|]. (let ((.cse0 (select |v_#memory_int_3714| ULTIMATE.start_main_p1))) (and (= .cse0 51) (= (store |v_#memory_int_3714| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:08,242 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:39:08,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:08,292 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:08,294 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:08,294 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:08,294 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:08,302 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:08,302 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3715|]. (let ((.cse0 (select |v_#memory_int_3715| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3715| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 52))) [2019-05-15 10:39:08,302 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:39:08,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:08,351 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:08,353 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:08,353 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:08,353 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:08,361 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:08,361 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3716|]. (let ((.cse0 (select |v_#memory_int_3716| ULTIMATE.start_main_p1))) (and (= .cse0 53) (= (store |v_#memory_int_3716| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:08,361 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:39:08,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:08,410 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:08,412 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:08,412 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:08,412 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:08,420 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:08,420 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3717|]. (let ((.cse0 (select |v_#memory_int_3717| ULTIMATE.start_main_p1))) (and (= 54 .cse0) (= (store |v_#memory_int_3717| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:08,420 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:39:08,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 16 treesize of output 11 [2019-05-15 10:39:08,470 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:08,472 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:08,472 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:08,472 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:08,479 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:08,479 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3718|]. (let ((.cse0 (select |v_#memory_int_3718| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3718| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 55 .cse0))) [2019-05-15 10:39:08,479 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:39:08,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:08,541 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:08,543 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:08,543 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:08,543 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:08,550 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:08,551 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3719|]. (let ((.cse0 (select |v_#memory_int_3719| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3719| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 56 .cse0))) [2019-05-15 10:39:08,551 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:39:08,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:08,604 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:08,606 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:08,606 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:08,606 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:08,614 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:08,614 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3720|]. (let ((.cse0 (select |v_#memory_int_3720| ULTIMATE.start_main_p1))) (and (= .cse0 57) (= (store |v_#memory_int_3720| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:08,614 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:39:08,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:08,668 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:08,670 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:08,670 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:08,670 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:08,678 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:08,678 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3721|]. (let ((.cse0 (select |v_#memory_int_3721| ULTIMATE.start_main_p1))) (and (= .cse0 58) (= (store |v_#memory_int_3721| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:08,678 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:39:08,732 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:08,733 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:08,735 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:08,735 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:08,735 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:08,743 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:08,743 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3722|]. (let ((.cse0 (select |v_#memory_int_3722| ULTIMATE.start_main_p1))) (and (= 59 .cse0) (= (store |v_#memory_int_3722| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:08,743 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:39:08,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:08,802 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:08,804 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:08,804 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:08,804 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:08,811 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:08,812 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3723|]. (let ((.cse0 (select |v_#memory_int_3723| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3723| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 60 .cse0))) [2019-05-15 10:39:08,812 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:39:08,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:08,866 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:08,868 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:08,868 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:08,868 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:08,876 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:08,876 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3724|]. (let ((.cse0 (select |v_#memory_int_3724| ULTIMATE.start_main_p1))) (and (= .cse0 61) (= (store |v_#memory_int_3724| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:08,876 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:39:08,930 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:08,931 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:08,933 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:08,933 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:08,934 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:08,941 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:08,942 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3725|]. (let ((.cse0 (select |v_#memory_int_3725| ULTIMATE.start_main_p1))) (and (= .cse0 62) (= (store |v_#memory_int_3725| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:08,942 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:39:08,998 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:08,999 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:09,001 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:09,002 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:09,002 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:09,009 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:09,009 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3726|]. (let ((.cse0 (select |v_#memory_int_3726| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3726| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 63))) [2019-05-15 10:39:09,009 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 64) [2019-05-15 10:39:09,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 16 treesize of output 11 [2019-05-15 10:39:09,067 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:09,069 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:09,069 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:09,070 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:09,078 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:09,078 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3727|]. (let ((.cse0 (select |v_#memory_int_3727| ULTIMATE.start_main_p1))) (and (= .cse0 64) (= (store |v_#memory_int_3727| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:09,078 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 65) [2019-05-15 10:39:09,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:09,138 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:09,140 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:09,140 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:09,140 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:09,148 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:09,148 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3728|]. (let ((.cse0 (select |v_#memory_int_3728| ULTIMATE.start_main_p1))) (and (= .cse0 65) (= |#memory_int| (store |v_#memory_int_3728| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:09,148 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 66) [2019-05-15 10:39: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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:09,207 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:09,209 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:09,209 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:09,209 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:09,217 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:09,217 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3729|]. (let ((.cse0 (select |v_#memory_int_3729| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3729| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 66 .cse0))) [2019-05-15 10:39:09,217 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 67) [2019-05-15 10:39:09,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 16 treesize of output 11 [2019-05-15 10:39:09,277 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:09,279 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:09,280 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:09,280 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:09,287 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:09,288 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3730|]. (let ((.cse0 (select |v_#memory_int_3730| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3730| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 67 .cse0))) [2019-05-15 10:39:09,288 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 68) [2019-05-15 10:39:09,348 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:09,348 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:09,351 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:09,351 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:09,351 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:09,358 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:09,359 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3731|]. (let ((.cse0 (select |v_#memory_int_3731| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3731| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 68 .cse0))) [2019-05-15 10:39:09,359 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 69) [2019-05-15 10:39:09,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 16 treesize of output 11 [2019-05-15 10:39:09,425 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:09,427 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:09,427 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:09,427 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:09,435 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:09,435 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3732|]. (let ((.cse0 (select |v_#memory_int_3732| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3732| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 69))) [2019-05-15 10:39:09,435 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 70) [2019-05-15 10:39:09,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 16 treesize of output 11 [2019-05-15 10:39:09,496 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:09,498 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:09,499 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:09,499 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:09,505 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:09,506 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3733|]. (let ((.cse0 (select |v_#memory_int_3733| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3733| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 70))) [2019-05-15 10:39:09,506 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 71) [2019-05-15 10:39:09,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 16 treesize of output 11 [2019-05-15 10:39:09,568 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:09,570 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:09,570 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:09,571 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:09,578 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:09,579 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3734|]. (let ((.cse0 (select |v_#memory_int_3734| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3734| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 71 .cse0))) [2019-05-15 10:39:09,579 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 72) [2019-05-15 10:39:09,643 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:09,644 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:09,646 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:09,646 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:09,646 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:09,654 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:09,654 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3735|]. (let ((.cse0 (select |v_#memory_int_3735| ULTIMATE.start_main_p1))) (and (= 72 .cse0) (= (store |v_#memory_int_3735| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:09,654 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 73) [2019-05-15 10:39:09,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 16 treesize of output 11 [2019-05-15 10:39:09,720 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:09,722 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:09,723 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:09,723 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:09,731 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:09,731 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3736|]. (let ((.cse0 (select |v_#memory_int_3736| ULTIMATE.start_main_p1))) (and (= .cse0 73) (= (store |v_#memory_int_3736| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:09,731 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 74) [2019-05-15 10:39:09,798 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:09,799 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:09,801 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:09,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:09,802 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:09,808 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:09,808 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3737|]. (let ((.cse0 (select |v_#memory_int_3737| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3737| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 74))) [2019-05-15 10:39:09,808 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 75) [2019-05-15 10:39:09,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:09,875 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:09,878 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:09,878 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:09,878 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:09,886 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:09,886 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3738|]. (let ((.cse0 (select |v_#memory_int_3738| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3738| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 75 .cse0))) [2019-05-15 10:39:09,886 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 76) [2019-05-15 10:39:09,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 16 treesize of output 11 [2019-05-15 10:39:09,958 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:09,960 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:09,960 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:09,961 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:09,968 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:09,969 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3739|]. (let ((.cse0 (select |v_#memory_int_3739| ULTIMATE.start_main_p1))) (and (= 76 .cse0) (= |#memory_int| (store |v_#memory_int_3739| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:09,969 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 77) [2019-05-15 10:39:10,040 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:10,041 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:10,043 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:10,043 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:10,043 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:10,050 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:10,051 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3740|]. (let ((.cse0 (select |v_#memory_int_3740| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3740| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 77 .cse0))) [2019-05-15 10:39:10,051 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 78) [2019-05-15 10:39:10,119 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:10,120 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:10,122 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:10,122 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:10,122 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:10,130 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:10,130 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3741|]. (let ((.cse0 (select |v_#memory_int_3741| ULTIMATE.start_main_p1))) (and (= .cse0 78) (= (store |v_#memory_int_3741| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:10,130 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 79) [2019-05-15 10:39:10,196 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:10,197 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:10,199 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:10,199 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:10,199 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:10,207 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:10,207 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3742|]. (let ((.cse0 (select |v_#memory_int_3742| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3742| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 79))) [2019-05-15 10:39:10,207 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 80) [2019-05-15 10:39:10,274 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:10,275 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:10,277 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:10,277 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:10,277 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:10,285 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:10,285 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3743|]. (let ((.cse0 (select |v_#memory_int_3743| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3743| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 80 .cse0))) [2019-05-15 10:39:10,285 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 81) [2019-05-15 10:39:10,353 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:10,354 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:10,356 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:10,357 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:10,357 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:10,365 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:10,365 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3744|]. (let ((.cse0 (select |v_#memory_int_3744| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3744| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 81 .cse0))) [2019-05-15 10:39:10,365 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 82) [2019-05-15 10:39:10,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:10,437 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:10,439 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:10,440 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:10,440 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:10,447 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:10,448 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3745|]. (let ((.cse0 (select |v_#memory_int_3745| ULTIMATE.start_main_p1))) (and (= .cse0 82) (= |#memory_int| (store |v_#memory_int_3745| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:10,448 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 83) [2019-05-15 10:39:10,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 16 treesize of output 11 [2019-05-15 10:39:10,519 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:10,521 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:10,521 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:10,521 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:10,529 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:10,529 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3746|]. (let ((.cse0 (select |v_#memory_int_3746| ULTIMATE.start_main_p1))) (and (= .cse0 83) (= (store |v_#memory_int_3746| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:10,529 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 84) [2019-05-15 10:39:10,601 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:10,602 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:10,604 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:10,604 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:10,604 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:10,612 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:10,612 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3747|]. (let ((.cse0 (select |v_#memory_int_3747| ULTIMATE.start_main_p1))) (and (= 84 .cse0) (= (store |v_#memory_int_3747| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:10,612 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 85) [2019-05-15 10:39:10,680 INFO L273 TraceCheckUtils]: 0: Hoare triple {31804#true} havoc main_p1; {31804#true} is VALID [2019-05-15 10:39:10,681 INFO L273 TraceCheckUtils]: 1: Hoare triple {31804#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {31804#true} is VALID [2019-05-15 10:39:10,681 INFO L273 TraceCheckUtils]: 2: Hoare triple {31804#true} #memory_int := #memory_int[main_p1 := 0]; {31815#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:39:10,681 INFO L273 TraceCheckUtils]: 3: Hoare triple {31815#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31819#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:39:10,682 INFO L273 TraceCheckUtils]: 4: Hoare triple {31819#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31823#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:39:10,682 INFO L273 TraceCheckUtils]: 5: Hoare triple {31823#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31827#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:39:10,683 INFO L273 TraceCheckUtils]: 6: Hoare triple {31827#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31831#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:39:10,683 INFO L273 TraceCheckUtils]: 7: Hoare triple {31831#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31835#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:39:10,684 INFO L273 TraceCheckUtils]: 8: Hoare triple {31835#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31839#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:39:10,685 INFO L273 TraceCheckUtils]: 9: Hoare triple {31839#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31843#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:39:10,686 INFO L273 TraceCheckUtils]: 10: Hoare triple {31843#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31847#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:39:10,686 INFO L273 TraceCheckUtils]: 11: Hoare triple {31847#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31851#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:39:10,687 INFO L273 TraceCheckUtils]: 12: Hoare triple {31851#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31855#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:39:10,688 INFO L273 TraceCheckUtils]: 13: Hoare triple {31855#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31859#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:39:10,689 INFO L273 TraceCheckUtils]: 14: Hoare triple {31859#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31863#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:39:10,689 INFO L273 TraceCheckUtils]: 15: Hoare triple {31863#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31867#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:39:10,690 INFO L273 TraceCheckUtils]: 16: Hoare triple {31867#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31871#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:39:10,691 INFO L273 TraceCheckUtils]: 17: Hoare triple {31871#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31875#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:39:10,691 INFO L273 TraceCheckUtils]: 18: Hoare triple {31875#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31879#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:39:10,692 INFO L273 TraceCheckUtils]: 19: Hoare triple {31879#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31883#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:39:10,693 INFO L273 TraceCheckUtils]: 20: Hoare triple {31883#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31887#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:39:10,694 INFO L273 TraceCheckUtils]: 21: Hoare triple {31887#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31891#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:39:10,694 INFO L273 TraceCheckUtils]: 22: Hoare triple {31891#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31895#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:39:10,695 INFO L273 TraceCheckUtils]: 23: Hoare triple {31895#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31899#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:39:10,696 INFO L273 TraceCheckUtils]: 24: Hoare triple {31899#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31903#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:39:10,697 INFO L273 TraceCheckUtils]: 25: Hoare triple {31903#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31907#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:39:10,697 INFO L273 TraceCheckUtils]: 26: Hoare triple {31907#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31911#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:39:10,698 INFO L273 TraceCheckUtils]: 27: Hoare triple {31911#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31915#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:39:10,699 INFO L273 TraceCheckUtils]: 28: Hoare triple {31915#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31919#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:39:10,700 INFO L273 TraceCheckUtils]: 29: Hoare triple {31919#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31923#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:39:10,706 INFO L273 TraceCheckUtils]: 30: Hoare triple {31923#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31927#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:39:10,706 INFO L273 TraceCheckUtils]: 31: Hoare triple {31927#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31931#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:39:10,707 INFO L273 TraceCheckUtils]: 32: Hoare triple {31931#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31935#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:39:10,707 INFO L273 TraceCheckUtils]: 33: Hoare triple {31935#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31939#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:39:10,708 INFO L273 TraceCheckUtils]: 34: Hoare triple {31939#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31943#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:39:10,708 INFO L273 TraceCheckUtils]: 35: Hoare triple {31943#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31947#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:39:10,709 INFO L273 TraceCheckUtils]: 36: Hoare triple {31947#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31951#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:39:10,709 INFO L273 TraceCheckUtils]: 37: Hoare triple {31951#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31955#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:39:10,710 INFO L273 TraceCheckUtils]: 38: Hoare triple {31955#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31959#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:39:10,711 INFO L273 TraceCheckUtils]: 39: Hoare triple {31959#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31963#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:39:10,712 INFO L273 TraceCheckUtils]: 40: Hoare triple {31963#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31967#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:39:10,712 INFO L273 TraceCheckUtils]: 41: Hoare triple {31967#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31971#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:39:10,713 INFO L273 TraceCheckUtils]: 42: Hoare triple {31971#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31975#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:39:10,714 INFO L273 TraceCheckUtils]: 43: Hoare triple {31975#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31979#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:39:10,715 INFO L273 TraceCheckUtils]: 44: Hoare triple {31979#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31983#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:39:10,715 INFO L273 TraceCheckUtils]: 45: Hoare triple {31983#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31987#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:39:10,716 INFO L273 TraceCheckUtils]: 46: Hoare triple {31987#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31991#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:39:10,717 INFO L273 TraceCheckUtils]: 47: Hoare triple {31991#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31995#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:39:10,718 INFO L273 TraceCheckUtils]: 48: Hoare triple {31995#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31999#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:39:10,718 INFO L273 TraceCheckUtils]: 49: Hoare triple {31999#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32003#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:39:10,719 INFO L273 TraceCheckUtils]: 50: Hoare triple {32003#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32007#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:39:10,720 INFO L273 TraceCheckUtils]: 51: Hoare triple {32007#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32011#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:39:10,721 INFO L273 TraceCheckUtils]: 52: Hoare triple {32011#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32015#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:39:10,721 INFO L273 TraceCheckUtils]: 53: Hoare triple {32015#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32019#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:39:10,722 INFO L273 TraceCheckUtils]: 54: Hoare triple {32019#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32023#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:39:10,723 INFO L273 TraceCheckUtils]: 55: Hoare triple {32023#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32027#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:39:10,724 INFO L273 TraceCheckUtils]: 56: Hoare triple {32027#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32031#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:39:10,724 INFO L273 TraceCheckUtils]: 57: Hoare triple {32031#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32035#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:39:10,725 INFO L273 TraceCheckUtils]: 58: Hoare triple {32035#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32039#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:39:10,726 INFO L273 TraceCheckUtils]: 59: Hoare triple {32039#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32043#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:39:10,726 INFO L273 TraceCheckUtils]: 60: Hoare triple {32043#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32047#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:39:10,727 INFO L273 TraceCheckUtils]: 61: Hoare triple {32047#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32051#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:39:10,728 INFO L273 TraceCheckUtils]: 62: Hoare triple {32051#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32055#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:39:10,729 INFO L273 TraceCheckUtils]: 63: Hoare triple {32055#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32059#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:39:10,729 INFO L273 TraceCheckUtils]: 64: Hoare triple {32059#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32063#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:39:10,730 INFO L273 TraceCheckUtils]: 65: Hoare triple {32063#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32067#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:39:10,731 INFO L273 TraceCheckUtils]: 66: Hoare triple {32067#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32071#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} is VALID [2019-05-15 10:39:10,732 INFO L273 TraceCheckUtils]: 67: Hoare triple {32071#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32075#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} is VALID [2019-05-15 10:39:10,732 INFO L273 TraceCheckUtils]: 68: Hoare triple {32075#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32079#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} is VALID [2019-05-15 10:39:10,733 INFO L273 TraceCheckUtils]: 69: Hoare triple {32079#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32083#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} is VALID [2019-05-15 10:39:10,734 INFO L273 TraceCheckUtils]: 70: Hoare triple {32083#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32087#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} is VALID [2019-05-15 10:39:10,735 INFO L273 TraceCheckUtils]: 71: Hoare triple {32087#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32091#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} is VALID [2019-05-15 10:39:10,735 INFO L273 TraceCheckUtils]: 72: Hoare triple {32091#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32095#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} is VALID [2019-05-15 10:39:10,736 INFO L273 TraceCheckUtils]: 73: Hoare triple {32095#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32099#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} is VALID [2019-05-15 10:39:10,737 INFO L273 TraceCheckUtils]: 74: Hoare triple {32099#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32103#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} is VALID [2019-05-15 10:39:10,738 INFO L273 TraceCheckUtils]: 75: Hoare triple {32103#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32107#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} is VALID [2019-05-15 10:39:10,738 INFO L273 TraceCheckUtils]: 76: Hoare triple {32107#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32111#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} is VALID [2019-05-15 10:39:10,739 INFO L273 TraceCheckUtils]: 77: Hoare triple {32111#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32115#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} is VALID [2019-05-15 10:39:10,740 INFO L273 TraceCheckUtils]: 78: Hoare triple {32115#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32119#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} is VALID [2019-05-15 10:39:10,741 INFO L273 TraceCheckUtils]: 79: Hoare triple {32119#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32123#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} is VALID [2019-05-15 10:39:10,741 INFO L273 TraceCheckUtils]: 80: Hoare triple {32123#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32127#(= (select |#memory_int| ULTIMATE.start_main_p1) 78)} is VALID [2019-05-15 10:39:10,742 INFO L273 TraceCheckUtils]: 81: Hoare triple {32127#(= (select |#memory_int| ULTIMATE.start_main_p1) 78)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32131#(= (select |#memory_int| ULTIMATE.start_main_p1) 79)} is VALID [2019-05-15 10:39:10,743 INFO L273 TraceCheckUtils]: 82: Hoare triple {32131#(= (select |#memory_int| ULTIMATE.start_main_p1) 79)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32135#(= (select |#memory_int| ULTIMATE.start_main_p1) 80)} is VALID [2019-05-15 10:39:10,744 INFO L273 TraceCheckUtils]: 83: Hoare triple {32135#(= (select |#memory_int| ULTIMATE.start_main_p1) 80)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32139#(= (select |#memory_int| ULTIMATE.start_main_p1) 81)} is VALID [2019-05-15 10:39:10,744 INFO L273 TraceCheckUtils]: 84: Hoare triple {32139#(= (select |#memory_int| ULTIMATE.start_main_p1) 81)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32143#(= (select |#memory_int| ULTIMATE.start_main_p1) 82)} is VALID [2019-05-15 10:39:10,745 INFO L273 TraceCheckUtils]: 85: Hoare triple {32143#(= (select |#memory_int| ULTIMATE.start_main_p1) 82)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32147#(= (select |#memory_int| ULTIMATE.start_main_p1) 83)} is VALID [2019-05-15 10:39:10,746 INFO L273 TraceCheckUtils]: 86: Hoare triple {32147#(= (select |#memory_int| ULTIMATE.start_main_p1) 83)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32151#(= (select |#memory_int| ULTIMATE.start_main_p1) 84)} is VALID [2019-05-15 10:39:10,746 INFO L273 TraceCheckUtils]: 87: Hoare triple {32151#(= (select |#memory_int| ULTIMATE.start_main_p1) 84)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32155#(= (select |#memory_int| ULTIMATE.start_main_p1) 85)} is VALID [2019-05-15 10:39:10,747 INFO L273 TraceCheckUtils]: 88: Hoare triple {32155#(= (select |#memory_int| ULTIMATE.start_main_p1) 85)} assume !(#memory_int[main_p1] >= 0); {31805#false} is VALID [2019-05-15 10:39:10,757 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:39:10,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:39:10,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-05-15 10:39:10,758 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 89 [2019-05-15 10:39:10,758 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:39:10,758 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 88 states. [2019-05-15 10:39:10,911 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:39:10,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-05-15 10:39:10,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-05-15 10:39:10,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2019-05-15 10:39:10,913 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 88 states. [2019-05-15 10:39:25,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:39:25,989 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-05-15 10:39:25,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-05-15 10:39:25,990 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 89 [2019-05-15 10:39:25,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:39:25,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-05-15 10:39:25,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2019-05-15 10:39:25,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-05-15 10:39:25,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2019-05-15 10:39:25,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 88 states and 92 transitions. [2019-05-15 10:39:26,069 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:39:26,071 INFO L225 Difference]: With dead ends: 91 [2019-05-15 10:39:26,071 INFO L226 Difference]: Without dead ends: 91 [2019-05-15 10:39:26,072 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2019-05-15 10:39:26,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-05-15 10:39:26,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-05-15 10:39:26,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:39:26,073 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand 91 states. [2019-05-15 10:39:26,073 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 91 states. [2019-05-15 10:39:26,074 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 91 states. [2019-05-15 10:39:26,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:39:26,075 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-05-15 10:39:26,075 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-05-15 10:39:26,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:39:26,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:39:26,075 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 91 states. [2019-05-15 10:39:26,075 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 91 states. [2019-05-15 10:39:26,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:39:26,076 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-05-15 10:39:26,076 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-05-15 10:39:26,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:39:26,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:39:26,077 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:39:26,077 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:39:26,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-05-15 10:39:26,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-05-15 10:39:26,078 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2019-05-15 10:39:26,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:39:26,078 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-05-15 10:39:26,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-05-15 10:39:26,078 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-05-15 10:39:26,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-05-15 10:39:26,078 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:39:26,078 INFO L399 BasicCegarLoop]: trace histogram [86, 1, 1, 1, 1] [2019-05-15 10:39:26,079 INFO L418 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:39:26,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:39:26,079 INFO L82 PathProgramCache]: Analyzing trace with hash -302337208, now seen corresponding path program 86 times [2019-05-15 10:39:26,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:39:26,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:39:26,123 WARN L254 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 88 conjunts are in the unsatisfiable core [2019-05-15 10:39:26,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:39:26,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:39:26,222 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:26,223 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,224 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:26,224 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,224 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:39:26,226 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:26,226 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3748|]. (= (store |v_#memory_int_3748| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:39:26,226 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:39:26,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 16 treesize of output 11 [2019-05-15 10:39:26,236 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,238 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:26,238 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,238 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:26,246 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:26,246 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3749|]. (let ((.cse0 (select |v_#memory_int_3749| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3749| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 0))) [2019-05-15 10:39:26,246 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:39:26,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 16 treesize of output 11 [2019-05-15 10:39:26,257 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,259 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:26,260 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,260 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:26,267 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:26,267 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3750|]. (let ((.cse0 (select |v_#memory_int_3750| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3750| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 1 .cse0))) [2019-05-15 10:39:26,267 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:39:26,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 16 treesize of output 11 [2019-05-15 10:39:26,280 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,282 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:26,282 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,282 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:26,289 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:26,290 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3751|]. (let ((.cse0 (select |v_#memory_int_3751| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3751| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 2))) [2019-05-15 10:39:26,290 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:39:26,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 16 treesize of output 11 [2019-05-15 10:39:26,302 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,304 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:26,304 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,304 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:26,310 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:26,311 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3752|]. (let ((.cse0 (select |v_#memory_int_3752| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3752| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 3))) [2019-05-15 10:39:26,311 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:39:26,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 16 treesize of output 11 [2019-05-15 10:39:26,322 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,324 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:26,324 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,325 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:26,331 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:26,331 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3753|]. (let ((.cse0 (select |v_#memory_int_3753| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3753| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 4))) [2019-05-15 10:39:26,331 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:39:26,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 16 treesize of output 11 [2019-05-15 10:39:26,345 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,347 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:26,347 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,348 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:26,355 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:26,355 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3754|]. (let ((.cse0 (select |v_#memory_int_3754| ULTIMATE.start_main_p1))) (and (= 5 .cse0) (= |#memory_int| (store |v_#memory_int_3754| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:26,355 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:39:26,369 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:26,370 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,372 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:26,372 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,373 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:26,379 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:26,379 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3755|]. (let ((.cse0 (select |v_#memory_int_3755| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3755| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 6 .cse0))) [2019-05-15 10:39:26,379 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:39:26,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:26,394 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,396 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:26,396 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,396 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:26,403 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:26,404 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3756|]. (let ((.cse0 (select |v_#memory_int_3756| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3756| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 7))) [2019-05-15 10:39:26,404 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:39:26,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:26,420 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,422 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:26,422 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,423 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:26,429 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:26,430 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3757|]. (let ((.cse0 (select |v_#memory_int_3757| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3757| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 8))) [2019-05-15 10:39:26,430 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:39:26,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:26,446 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,448 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:26,448 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,449 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:26,455 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:26,456 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3758|]. (let ((.cse0 (select |v_#memory_int_3758| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3758| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 9))) [2019-05-15 10:39:26,456 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:39:26,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 16 treesize of output 11 [2019-05-15 10:39:26,474 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,476 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:26,476 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,476 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:26,484 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:26,484 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3759|]. (let ((.cse0 (select |v_#memory_int_3759| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3759| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 10))) [2019-05-15 10:39:26,484 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:39:26,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 16 treesize of output 11 [2019-05-15 10:39:26,502 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,504 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:26,505 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,505 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:26,512 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:26,512 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3760|]. (let ((.cse0 (select |v_#memory_int_3760| ULTIMATE.start_main_p1))) (and (= .cse0 11) (= (store |v_#memory_int_3760| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:26,512 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:39:26,529 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:26,530 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,532 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:26,533 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,533 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:26,540 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:26,540 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3761|]. (let ((.cse0 (select |v_#memory_int_3761| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3761| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 12))) [2019-05-15 10:39:26,540 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:39:26,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:26,560 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,562 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:26,562 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,562 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:26,570 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:26,570 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3762|]. (let ((.cse0 (select |v_#memory_int_3762| ULTIMATE.start_main_p1))) (and (= .cse0 13) (= |#memory_int| (store |v_#memory_int_3762| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:26,570 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:39:26,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:26,591 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,593 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:26,593 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,594 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:26,601 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:26,601 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3763|]. (let ((.cse0 (select |v_#memory_int_3763| ULTIMATE.start_main_p1))) (and (= 14 .cse0) (= |#memory_int| (store |v_#memory_int_3763| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:26,601 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:39:26,622 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:26,623 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,625 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:26,625 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,625 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:26,633 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:26,633 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3764|]. (let ((.cse0 (select |v_#memory_int_3764| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3764| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 15 .cse0))) [2019-05-15 10:39:26,633 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:39:26,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:26,658 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,660 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:26,660 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,660 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:26,668 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:26,668 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3765|]. (let ((.cse0 (select |v_#memory_int_3765| ULTIMATE.start_main_p1))) (and (= .cse0 16) (= (store |v_#memory_int_3765| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:26,668 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:39:26,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 16 treesize of output 11 [2019-05-15 10:39:26,690 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,692 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:26,692 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,692 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:26,699 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:26,699 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3766|]. (let ((.cse0 (select |v_#memory_int_3766| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3766| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 17))) [2019-05-15 10:39:26,700 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:39:26,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 16 treesize of output 11 [2019-05-15 10:39:26,738 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,739 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:26,739 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,739 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:26,745 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:26,745 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3767|]. (let ((.cse0 (select |v_#memory_int_3767| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3767| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 18))) [2019-05-15 10:39:26,745 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:39:26,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:26,770 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,772 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:26,773 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,773 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:26,780 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:26,781 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3768|]. (let ((.cse0 (select |v_#memory_int_3768| ULTIMATE.start_main_p1))) (and (= 19 .cse0) (= (store |v_#memory_int_3768| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:26,781 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:39:26,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 16 treesize of output 11 [2019-05-15 10:39:26,805 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,807 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:26,807 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,808 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:26,816 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:26,816 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3769|]. (let ((.cse0 (select |v_#memory_int_3769| ULTIMATE.start_main_p1))) (and (= 20 .cse0) (= (store |v_#memory_int_3769| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:26,816 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:39:26,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:26,841 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,843 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:26,843 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,843 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:26,850 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:26,851 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3770|]. (let ((.cse0 (select |v_#memory_int_3770| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3770| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 21))) [2019-05-15 10:39:26,851 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:39:26,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:26,877 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,879 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:26,879 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,879 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:26,887 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:26,887 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3771|]. (let ((.cse0 (select |v_#memory_int_3771| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3771| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 22 .cse0))) [2019-05-15 10:39:26,887 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:39:26,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 16 treesize of output 11 [2019-05-15 10:39:26,915 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,917 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:26,917 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,917 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:26,926 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:26,926 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3772|]. (let ((.cse0 (select |v_#memory_int_3772| ULTIMATE.start_main_p1))) (and (= .cse0 23) (= |#memory_int| (store |v_#memory_int_3772| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:26,926 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:39:26,953 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:26,954 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,956 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:26,956 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,957 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:26,962 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:26,963 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3773|]. (let ((.cse0 (select |v_#memory_int_3773| ULTIMATE.start_main_p1))) (and (= 24 .cse0) (= (store |v_#memory_int_3773| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:26,963 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:39:26,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:26,991 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,993 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:26,993 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:26,993 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:27,000 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:27,001 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3774|]. (let ((.cse0 (select |v_#memory_int_3774| ULTIMATE.start_main_p1))) (and (= 25 .cse0) (= |#memory_int| (store |v_#memory_int_3774| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:27,001 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:39:27,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 16 treesize of output 11 [2019-05-15 10:39:27,031 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:27,033 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:27,033 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:27,033 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:27,039 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:27,039 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3775|]. (let ((.cse0 (select |v_#memory_int_3775| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3775| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 26 .cse0))) [2019-05-15 10:39:27,039 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:39:27,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 16 treesize of output 11 [2019-05-15 10:39:27,068 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:27,070 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:27,070 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:27,070 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:27,078 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:27,078 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3776|]. (let ((.cse0 (select |v_#memory_int_3776| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3776| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 27))) [2019-05-15 10:39:27,078 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:39:27,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 16 treesize of output 11 [2019-05-15 10:39:27,110 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:27,112 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:27,112 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:27,112 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:27,119 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:27,120 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3777|]. (let ((.cse0 (select |v_#memory_int_3777| ULTIMATE.start_main_p1))) (and (= .cse0 28) (= (store |v_#memory_int_3777| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:27,120 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:39:27,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 16 treesize of output 11 [2019-05-15 10:39:27,152 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:27,154 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:27,155 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:27,155 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:27,162 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:27,162 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3778|]. (let ((.cse0 (select |v_#memory_int_3778| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3778| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 29 .cse0))) [2019-05-15 10:39:27,162 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:39:27,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:27,193 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:27,195 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:27,196 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:27,196 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:27,202 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:27,202 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3779|]. (let ((.cse0 (select |v_#memory_int_3779| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3779| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 30 .cse0))) [2019-05-15 10:39:27,202 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:39:27,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 16 treesize of output 11 [2019-05-15 10:39:27,234 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:27,236 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:27,237 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:27,237 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:27,244 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:27,244 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3780|]. (let ((.cse0 (select |v_#memory_int_3780| ULTIMATE.start_main_p1))) (and (= .cse0 31) (= (store |v_#memory_int_3780| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:27,245 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:39:27,280 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:27,281 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:27,283 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:27,283 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:27,283 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:27,291 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:27,291 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3781|]. (let ((.cse0 (select |v_#memory_int_3781| ULTIMATE.start_main_p1))) (and (= 32 .cse0) (= |#memory_int| (store |v_#memory_int_3781| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:27,291 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:39:27,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 16 treesize of output 11 [2019-05-15 10:39:27,329 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:27,331 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:27,332 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:27,332 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:27,340 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:27,340 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3782|]. (let ((.cse0 (select |v_#memory_int_3782| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3782| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 33))) [2019-05-15 10:39:27,340 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:39:27,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 16 treesize of output 11 [2019-05-15 10:39:27,374 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:27,376 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:27,376 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:27,377 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:27,384 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:27,384 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3783|]. (let ((.cse0 (select |v_#memory_int_3783| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3783| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 34))) [2019-05-15 10:39:27,384 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:39:27,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:27,420 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:27,422 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:27,422 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:27,422 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:27,430 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:27,430 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3784|]. (let ((.cse0 (select |v_#memory_int_3784| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3784| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 35 .cse0))) [2019-05-15 10:39:27,430 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:39:27,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:27,466 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:27,468 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:27,468 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:27,468 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:27,476 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:27,476 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3785|]. (let ((.cse0 (select |v_#memory_int_3785| ULTIMATE.start_main_p1))) (and (= 36 .cse0) (= (store |v_#memory_int_3785| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:27,476 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:39: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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:27,514 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:27,516 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:27,517 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:27,517 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:27,525 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:27,525 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3786|]. (let ((.cse0 (select |v_#memory_int_3786| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3786| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 37))) [2019-05-15 10:39:27,525 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:39:27,563 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:27,564 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:27,566 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:27,566 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:27,566 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:27,573 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:27,574 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3787|]. (let ((.cse0 (select |v_#memory_int_3787| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3787| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 38 .cse0))) [2019-05-15 10:39:27,574 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:39:27,611 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:27,612 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:27,614 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:27,614 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:27,615 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:27,622 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:27,622 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3788|]. (let ((.cse0 (select |v_#memory_int_3788| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3788| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 39 .cse0))) [2019-05-15 10:39:27,622 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:39:27,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:27,661 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:27,663 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:27,664 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:27,664 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:27,671 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:27,671 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3789|]. (let ((.cse0 (select |v_#memory_int_3789| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3789| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 40 .cse0))) [2019-05-15 10:39:27,672 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:39:27,710 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:27,711 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:27,713 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:27,713 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:27,713 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:27,721 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:27,721 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3790|]. (let ((.cse0 (select |v_#memory_int_3790| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3790| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 41))) [2019-05-15 10:39:27,722 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:39:27,763 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:27,764 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:27,766 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:27,766 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:27,766 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:27,774 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:27,774 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3791|]. (let ((.cse0 (select |v_#memory_int_3791| ULTIMATE.start_main_p1))) (and (= 42 .cse0) (= |#memory_int| (store |v_#memory_int_3791| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:27,774 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:39:27,816 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:27,817 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:27,819 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:27,820 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:27,820 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:27,827 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:27,827 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3792|]. (let ((.cse0 (select |v_#memory_int_3792| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3792| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 43 .cse0))) [2019-05-15 10:39:27,827 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:39:27,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:27,876 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:27,878 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:27,878 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:27,878 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:27,887 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:27,887 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3793|]. (let ((.cse0 (select |v_#memory_int_3793| ULTIMATE.start_main_p1))) (and (= .cse0 44) (= |#memory_int| (store |v_#memory_int_3793| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:27,887 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:39:27,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 16 treesize of output 11 [2019-05-15 10:39:27,929 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:27,931 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:27,932 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:27,932 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:27,938 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:27,938 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3794|]. (let ((.cse0 (select |v_#memory_int_3794| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3794| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 45))) [2019-05-15 10:39:27,938 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:39:27,983 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:27,984 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:27,986 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:27,986 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:27,987 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:27,996 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:27,997 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3795|]. (let ((.cse0 (select |v_#memory_int_3795| ULTIMATE.start_main_p1))) (and (= .cse0 46) (= (store |v_#memory_int_3795| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:27,997 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:39:28,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:28,043 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:28,045 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:28,045 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:28,045 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:28,053 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:28,053 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3796|]. (let ((.cse0 (select |v_#memory_int_3796| ULTIMATE.start_main_p1))) (and (= .cse0 47) (= |#memory_int| (store |v_#memory_int_3796| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:28,053 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:39:28,100 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:28,101 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:28,103 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:28,103 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:28,103 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:28,110 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:28,111 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3797|]. (let ((.cse0 (select |v_#memory_int_3797| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3797| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 48))) [2019-05-15 10:39:28,111 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:39:28,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 16 treesize of output 11 [2019-05-15 10:39:28,157 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:28,159 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:28,160 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:28,160 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:28,167 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:28,167 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3798|]. (let ((.cse0 (select |v_#memory_int_3798| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3798| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 49))) [2019-05-15 10:39:28,167 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:39:28,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:28,215 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:28,217 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:28,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:28,217 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:28,226 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:28,226 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3799|]. (let ((.cse0 (select |v_#memory_int_3799| ULTIMATE.start_main_p1))) (and (= .cse0 50) (= (store |v_#memory_int_3799| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:28,227 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:39:28,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:28,273 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:28,275 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:28,275 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:28,275 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:28,283 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:28,283 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3800|]. (let ((.cse0 (select |v_#memory_int_3800| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3800| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 51 .cse0))) [2019-05-15 10:39:28,283 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:39:28,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 16 treesize of output 11 [2019-05-15 10:39:28,330 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:28,332 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:28,333 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:28,333 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:28,340 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:28,341 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3801|]. (let ((.cse0 (select |v_#memory_int_3801| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3801| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 52 .cse0))) [2019-05-15 10:39:28,341 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:39:28,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:28,396 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:28,398 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:28,398 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:28,398 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:28,407 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:28,407 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3802|]. (let ((.cse0 (select |v_#memory_int_3802| ULTIMATE.start_main_p1))) (and (= .cse0 53) (= (store |v_#memory_int_3802| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:28,407 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:39:28,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 16 treesize of output 11 [2019-05-15 10:39:28,458 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:28,460 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:28,460 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:28,460 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:28,468 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:28,468 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3803|]. (let ((.cse0 (select |v_#memory_int_3803| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3803| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 54))) [2019-05-15 10:39:28,468 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:39:28,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:28,520 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:28,522 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:28,522 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:28,523 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:28,530 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:28,530 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3804|]. (let ((.cse0 (select |v_#memory_int_3804| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3804| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 55))) [2019-05-15 10:39:28,530 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:39:28,580 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:28,581 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:28,583 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:28,583 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:28,583 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:28,590 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:28,590 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3805|]. (let ((.cse0 (select |v_#memory_int_3805| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3805| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 56))) [2019-05-15 10:39:28,590 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:39:28,642 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:28,643 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:28,645 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:28,646 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:28,646 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:28,653 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:28,653 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3806|]. (let ((.cse0 (select |v_#memory_int_3806| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3806| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 57 .cse0))) [2019-05-15 10:39:28,653 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:39:28,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:28,707 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:28,709 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:28,710 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:28,710 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:28,716 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:28,716 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3807|]. (let ((.cse0 (select |v_#memory_int_3807| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3807| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 58))) [2019-05-15 10:39:28,716 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:39: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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:28,768 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:28,770 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:28,770 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:28,771 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:28,778 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:28,778 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3808|]. (let ((.cse0 (select |v_#memory_int_3808| ULTIMATE.start_main_p1))) (and (= .cse0 59) (= (store |v_#memory_int_3808| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:28,778 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:39:28,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 16 treesize of output 11 [2019-05-15 10:39:28,835 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:28,837 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:28,837 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:28,838 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:28,845 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:28,846 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3809|]. (let ((.cse0 (select |v_#memory_int_3809| ULTIMATE.start_main_p1))) (and (= 60 .cse0) (= (store |v_#memory_int_3809| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:28,846 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:39:28,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:28,906 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:28,908 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:28,908 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:28,909 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:28,916 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:28,916 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3810|]. (let ((.cse0 (select |v_#memory_int_3810| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3810| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 61))) [2019-05-15 10:39:28,917 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:39:28,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 16 treesize of output 11 [2019-05-15 10:39:28,975 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:28,977 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:28,977 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:28,977 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:28,985 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:28,985 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3811|]. (let ((.cse0 (select |v_#memory_int_3811| ULTIMATE.start_main_p1))) (and (= 62 .cse0) (= |#memory_int| (store |v_#memory_int_3811| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:28,985 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:39:29,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 16 treesize of output 11 [2019-05-15 10:39:29,049 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:29,051 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:29,051 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:29,051 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:29,060 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:29,060 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3812|]. (let ((.cse0 (select |v_#memory_int_3812| ULTIMATE.start_main_p1))) (and (= .cse0 63) (= |#memory_int| (store |v_#memory_int_3812| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:29,060 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 64) [2019-05-15 10:39:29,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 16 treesize of output 11 [2019-05-15 10:39:29,121 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:29,123 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:29,123 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:29,123 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:29,130 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:29,130 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3813|]. (let ((.cse0 (select |v_#memory_int_3813| ULTIMATE.start_main_p1))) (and (= 64 .cse0) (= |#memory_int| (store |v_#memory_int_3813| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:29,131 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 65) [2019-05-15 10:39:29,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:29,193 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:29,195 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:29,195 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:29,196 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:29,202 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:29,203 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3814|]. (let ((.cse0 (select |v_#memory_int_3814| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3814| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 65 .cse0))) [2019-05-15 10:39:29,203 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 66) [2019-05-15 10:39:29,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 16 treesize of output 11 [2019-05-15 10:39:29,262 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:29,264 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:29,264 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:29,264 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:29,271 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:29,271 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3815|]. (let ((.cse0 (select |v_#memory_int_3815| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3815| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 66 .cse0))) [2019-05-15 10:39:29,272 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 67) [2019-05-15 10:39:29,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:29,332 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:29,334 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:29,335 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:29,335 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:29,341 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:29,341 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3816|]. (let ((.cse0 (select |v_#memory_int_3816| ULTIMATE.start_main_p1))) (and (= .cse0 67) (= |#memory_int| (store |v_#memory_int_3816| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:29,341 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 68) [2019-05-15 10:39:29,403 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:29,404 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:29,406 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:29,406 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:29,406 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:29,414 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:29,414 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3817|]. (let ((.cse0 (select |v_#memory_int_3817| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3817| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 68))) [2019-05-15 10:39:29,414 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 69) [2019-05-15 10:39:29,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 16 treesize of output 11 [2019-05-15 10:39:29,483 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:29,485 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:29,485 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:29,485 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:29,493 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:29,493 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3818|]. (let ((.cse0 (select |v_#memory_int_3818| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3818| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 69))) [2019-05-15 10:39:29,493 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 70) [2019-05-15 10:39:29,554 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:29,555 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:29,557 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:29,558 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:29,558 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:29,566 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:29,566 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3819|]. (let ((.cse0 (select |v_#memory_int_3819| ULTIMATE.start_main_p1))) (and (= 70 .cse0) (= |#memory_int| (store |v_#memory_int_3819| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:29,566 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 71) [2019-05-15 10:39:29,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 16 treesize of output 11 [2019-05-15 10:39:29,628 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:29,630 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:29,631 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:29,631 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:29,638 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:29,638 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3820|]. (let ((.cse0 (select |v_#memory_int_3820| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3820| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 71 .cse0))) [2019-05-15 10:39:29,638 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 72) [2019-05-15 10:39:29,705 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:29,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:29,708 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:29,708 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:29,708 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:29,716 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:29,716 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3821|]. (let ((.cse0 (select |v_#memory_int_3821| ULTIMATE.start_main_p1))) (and (= 72 .cse0) (= (store |v_#memory_int_3821| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:29,717 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 73) [2019-05-15 10:39:29,781 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:29,782 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:29,784 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:29,784 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:29,784 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:29,792 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:29,792 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3822|]. (let ((.cse0 (select |v_#memory_int_3822| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3822| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 73 .cse0))) [2019-05-15 10:39:29,792 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 74) [2019-05-15 10:39:29,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:29,859 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:29,861 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:29,861 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:29,861 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:29,868 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:29,869 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3823|]. (let ((.cse0 (select |v_#memory_int_3823| ULTIMATE.start_main_p1))) (and (= 74 .cse0) (= |#memory_int| (store |v_#memory_int_3823| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:29,869 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 75) [2019-05-15 10:39:29,934 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:29,935 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:29,937 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:29,937 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:29,937 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:29,944 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:29,944 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3824|]. (let ((.cse0 (select |v_#memory_int_3824| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3824| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 75 .cse0))) [2019-05-15 10:39:29,945 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 76) [2019-05-15 10:39:30,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:30,015 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:30,017 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:30,017 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:30,018 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:30,025 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:30,026 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3825|]. (let ((.cse0 (select |v_#memory_int_3825| ULTIMATE.start_main_p1))) (and (= .cse0 76) (= (store |v_#memory_int_3825| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:30,026 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 77) [2019-05-15 10:39:30,100 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:30,104 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:30,106 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:30,106 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:30,106 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:30,112 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:30,113 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3826|]. (let ((.cse0 (select |v_#memory_int_3826| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3826| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 77))) [2019-05-15 10:39:30,113 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 78) [2019-05-15 10:39:30,181 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:30,182 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:30,184 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:30,184 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:30,185 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:30,192 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:30,192 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3827|]. (let ((.cse0 (select |v_#memory_int_3827| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3827| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 78 .cse0))) [2019-05-15 10:39:30,192 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 79) [2019-05-15 10:39:30,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 16 treesize of output 11 [2019-05-15 10:39:30,260 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:30,262 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:30,263 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:30,263 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:30,269 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:30,269 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3828|]. (let ((.cse0 (select |v_#memory_int_3828| ULTIMATE.start_main_p1))) (and (= .cse0 79) (= (store |v_#memory_int_3828| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:30,269 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 80) [2019-05-15 10:39:30,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:30,341 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:30,343 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:30,343 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:30,343 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:30,350 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:30,351 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3829|]. (let ((.cse0 (select |v_#memory_int_3829| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3829| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 80 .cse0))) [2019-05-15 10:39:30,351 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 81) [2019-05-15 10:39:30,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 16 treesize of output 11 [2019-05-15 10:39:30,421 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:30,423 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:30,424 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:30,424 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:30,431 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:30,431 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3830|]. (let ((.cse0 (select |v_#memory_int_3830| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3830| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 81))) [2019-05-15 10:39:30,431 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 82) [2019-05-15 10:39:30,499 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:30,499 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:30,502 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:30,502 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:30,502 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:30,510 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:30,510 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3831|]. (let ((.cse0 (select |v_#memory_int_3831| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3831| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 82 .cse0))) [2019-05-15 10:39:30,510 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 83) [2019-05-15 10:39: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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:30,585 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:30,587 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:30,587 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:30,587 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:30,594 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:30,594 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3832|]. (let ((.cse0 (select |v_#memory_int_3832| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3832| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 83))) [2019-05-15 10:39:30,595 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 84) [2019-05-15 10:39:30,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 16 treesize of output 11 [2019-05-15 10:39:30,667 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:30,669 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:30,669 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:30,669 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:30,677 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:30,677 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3833|]. (let ((.cse0 (select |v_#memory_int_3833| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3833| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 84 .cse0))) [2019-05-15 10:39:30,677 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 85) [2019-05-15 10:39:30,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:30,759 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:30,761 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:30,762 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:30,762 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:30,768 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:30,768 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3834|]. (let ((.cse0 (select |v_#memory_int_3834| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3834| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 85 .cse0))) [2019-05-15 10:39:30,768 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 86) [2019-05-15 10:39:30,839 INFO L273 TraceCheckUtils]: 0: Hoare triple {32522#true} havoc main_p1; {32522#true} is VALID [2019-05-15 10:39:30,840 INFO L273 TraceCheckUtils]: 1: Hoare triple {32522#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {32522#true} is VALID [2019-05-15 10:39:30,840 INFO L273 TraceCheckUtils]: 2: Hoare triple {32522#true} #memory_int := #memory_int[main_p1 := 0]; {32533#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:39:30,841 INFO L273 TraceCheckUtils]: 3: Hoare triple {32533#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32537#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:39:30,841 INFO L273 TraceCheckUtils]: 4: Hoare triple {32537#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32541#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:39:30,842 INFO L273 TraceCheckUtils]: 5: Hoare triple {32541#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32545#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:39:30,842 INFO L273 TraceCheckUtils]: 6: Hoare triple {32545#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32549#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:39:30,842 INFO L273 TraceCheckUtils]: 7: Hoare triple {32549#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32553#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:39:30,843 INFO L273 TraceCheckUtils]: 8: Hoare triple {32553#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32557#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:39:30,844 INFO L273 TraceCheckUtils]: 9: Hoare triple {32557#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32561#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:39:30,845 INFO L273 TraceCheckUtils]: 10: Hoare triple {32561#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32565#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:39:30,845 INFO L273 TraceCheckUtils]: 11: Hoare triple {32565#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32569#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:39:30,846 INFO L273 TraceCheckUtils]: 12: Hoare triple {32569#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32573#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:39:30,847 INFO L273 TraceCheckUtils]: 13: Hoare triple {32573#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32577#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:39:30,848 INFO L273 TraceCheckUtils]: 14: Hoare triple {32577#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32581#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:39:30,848 INFO L273 TraceCheckUtils]: 15: Hoare triple {32581#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32585#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:39:30,849 INFO L273 TraceCheckUtils]: 16: Hoare triple {32585#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32589#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:39:30,850 INFO L273 TraceCheckUtils]: 17: Hoare triple {32589#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32593#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:39:30,851 INFO L273 TraceCheckUtils]: 18: Hoare triple {32593#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32597#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:39:30,851 INFO L273 TraceCheckUtils]: 19: Hoare triple {32597#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32601#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:39:30,852 INFO L273 TraceCheckUtils]: 20: Hoare triple {32601#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32605#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:39:30,853 INFO L273 TraceCheckUtils]: 21: Hoare triple {32605#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32609#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:39:30,854 INFO L273 TraceCheckUtils]: 22: Hoare triple {32609#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32613#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:39:30,854 INFO L273 TraceCheckUtils]: 23: Hoare triple {32613#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32617#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:39:30,855 INFO L273 TraceCheckUtils]: 24: Hoare triple {32617#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32621#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:39:30,856 INFO L273 TraceCheckUtils]: 25: Hoare triple {32621#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32625#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:39:30,857 INFO L273 TraceCheckUtils]: 26: Hoare triple {32625#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32629#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:39:30,857 INFO L273 TraceCheckUtils]: 27: Hoare triple {32629#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32633#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:39:30,858 INFO L273 TraceCheckUtils]: 28: Hoare triple {32633#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32637#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:39:30,859 INFO L273 TraceCheckUtils]: 29: Hoare triple {32637#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32641#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:39:30,860 INFO L273 TraceCheckUtils]: 30: Hoare triple {32641#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32645#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:39:30,860 INFO L273 TraceCheckUtils]: 31: Hoare triple {32645#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32649#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:39:30,861 INFO L273 TraceCheckUtils]: 32: Hoare triple {32649#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32653#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:39:30,862 INFO L273 TraceCheckUtils]: 33: Hoare triple {32653#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32657#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:39:30,863 INFO L273 TraceCheckUtils]: 34: Hoare triple {32657#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32661#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:39:30,863 INFO L273 TraceCheckUtils]: 35: Hoare triple {32661#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32665#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:39:30,864 INFO L273 TraceCheckUtils]: 36: Hoare triple {32665#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32669#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:39:30,865 INFO L273 TraceCheckUtils]: 37: Hoare triple {32669#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32673#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:39:30,865 INFO L273 TraceCheckUtils]: 38: Hoare triple {32673#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32677#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:39:30,866 INFO L273 TraceCheckUtils]: 39: Hoare triple {32677#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32681#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:39:30,867 INFO L273 TraceCheckUtils]: 40: Hoare triple {32681#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32685#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:39:30,868 INFO L273 TraceCheckUtils]: 41: Hoare triple {32685#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32689#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:39:30,868 INFO L273 TraceCheckUtils]: 42: Hoare triple {32689#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32693#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:39:30,869 INFO L273 TraceCheckUtils]: 43: Hoare triple {32693#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32697#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:39:30,870 INFO L273 TraceCheckUtils]: 44: Hoare triple {32697#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32701#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:39:30,871 INFO L273 TraceCheckUtils]: 45: Hoare triple {32701#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32705#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:39:30,871 INFO L273 TraceCheckUtils]: 46: Hoare triple {32705#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32709#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:39:30,872 INFO L273 TraceCheckUtils]: 47: Hoare triple {32709#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32713#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:39:30,873 INFO L273 TraceCheckUtils]: 48: Hoare triple {32713#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32717#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:39:30,874 INFO L273 TraceCheckUtils]: 49: Hoare triple {32717#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32721#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:39:30,874 INFO L273 TraceCheckUtils]: 50: Hoare triple {32721#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32725#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:39:30,875 INFO L273 TraceCheckUtils]: 51: Hoare triple {32725#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32729#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:39:30,876 INFO L273 TraceCheckUtils]: 52: Hoare triple {32729#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32733#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:39:30,877 INFO L273 TraceCheckUtils]: 53: Hoare triple {32733#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32737#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:39:30,877 INFO L273 TraceCheckUtils]: 54: Hoare triple {32737#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32741#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:39:30,878 INFO L273 TraceCheckUtils]: 55: Hoare triple {32741#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32745#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:39:30,879 INFO L273 TraceCheckUtils]: 56: Hoare triple {32745#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32749#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:39:30,880 INFO L273 TraceCheckUtils]: 57: Hoare triple {32749#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32753#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:39:30,880 INFO L273 TraceCheckUtils]: 58: Hoare triple {32753#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32757#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:39:30,881 INFO L273 TraceCheckUtils]: 59: Hoare triple {32757#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32761#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:39:30,882 INFO L273 TraceCheckUtils]: 60: Hoare triple {32761#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32765#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:39:30,883 INFO L273 TraceCheckUtils]: 61: Hoare triple {32765#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32769#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:39:30,883 INFO L273 TraceCheckUtils]: 62: Hoare triple {32769#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32773#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:39:30,884 INFO L273 TraceCheckUtils]: 63: Hoare triple {32773#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32777#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:39:30,885 INFO L273 TraceCheckUtils]: 64: Hoare triple {32777#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32781#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:39:30,886 INFO L273 TraceCheckUtils]: 65: Hoare triple {32781#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32785#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:39:30,886 INFO L273 TraceCheckUtils]: 66: Hoare triple {32785#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32789#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} is VALID [2019-05-15 10:39:30,887 INFO L273 TraceCheckUtils]: 67: Hoare triple {32789#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32793#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} is VALID [2019-05-15 10:39:30,888 INFO L273 TraceCheckUtils]: 68: Hoare triple {32793#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32797#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} is VALID [2019-05-15 10:39:30,888 INFO L273 TraceCheckUtils]: 69: Hoare triple {32797#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32801#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} is VALID [2019-05-15 10:39:30,889 INFO L273 TraceCheckUtils]: 70: Hoare triple {32801#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32805#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} is VALID [2019-05-15 10:39:30,890 INFO L273 TraceCheckUtils]: 71: Hoare triple {32805#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32809#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} is VALID [2019-05-15 10:39:30,891 INFO L273 TraceCheckUtils]: 72: Hoare triple {32809#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32813#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} is VALID [2019-05-15 10:39:30,891 INFO L273 TraceCheckUtils]: 73: Hoare triple {32813#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32817#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} is VALID [2019-05-15 10:39:30,892 INFO L273 TraceCheckUtils]: 74: Hoare triple {32817#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32821#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} is VALID [2019-05-15 10:39:30,893 INFO L273 TraceCheckUtils]: 75: Hoare triple {32821#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32825#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} is VALID [2019-05-15 10:39:30,894 INFO L273 TraceCheckUtils]: 76: Hoare triple {32825#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32829#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} is VALID [2019-05-15 10:39:30,894 INFO L273 TraceCheckUtils]: 77: Hoare triple {32829#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32833#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} is VALID [2019-05-15 10:39:30,895 INFO L273 TraceCheckUtils]: 78: Hoare triple {32833#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32837#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} is VALID [2019-05-15 10:39:30,896 INFO L273 TraceCheckUtils]: 79: Hoare triple {32837#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32841#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} is VALID [2019-05-15 10:39:30,897 INFO L273 TraceCheckUtils]: 80: Hoare triple {32841#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32845#(= (select |#memory_int| ULTIMATE.start_main_p1) 78)} is VALID [2019-05-15 10:39:30,897 INFO L273 TraceCheckUtils]: 81: Hoare triple {32845#(= (select |#memory_int| ULTIMATE.start_main_p1) 78)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32849#(= (select |#memory_int| ULTIMATE.start_main_p1) 79)} is VALID [2019-05-15 10:39:30,898 INFO L273 TraceCheckUtils]: 82: Hoare triple {32849#(= (select |#memory_int| ULTIMATE.start_main_p1) 79)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32853#(= (select |#memory_int| ULTIMATE.start_main_p1) 80)} is VALID [2019-05-15 10:39:30,899 INFO L273 TraceCheckUtils]: 83: Hoare triple {32853#(= (select |#memory_int| ULTIMATE.start_main_p1) 80)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32857#(= (select |#memory_int| ULTIMATE.start_main_p1) 81)} is VALID [2019-05-15 10:39:30,900 INFO L273 TraceCheckUtils]: 84: Hoare triple {32857#(= (select |#memory_int| ULTIMATE.start_main_p1) 81)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32861#(= (select |#memory_int| ULTIMATE.start_main_p1) 82)} is VALID [2019-05-15 10:39:30,900 INFO L273 TraceCheckUtils]: 85: Hoare triple {32861#(= (select |#memory_int| ULTIMATE.start_main_p1) 82)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32865#(= (select |#memory_int| ULTIMATE.start_main_p1) 83)} is VALID [2019-05-15 10:39:30,901 INFO L273 TraceCheckUtils]: 86: Hoare triple {32865#(= (select |#memory_int| ULTIMATE.start_main_p1) 83)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32869#(= (select |#memory_int| ULTIMATE.start_main_p1) 84)} is VALID [2019-05-15 10:39:30,902 INFO L273 TraceCheckUtils]: 87: Hoare triple {32869#(= (select |#memory_int| ULTIMATE.start_main_p1) 84)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32873#(= (select |#memory_int| ULTIMATE.start_main_p1) 85)} is VALID [2019-05-15 10:39:30,903 INFO L273 TraceCheckUtils]: 88: Hoare triple {32873#(= (select |#memory_int| ULTIMATE.start_main_p1) 85)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32877#(= (select |#memory_int| ULTIMATE.start_main_p1) 86)} is VALID [2019-05-15 10:39:30,903 INFO L273 TraceCheckUtils]: 89: Hoare triple {32877#(= (select |#memory_int| ULTIMATE.start_main_p1) 86)} assume !(#memory_int[main_p1] >= 0); {32523#false} is VALID [2019-05-15 10:39:30,913 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:39:30,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:39:30,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-05-15 10:39:30,913 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 90 [2019-05-15 10:39:30,913 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:39:30,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 89 states. [2019-05-15 10:39:30,986 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:39:30,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-05-15 10:39:30,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-05-15 10:39:30,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2019-05-15 10:39:30,987 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 89 states. [2019-05-15 10:39:46,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:39:46,384 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-05-15 10:39:46,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-05-15 10:39:46,384 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 90 [2019-05-15 10:39:46,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:39:46,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-05-15 10:39:46,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2019-05-15 10:39:46,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-05-15 10:39:46,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2019-05-15 10:39:46,387 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 89 states and 93 transitions. [2019-05-15 10:39:46,460 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:39:46,461 INFO L225 Difference]: With dead ends: 92 [2019-05-15 10:39:46,461 INFO L226 Difference]: Without dead ends: 92 [2019-05-15 10:39:46,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2019-05-15 10:39:46,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-05-15 10:39:46,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-05-15 10:39:46,463 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:39:46,463 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 92 states. [2019-05-15 10:39:46,463 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 92 states. [2019-05-15 10:39:46,463 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 92 states. [2019-05-15 10:39:46,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:39:46,464 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-05-15 10:39:46,464 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-05-15 10:39:46,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:39:46,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:39:46,465 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 92 states. [2019-05-15 10:39:46,465 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 92 states. [2019-05-15 10:39:46,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:39:46,466 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-05-15 10:39:46,466 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-05-15 10:39:46,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:39:46,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:39:46,466 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:39:46,466 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:39:46,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-05-15 10:39:46,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-05-15 10:39:46,467 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2019-05-15 10:39:46,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:39:46,467 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-05-15 10:39:46,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-05-15 10:39:46,467 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-05-15 10:39:46,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-05-15 10:39:46,467 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:39:46,467 INFO L399 BasicCegarLoop]: trace histogram [87, 1, 1, 1, 1] [2019-05-15 10:39:46,467 INFO L418 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:39:46,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:39:46,468 INFO L82 PathProgramCache]: Analyzing trace with hash -782518910, now seen corresponding path program 87 times [2019-05-15 10:39:46,468 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:39:46,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:39:46,517 WARN L254 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 89 conjunts are in the unsatisfiable core [2019-05-15 10:39:46,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:39:46,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:39:46,680 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:46,681 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:46,718 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:46,718 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:46,719 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:39:46,737 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:46,737 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3835|]. (= (store |v_#memory_int_3835| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:39:46,737 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:39:46,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 16 treesize of output 11 [2019-05-15 10:39:46,964 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:46,990 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:46,990 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:46,991 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:47,004 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:47,004 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3836|]. (let ((.cse0 (select |v_#memory_int_3836| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3836| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 0 .cse0))) [2019-05-15 10:39:47,005 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:39:47,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 16 treesize of output 11 [2019-05-15 10:39:47,275 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:47,316 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:47,316 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:47,317 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:47,329 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:47,329 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3837|]. (let ((.cse0 (select |v_#memory_int_3837| ULTIMATE.start_main_p1))) (and (= .cse0 1) (= (store |v_#memory_int_3837| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:47,330 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:39:47,548 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:47,561 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:47,586 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:47,587 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:47,587 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:47,603 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:47,604 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3838|]. (let ((.cse0 (select |v_#memory_int_3838| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3838| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 2 .cse0))) [2019-05-15 10:39:47,604 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:39:47,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:47,702 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:47,704 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:47,704 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:47,705 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:47,713 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:47,713 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3839|]. (let ((.cse0 (select |v_#memory_int_3839| ULTIMATE.start_main_p1))) (and (= .cse0 3) (= |#memory_int| (store |v_#memory_int_3839| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:47,713 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:39:47,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:47,731 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:47,733 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:47,733 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:47,733 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:47,741 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:47,741 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3840|]. (let ((.cse0 (select |v_#memory_int_3840| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3840| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 4 .cse0))) [2019-05-15 10:39:47,741 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:39:47,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:47,761 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:47,763 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:47,763 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:47,763 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:47,771 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:47,771 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3841|]. (let ((.cse0 (select |v_#memory_int_3841| ULTIMATE.start_main_p1))) (and (= 5 .cse0) (= (store |v_#memory_int_3841| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:47,771 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:39:47,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 16 treesize of output 11 [2019-05-15 10:39:47,785 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:47,787 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:47,787 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:47,787 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:47,796 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:47,796 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3842|]. (let ((.cse0 (select |v_#memory_int_3842| ULTIMATE.start_main_p1))) (and (= .cse0 6) (= (store |v_#memory_int_3842| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:47,796 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:39:47,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 16 treesize of output 11 [2019-05-15 10:39:47,812 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:47,814 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:47,815 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:47,815 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:47,822 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:47,822 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3843|]. (let ((.cse0 (select |v_#memory_int_3843| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3843| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 7 .cse0))) [2019-05-15 10:39:47,822 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:39:47,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 16 treesize of output 11 [2019-05-15 10:39:47,838 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:47,840 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:47,841 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:47,841 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:47,848 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:47,848 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3844|]. (let ((.cse0 (select |v_#memory_int_3844| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3844| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 8 .cse0))) [2019-05-15 10:39:47,848 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:39:47,863 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:47,864 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:47,866 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:47,866 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:47,866 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:47,873 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:47,873 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3845|]. (let ((.cse0 (select |v_#memory_int_3845| ULTIMATE.start_main_p1))) (and (= .cse0 9) (= |#memory_int| (store |v_#memory_int_3845| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:47,874 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:39:47,890 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:47,891 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:47,893 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:47,893 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:47,893 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:47,900 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:47,900 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3846|]. (let ((.cse0 (select |v_#memory_int_3846| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3846| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 10))) [2019-05-15 10:39:47,901 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:39:47,930 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:47,931 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:47,933 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:47,934 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:47,934 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:47,942 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:47,942 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3847|]. (let ((.cse0 (select |v_#memory_int_3847| ULTIMATE.start_main_p1))) (and (= .cse0 11) (= (store |v_#memory_int_3847| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:47,942 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:39:47,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 16 treesize of output 11 [2019-05-15 10:39:47,962 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:47,964 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:47,965 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:47,965 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:47,971 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:47,971 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3848|]. (let ((.cse0 (select |v_#memory_int_3848| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3848| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 12))) [2019-05-15 10:39:47,971 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:39:47,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:47,992 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:47,994 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:47,994 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:47,994 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:48,000 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:48,000 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3849|]. (let ((.cse0 (select |v_#memory_int_3849| ULTIMATE.start_main_p1))) (and (= .cse0 13) (= (store |v_#memory_int_3849| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:48,000 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:39:48,020 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:48,021 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:48,023 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:48,023 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:48,023 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:48,031 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:48,031 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3850|]. (let ((.cse0 (select |v_#memory_int_3850| ULTIMATE.start_main_p1))) (and (= 14 .cse0) (= (store |v_#memory_int_3850| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:48,031 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:39:48,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:48,053 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:48,055 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:48,055 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:48,056 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:48,063 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:48,063 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3851|]. (let ((.cse0 (select |v_#memory_int_3851| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3851| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 15 .cse0))) [2019-05-15 10:39:48,064 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:39:48,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:48,086 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:48,088 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:48,088 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:48,089 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:48,096 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:48,096 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3852|]. (let ((.cse0 (select |v_#memory_int_3852| ULTIMATE.start_main_p1))) (and (= .cse0 16) (= |#memory_int| (store |v_#memory_int_3852| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:48,096 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:39:48,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:48,119 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:48,121 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:48,121 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:48,121 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:48,129 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:48,129 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3853|]. (let ((.cse0 (select |v_#memory_int_3853| ULTIMATE.start_main_p1))) (and (= .cse0 17) (= (store |v_#memory_int_3853| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:48,129 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:39:48,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 16 treesize of output 11 [2019-05-15 10:39:48,152 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:48,154 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:48,155 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:48,155 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:48,163 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:48,163 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3854|]. (let ((.cse0 (select |v_#memory_int_3854| ULTIMATE.start_main_p1))) (and (= .cse0 18) (= |#memory_int| (store |v_#memory_int_3854| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:48,164 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:39:48,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 16 treesize of output 11 [2019-05-15 10:39:48,190 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:48,192 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:48,192 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:48,192 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:48,200 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:48,201 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3855|]. (let ((.cse0 (select |v_#memory_int_3855| ULTIMATE.start_main_p1))) (and (= .cse0 19) (= |#memory_int| (store |v_#memory_int_3855| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:48,201 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:39:48,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:48,225 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:48,227 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:48,227 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:48,227 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:48,235 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:48,235 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3856|]. (let ((.cse0 (select |v_#memory_int_3856| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3856| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 20 .cse0))) [2019-05-15 10:39:48,235 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:39:48,264 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:48,265 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:48,267 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:48,267 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:48,267 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:48,273 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:48,274 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3857|]. (let ((.cse0 (select |v_#memory_int_3857| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3857| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 21))) [2019-05-15 10:39:48,274 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:39: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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:48,299 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:48,306 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:48,307 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:48,307 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:48,314 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:48,314 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3858|]. (let ((.cse0 (select |v_#memory_int_3858| ULTIMATE.start_main_p1))) (and (= .cse0 22) (= (store |v_#memory_int_3858| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:48,314 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:39:48,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:48,341 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:48,343 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:48,343 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:48,343 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:48,351 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:48,351 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3859|]. (let ((.cse0 (select |v_#memory_int_3859| ULTIMATE.start_main_p1))) (and (= 23 .cse0) (= |#memory_int| (store |v_#memory_int_3859| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:48,351 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:39:48,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:48,382 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:48,384 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:48,384 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:48,384 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:48,392 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:48,392 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3860|]. (let ((.cse0 (select |v_#memory_int_3860| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3860| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 24 .cse0))) [2019-05-15 10:39:48,392 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:39:48,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:48,422 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:48,424 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:48,424 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:48,424 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:48,432 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:48,432 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3861|]. (let ((.cse0 (select |v_#memory_int_3861| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3861| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 25 .cse0))) [2019-05-15 10:39:48,432 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:39:48,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 16 treesize of output 11 [2019-05-15 10:39:48,462 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:48,464 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:48,464 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:48,465 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:48,472 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:48,472 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3862|]. (let ((.cse0 (select |v_#memory_int_3862| ULTIMATE.start_main_p1))) (and (= 26 .cse0) (= |#memory_int| (store |v_#memory_int_3862| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:48,472 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:39:48,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 16 treesize of output 11 [2019-05-15 10:39:48,502 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:48,504 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:48,504 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:48,505 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:48,513 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:48,513 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3863|]. (let ((.cse0 (select |v_#memory_int_3863| ULTIMATE.start_main_p1))) (and (= .cse0 27) (= (store |v_#memory_int_3863| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:48,513 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:39:48,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 16 treesize of output 11 [2019-05-15 10:39:48,544 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:48,546 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:48,546 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:48,546 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:48,554 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:48,554 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3864|]. (let ((.cse0 (select |v_#memory_int_3864| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3864| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 28 .cse0))) [2019-05-15 10:39:48,555 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:39:48,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:48,587 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:48,589 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:48,589 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:48,589 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:48,597 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:48,597 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3865|]. (let ((.cse0 (select |v_#memory_int_3865| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3865| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 29))) [2019-05-15 10:39:48,597 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:39:48,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 16 treesize of output 11 [2019-05-15 10:39:48,629 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:48,631 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:48,631 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:48,631 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:48,639 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:48,639 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3866|]. (let ((.cse0 (select |v_#memory_int_3866| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3866| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 30))) [2019-05-15 10:39:48,639 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:39:48,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:48,672 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:48,674 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:48,675 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:48,675 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:48,683 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:48,683 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3867|]. (let ((.cse0 (select |v_#memory_int_3867| ULTIMATE.start_main_p1))) (and (= .cse0 31) (= (store |v_#memory_int_3867| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:48,683 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:39:48,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:48,718 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:48,720 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:48,720 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:48,720 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:48,728 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:48,728 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3868|]. (let ((.cse0 (select |v_#memory_int_3868| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3868| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 32 .cse0))) [2019-05-15 10:39:48,728 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:39:48,764 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:48,765 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:48,767 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:48,767 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:48,767 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:48,775 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:48,775 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3869|]. (let ((.cse0 (select |v_#memory_int_3869| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3869| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 33 .cse0))) [2019-05-15 10:39:48,776 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:39:48,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 16 treesize of output 11 [2019-05-15 10:39:48,810 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:48,812 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:48,813 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:48,813 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:48,821 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:48,821 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3870|]. (let ((.cse0 (select |v_#memory_int_3870| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3870| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 34 .cse0))) [2019-05-15 10:39:48,821 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:39:48,863 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:48,864 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:48,866 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:48,867 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:48,867 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:48,874 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:48,874 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3871|]. (let ((.cse0 (select |v_#memory_int_3871| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3871| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 35 .cse0))) [2019-05-15 10:39:48,874 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:39:48,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 16 treesize of output 11 [2019-05-15 10:39:48,911 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:48,913 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:48,913 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:48,913 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:48,922 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:48,922 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3872|]. (let ((.cse0 (select |v_#memory_int_3872| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3872| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 36 .cse0))) [2019-05-15 10:39:48,922 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:39:48,959 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:48,960 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:48,962 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:48,962 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:48,962 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:48,970 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:48,970 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3873|]. (let ((.cse0 (select |v_#memory_int_3873| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3873| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 37 .cse0))) [2019-05-15 10:39:48,970 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:39:49,006 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:49,007 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:49,009 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:49,009 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,009 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:49,016 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:49,016 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3874|]. (let ((.cse0 (select |v_#memory_int_3874| ULTIMATE.start_main_p1))) (and (= .cse0 38) (= (store |v_#memory_int_3874| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:49,017 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:39:49,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:49,055 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:49,057 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:49,057 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,057 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:49,065 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:49,065 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3875|]. (let ((.cse0 (select |v_#memory_int_3875| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3875| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 39))) [2019-05-15 10:39:49,065 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:39:49,104 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:49,105 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:49,107 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:49,107 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,107 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:49,115 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:49,116 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3876|]. (let ((.cse0 (select |v_#memory_int_3876| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3876| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 40))) [2019-05-15 10:39:49,116 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:39:49,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:49,159 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:49,161 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:49,161 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,161 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:49,169 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:49,169 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3877|]. (let ((.cse0 (select |v_#memory_int_3877| ULTIMATE.start_main_p1))) (and (= .cse0 41) (= (store |v_#memory_int_3877| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:49,169 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:39:49,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:49,215 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 0, result has 100.0 percent of original size [2019-05-15 10:39:49,218 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,218 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:49,225 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:49,225 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3878|]. (let ((.cse0 (select |v_#memory_int_3878| ULTIMATE.start_main_p1))) (and (= .cse0 42) (= (store |v_#memory_int_3878| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:49,226 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:39:49,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 16 treesize of output 11 [2019-05-15 10:39:49,267 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:49,269 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:49,270 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,270 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:49,277 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:49,277 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3879|]. (let ((.cse0 (select |v_#memory_int_3879| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3879| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 43))) [2019-05-15 10:39:49,278 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:39:49,319 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:49,320 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:49,322 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:49,322 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,322 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:49,329 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:49,330 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3880|]. (let ((.cse0 (select |v_#memory_int_3880| ULTIMATE.start_main_p1))) (and (= .cse0 44) (= (store |v_#memory_int_3880| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:49,330 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:39:49,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:49,382 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:49,384 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:49,385 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,385 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:49,392 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:49,392 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3881|]. (let ((.cse0 (select |v_#memory_int_3881| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3881| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 45 .cse0))) [2019-05-15 10:39:49,392 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:39:49,436 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:49,437 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:49,439 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:49,439 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,439 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:49,447 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:49,447 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3882|]. (let ((.cse0 (select |v_#memory_int_3882| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3882| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 46))) [2019-05-15 10:39:49,447 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:39:49,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 16 treesize of output 11 [2019-05-15 10:39:49,494 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:49,496 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:49,497 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,497 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:49,506 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:49,506 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3883|]. (let ((.cse0 (select |v_#memory_int_3883| ULTIMATE.start_main_p1))) (and (= 47 .cse0) (= |#memory_int| (store |v_#memory_int_3883| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:49,506 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:39:49,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 16 treesize of output 11 [2019-05-15 10:39:49,552 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:49,554 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:49,554 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,555 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:49,563 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:49,564 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3884|]. (let ((.cse0 (select |v_#memory_int_3884| ULTIMATE.start_main_p1))) (and (= .cse0 48) (= (store |v_#memory_int_3884| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:49,564 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:39:49,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 16 treesize of output 11 [2019-05-15 10:39:49,610 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:49,612 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:49,612 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,612 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:49,619 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:49,619 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3885|]. (let ((.cse0 (select |v_#memory_int_3885| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3885| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 49))) [2019-05-15 10:39:49,619 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:39:49,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 16 treesize of output 11 [2019-05-15 10:39:49,667 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:49,669 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:49,669 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,669 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:49,677 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:49,677 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3886|]. (let ((.cse0 (select |v_#memory_int_3886| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3886| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 50))) [2019-05-15 10:39:49,677 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:39:49,725 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:49,726 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:49,728 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:49,728 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,728 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:49,736 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:49,736 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3887|]. (let ((.cse0 (select |v_#memory_int_3887| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3887| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 51))) [2019-05-15 10:39:49,736 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:39:49,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:49,787 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:49,789 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:49,789 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,789 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:49,797 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:49,797 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3888|]. (let ((.cse0 (select |v_#memory_int_3888| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3888| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 52 .cse0))) [2019-05-15 10:39:49,797 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:39:49,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 16 treesize of output 11 [2019-05-15 10:39:49,854 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:49,856 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:49,856 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,856 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:49,864 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:49,864 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3889|]. (let ((.cse0 (select |v_#memory_int_3889| ULTIMATE.start_main_p1))) (and (= 53 .cse0) (= (store |v_#memory_int_3889| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:49,865 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:39:49,912 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:49,913 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:49,915 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:49,915 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,916 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:49,923 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:49,923 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3890|]. (let ((.cse0 (select |v_#memory_int_3890| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3890| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 54))) [2019-05-15 10:39:49,923 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:39:49,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 16 treesize of output 11 [2019-05-15 10:39:49,975 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:49,977 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:49,977 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,977 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:49,985 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:49,985 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3891|]. (let ((.cse0 (select |v_#memory_int_3891| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3891| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 55 .cse0))) [2019-05-15 10:39:49,985 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:39:50,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:50,038 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:50,040 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:50,040 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:50,040 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:50,048 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:50,048 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3892|]. (let ((.cse0 (select |v_#memory_int_3892| ULTIMATE.start_main_p1))) (and (= 56 .cse0) (= (store |v_#memory_int_3892| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:50,048 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:39:50,102 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:50,103 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:50,105 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:50,105 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:50,105 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:50,113 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:50,114 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3893|]. (let ((.cse0 (select |v_#memory_int_3893| ULTIMATE.start_main_p1))) (and (= .cse0 57) (= |#memory_int| (store |v_#memory_int_3893| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:50,114 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:39:50,167 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:50,168 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:50,170 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:50,170 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:50,171 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:50,178 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:50,178 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3894|]. (let ((.cse0 (select |v_#memory_int_3894| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3894| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 58))) [2019-05-15 10:39:50,179 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:39:50,231 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:50,231 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:50,233 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:50,234 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:50,234 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:50,241 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:50,241 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3895|]. (let ((.cse0 (select |v_#memory_int_3895| ULTIMATE.start_main_p1))) (and (= 59 .cse0) (= |#memory_int| (store |v_#memory_int_3895| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:50,242 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:39:50,295 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:50,296 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:50,298 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:50,298 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:50,299 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:50,307 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:50,308 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3896|]. (let ((.cse0 (select |v_#memory_int_3896| ULTIMATE.start_main_p1))) (and (= 60 .cse0) (= |#memory_int| (store |v_#memory_int_3896| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:50,308 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:39:50,369 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:50,370 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:50,372 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:50,372 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:50,372 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:50,381 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:50,382 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3897|]. (let ((.cse0 (select |v_#memory_int_3897| ULTIMATE.start_main_p1))) (and (= .cse0 61) (= (store |v_#memory_int_3897| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:50,382 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:39:50,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:50,439 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:50,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:50,441 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:50,441 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:50,448 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:50,448 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3898|]. (let ((.cse0 (select |v_#memory_int_3898| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3898| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 62 .cse0))) [2019-05-15 10:39:50,448 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:39:50,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 16 treesize of output 11 [2019-05-15 10:39:50,508 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:50,510 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:50,511 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:50,511 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:50,518 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:50,518 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3899|]. (let ((.cse0 (select |v_#memory_int_3899| ULTIMATE.start_main_p1))) (and (= .cse0 63) (= (store |v_#memory_int_3899| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:50,518 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 64) [2019-05-15 10:39:50,575 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:50,576 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:50,578 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:50,578 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:50,579 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:50,587 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:50,587 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3900|]. (let ((.cse0 (select |v_#memory_int_3900| ULTIMATE.start_main_p1))) (and (= .cse0 64) (= |#memory_int| (store |v_#memory_int_3900| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:50,587 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 65) [2019-05-15 10:39:50,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:50,645 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:50,647 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:50,648 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:50,648 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:50,655 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:50,656 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3901|]. (let ((.cse0 (select |v_#memory_int_3901| ULTIMATE.start_main_p1))) (and (= 65 .cse0) (= |#memory_int| (store |v_#memory_int_3901| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:50,656 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 66) [2019-05-15 10:39:50,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:50,713 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:50,715 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:50,716 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:50,716 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:50,723 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:50,723 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3902|]. (let ((.cse0 (select |v_#memory_int_3902| ULTIMATE.start_main_p1))) (and (= .cse0 66) (= (store |v_#memory_int_3902| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:50,724 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 67) [2019-05-15 10:39:50,783 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:50,784 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:50,786 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:50,786 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:50,787 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:50,794 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:50,794 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3903|]. (let ((.cse0 (select |v_#memory_int_3903| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3903| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 67))) [2019-05-15 10:39:50,794 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 68) [2019-05-15 10:39:50,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 16 treesize of output 11 [2019-05-15 10:39:50,861 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:50,863 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:50,863 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:50,864 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:50,872 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:50,872 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3904|]. (let ((.cse0 (select |v_#memory_int_3904| ULTIMATE.start_main_p1))) (and (= 68 .cse0) (= (store |v_#memory_int_3904| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:50,872 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 69) [2019-05-15 10:39:50,933 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:50,934 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:50,936 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:50,936 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:50,936 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:50,945 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:50,945 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3905|]. (let ((.cse0 (select |v_#memory_int_3905| ULTIMATE.start_main_p1))) (and (= .cse0 69) (= |#memory_int| (store |v_#memory_int_3905| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:50,945 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 70) [2019-05-15 10:39:51,005 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:51,006 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:51,008 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:51,008 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:51,008 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:51,016 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:51,016 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3906|]. (let ((.cse0 (select |v_#memory_int_3906| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3906| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 70))) [2019-05-15 10:39:51,016 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 71) [2019-05-15 10:39:51,079 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:51,080 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:51,082 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:51,082 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:51,083 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:51,090 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:51,090 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3907|]. (let ((.cse0 (select |v_#memory_int_3907| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3907| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 71))) [2019-05-15 10:39:51,091 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 72) [2019-05-15 10:39:51,152 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:51,153 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:51,155 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:51,155 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:51,156 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:51,164 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:51,164 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3908|]. (let ((.cse0 (select |v_#memory_int_3908| ULTIMATE.start_main_p1))) (and (= 72 .cse0) (= (store |v_#memory_int_3908| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:51,164 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 73) [2019-05-15 10:39:51,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:51,226 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:51,228 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:51,228 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:51,228 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:51,237 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:51,237 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3909|]. (let ((.cse0 (select |v_#memory_int_3909| ULTIMATE.start_main_p1))) (and (= 73 .cse0) (= (store |v_#memory_int_3909| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:51,237 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 74) [2019-05-15 10:39:51,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 16 treesize of output 11 [2019-05-15 10:39:51,303 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:51,305 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:51,305 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:51,305 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:51,312 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:51,312 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3910|]. (let ((.cse0 (select |v_#memory_int_3910| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3910| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 74))) [2019-05-15 10:39:51,313 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 75) [2019-05-15 10:39:51,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:51,380 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:51,382 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:51,382 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:51,382 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:51,390 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:51,390 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3911|]. (let ((.cse0 (select |v_#memory_int_3911| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3911| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 75 .cse0))) [2019-05-15 10:39:51,390 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 76) [2019-05-15 10:39:51,462 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:51,463 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:51,465 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:51,465 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:51,466 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:51,473 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_#memory_int_3912|]. (let ((.cse0 (select |v_#memory_int_3912| ULTIMATE.start_main_p1))) (and (= 76 .cse0) (= (store |v_#memory_int_3912| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:51,473 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 77) [2019-05-15 10:39:51,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:51,539 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:51,541 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:51,541 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:51,541 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:51,548 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:51,549 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3913|]. (let ((.cse0 (select |v_#memory_int_3913| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3913| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 77 .cse0))) [2019-05-15 10:39:51,549 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 78) [2019-05-15 10:39:51,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 16 treesize of output 11 [2019-05-15 10:39:51,619 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:51,621 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:51,621 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:51,621 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:51,627 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:51,628 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3914|]. (let ((.cse0 (select |v_#memory_int_3914| ULTIMATE.start_main_p1))) (and (= .cse0 78) (= (store |v_#memory_int_3914| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:51,628 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 79) [2019-05-15 10:39:51,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:51,695 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:51,697 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:51,698 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:51,698 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:51,705 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:51,705 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3915|]. (let ((.cse0 (select |v_#memory_int_3915| ULTIMATE.start_main_p1))) (and (= .cse0 79) (= |#memory_int| (store |v_#memory_int_3915| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:51,705 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 80) [2019-05-15 10:39:51,772 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:51,773 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:51,775 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:51,775 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:51,776 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:51,783 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:51,783 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3916|]. (let ((.cse0 (select |v_#memory_int_3916| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3916| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 80 .cse0))) [2019-05-15 10:39:51,783 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 81) [2019-05-15 10:39:51,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 16 treesize of output 11 [2019-05-15 10:39:51,851 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:51,853 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:51,853 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:51,853 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:51,861 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:51,861 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3917|]. (let ((.cse0 (select |v_#memory_int_3917| ULTIMATE.start_main_p1))) (and (= 81 .cse0) (= (store |v_#memory_int_3917| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:51,862 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 82) [2019-05-15 10:39:51,933 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:51,934 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:51,936 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:51,936 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:51,936 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:51,944 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:51,944 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3918|]. (let ((.cse0 (select |v_#memory_int_3918| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3918| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 82 .cse0))) [2019-05-15 10:39:51,944 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 83) [2019-05-15 10:39:52,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 16 treesize of output 11 [2019-05-15 10:39:52,019 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:52,021 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:52,022 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:52,022 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:52,029 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:52,029 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3919|]. (let ((.cse0 (select |v_#memory_int_3919| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3919| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 83))) [2019-05-15 10:39:52,029 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 84) [2019-05-15 10:39:52,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 16 treesize of output 11 [2019-05-15 10:39:52,099 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:52,101 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:52,101 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:52,101 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:52,109 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:52,109 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3920|]. (let ((.cse0 (select |v_#memory_int_3920| ULTIMATE.start_main_p1))) (and (= .cse0 84) (= (store |v_#memory_int_3920| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:52,110 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 85) [2019-05-15 10:39:52,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 16 treesize of output 11 [2019-05-15 10:39:52,190 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:52,192 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:52,192 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:52,192 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:52,201 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:52,201 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3921|]. (let ((.cse0 (select |v_#memory_int_3921| ULTIMATE.start_main_p1))) (and (= 85 .cse0) (= |#memory_int| (store |v_#memory_int_3921| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:52,201 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 86) [2019-05-15 10:39:52,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 16 treesize of output 11 [2019-05-15 10:39:52,274 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:52,276 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:52,276 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:52,276 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:52,284 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:52,285 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3922|]. (let ((.cse0 (select |v_#memory_int_3922| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3922| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 86 .cse0))) [2019-05-15 10:39:52,285 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 87) [2019-05-15 10:39:52,354 INFO L273 TraceCheckUtils]: 0: Hoare triple {33248#true} havoc main_p1; {33248#true} is VALID [2019-05-15 10:39:52,354 INFO L273 TraceCheckUtils]: 1: Hoare triple {33248#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {33248#true} is VALID [2019-05-15 10:39:52,355 INFO L273 TraceCheckUtils]: 2: Hoare triple {33248#true} #memory_int := #memory_int[main_p1 := 0]; {33259#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:39:52,355 INFO L273 TraceCheckUtils]: 3: Hoare triple {33259#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33263#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:39:52,356 INFO L273 TraceCheckUtils]: 4: Hoare triple {33263#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33267#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:39:52,356 INFO L273 TraceCheckUtils]: 5: Hoare triple {33267#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33271#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:39:52,357 INFO L273 TraceCheckUtils]: 6: Hoare triple {33271#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33275#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:39:52,358 INFO L273 TraceCheckUtils]: 7: Hoare triple {33275#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33279#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:39:52,359 INFO L273 TraceCheckUtils]: 8: Hoare triple {33279#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33283#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:39:52,359 INFO L273 TraceCheckUtils]: 9: Hoare triple {33283#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33287#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:39:52,360 INFO L273 TraceCheckUtils]: 10: Hoare triple {33287#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33291#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:39:52,361 INFO L273 TraceCheckUtils]: 11: Hoare triple {33291#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33295#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:39:52,362 INFO L273 TraceCheckUtils]: 12: Hoare triple {33295#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33299#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:39:52,362 INFO L273 TraceCheckUtils]: 13: Hoare triple {33299#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33303#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:39:52,363 INFO L273 TraceCheckUtils]: 14: Hoare triple {33303#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33307#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:39:52,364 INFO L273 TraceCheckUtils]: 15: Hoare triple {33307#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33311#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:39:52,365 INFO L273 TraceCheckUtils]: 16: Hoare triple {33311#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33315#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:39:52,365 INFO L273 TraceCheckUtils]: 17: Hoare triple {33315#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33319#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:39:52,366 INFO L273 TraceCheckUtils]: 18: Hoare triple {33319#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33323#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:39:52,367 INFO L273 TraceCheckUtils]: 19: Hoare triple {33323#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33327#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:39:52,368 INFO L273 TraceCheckUtils]: 20: Hoare triple {33327#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33331#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:39:52,368 INFO L273 TraceCheckUtils]: 21: Hoare triple {33331#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33335#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:39:52,369 INFO L273 TraceCheckUtils]: 22: Hoare triple {33335#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33339#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:39:52,370 INFO L273 TraceCheckUtils]: 23: Hoare triple {33339#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33343#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:39:52,371 INFO L273 TraceCheckUtils]: 24: Hoare triple {33343#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33347#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:39:52,371 INFO L273 TraceCheckUtils]: 25: Hoare triple {33347#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33351#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:39:52,372 INFO L273 TraceCheckUtils]: 26: Hoare triple {33351#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33355#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:39:52,373 INFO L273 TraceCheckUtils]: 27: Hoare triple {33355#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33359#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:39:52,374 INFO L273 TraceCheckUtils]: 28: Hoare triple {33359#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33363#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:39:52,374 INFO L273 TraceCheckUtils]: 29: Hoare triple {33363#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33367#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:39:52,375 INFO L273 TraceCheckUtils]: 30: Hoare triple {33367#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33371#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:39:52,376 INFO L273 TraceCheckUtils]: 31: Hoare triple {33371#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33375#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:39:52,377 INFO L273 TraceCheckUtils]: 32: Hoare triple {33375#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33379#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:39:52,377 INFO L273 TraceCheckUtils]: 33: Hoare triple {33379#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33383#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:39:52,378 INFO L273 TraceCheckUtils]: 34: Hoare triple {33383#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33387#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:39:52,379 INFO L273 TraceCheckUtils]: 35: Hoare triple {33387#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33391#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:39:52,380 INFO L273 TraceCheckUtils]: 36: Hoare triple {33391#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33395#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:39:52,380 INFO L273 TraceCheckUtils]: 37: Hoare triple {33395#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33399#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:39:52,381 INFO L273 TraceCheckUtils]: 38: Hoare triple {33399#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33403#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:39:52,382 INFO L273 TraceCheckUtils]: 39: Hoare triple {33403#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33407#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:39:52,382 INFO L273 TraceCheckUtils]: 40: Hoare triple {33407#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33411#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:39:52,383 INFO L273 TraceCheckUtils]: 41: Hoare triple {33411#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33415#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:39:52,384 INFO L273 TraceCheckUtils]: 42: Hoare triple {33415#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33419#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:39:52,385 INFO L273 TraceCheckUtils]: 43: Hoare triple {33419#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33423#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:39:52,385 INFO L273 TraceCheckUtils]: 44: Hoare triple {33423#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33427#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:39:52,386 INFO L273 TraceCheckUtils]: 45: Hoare triple {33427#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33431#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:39:52,387 INFO L273 TraceCheckUtils]: 46: Hoare triple {33431#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33435#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:39:52,388 INFO L273 TraceCheckUtils]: 47: Hoare triple {33435#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33439#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:39:52,388 INFO L273 TraceCheckUtils]: 48: Hoare triple {33439#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33443#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:39:52,389 INFO L273 TraceCheckUtils]: 49: Hoare triple {33443#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33447#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:39:52,390 INFO L273 TraceCheckUtils]: 50: Hoare triple {33447#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33451#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:39:52,391 INFO L273 TraceCheckUtils]: 51: Hoare triple {33451#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33455#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:39:52,391 INFO L273 TraceCheckUtils]: 52: Hoare triple {33455#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33459#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:39:52,392 INFO L273 TraceCheckUtils]: 53: Hoare triple {33459#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33463#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:39:52,393 INFO L273 TraceCheckUtils]: 54: Hoare triple {33463#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33467#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:39:52,394 INFO L273 TraceCheckUtils]: 55: Hoare triple {33467#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33471#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:39:52,394 INFO L273 TraceCheckUtils]: 56: Hoare triple {33471#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33475#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:39:52,395 INFO L273 TraceCheckUtils]: 57: Hoare triple {33475#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33479#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:39:52,396 INFO L273 TraceCheckUtils]: 58: Hoare triple {33479#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33483#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:39:52,397 INFO L273 TraceCheckUtils]: 59: Hoare triple {33483#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33487#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:39:52,397 INFO L273 TraceCheckUtils]: 60: Hoare triple {33487#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33491#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:39:52,398 INFO L273 TraceCheckUtils]: 61: Hoare triple {33491#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33495#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:39:52,399 INFO L273 TraceCheckUtils]: 62: Hoare triple {33495#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33499#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:39:52,400 INFO L273 TraceCheckUtils]: 63: Hoare triple {33499#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33503#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:39:52,400 INFO L273 TraceCheckUtils]: 64: Hoare triple {33503#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33507#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:39:52,401 INFO L273 TraceCheckUtils]: 65: Hoare triple {33507#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33511#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:39:52,402 INFO L273 TraceCheckUtils]: 66: Hoare triple {33511#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33515#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} is VALID [2019-05-15 10:39:52,403 INFO L273 TraceCheckUtils]: 67: Hoare triple {33515#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33519#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} is VALID [2019-05-15 10:39:52,403 INFO L273 TraceCheckUtils]: 68: Hoare triple {33519#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33523#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} is VALID [2019-05-15 10:39:52,404 INFO L273 TraceCheckUtils]: 69: Hoare triple {33523#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33527#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} is VALID [2019-05-15 10:39:52,405 INFO L273 TraceCheckUtils]: 70: Hoare triple {33527#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33531#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} is VALID [2019-05-15 10:39:52,405 INFO L273 TraceCheckUtils]: 71: Hoare triple {33531#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33535#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} is VALID [2019-05-15 10:39:52,406 INFO L273 TraceCheckUtils]: 72: Hoare triple {33535#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33539#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} is VALID [2019-05-15 10:39:52,407 INFO L273 TraceCheckUtils]: 73: Hoare triple {33539#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33543#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} is VALID [2019-05-15 10:39:52,408 INFO L273 TraceCheckUtils]: 74: Hoare triple {33543#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33547#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} is VALID [2019-05-15 10:39:52,408 INFO L273 TraceCheckUtils]: 75: Hoare triple {33547#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33551#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} is VALID [2019-05-15 10:39:52,409 INFO L273 TraceCheckUtils]: 76: Hoare triple {33551#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33555#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} is VALID [2019-05-15 10:39:52,410 INFO L273 TraceCheckUtils]: 77: Hoare triple {33555#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33559#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} is VALID [2019-05-15 10:39:52,411 INFO L273 TraceCheckUtils]: 78: Hoare triple {33559#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33563#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} is VALID [2019-05-15 10:39:52,411 INFO L273 TraceCheckUtils]: 79: Hoare triple {33563#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33567#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} is VALID [2019-05-15 10:39:52,412 INFO L273 TraceCheckUtils]: 80: Hoare triple {33567#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33571#(= (select |#memory_int| ULTIMATE.start_main_p1) 78)} is VALID [2019-05-15 10:39:52,413 INFO L273 TraceCheckUtils]: 81: Hoare triple {33571#(= (select |#memory_int| ULTIMATE.start_main_p1) 78)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33575#(= (select |#memory_int| ULTIMATE.start_main_p1) 79)} is VALID [2019-05-15 10:39:52,414 INFO L273 TraceCheckUtils]: 82: Hoare triple {33575#(= (select |#memory_int| ULTIMATE.start_main_p1) 79)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33579#(= (select |#memory_int| ULTIMATE.start_main_p1) 80)} is VALID [2019-05-15 10:39:52,414 INFO L273 TraceCheckUtils]: 83: Hoare triple {33579#(= (select |#memory_int| ULTIMATE.start_main_p1) 80)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33583#(= (select |#memory_int| ULTIMATE.start_main_p1) 81)} is VALID [2019-05-15 10:39:52,415 INFO L273 TraceCheckUtils]: 84: Hoare triple {33583#(= (select |#memory_int| ULTIMATE.start_main_p1) 81)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33587#(= (select |#memory_int| ULTIMATE.start_main_p1) 82)} is VALID [2019-05-15 10:39:52,416 INFO L273 TraceCheckUtils]: 85: Hoare triple {33587#(= (select |#memory_int| ULTIMATE.start_main_p1) 82)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33591#(= (select |#memory_int| ULTIMATE.start_main_p1) 83)} is VALID [2019-05-15 10:39:52,417 INFO L273 TraceCheckUtils]: 86: Hoare triple {33591#(= (select |#memory_int| ULTIMATE.start_main_p1) 83)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33595#(= (select |#memory_int| ULTIMATE.start_main_p1) 84)} is VALID [2019-05-15 10:39:52,417 INFO L273 TraceCheckUtils]: 87: Hoare triple {33595#(= (select |#memory_int| ULTIMATE.start_main_p1) 84)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33599#(= (select |#memory_int| ULTIMATE.start_main_p1) 85)} is VALID [2019-05-15 10:39:52,418 INFO L273 TraceCheckUtils]: 88: Hoare triple {33599#(= (select |#memory_int| ULTIMATE.start_main_p1) 85)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33603#(= (select |#memory_int| ULTIMATE.start_main_p1) 86)} is VALID [2019-05-15 10:39:52,419 INFO L273 TraceCheckUtils]: 89: Hoare triple {33603#(= (select |#memory_int| ULTIMATE.start_main_p1) 86)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33607#(= (select |#memory_int| ULTIMATE.start_main_p1) 87)} is VALID [2019-05-15 10:39:52,419 INFO L273 TraceCheckUtils]: 90: Hoare triple {33607#(= (select |#memory_int| ULTIMATE.start_main_p1) 87)} assume !(#memory_int[main_p1] >= 0); {33249#false} is VALID [2019-05-15 10:39:52,430 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:39:52,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:39:52,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-05-15 10:39:52,431 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 91 [2019-05-15 10:39:52,431 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:39:52,431 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 90 states. [2019-05-15 10:39:52,502 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:39:52,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-05-15 10:39:52,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-05-15 10:39:52,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2019-05-15 10:39:52,504 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 90 states. [2019-05-15 10:40:08,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:40:08,236 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-05-15 10:40:08,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-05-15 10:40:08,236 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 91 [2019-05-15 10:40:08,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:40:08,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-05-15 10:40:08,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2019-05-15 10:40:08,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-05-15 10:40:08,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2019-05-15 10:40:08,239 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 90 states and 94 transitions. [2019-05-15 10:40:08,317 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:40:08,318 INFO L225 Difference]: With dead ends: 93 [2019-05-15 10:40:08,318 INFO L226 Difference]: Without dead ends: 93 [2019-05-15 10:40:08,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2019-05-15 10:40:08,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-05-15 10:40:08,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-05-15 10:40:08,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:40:08,320 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand 93 states. [2019-05-15 10:40:08,320 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 93 states. [2019-05-15 10:40:08,320 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 93 states. [2019-05-15 10:40:08,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:40:08,321 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-05-15 10:40:08,321 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-05-15 10:40:08,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:40:08,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:40:08,321 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 93 states. [2019-05-15 10:40:08,321 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 93 states. [2019-05-15 10:40:08,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:40:08,322 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-05-15 10:40:08,322 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-05-15 10:40:08,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:40:08,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:40:08,322 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:40:08,323 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:40:08,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-05-15 10:40:08,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-05-15 10:40:08,323 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2019-05-15 10:40:08,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:40:08,324 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-05-15 10:40:08,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-05-15 10:40:08,324 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-05-15 10:40:08,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-05-15 10:40:08,324 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:40:08,324 INFO L399 BasicCegarLoop]: trace histogram [88, 1, 1, 1, 1] [2019-05-15 10:40:08,324 INFO L418 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:40:08,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:40:08,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1511717512, now seen corresponding path program 88 times [2019-05-15 10:40:08,325 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:40:08,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:40:08,350 WARN L254 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 90 conjunts are in the unsatisfiable core [2019-05-15 10:40:08,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:40:08,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:40:08,375 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:08,375 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:08,377 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:08,377 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:08,377 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:40:08,379 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:08,380 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3923|]. (= (store |v_#memory_int_3923| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:40:08,380 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:40:08,389 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:08,390 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:08,392 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:08,392 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:08,392 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:08,400 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:08,400 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3924|]. (let ((.cse0 (select |v_#memory_int_3924| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3924| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 0))) [2019-05-15 10:40:08,400 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:40:08,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 16 treesize of output 11 [2019-05-15 10:40:08,411 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:08,413 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:08,414 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:08,414 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:08,422 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:08,423 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3925|]. (let ((.cse0 (select |v_#memory_int_3925| ULTIMATE.start_main_p1))) (and (= 1 .cse0) (= |#memory_int| (store |v_#memory_int_3925| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:08,423 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:40:08,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 16 treesize of output 11 [2019-05-15 10:40:08,434 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:08,436 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:08,437 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:08,437 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:08,444 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:08,445 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3926|]. (let ((.cse0 (select |v_#memory_int_3926| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3926| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 2 .cse0))) [2019-05-15 10:40:08,445 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:40:08,456 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:08,457 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:08,459 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:08,459 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:08,459 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:08,466 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:08,467 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3927|]. (let ((.cse0 (select |v_#memory_int_3927| ULTIMATE.start_main_p1))) (and (= .cse0 3) (= |#memory_int| (store |v_#memory_int_3927| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:08,467 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:40:08,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:08,479 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:08,481 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:08,481 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:08,481 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:08,488 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:08,489 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3928|]. (let ((.cse0 (select |v_#memory_int_3928| ULTIMATE.start_main_p1))) (and (= .cse0 4) (= (store |v_#memory_int_3928| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:08,489 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:40:08,502 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:08,503 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:08,505 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:08,505 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:08,505 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:08,513 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:08,513 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3929|]. (let ((.cse0 (select |v_#memory_int_3929| ULTIMATE.start_main_p1))) (and (= .cse0 5) (= |#memory_int| (store |v_#memory_int_3929| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:08,513 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:40:08,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 16 treesize of output 11 [2019-05-15 10:40:08,528 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:08,530 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:08,530 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:08,531 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:08,536 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:08,536 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3930|]. (let ((.cse0 (select |v_#memory_int_3930| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3930| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 6))) [2019-05-15 10:40:08,537 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:40:08,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 16 treesize of output 11 [2019-05-15 10:40:08,552 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:08,554 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:08,554 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:08,555 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:08,562 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:08,562 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3931|]. (let ((.cse0 (select |v_#memory_int_3931| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3931| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 7))) [2019-05-15 10:40:08,562 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:40:08,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:08,578 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:08,587 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:08,587 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:08,587 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:08,593 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:08,593 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3932|]. (let ((.cse0 (select |v_#memory_int_3932| ULTIMATE.start_main_p1))) (and (= .cse0 8) (= (store |v_#memory_int_3932| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:08,593 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:40:08,611 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:08,612 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:08,614 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:08,614 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:08,614 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:08,621 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:08,621 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3933|]. (let ((.cse0 (select |v_#memory_int_3933| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3933| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 9))) [2019-05-15 10:40:08,621 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:40:08,636 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:08,637 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:08,639 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:08,640 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:08,640 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:08,647 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:08,647 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3934|]. (let ((.cse0 (select |v_#memory_int_3934| ULTIMATE.start_main_p1))) (and (= .cse0 10) (= |#memory_int| (store |v_#memory_int_3934| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:08,647 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:40:08,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:08,664 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:08,666 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:08,666 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:08,667 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:08,673 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:08,673 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3935|]. (let ((.cse0 (select |v_#memory_int_3935| ULTIMATE.start_main_p1))) (and (= .cse0 11) (= (store |v_#memory_int_3935| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:08,674 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:40:08,691 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:08,692 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:08,694 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:08,694 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:08,695 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:08,702 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:08,702 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3936|]. (let ((.cse0 (select |v_#memory_int_3936| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3936| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 12 .cse0))) [2019-05-15 10:40:08,702 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:40:08,723 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:08,724 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:08,726 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:08,726 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:08,726 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:08,734 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:08,734 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3937|]. (let ((.cse0 (select |v_#memory_int_3937| ULTIMATE.start_main_p1))) (and (= .cse0 13) (= (store |v_#memory_int_3937| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:08,734 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:40:08,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:08,756 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:08,758 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:08,758 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:08,758 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:08,766 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:08,766 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3938|]. (let ((.cse0 (select |v_#memory_int_3938| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3938| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 14))) [2019-05-15 10:40:08,766 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:40:08,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 16 treesize of output 11 [2019-05-15 10:40:08,789 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:08,791 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:08,791 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:08,791 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:08,800 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:08,800 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3939|]. (let ((.cse0 (select |v_#memory_int_3939| ULTIMATE.start_main_p1))) (and (= .cse0 15) (= |#memory_int| (store |v_#memory_int_3939| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:08,800 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:40:08,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 16 treesize of output 11 [2019-05-15 10:40:08,824 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:08,826 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:08,826 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:08,826 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:08,833 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:08,833 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3940|]. (let ((.cse0 (select |v_#memory_int_3940| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3940| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 16))) [2019-05-15 10:40:08,833 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:40:08,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 16 treesize of output 11 [2019-05-15 10:40:08,856 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:08,858 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:08,858 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:08,858 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:08,866 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:08,866 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3941|]. (let ((.cse0 (select |v_#memory_int_3941| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3941| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 17))) [2019-05-15 10:40:08,866 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:40:08,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:08,890 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:08,892 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:08,892 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:08,892 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:08,898 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:08,898 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3942|]. (let ((.cse0 (select |v_#memory_int_3942| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3942| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 18))) [2019-05-15 10:40:08,898 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:40:08,924 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:08,925 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:08,927 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:08,927 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:08,927 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:08,933 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:08,934 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3943|]. (let ((.cse0 (select |v_#memory_int_3943| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3943| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 19 .cse0))) [2019-05-15 10:40:08,934 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:40:08,959 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:08,960 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:08,962 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:08,963 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:08,963 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:08,970 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:08,970 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3944|]. (let ((.cse0 (select |v_#memory_int_3944| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3944| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 20))) [2019-05-15 10:40:08,970 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:40:08,998 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:08,999 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:09,001 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:09,001 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:09,001 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:09,009 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:09,009 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3945|]. (let ((.cse0 (select |v_#memory_int_3945| ULTIMATE.start_main_p1))) (and (= .cse0 21) (= (store |v_#memory_int_3945| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:09,009 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:40:09,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 16 treesize of output 11 [2019-05-15 10:40:09,035 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:09,037 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:09,038 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:09,038 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:09,045 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:09,046 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3946|]. (let ((.cse0 (select |v_#memory_int_3946| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3946| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 22))) [2019-05-15 10:40:09,046 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:40:09,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:09,075 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:09,077 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:09,078 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:09,078 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:09,085 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:09,085 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3947|]. (let ((.cse0 (select |v_#memory_int_3947| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3947| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 23 .cse0))) [2019-05-15 10:40:09,085 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:40:09,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 16 treesize of output 11 [2019-05-15 10:40:09,112 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:09,115 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:09,115 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:09,115 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:09,123 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:09,123 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3948|]. (let ((.cse0 (select |v_#memory_int_3948| ULTIMATE.start_main_p1))) (and (= .cse0 24) (= (store |v_#memory_int_3948| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:09,123 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:40:09,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 16 treesize of output 11 [2019-05-15 10:40:09,151 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:09,153 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:09,153 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:09,153 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:09,161 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:09,161 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3949|]. (let ((.cse0 (select |v_#memory_int_3949| ULTIMATE.start_main_p1))) (and (= .cse0 25) (= (store |v_#memory_int_3949| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:09,161 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:40:09,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 16 treesize of output 11 [2019-05-15 10:40:09,190 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:09,192 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:09,192 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:09,193 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:09,200 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:09,200 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3950|]. (let ((.cse0 (select |v_#memory_int_3950| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3950| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 26 .cse0))) [2019-05-15 10:40:09,204 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:40:09,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 16 treesize of output 11 [2019-05-15 10:40:09,235 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:09,237 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:09,237 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:09,237 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:09,244 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:09,244 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3951|]. (let ((.cse0 (select |v_#memory_int_3951| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3951| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 27 .cse0))) [2019-05-15 10:40:09,244 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:40:09,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 16 treesize of output 11 [2019-05-15 10:40:09,274 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:09,276 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:09,276 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:09,277 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:09,285 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:09,285 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3952|]. (let ((.cse0 (select |v_#memory_int_3952| ULTIMATE.start_main_p1))) (and (= 28 .cse0) (= (store |v_#memory_int_3952| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:09,285 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:40:09,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 16 treesize of output 11 [2019-05-15 10:40:09,315 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:09,317 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:09,317 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:09,317 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:09,325 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:09,325 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3953|]. (let ((.cse0 (select |v_#memory_int_3953| ULTIMATE.start_main_p1))) (and (= .cse0 29) (= |#memory_int| (store |v_#memory_int_3953| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:09,325 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:40:09,357 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:09,358 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:09,360 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:09,360 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:09,360 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:09,367 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:09,368 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3954|]. (let ((.cse0 (select |v_#memory_int_3954| ULTIMATE.start_main_p1))) (and (= 30 .cse0) (= (store |v_#memory_int_3954| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:09,368 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:40:09,402 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:09,403 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:09,405 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:09,405 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:09,405 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:09,411 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:09,412 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3955|]. (let ((.cse0 (select |v_#memory_int_3955| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3955| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 31 .cse0))) [2019-05-15 10:40:09,412 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:40:09,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:09,444 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:09,446 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:09,446 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:09,446 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:09,452 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:09,453 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3956|]. (let ((.cse0 (select |v_#memory_int_3956| ULTIMATE.start_main_p1))) (and (= .cse0 32) (= |#memory_int| (store |v_#memory_int_3956| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:09,453 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:40:09,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 16 treesize of output 11 [2019-05-15 10:40:09,485 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:09,487 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:09,488 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:09,488 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:09,495 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:09,495 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3957|]. (let ((.cse0 (select |v_#memory_int_3957| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3957| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 33))) [2019-05-15 10:40:09,495 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:40:09,532 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:09,533 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:09,535 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:09,535 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:09,535 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:09,543 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:09,543 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3958|]. (let ((.cse0 (select |v_#memory_int_3958| ULTIMATE.start_main_p1))) (and (= 34 .cse0) (= (store |v_#memory_int_3958| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:09,543 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:40:09,580 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:09,581 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:09,583 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:09,583 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:09,583 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:09,590 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:09,591 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3959|]. (let ((.cse0 (select |v_#memory_int_3959| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3959| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 35 .cse0))) [2019-05-15 10:40:09,591 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:40:09,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 16 treesize of output 11 [2019-05-15 10:40:09,628 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:09,630 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:09,630 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:09,630 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:09,636 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:09,636 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3960|]. (let ((.cse0 (select |v_#memory_int_3960| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3960| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 36 .cse0))) [2019-05-15 10:40:09,637 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:40:09,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:09,674 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:09,676 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:09,676 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:09,676 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:09,684 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:09,684 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3961|]. (let ((.cse0 (select |v_#memory_int_3961| ULTIMATE.start_main_p1))) (and (= 37 .cse0) (= (store |v_#memory_int_3961| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:09,684 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:40:09,721 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:09,722 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:09,724 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:09,724 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:09,724 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:09,732 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:09,732 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3962|]. (let ((.cse0 (select |v_#memory_int_3962| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3962| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 38 .cse0))) [2019-05-15 10:40:09,732 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:40:09,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 16 treesize of output 11 [2019-05-15 10:40:09,776 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:09,778 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:09,779 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:09,779 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:09,787 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:09,787 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3963|]. (let ((.cse0 (select |v_#memory_int_3963| ULTIMATE.start_main_p1))) (and (= .cse0 39) (= |#memory_int| (store |v_#memory_int_3963| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:09,787 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:40:09,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:09,828 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:09,830 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:09,830 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:09,830 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:09,837 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:09,838 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3964|]. (let ((.cse0 (select |v_#memory_int_3964| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3964| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 40 .cse0))) [2019-05-15 10:40:09,838 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:40:09,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:09,882 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:09,884 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:09,884 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:09,884 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:09,891 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:09,891 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3965|]. (let ((.cse0 (select |v_#memory_int_3965| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3965| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 41 .cse0))) [2019-05-15 10:40:09,892 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:40:09,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 16 treesize of output 11 [2019-05-15 10:40:09,933 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:09,935 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:09,935 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:09,935 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:09,942 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:09,942 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3966|]. (let ((.cse0 (select |v_#memory_int_3966| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3966| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 42))) [2019-05-15 10:40:09,943 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:40:09,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 16 treesize of output 11 [2019-05-15 10:40:09,985 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:09,987 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:09,988 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:09,988 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:09,995 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:09,995 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3967|]. (let ((.cse0 (select |v_#memory_int_3967| ULTIMATE.start_main_p1))) (and (= 43 .cse0) (= (store |v_#memory_int_3967| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:09,995 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:40:10,038 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:10,039 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:10,041 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:10,042 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:10,042 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:10,049 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:10,050 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3968|]. (let ((.cse0 (select |v_#memory_int_3968| ULTIMATE.start_main_p1))) (and (= 44 .cse0) (= (store |v_#memory_int_3968| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:10,050 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:40:10,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 16 treesize of output 11 [2019-05-15 10:40:10,092 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:10,094 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:10,094 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:10,095 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:10,103 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:10,103 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3969|]. (let ((.cse0 (select |v_#memory_int_3969| ULTIMATE.start_main_p1))) (and (= 45 .cse0) (= (store |v_#memory_int_3969| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:10,103 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:40:10,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:10,145 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:10,147 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:10,147 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:10,147 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:10,155 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:10,155 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3970|]. (let ((.cse0 (select |v_#memory_int_3970| ULTIMATE.start_main_p1))) (and (= .cse0 46) (= |#memory_int| (store |v_#memory_int_3970| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:10,155 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:40:10,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:10,200 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:10,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:10,202 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:10,202 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:10,211 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:10,211 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3971|]. (let ((.cse0 (select |v_#memory_int_3971| ULTIMATE.start_main_p1))) (and (= .cse0 47) (= |#memory_int| (store |v_#memory_int_3971| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:10,211 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:40:10,255 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:10,256 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:10,258 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:10,258 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:10,258 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:10,268 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:10,268 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3972|]. (let ((.cse0 (select |v_#memory_int_3972| ULTIMATE.start_main_p1))) (and (= .cse0 48) (= (store |v_#memory_int_3972| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:10,268 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:40:10,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 16 treesize of output 11 [2019-05-15 10:40:10,312 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:10,314 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:10,314 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:10,314 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:10,321 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:10,322 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3973|]. (let ((.cse0 (select |v_#memory_int_3973| ULTIMATE.start_main_p1))) (and (= .cse0 49) (= (store |v_#memory_int_3973| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:10,322 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:40:10,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:10,375 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:10,377 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:10,377 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:10,377 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:10,384 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:10,384 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3974|]. (let ((.cse0 (select |v_#memory_int_3974| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3974| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 50 .cse0))) [2019-05-15 10:40:10,384 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:40:10,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:10,429 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:10,431 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:10,431 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:10,431 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:10,439 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:10,439 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3975|]. (let ((.cse0 (select |v_#memory_int_3975| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3975| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 51))) [2019-05-15 10:40:10,439 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:40:10,485 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:10,486 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:10,488 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:10,488 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:10,488 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:10,496 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:10,496 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3976|]. (let ((.cse0 (select |v_#memory_int_3976| ULTIMATE.start_main_p1))) (and (= .cse0 52) (= (store |v_#memory_int_3976| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:10,496 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:40:10,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:10,550 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:10,552 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:10,552 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:10,553 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:10,560 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:10,560 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3977|]. (let ((.cse0 (select |v_#memory_int_3977| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3977| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 53 .cse0))) [2019-05-15 10:40:10,560 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:40:10,612 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:10,613 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:10,615 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:10,615 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:10,615 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:10,622 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:10,622 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3978|]. (let ((.cse0 (select |v_#memory_int_3978| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3978| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 54))) [2019-05-15 10:40:10,622 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:40:10,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:10,674 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:10,676 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:10,676 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:10,677 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:10,684 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:10,685 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3979|]. (let ((.cse0 (select |v_#memory_int_3979| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3979| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 55))) [2019-05-15 10:40:10,685 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:40:10,735 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:10,736 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:10,738 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:10,738 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:10,739 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:10,746 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:10,746 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3980|]. (let ((.cse0 (select |v_#memory_int_3980| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3980| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 56))) [2019-05-15 10:40:10,746 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:40:10,799 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:10,800 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:10,802 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:10,802 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:10,802 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:10,810 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:10,810 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3981|]. (let ((.cse0 (select |v_#memory_int_3981| ULTIMATE.start_main_p1))) (and (= 57 .cse0) (= (store |v_#memory_int_3981| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:10,810 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:40:10,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:10,867 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:10,869 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:10,869 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:10,869 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:10,876 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:10,876 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3982|]. (let ((.cse0 (select |v_#memory_int_3982| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3982| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 58))) [2019-05-15 10:40:10,877 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:40:10,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 16 treesize of output 11 [2019-05-15 10:40:10,928 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:10,930 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:10,930 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:10,930 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:10,938 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:10,938 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3983|]. (let ((.cse0 (select |v_#memory_int_3983| ULTIMATE.start_main_p1))) (and (= .cse0 59) (= (store |v_#memory_int_3983| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:10,938 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:40:10,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 16 treesize of output 11 [2019-05-15 10:40:10,995 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:10,997 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:10,997 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:10,997 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:11,005 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:11,005 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3984|]. (let ((.cse0 (select |v_#memory_int_3984| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3984| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 60))) [2019-05-15 10:40:11,005 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:40:11,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 16 treesize of output 11 [2019-05-15 10:40:11,058 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:11,060 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:11,060 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:11,060 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:11,068 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:11,068 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3985|]. (let ((.cse0 (select |v_#memory_int_3985| ULTIMATE.start_main_p1))) (and (= .cse0 61) (= (store |v_#memory_int_3985| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:11,068 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:40:11,127 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:11,128 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:11,130 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:11,130 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:11,130 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:11,138 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:11,138 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3986|]. (let ((.cse0 (select |v_#memory_int_3986| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3986| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 62))) [2019-05-15 10:40:11,138 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:40:11,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 16 treesize of output 11 [2019-05-15 10:40:11,195 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:11,197 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:11,197 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:11,197 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:11,205 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:11,206 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3987|]. (let ((.cse0 (select |v_#memory_int_3987| ULTIMATE.start_main_p1))) (and (= .cse0 63) (= (store |v_#memory_int_3987| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:11,206 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 64) [2019-05-15 10:40:11,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 16 treesize of output 11 [2019-05-15 10:40:11,261 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:11,263 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:11,263 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:11,264 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:11,271 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:11,271 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3988|]. (let ((.cse0 (select |v_#memory_int_3988| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3988| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 64))) [2019-05-15 10:40:11,271 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 65) [2019-05-15 10:40:11,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 16 treesize of output 11 [2019-05-15 10:40:11,329 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:11,331 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:11,331 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:11,331 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:11,338 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:11,339 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3989|]. (let ((.cse0 (select |v_#memory_int_3989| ULTIMATE.start_main_p1))) (and (= .cse0 65) (= |#memory_int| (store |v_#memory_int_3989| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:11,339 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 66) [2019-05-15 10:40:11,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 16 treesize of output 11 [2019-05-15 10:40:11,397 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:11,399 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:11,400 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:11,400 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:11,407 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:11,407 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3990|]. (let ((.cse0 (select |v_#memory_int_3990| ULTIMATE.start_main_p1))) (and (= .cse0 66) (= |#memory_int| (store |v_#memory_int_3990| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:11,407 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 67) [2019-05-15 10:40:11,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:11,466 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:11,468 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:11,468 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:11,468 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:11,476 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:11,476 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3991|]. (let ((.cse0 (select |v_#memory_int_3991| ULTIMATE.start_main_p1))) (and (= .cse0 67) (= (store |v_#memory_int_3991| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:11,476 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 68) [2019-05-15 10:40:11,541 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:11,542 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:11,544 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:11,545 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:11,545 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:11,553 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:11,553 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3992|]. (let ((.cse0 (select |v_#memory_int_3992| ULTIMATE.start_main_p1))) (and (= 68 .cse0) (= (store |v_#memory_int_3992| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:11,554 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 69) [2019-05-15 10:40:11,615 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:11,616 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:11,618 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:11,618 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:11,619 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:11,626 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:11,627 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3993|]. (let ((.cse0 (select |v_#memory_int_3993| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3993| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 69 .cse0))) [2019-05-15 10:40:11,627 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 70) [2019-05-15 10:40:11,690 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:11,691 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:11,693 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:11,693 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:11,694 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:11,701 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:11,701 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3994|]. (let ((.cse0 (select |v_#memory_int_3994| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3994| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 70))) [2019-05-15 10:40:11,701 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 71) [2019-05-15 10:40:11,764 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:11,765 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:11,767 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:11,767 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:11,767 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:11,775 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:11,775 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3995|]. (let ((.cse0 (select |v_#memory_int_3995| ULTIMATE.start_main_p1))) (and (= .cse0 71) (= (store |v_#memory_int_3995| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:11,775 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 72) [2019-05-15 10:40:11,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:11,841 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:11,843 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:11,843 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:11,843 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:11,850 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:11,850 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3996|]. (let ((.cse0 (select |v_#memory_int_3996| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3996| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 72))) [2019-05-15 10:40:11,850 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 73) [2019-05-15 10:40:11,912 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:11,913 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:11,915 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:11,915 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:11,915 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:11,923 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:11,923 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3997|]. (let ((.cse0 (select |v_#memory_int_3997| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3997| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 73 .cse0))) [2019-05-15 10:40:11,923 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 74) [2019-05-15 10:40:11,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:11,987 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:11,989 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:11,989 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:11,990 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:11,997 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:11,997 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3998|]. (let ((.cse0 (select |v_#memory_int_3998| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3998| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 74 .cse0))) [2019-05-15 10:40:11,997 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 75) [2019-05-15 10:40:12,069 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:12,070 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:12,072 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:12,072 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:12,072 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:12,079 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:12,080 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3999|]. (let ((.cse0 (select |v_#memory_int_3999| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3999| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 75 .cse0))) [2019-05-15 10:40:12,080 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 76) [2019-05-15 10:40:12,145 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:12,146 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:12,148 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:12,148 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:12,149 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:12,156 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:12,156 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4000|]. (let ((.cse0 (select |v_#memory_int_4000| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4000| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 76))) [2019-05-15 10:40:12,156 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 77) [2019-05-15 10:40:12,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:12,226 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:12,228 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:12,228 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:12,229 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:12,236 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:12,236 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4001|]. (let ((.cse0 (select |v_#memory_int_4001| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4001| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 77 .cse0))) [2019-05-15 10:40:12,236 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 78) [2019-05-15 10:40:12,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 16 treesize of output 11 [2019-05-15 10:40:12,305 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:12,307 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:12,307 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:12,307 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:12,314 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:12,315 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4002|]. (let ((.cse0 (select |v_#memory_int_4002| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4002| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 78 .cse0))) [2019-05-15 10:40:12,315 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 79) [2019-05-15 10:40:12,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:12,380 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:12,382 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:12,382 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:12,383 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:12,390 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:12,390 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4003|]. (let ((.cse0 (select |v_#memory_int_4003| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4003| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 79))) [2019-05-15 10:40:12,390 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 80) [2019-05-15 10:40:12,456 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:12,457 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:12,459 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:12,459 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:12,460 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:12,467 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:12,467 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4004|]. (let ((.cse0 (select |v_#memory_int_4004| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4004| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 80 .cse0))) [2019-05-15 10:40:12,467 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 81) [2019-05-15 10:40:12,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:12,538 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:12,540 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:12,540 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:12,540 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:12,548 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:12,548 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4005|]. (let ((.cse0 (select |v_#memory_int_4005| ULTIMATE.start_main_p1))) (and (= 81 .cse0) (= (store |v_#memory_int_4005| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:12,548 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 82) [2019-05-15 10:40:12,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:12,619 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:12,621 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:12,622 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:12,622 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:12,630 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:12,630 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4006|]. (let ((.cse0 (select |v_#memory_int_4006| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4006| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 82 .cse0))) [2019-05-15 10:40:12,630 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 83) [2019-05-15 10:40:12,704 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:12,705 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:12,707 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:12,707 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:12,708 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:12,715 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:12,715 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4007|]. (let ((.cse0 (select |v_#memory_int_4007| ULTIMATE.start_main_p1))) (and (= .cse0 83) (= (store |v_#memory_int_4007| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:12,715 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 84) [2019-05-15 10:40:12,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 16 treesize of output 11 [2019-05-15 10:40:12,789 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:12,791 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:12,791 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:12,791 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:12,798 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:12,798 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4008|]. (let ((.cse0 (select |v_#memory_int_4008| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4008| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 84 .cse0))) [2019-05-15 10:40:12,799 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 85) [2019-05-15 10:40:12,871 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:12,872 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:12,874 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:12,875 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:12,875 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:12,883 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:12,883 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4009|]. (let ((.cse0 (select |v_#memory_int_4009| ULTIMATE.start_main_p1))) (and (= .cse0 85) (= (store |v_#memory_int_4009| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:12,884 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 86) [2019-05-15 10:40:12,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:12,959 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:12,961 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:12,961 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:12,962 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:12,969 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:12,969 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4010|]. (let ((.cse0 (select |v_#memory_int_4010| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4010| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 86))) [2019-05-15 10:40:12,969 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 87) [2019-05-15 10:40:13,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 16 treesize of output 11 [2019-05-15 10:40:13,042 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:13,044 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:13,045 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:13,045 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:13,052 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:13,052 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4011|]. (let ((.cse0 (select |v_#memory_int_4011| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4011| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 87))) [2019-05-15 10:40:13,052 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 88) [2019-05-15 10:40:13,121 INFO L273 TraceCheckUtils]: 0: Hoare triple {33982#true} havoc main_p1; {33982#true} is VALID [2019-05-15 10:40:13,121 INFO L273 TraceCheckUtils]: 1: Hoare triple {33982#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {33982#true} is VALID [2019-05-15 10:40:13,122 INFO L273 TraceCheckUtils]: 2: Hoare triple {33982#true} #memory_int := #memory_int[main_p1 := 0]; {33993#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:40:13,123 INFO L273 TraceCheckUtils]: 3: Hoare triple {33993#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33997#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:40:13,123 INFO L273 TraceCheckUtils]: 4: Hoare triple {33997#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34001#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:40:13,124 INFO L273 TraceCheckUtils]: 5: Hoare triple {34001#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34005#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:40:13,124 INFO L273 TraceCheckUtils]: 6: Hoare triple {34005#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34009#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:40:13,125 INFO L273 TraceCheckUtils]: 7: Hoare triple {34009#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34013#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:40:13,125 INFO L273 TraceCheckUtils]: 8: Hoare triple {34013#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34017#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:40:13,126 INFO L273 TraceCheckUtils]: 9: Hoare triple {34017#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34021#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:40:13,127 INFO L273 TraceCheckUtils]: 10: Hoare triple {34021#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34025#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:40:13,128 INFO L273 TraceCheckUtils]: 11: Hoare triple {34025#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34029#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:40:13,128 INFO L273 TraceCheckUtils]: 12: Hoare triple {34029#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34033#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:40:13,129 INFO L273 TraceCheckUtils]: 13: Hoare triple {34033#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34037#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:40:13,130 INFO L273 TraceCheckUtils]: 14: Hoare triple {34037#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34041#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:40:13,130 INFO L273 TraceCheckUtils]: 15: Hoare triple {34041#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34045#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:40:13,131 INFO L273 TraceCheckUtils]: 16: Hoare triple {34045#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34049#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:40:13,132 INFO L273 TraceCheckUtils]: 17: Hoare triple {34049#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34053#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:40:13,133 INFO L273 TraceCheckUtils]: 18: Hoare triple {34053#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34057#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:40:13,133 INFO L273 TraceCheckUtils]: 19: Hoare triple {34057#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34061#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:40:13,134 INFO L273 TraceCheckUtils]: 20: Hoare triple {34061#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34065#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:40:13,135 INFO L273 TraceCheckUtils]: 21: Hoare triple {34065#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34069#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:40:13,136 INFO L273 TraceCheckUtils]: 22: Hoare triple {34069#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34073#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:40:13,136 INFO L273 TraceCheckUtils]: 23: Hoare triple {34073#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34077#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:40:13,137 INFO L273 TraceCheckUtils]: 24: Hoare triple {34077#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34081#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:40:13,138 INFO L273 TraceCheckUtils]: 25: Hoare triple {34081#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34085#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:40:13,139 INFO L273 TraceCheckUtils]: 26: Hoare triple {34085#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34089#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:40:13,139 INFO L273 TraceCheckUtils]: 27: Hoare triple {34089#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34093#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:40:13,140 INFO L273 TraceCheckUtils]: 28: Hoare triple {34093#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34097#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:40:13,141 INFO L273 TraceCheckUtils]: 29: Hoare triple {34097#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34101#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:40:13,142 INFO L273 TraceCheckUtils]: 30: Hoare triple {34101#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34105#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:40:13,142 INFO L273 TraceCheckUtils]: 31: Hoare triple {34105#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34109#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:40:13,143 INFO L273 TraceCheckUtils]: 32: Hoare triple {34109#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34113#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:40:13,144 INFO L273 TraceCheckUtils]: 33: Hoare triple {34113#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34117#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:40:13,145 INFO L273 TraceCheckUtils]: 34: Hoare triple {34117#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34121#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:40:13,145 INFO L273 TraceCheckUtils]: 35: Hoare triple {34121#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34125#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:40:13,146 INFO L273 TraceCheckUtils]: 36: Hoare triple {34125#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34129#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:40:13,147 INFO L273 TraceCheckUtils]: 37: Hoare triple {34129#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34133#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:40:13,148 INFO L273 TraceCheckUtils]: 38: Hoare triple {34133#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34137#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:40:13,148 INFO L273 TraceCheckUtils]: 39: Hoare triple {34137#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34141#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:40:13,149 INFO L273 TraceCheckUtils]: 40: Hoare triple {34141#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34145#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:40:13,150 INFO L273 TraceCheckUtils]: 41: Hoare triple {34145#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34149#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:40:13,151 INFO L273 TraceCheckUtils]: 42: Hoare triple {34149#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34153#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:40:13,151 INFO L273 TraceCheckUtils]: 43: Hoare triple {34153#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34157#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:40:13,152 INFO L273 TraceCheckUtils]: 44: Hoare triple {34157#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34161#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:40:13,153 INFO L273 TraceCheckUtils]: 45: Hoare triple {34161#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34165#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:40:13,153 INFO L273 TraceCheckUtils]: 46: Hoare triple {34165#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34169#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:40:13,154 INFO L273 TraceCheckUtils]: 47: Hoare triple {34169#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34173#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:40:13,155 INFO L273 TraceCheckUtils]: 48: Hoare triple {34173#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34177#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:40:13,156 INFO L273 TraceCheckUtils]: 49: Hoare triple {34177#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34181#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:40:13,156 INFO L273 TraceCheckUtils]: 50: Hoare triple {34181#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34185#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:40:13,157 INFO L273 TraceCheckUtils]: 51: Hoare triple {34185#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34189#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:40:13,158 INFO L273 TraceCheckUtils]: 52: Hoare triple {34189#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34193#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:40:13,159 INFO L273 TraceCheckUtils]: 53: Hoare triple {34193#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34197#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:40:13,159 INFO L273 TraceCheckUtils]: 54: Hoare triple {34197#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34201#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:40:13,160 INFO L273 TraceCheckUtils]: 55: Hoare triple {34201#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34205#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:40:13,161 INFO L273 TraceCheckUtils]: 56: Hoare triple {34205#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34209#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:40:13,162 INFO L273 TraceCheckUtils]: 57: Hoare triple {34209#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34213#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:40:13,162 INFO L273 TraceCheckUtils]: 58: Hoare triple {34213#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34217#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:40:13,163 INFO L273 TraceCheckUtils]: 59: Hoare triple {34217#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34221#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:40:13,164 INFO L273 TraceCheckUtils]: 60: Hoare triple {34221#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34225#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:40:13,165 INFO L273 TraceCheckUtils]: 61: Hoare triple {34225#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34229#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:40:13,165 INFO L273 TraceCheckUtils]: 62: Hoare triple {34229#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34233#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:40:13,166 INFO L273 TraceCheckUtils]: 63: Hoare triple {34233#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34237#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:40:13,167 INFO L273 TraceCheckUtils]: 64: Hoare triple {34237#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34241#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:40:13,168 INFO L273 TraceCheckUtils]: 65: Hoare triple {34241#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34245#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:40:13,168 INFO L273 TraceCheckUtils]: 66: Hoare triple {34245#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34249#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} is VALID [2019-05-15 10:40:13,169 INFO L273 TraceCheckUtils]: 67: Hoare triple {34249#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34253#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} is VALID [2019-05-15 10:40:13,170 INFO L273 TraceCheckUtils]: 68: Hoare triple {34253#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34257#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} is VALID [2019-05-15 10:40:13,171 INFO L273 TraceCheckUtils]: 69: Hoare triple {34257#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34261#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} is VALID [2019-05-15 10:40:13,171 INFO L273 TraceCheckUtils]: 70: Hoare triple {34261#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34265#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} is VALID [2019-05-15 10:40:13,172 INFO L273 TraceCheckUtils]: 71: Hoare triple {34265#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34269#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} is VALID [2019-05-15 10:40:13,173 INFO L273 TraceCheckUtils]: 72: Hoare triple {34269#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34273#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} is VALID [2019-05-15 10:40:13,174 INFO L273 TraceCheckUtils]: 73: Hoare triple {34273#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34277#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} is VALID [2019-05-15 10:40:13,174 INFO L273 TraceCheckUtils]: 74: Hoare triple {34277#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34281#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} is VALID [2019-05-15 10:40:13,175 INFO L273 TraceCheckUtils]: 75: Hoare triple {34281#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34285#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} is VALID [2019-05-15 10:40:13,176 INFO L273 TraceCheckUtils]: 76: Hoare triple {34285#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34289#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} is VALID [2019-05-15 10:40:13,177 INFO L273 TraceCheckUtils]: 77: Hoare triple {34289#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34293#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} is VALID [2019-05-15 10:40:13,177 INFO L273 TraceCheckUtils]: 78: Hoare triple {34293#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34297#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} is VALID [2019-05-15 10:40:13,178 INFO L273 TraceCheckUtils]: 79: Hoare triple {34297#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34301#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} is VALID [2019-05-15 10:40:13,179 INFO L273 TraceCheckUtils]: 80: Hoare triple {34301#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34305#(= (select |#memory_int| ULTIMATE.start_main_p1) 78)} is VALID [2019-05-15 10:40:13,179 INFO L273 TraceCheckUtils]: 81: Hoare triple {34305#(= (select |#memory_int| ULTIMATE.start_main_p1) 78)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34309#(= (select |#memory_int| ULTIMATE.start_main_p1) 79)} is VALID [2019-05-15 10:40:13,180 INFO L273 TraceCheckUtils]: 82: Hoare triple {34309#(= (select |#memory_int| ULTIMATE.start_main_p1) 79)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34313#(= (select |#memory_int| ULTIMATE.start_main_p1) 80)} is VALID [2019-05-15 10:40:13,181 INFO L273 TraceCheckUtils]: 83: Hoare triple {34313#(= (select |#memory_int| ULTIMATE.start_main_p1) 80)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34317#(= (select |#memory_int| ULTIMATE.start_main_p1) 81)} is VALID [2019-05-15 10:40:13,182 INFO L273 TraceCheckUtils]: 84: Hoare triple {34317#(= (select |#memory_int| ULTIMATE.start_main_p1) 81)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34321#(= (select |#memory_int| ULTIMATE.start_main_p1) 82)} is VALID [2019-05-15 10:40:13,182 INFO L273 TraceCheckUtils]: 85: Hoare triple {34321#(= (select |#memory_int| ULTIMATE.start_main_p1) 82)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34325#(= (select |#memory_int| ULTIMATE.start_main_p1) 83)} is VALID [2019-05-15 10:40:13,183 INFO L273 TraceCheckUtils]: 86: Hoare triple {34325#(= (select |#memory_int| ULTIMATE.start_main_p1) 83)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34329#(= (select |#memory_int| ULTIMATE.start_main_p1) 84)} is VALID [2019-05-15 10:40:13,184 INFO L273 TraceCheckUtils]: 87: Hoare triple {34329#(= (select |#memory_int| ULTIMATE.start_main_p1) 84)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34333#(= (select |#memory_int| ULTIMATE.start_main_p1) 85)} is VALID [2019-05-15 10:40:13,185 INFO L273 TraceCheckUtils]: 88: Hoare triple {34333#(= (select |#memory_int| ULTIMATE.start_main_p1) 85)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34337#(= (select |#memory_int| ULTIMATE.start_main_p1) 86)} is VALID [2019-05-15 10:40:13,185 INFO L273 TraceCheckUtils]: 89: Hoare triple {34337#(= (select |#memory_int| ULTIMATE.start_main_p1) 86)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34341#(= (select |#memory_int| ULTIMATE.start_main_p1) 87)} is VALID [2019-05-15 10:40:13,186 INFO L273 TraceCheckUtils]: 90: Hoare triple {34341#(= (select |#memory_int| ULTIMATE.start_main_p1) 87)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34345#(= (select |#memory_int| ULTIMATE.start_main_p1) 88)} is VALID [2019-05-15 10:40:13,187 INFO L273 TraceCheckUtils]: 91: Hoare triple {34345#(= (select |#memory_int| ULTIMATE.start_main_p1) 88)} assume !(#memory_int[main_p1] >= 0); {33983#false} is VALID [2019-05-15 10:40:13,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:40:13,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:40:13,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-05-15 10:40:13,197 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 92 [2019-05-15 10:40:13,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:40:13,198 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 91 states. [2019-05-15 10:40:13,271 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:40:13,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-05-15 10:40:13,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-05-15 10:40:13,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2019-05-15 10:40:13,273 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 91 states. [2019-05-15 10:40:29,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:40:29,350 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-05-15 10:40:29,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-05-15 10:40:29,350 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 92 [2019-05-15 10:40:29,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:40:29,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-05-15 10:40:29,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2019-05-15 10:40:29,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-05-15 10:40:29,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2019-05-15 10:40:29,352 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 91 states and 95 transitions. [2019-05-15 10:40:29,427 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:40:29,428 INFO L225 Difference]: With dead ends: 94 [2019-05-15 10:40:29,428 INFO L226 Difference]: Without dead ends: 94 [2019-05-15 10:40:29,429 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2019-05-15 10:40:29,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-05-15 10:40:29,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-05-15 10:40:29,430 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:40:29,430 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand 94 states. [2019-05-15 10:40:29,430 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 94 states. [2019-05-15 10:40:29,430 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 94 states. [2019-05-15 10:40:29,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:40:29,431 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-05-15 10:40:29,431 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-05-15 10:40:29,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:40:29,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:40:29,432 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 94 states. [2019-05-15 10:40:29,432 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 94 states. [2019-05-15 10:40:29,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:40:29,432 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-05-15 10:40:29,433 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-05-15 10:40:29,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:40:29,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:40:29,433 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:40:29,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:40:29,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-05-15 10:40:29,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-05-15 10:40:29,434 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2019-05-15 10:40:29,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:40:29,434 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-05-15 10:40:29,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-05-15 10:40:29,434 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-05-15 10:40:29,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-05-15 10:40:29,434 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:40:29,434 INFO L399 BasicCegarLoop]: trace histogram [89, 1, 1, 1, 1] [2019-05-15 10:40:29,435 INFO L418 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:40:29,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:40:29,435 INFO L82 PathProgramCache]: Analyzing trace with hash -381397438, now seen corresponding path program 89 times [2019-05-15 10:40:29,435 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:40:29,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:40:29,477 WARN L254 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 91 conjunts are in the unsatisfiable core [2019-05-15 10:40:29,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:40:29,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:40:29,509 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:29,509 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:29,511 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:29,511 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:29,511 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:40:29,513 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:29,514 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4012|]. (= |#memory_int| (store |v_#memory_int_4012| ULTIMATE.start_main_p1 0)) [2019-05-15 10:40:29,514 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:40:29,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 16 treesize of output 11 [2019-05-15 10:40:29,527 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:29,529 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:29,530 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:29,530 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:29,539 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:29,539 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4013|]. (let ((.cse0 (select |v_#memory_int_4013| ULTIMATE.start_main_p1))) (and (= 0 .cse0) (= |#memory_int| (store |v_#memory_int_4013| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:29,539 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:40:29,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:29,550 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:29,551 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:29,552 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:29,552 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:29,559 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:29,560 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4014|]. (let ((.cse0 (select |v_#memory_int_4014| ULTIMATE.start_main_p1))) (and (= 1 .cse0) (= (store |v_#memory_int_4014| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:29,560 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:40:29,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 16 treesize of output 11 [2019-05-15 10:40:29,570 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:29,572 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:29,572 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:29,572 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:29,580 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:29,580 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4015|]. (let ((.cse0 (select |v_#memory_int_4015| ULTIMATE.start_main_p1))) (and (= 2 .cse0) (= |#memory_int| (store |v_#memory_int_4015| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:29,580 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:40:29,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 16 treesize of output 11 [2019-05-15 10:40:29,596 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:29,598 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:29,598 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:29,598 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:29,606 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:29,606 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4016|]. (let ((.cse0 (select |v_#memory_int_4016| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4016| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 3))) [2019-05-15 10:40:29,606 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:40:29,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 16 treesize of output 11 [2019-05-15 10:40:29,619 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:29,621 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:29,622 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:29,622 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:29,629 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:29,629 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4017|]. (let ((.cse0 (select |v_#memory_int_4017| ULTIMATE.start_main_p1))) (and (= 4 .cse0) (= (store |v_#memory_int_4017| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:29,629 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:40:29,642 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:29,643 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:29,645 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:29,645 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:29,645 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:29,653 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:29,653 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4018|]. (let ((.cse0 (select |v_#memory_int_4018| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4018| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 5 .cse0))) [2019-05-15 10:40:29,653 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:40:29,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:29,668 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:29,670 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:29,670 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:29,670 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:29,679 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:29,679 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4019|]. (let ((.cse0 (select |v_#memory_int_4019| ULTIMATE.start_main_p1))) (and (= .cse0 6) (= (store |v_#memory_int_4019| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:29,679 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:40:29,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 16 treesize of output 11 [2019-05-15 10:40:29,694 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:29,696 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 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 1 xjuncts. [2019-05-15 10:40:29,697 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:29,704 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:29,704 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4020|]. (let ((.cse0 (select |v_#memory_int_4020| ULTIMATE.start_main_p1))) (and (= .cse0 7) (= |#memory_int| (store |v_#memory_int_4020| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:29,704 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:40:29,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:29,721 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:29,723 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:29,723 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:29,723 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:29,730 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:29,730 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4021|]. (let ((.cse0 (select |v_#memory_int_4021| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4021| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 8 .cse0))) [2019-05-15 10:40:29,730 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:40:29,746 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:29,747 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:29,749 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:29,749 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:29,749 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:29,757 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:29,757 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4022|]. (let ((.cse0 (select |v_#memory_int_4022| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4022| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 9))) [2019-05-15 10:40:29,757 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:40:29,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:29,774 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:29,776 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:29,776 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:29,776 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:29,783 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:29,784 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4023|]. (let ((.cse0 (select |v_#memory_int_4023| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4023| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 10 .cse0))) [2019-05-15 10:40:29,784 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:40:29,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:29,802 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:29,804 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:29,804 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:29,804 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:29,811 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:29,811 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4024|]. (let ((.cse0 (select |v_#memory_int_4024| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4024| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 11))) [2019-05-15 10:40:29,812 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:40:29,830 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:29,830 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:29,832 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:29,833 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:29,833 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:29,844 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:29,844 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4025|]. (let ((.cse0 (select |v_#memory_int_4025| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4025| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 12 .cse0))) [2019-05-15 10:40:29,844 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:40:29,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:29,863 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:29,865 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:29,865 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:29,865 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:29,872 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:29,873 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4026|]. (let ((.cse0 (select |v_#memory_int_4026| ULTIMATE.start_main_p1))) (and (= 13 .cse0) (= |#memory_int| (store |v_#memory_int_4026| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:29,873 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:40:29,893 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:29,894 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:29,896 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:29,896 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:29,896 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:29,903 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:29,904 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4027|]. (let ((.cse0 (select |v_#memory_int_4027| ULTIMATE.start_main_p1))) (and (= .cse0 14) (= (store |v_#memory_int_4027| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:29,904 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:40:29,924 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:29,924 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:29,926 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:29,927 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:29,927 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:29,935 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:29,936 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4028|]. (let ((.cse0 (select |v_#memory_int_4028| ULTIMATE.start_main_p1))) (and (= .cse0 15) (= (store |v_#memory_int_4028| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:29,936 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:40:29,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:29,959 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:29,961 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:29,962 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:29,962 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:29,969 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:29,969 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4029|]. (let ((.cse0 (select |v_#memory_int_4029| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4029| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 16))) [2019-05-15 10:40:29,969 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:40:29,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:29,992 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:29,994 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:29,994 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:29,995 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:30,002 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:30,002 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4030|]. (let ((.cse0 (select |v_#memory_int_4030| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4030| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 17))) [2019-05-15 10:40:30,002 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:40:30,024 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:30,025 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,027 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:30,027 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,028 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:30,034 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:30,035 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4031|]. (let ((.cse0 (select |v_#memory_int_4031| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4031| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 18 .cse0))) [2019-05-15 10:40:30,035 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:40:30,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:30,059 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,061 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40: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:40:30,062 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:30,069 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:30,069 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4032|]. (let ((.cse0 (select |v_#memory_int_4032| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4032| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 19))) [2019-05-15 10:40:30,069 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:40:30,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 16 treesize of output 11 [2019-05-15 10:40:30,096 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,098 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:30,098 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,099 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:30,106 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:30,106 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4033|]. (let ((.cse0 (select |v_#memory_int_4033| ULTIMATE.start_main_p1))) (and (= .cse0 20) (= (store |v_#memory_int_4033| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:30,106 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:40:30,131 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:30,132 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,134 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:30,134 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,134 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:30,141 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:30,141 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4034|]. (let ((.cse0 (select |v_#memory_int_4034| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4034| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 21))) [2019-05-15 10:40:30,141 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:40:30,168 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:30,169 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,171 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:30,172 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,172 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:30,179 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:30,179 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4035|]. (let ((.cse0 (select |v_#memory_int_4035| ULTIMATE.start_main_p1))) (and (= .cse0 22) (= (store |v_#memory_int_4035| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:30,179 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:40:30,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:30,207 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,209 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:30,209 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,209 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:30,217 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:30,217 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4036|]. (let ((.cse0 (select |v_#memory_int_4036| ULTIMATE.start_main_p1))) (and (= .cse0 23) (= (store |v_#memory_int_4036| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:30,217 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:40:30,246 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:30,247 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,249 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:30,249 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,249 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:30,257 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:30,258 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4037|]. (let ((.cse0 (select |v_#memory_int_4037| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4037| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 24))) [2019-05-15 10:40:30,258 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:40:30,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:30,286 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,288 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:30,288 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,289 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:30,296 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:30,297 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4038|]. (let ((.cse0 (select |v_#memory_int_4038| ULTIMATE.start_main_p1))) (and (= 25 .cse0) (= |#memory_int| (store |v_#memory_int_4038| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:30,297 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:40:30,332 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:30,333 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,335 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:30,335 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,335 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:30,343 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:30,343 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4039|]. (let ((.cse0 (select |v_#memory_int_4039| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4039| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 26))) [2019-05-15 10:40:30,343 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:40:30,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 16 treesize of output 11 [2019-05-15 10:40:30,374 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,376 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:30,376 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,376 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:30,384 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:30,384 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4040|]. (let ((.cse0 (select |v_#memory_int_4040| ULTIMATE.start_main_p1))) (and (= .cse0 27) (= (store |v_#memory_int_4040| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:30,384 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:40:30,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 16 treesize of output 11 [2019-05-15 10:40:30,415 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,417 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:30,417 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,417 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:30,425 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:30,425 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4041|]. (let ((.cse0 (select |v_#memory_int_4041| ULTIMATE.start_main_p1))) (and (= .cse0 28) (= (store |v_#memory_int_4041| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:30,425 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:40:30,456 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:30,457 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,459 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:30,459 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,459 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:30,467 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:30,467 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4042|]. (let ((.cse0 (select |v_#memory_int_4042| ULTIMATE.start_main_p1))) (and (= 29 .cse0) (= (store |v_#memory_int_4042| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:30,467 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:40:30,499 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:30,500 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,502 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:30,502 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,502 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:30,510 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:30,510 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4043|]. (let ((.cse0 (select |v_#memory_int_4043| ULTIMATE.start_main_p1))) (and (= .cse0 30) (= |#memory_int| (store |v_#memory_int_4043| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:30,510 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:40:30,544 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:30,545 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,547 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:30,547 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,547 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:30,555 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:30,555 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4044|]. (let ((.cse0 (select |v_#memory_int_4044| ULTIMATE.start_main_p1))) (and (= .cse0 31) (= (store |v_#memory_int_4044| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:30,555 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:40:30,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:30,591 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,593 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:30,593 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,594 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:30,600 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:30,600 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4045|]. (let ((.cse0 (select |v_#memory_int_4045| ULTIMATE.start_main_p1))) (and (= .cse0 32) (= (store |v_#memory_int_4045| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:30,600 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:40:30,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 16 treesize of output 11 [2019-05-15 10:40:30,635 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,637 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:30,637 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,638 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:30,645 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:30,646 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4046|]. (let ((.cse0 (select |v_#memory_int_4046| ULTIMATE.start_main_p1))) (and (= 33 .cse0) (= (store |v_#memory_int_4046| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:30,646 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:40:30,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 16 treesize of output 11 [2019-05-15 10:40:30,684 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,686 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:30,686 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,686 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:30,694 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:30,694 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4047|]. (let ((.cse0 (select |v_#memory_int_4047| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4047| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 34 .cse0))) [2019-05-15 10:40:30,695 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:40:30,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 16 treesize of output 11 [2019-05-15 10:40:30,732 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,734 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:30,734 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,734 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:30,742 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:30,742 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4048|]. (let ((.cse0 (select |v_#memory_int_4048| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4048| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 35))) [2019-05-15 10:40:30,743 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:40:30,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 16 treesize of output 11 [2019-05-15 10:40:30,779 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,781 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:30,782 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,786 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:30,792 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:30,792 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4049|]. (let ((.cse0 (select |v_#memory_int_4049| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4049| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 36))) [2019-05-15 10:40:30,792 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:40:30,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:30,830 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,832 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:30,832 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,832 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:30,839 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:30,840 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4050|]. (let ((.cse0 (select |v_#memory_int_4050| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4050| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 37 .cse0))) [2019-05-15 10:40:30,840 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:40:30,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:30,876 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,878 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:30,879 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,879 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:30,886 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:30,886 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4051|]. (let ((.cse0 (select |v_#memory_int_4051| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4051| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 38))) [2019-05-15 10:40:30,887 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:40:30,929 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:30,930 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,932 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:30,932 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,932 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:30,940 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:30,941 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4052|]. (let ((.cse0 (select |v_#memory_int_4052| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4052| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 39 .cse0))) [2019-05-15 10:40:30,941 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:40:30,980 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:30,981 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,983 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:30,983 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:30,984 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:30,991 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:30,991 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4053|]. (let ((.cse0 (select |v_#memory_int_4053| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4053| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 40))) [2019-05-15 10:40:30,991 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:40:31,033 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:31,034 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:31,036 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:31,036 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:31,037 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:31,044 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:31,044 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4054|]. (let ((.cse0 (select |v_#memory_int_4054| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4054| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 41 .cse0))) [2019-05-15 10:40:31,044 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:40:31,088 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:31,089 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:31,091 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:31,091 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:31,091 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:31,099 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:31,099 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4055|]. (let ((.cse0 (select |v_#memory_int_4055| ULTIMATE.start_main_p1))) (and (= 42 .cse0) (= (store |v_#memory_int_4055| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:31,099 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:40:31,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 16 treesize of output 11 [2019-05-15 10:40:31,144 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:31,146 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:31,146 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:31,146 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:31,154 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:31,154 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4056|]. (let ((.cse0 (select |v_#memory_int_4056| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4056| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 43))) [2019-05-15 10:40:31,154 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:40: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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:31,196 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:31,198 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:31,198 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:31,198 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:31,206 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:31,206 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4057|]. (let ((.cse0 (select |v_#memory_int_4057| ULTIMATE.start_main_p1))) (and (= .cse0 44) (= (store |v_#memory_int_4057| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:31,206 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:40:31,247 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:31,248 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:31,250 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:31,250 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:31,250 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:31,257 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:31,258 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4058|]. (let ((.cse0 (select |v_#memory_int_4058| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4058| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 45 .cse0))) [2019-05-15 10:40:31,258 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:40:31,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:31,307 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:31,309 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:31,310 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:31,310 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:31,318 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:31,319 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4059|]. (let ((.cse0 (select |v_#memory_int_4059| ULTIMATE.start_main_p1))) (and (= 46 .cse0) (= (store |v_#memory_int_4059| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:31,319 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:40:31,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:31,364 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:31,366 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:31,366 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:31,366 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:31,374 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:31,374 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4060|]. (let ((.cse0 (select |v_#memory_int_4060| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4060| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 47))) [2019-05-15 10:40:31,374 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:40:31,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 16 treesize of output 11 [2019-05-15 10:40:31,421 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:31,423 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:31,423 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:31,423 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:31,430 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:31,431 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4061|]. (let ((.cse0 (select |v_#memory_int_4061| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4061| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 48 .cse0))) [2019-05-15 10:40:31,431 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:40:31,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:31,478 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:31,480 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:31,480 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:31,480 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:31,488 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:31,488 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4062|]. (let ((.cse0 (select |v_#memory_int_4062| ULTIMATE.start_main_p1))) (and (= 49 .cse0) (= |#memory_int| (store |v_#memory_int_4062| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:31,488 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:40:31,534 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:31,535 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:31,537 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:31,537 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:31,537 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:31,545 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:31,545 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4063|]. (let ((.cse0 (select |v_#memory_int_4063| ULTIMATE.start_main_p1))) (and (= .cse0 50) (= (store |v_#memory_int_4063| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:31,545 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:40:31,594 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:31,595 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:31,597 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:31,597 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:31,597 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:31,603 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:31,604 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4064|]. (let ((.cse0 (select |v_#memory_int_4064| ULTIMATE.start_main_p1))) (and (= .cse0 51) (= (store |v_#memory_int_4064| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:31,604 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:40:31,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:31,654 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:31,656 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:31,656 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:31,657 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:31,664 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:31,664 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4065|]. (let ((.cse0 (select |v_#memory_int_4065| ULTIMATE.start_main_p1))) (and (= .cse0 52) (= (store |v_#memory_int_4065| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:31,665 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:40:31,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:31,713 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:31,715 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:31,715 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:31,715 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:31,724 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:31,724 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4066|]. (let ((.cse0 (select |v_#memory_int_4066| ULTIMATE.start_main_p1))) (and (= .cse0 53) (= (store |v_#memory_int_4066| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:31,724 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:40:31,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 16 treesize of output 11 [2019-05-15 10:40:31,776 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:31,778 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:31,778 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:31,778 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:31,786 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:31,786 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4067|]. (let ((.cse0 (select |v_#memory_int_4067| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4067| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 54))) [2019-05-15 10:40:31,786 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:40:31,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 16 treesize of output 11 [2019-05-15 10:40:31,843 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:31,845 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:31,845 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:31,845 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:31,854 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:31,854 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4068|]. (let ((.cse0 (select |v_#memory_int_4068| ULTIMATE.start_main_p1))) (and (= .cse0 55) (= (store |v_#memory_int_4068| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:31,854 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:40:31,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:31,906 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:31,908 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:31,908 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:31,908 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:31,916 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:31,916 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4069|]. (let ((.cse0 (select |v_#memory_int_4069| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4069| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 56 .cse0))) [2019-05-15 10:40:31,916 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:40:31,969 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:31,970 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:31,972 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:31,972 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:31,973 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:31,979 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:31,979 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4070|]. (let ((.cse0 (select |v_#memory_int_4070| ULTIMATE.start_main_p1))) (and (= 57 .cse0) (= (store |v_#memory_int_4070| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:31,980 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:40:32,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:32,032 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:32,034 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:32,034 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:32,035 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:32,042 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:32,042 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4071|]. (let ((.cse0 (select |v_#memory_int_4071| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4071| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 58))) [2019-05-15 10:40:32,043 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:40:32,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:32,100 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:32,102 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:32,102 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:32,102 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:32,110 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:32,110 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4072|]. (let ((.cse0 (select |v_#memory_int_4072| ULTIMATE.start_main_p1))) (and (= .cse0 59) (= (store |v_#memory_int_4072| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:32,110 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:40:32,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 16 treesize of output 11 [2019-05-15 10:40:32,166 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:32,168 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:32,168 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:32,168 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:32,175 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:32,176 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4073|]. (let ((.cse0 (select |v_#memory_int_4073| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4073| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 60 .cse0))) [2019-05-15 10:40:32,176 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:40:32,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:32,233 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:32,235 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:32,236 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:32,236 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:32,243 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:32,243 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4074|]. (let ((.cse0 (select |v_#memory_int_4074| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4074| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 61 .cse0))) [2019-05-15 10:40:32,243 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:40:32,300 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:32,301 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:32,303 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:32,303 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:32,304 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:32,311 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:32,312 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4075|]. (let ((.cse0 (select |v_#memory_int_4075| ULTIMATE.start_main_p1))) (and (= .cse0 62) (= (store |v_#memory_int_4075| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:32,312 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:40:32,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 16 treesize of output 11 [2019-05-15 10:40:32,374 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:32,376 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:32,376 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:32,377 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:32,385 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:32,385 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4076|]. (let ((.cse0 (select |v_#memory_int_4076| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4076| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 63))) [2019-05-15 10:40:32,385 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 64) [2019-05-15 10:40:32,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:32,442 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:32,444 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:32,445 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:32,445 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:32,452 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:32,453 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4077|]. (let ((.cse0 (select |v_#memory_int_4077| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4077| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 64))) [2019-05-15 10:40:32,453 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 65) [2019-05-15 10:40: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 16 treesize of output 11 [2019-05-15 10:40:32,510 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:32,512 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:32,512 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:32,513 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:32,520 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:32,520 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4078|]. (let ((.cse0 (select |v_#memory_int_4078| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4078| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 65))) [2019-05-15 10:40:32,520 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 66) [2019-05-15 10:40:32,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:32,580 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:32,582 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:32,583 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:32,583 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:32,590 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:32,591 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4079|]. (let ((.cse0 (select |v_#memory_int_4079| ULTIMATE.start_main_p1))) (and (= .cse0 66) (= (store |v_#memory_int_4079| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:32,591 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 67) [2019-05-15 10:40:32,648 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:32,649 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:32,651 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:32,651 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:32,652 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:32,659 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:32,660 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4080|]. (let ((.cse0 (select |v_#memory_int_4080| ULTIMATE.start_main_p1))) (and (= 67 .cse0) (= (store |v_#memory_int_4080| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:32,660 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 68) [2019-05-15 10:40:32,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:32,721 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:32,723 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:32,724 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:32,724 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:32,731 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:32,732 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4081|]. (let ((.cse0 (select |v_#memory_int_4081| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4081| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 68))) [2019-05-15 10:40:32,732 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 69) [2019-05-15 10:40:32,792 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:32,793 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:32,795 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:32,795 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:32,795 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:32,803 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:32,803 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4082|]. (let ((.cse0 (select |v_#memory_int_4082| ULTIMATE.start_main_p1))) (and (= .cse0 69) (= (store |v_#memory_int_4082| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:32,803 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 70) [2019-05-15 10:40:32,868 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:32,869 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:32,871 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:32,871 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:32,871 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:32,878 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:32,878 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4083|]. (let ((.cse0 (select |v_#memory_int_4083| ULTIMATE.start_main_p1))) (and (= 70 .cse0) (= (store |v_#memory_int_4083| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:32,878 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 71) [2019-05-15 10:40:32,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 16 treesize of output 11 [2019-05-15 10:40:32,946 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:32,948 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:32,948 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:32,948 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:32,956 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:32,956 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4084|]. (let ((.cse0 (select |v_#memory_int_4084| ULTIMATE.start_main_p1))) (and (= 71 .cse0) (= |#memory_int| (store |v_#memory_int_4084| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:32,956 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 72) [2019-05-15 10:40:33,020 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:33,021 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:33,023 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:33,023 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:33,023 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:33,029 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:33,030 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4085|]. (let ((.cse0 (select |v_#memory_int_4085| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4085| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 72 .cse0))) [2019-05-15 10:40:33,030 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 73) [2019-05-15 10:40:33,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 16 treesize of output 11 [2019-05-15 10:40:33,096 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:33,098 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:33,099 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:33,099 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:33,106 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:33,106 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4086|]. (let ((.cse0 (select |v_#memory_int_4086| ULTIMATE.start_main_p1))) (and (= .cse0 73) (= (store |v_#memory_int_4086| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:33,107 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 74) [2019-05-15 10:40:33,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:33,172 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:33,174 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:33,175 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:33,175 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:33,182 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:33,183 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4087|]. (let ((.cse0 (select |v_#memory_int_4087| ULTIMATE.start_main_p1))) (and (= .cse0 74) (= (store |v_#memory_int_4087| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:33,183 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 75) [2019-05-15 10:40:33,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 16 treesize of output 11 [2019-05-15 10:40:33,249 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:33,251 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:33,251 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:33,251 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:33,260 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:33,260 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4088|]. (let ((.cse0 (select |v_#memory_int_4088| ULTIMATE.start_main_p1))) (and (= 75 .cse0) (= |#memory_int| (store |v_#memory_int_4088| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:33,260 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 76) [2019-05-15 10:40:33,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 16 treesize of output 11 [2019-05-15 10:40:33,329 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:33,331 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:33,331 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:33,331 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:33,340 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:33,341 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4089|]. (let ((.cse0 (select |v_#memory_int_4089| ULTIMATE.start_main_p1))) (and (= .cse0 76) (= (store |v_#memory_int_4089| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:33,341 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 77) [2019-05-15 10:40:33,407 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:33,414 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:33,415 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:33,415 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:33,415 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:33,422 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:33,422 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4090|]. (let ((.cse0 (select |v_#memory_int_4090| ULTIMATE.start_main_p1))) (and (= .cse0 77) (= (store |v_#memory_int_4090| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:33,422 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 78) [2019-05-15 10:40:33,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:33,490 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:33,492 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:33,492 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:33,493 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:33,500 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:33,500 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4091|]. (let ((.cse0 (select |v_#memory_int_4091| ULTIMATE.start_main_p1))) (and (= .cse0 78) (= (store |v_#memory_int_4091| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:33,501 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 79) [2019-05-15 10:40:33,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:33,578 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:33,580 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:33,580 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:33,580 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:33,588 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:33,588 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4092|]. (let ((.cse0 (select |v_#memory_int_4092| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4092| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 79 .cse0))) [2019-05-15 10:40:33,588 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 80) [2019-05-15 10:40:33,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:33,658 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:33,660 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:33,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:33,660 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:33,667 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:33,668 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4093|]. (let ((.cse0 (select |v_#memory_int_4093| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4093| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 80 .cse0))) [2019-05-15 10:40:33,668 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 81) [2019-05-15 10:40:33,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 16 treesize of output 11 [2019-05-15 10:40:33,737 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:33,739 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:33,740 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:33,740 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:33,747 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:33,747 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4094|]. (let ((.cse0 (select |v_#memory_int_4094| ULTIMATE.start_main_p1))) (and (= .cse0 81) (= (store |v_#memory_int_4094| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:33,748 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 82) [2019-05-15 10:40:33,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:33,827 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:33,830 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:33,830 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:33,830 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:33,837 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:33,838 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4095|]. (let ((.cse0 (select |v_#memory_int_4095| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4095| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 82))) [2019-05-15 10:40:33,838 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 83) [2019-05-15 10:40:33,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 16 treesize of output 11 [2019-05-15 10:40:33,921 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:33,923 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:33,923 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:33,923 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:33,930 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:33,931 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4096|]. (let ((.cse0 (select |v_#memory_int_4096| ULTIMATE.start_main_p1))) (and (= 83 .cse0) (= (store |v_#memory_int_4096| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:33,931 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 84) [2019-05-15 10:40:33,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:34,000 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:34,002 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:34,003 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:34,003 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:34,011 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:34,011 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4097|]. (let ((.cse0 (select |v_#memory_int_4097| ULTIMATE.start_main_p1))) (and (= 84 .cse0) (= |#memory_int| (store |v_#memory_int_4097| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:34,011 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 85) [2019-05-15 10:40:34,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:34,086 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:34,088 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:34,088 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:34,088 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:34,095 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:34,095 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4098|]. (let ((.cse0 (select |v_#memory_int_4098| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4098| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 85 .cse0))) [2019-05-15 10:40:34,095 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 86) [2019-05-15 10:40:34,169 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:34,169 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:34,172 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:34,172 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:34,172 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:34,180 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:34,180 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4099|]. (let ((.cse0 (select |v_#memory_int_4099| ULTIMATE.start_main_p1))) (and (= 86 .cse0) (= (store |v_#memory_int_4099| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:34,180 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 87) [2019-05-15 10:40:34,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 16 treesize of output 11 [2019-05-15 10:40:34,263 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:34,265 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:34,265 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:34,265 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:34,272 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:34,272 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4100|]. (let ((.cse0 (select |v_#memory_int_4100| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4100| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 87))) [2019-05-15 10:40:34,272 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 88) [2019-05-15 10:40:34,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:34,348 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:34,350 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:34,350 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:34,350 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:34,358 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:34,358 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4101|]. (let ((.cse0 (select |v_#memory_int_4101| ULTIMATE.start_main_p1))) (and (= .cse0 88) (= (store |v_#memory_int_4101| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:34,358 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 89) [2019-05-15 10:40:34,427 INFO L273 TraceCheckUtils]: 0: Hoare triple {34724#true} havoc main_p1; {34724#true} is VALID [2019-05-15 10:40:34,428 INFO L273 TraceCheckUtils]: 1: Hoare triple {34724#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {34724#true} is VALID [2019-05-15 10:40:34,428 INFO L273 TraceCheckUtils]: 2: Hoare triple {34724#true} #memory_int := #memory_int[main_p1 := 0]; {34735#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:40:34,429 INFO L273 TraceCheckUtils]: 3: Hoare triple {34735#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34739#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:40:34,430 INFO L273 TraceCheckUtils]: 4: Hoare triple {34739#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34743#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:40:34,430 INFO L273 TraceCheckUtils]: 5: Hoare triple {34743#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34747#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:40:34,430 INFO L273 TraceCheckUtils]: 6: Hoare triple {34747#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34751#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:40:34,431 INFO L273 TraceCheckUtils]: 7: Hoare triple {34751#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34755#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:40:34,431 INFO L273 TraceCheckUtils]: 8: Hoare triple {34755#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34759#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:40:34,432 INFO L273 TraceCheckUtils]: 9: Hoare triple {34759#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34763#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:40:34,433 INFO L273 TraceCheckUtils]: 10: Hoare triple {34763#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34767#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:40:34,433 INFO L273 TraceCheckUtils]: 11: Hoare triple {34767#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34771#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:40:34,434 INFO L273 TraceCheckUtils]: 12: Hoare triple {34771#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34775#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:40:34,435 INFO L273 TraceCheckUtils]: 13: Hoare triple {34775#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34779#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:40:34,436 INFO L273 TraceCheckUtils]: 14: Hoare triple {34779#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34783#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:40:34,436 INFO L273 TraceCheckUtils]: 15: Hoare triple {34783#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34787#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:40:34,437 INFO L273 TraceCheckUtils]: 16: Hoare triple {34787#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34791#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:40:34,438 INFO L273 TraceCheckUtils]: 17: Hoare triple {34791#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34795#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:40:34,439 INFO L273 TraceCheckUtils]: 18: Hoare triple {34795#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34799#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:40:34,439 INFO L273 TraceCheckUtils]: 19: Hoare triple {34799#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34803#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:40:34,440 INFO L273 TraceCheckUtils]: 20: Hoare triple {34803#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34807#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:40:34,441 INFO L273 TraceCheckUtils]: 21: Hoare triple {34807#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34811#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:40:34,441 INFO L273 TraceCheckUtils]: 22: Hoare triple {34811#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34815#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:40:34,442 INFO L273 TraceCheckUtils]: 23: Hoare triple {34815#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34819#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:40:34,443 INFO L273 TraceCheckUtils]: 24: Hoare triple {34819#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34823#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:40:34,444 INFO L273 TraceCheckUtils]: 25: Hoare triple {34823#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34827#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:40:34,444 INFO L273 TraceCheckUtils]: 26: Hoare triple {34827#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34831#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:40:34,445 INFO L273 TraceCheckUtils]: 27: Hoare triple {34831#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34835#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:40:34,446 INFO L273 TraceCheckUtils]: 28: Hoare triple {34835#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34839#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:40:34,447 INFO L273 TraceCheckUtils]: 29: Hoare triple {34839#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34843#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:40:34,447 INFO L273 TraceCheckUtils]: 30: Hoare triple {34843#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34847#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:40:34,448 INFO L273 TraceCheckUtils]: 31: Hoare triple {34847#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34851#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:40:34,449 INFO L273 TraceCheckUtils]: 32: Hoare triple {34851#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34855#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:40:34,450 INFO L273 TraceCheckUtils]: 33: Hoare triple {34855#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34859#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:40:34,450 INFO L273 TraceCheckUtils]: 34: Hoare triple {34859#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34863#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:40:34,451 INFO L273 TraceCheckUtils]: 35: Hoare triple {34863#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34867#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:40:34,452 INFO L273 TraceCheckUtils]: 36: Hoare triple {34867#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34871#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:40:34,453 INFO L273 TraceCheckUtils]: 37: Hoare triple {34871#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34875#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:40:34,453 INFO L273 TraceCheckUtils]: 38: Hoare triple {34875#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34879#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:40:34,454 INFO L273 TraceCheckUtils]: 39: Hoare triple {34879#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34883#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:40:34,455 INFO L273 TraceCheckUtils]: 40: Hoare triple {34883#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34887#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:40:34,456 INFO L273 TraceCheckUtils]: 41: Hoare triple {34887#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34891#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:40:34,456 INFO L273 TraceCheckUtils]: 42: Hoare triple {34891#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34895#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:40:34,457 INFO L273 TraceCheckUtils]: 43: Hoare triple {34895#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34899#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:40:34,458 INFO L273 TraceCheckUtils]: 44: Hoare triple {34899#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34903#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:40:34,459 INFO L273 TraceCheckUtils]: 45: Hoare triple {34903#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34907#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:40:34,459 INFO L273 TraceCheckUtils]: 46: Hoare triple {34907#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34911#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:40:34,460 INFO L273 TraceCheckUtils]: 47: Hoare triple {34911#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34915#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:40:34,461 INFO L273 TraceCheckUtils]: 48: Hoare triple {34915#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34919#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:40:34,461 INFO L273 TraceCheckUtils]: 49: Hoare triple {34919#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34923#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:40:34,462 INFO L273 TraceCheckUtils]: 50: Hoare triple {34923#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34927#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:40:34,463 INFO L273 TraceCheckUtils]: 51: Hoare triple {34927#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34931#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:40:34,464 INFO L273 TraceCheckUtils]: 52: Hoare triple {34931#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34935#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:40:34,464 INFO L273 TraceCheckUtils]: 53: Hoare triple {34935#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34939#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:40:34,465 INFO L273 TraceCheckUtils]: 54: Hoare triple {34939#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34943#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:40:34,466 INFO L273 TraceCheckUtils]: 55: Hoare triple {34943#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34947#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:40:34,467 INFO L273 TraceCheckUtils]: 56: Hoare triple {34947#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34951#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:40:34,467 INFO L273 TraceCheckUtils]: 57: Hoare triple {34951#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34955#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:40:34,468 INFO L273 TraceCheckUtils]: 58: Hoare triple {34955#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34959#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:40:34,469 INFO L273 TraceCheckUtils]: 59: Hoare triple {34959#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34963#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:40:34,470 INFO L273 TraceCheckUtils]: 60: Hoare triple {34963#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34967#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:40:34,470 INFO L273 TraceCheckUtils]: 61: Hoare triple {34967#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34971#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:40:34,471 INFO L273 TraceCheckUtils]: 62: Hoare triple {34971#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34975#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:40:34,472 INFO L273 TraceCheckUtils]: 63: Hoare triple {34975#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34979#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:40:34,473 INFO L273 TraceCheckUtils]: 64: Hoare triple {34979#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34983#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:40:34,473 INFO L273 TraceCheckUtils]: 65: Hoare triple {34983#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34987#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:40:34,474 INFO L273 TraceCheckUtils]: 66: Hoare triple {34987#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34991#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} is VALID [2019-05-15 10:40:34,475 INFO L273 TraceCheckUtils]: 67: Hoare triple {34991#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34995#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} is VALID [2019-05-15 10:40:34,476 INFO L273 TraceCheckUtils]: 68: Hoare triple {34995#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34999#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} is VALID [2019-05-15 10:40:34,476 INFO L273 TraceCheckUtils]: 69: Hoare triple {34999#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35003#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} is VALID [2019-05-15 10:40:34,477 INFO L273 TraceCheckUtils]: 70: Hoare triple {35003#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35007#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} is VALID [2019-05-15 10:40:34,478 INFO L273 TraceCheckUtils]: 71: Hoare triple {35007#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35011#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} is VALID [2019-05-15 10:40:34,479 INFO L273 TraceCheckUtils]: 72: Hoare triple {35011#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35015#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} is VALID [2019-05-15 10:40:34,479 INFO L273 TraceCheckUtils]: 73: Hoare triple {35015#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35019#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} is VALID [2019-05-15 10:40:34,480 INFO L273 TraceCheckUtils]: 74: Hoare triple {35019#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35023#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} is VALID [2019-05-15 10:40:34,481 INFO L273 TraceCheckUtils]: 75: Hoare triple {35023#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35027#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} is VALID [2019-05-15 10:40:34,482 INFO L273 TraceCheckUtils]: 76: Hoare triple {35027#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35031#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} is VALID [2019-05-15 10:40:34,482 INFO L273 TraceCheckUtils]: 77: Hoare triple {35031#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35035#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} is VALID [2019-05-15 10:40:34,483 INFO L273 TraceCheckUtils]: 78: Hoare triple {35035#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35039#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} is VALID [2019-05-15 10:40:34,484 INFO L273 TraceCheckUtils]: 79: Hoare triple {35039#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35043#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} is VALID [2019-05-15 10:40:34,484 INFO L273 TraceCheckUtils]: 80: Hoare triple {35043#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35047#(= (select |#memory_int| ULTIMATE.start_main_p1) 78)} is VALID [2019-05-15 10:40:34,485 INFO L273 TraceCheckUtils]: 81: Hoare triple {35047#(= (select |#memory_int| ULTIMATE.start_main_p1) 78)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35051#(= (select |#memory_int| ULTIMATE.start_main_p1) 79)} is VALID [2019-05-15 10:40:34,486 INFO L273 TraceCheckUtils]: 82: Hoare triple {35051#(= (select |#memory_int| ULTIMATE.start_main_p1) 79)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35055#(= (select |#memory_int| ULTIMATE.start_main_p1) 80)} is VALID [2019-05-15 10:40:34,487 INFO L273 TraceCheckUtils]: 83: Hoare triple {35055#(= (select |#memory_int| ULTIMATE.start_main_p1) 80)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35059#(= (select |#memory_int| ULTIMATE.start_main_p1) 81)} is VALID [2019-05-15 10:40:34,487 INFO L273 TraceCheckUtils]: 84: Hoare triple {35059#(= (select |#memory_int| ULTIMATE.start_main_p1) 81)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35063#(= (select |#memory_int| ULTIMATE.start_main_p1) 82)} is VALID [2019-05-15 10:40:34,488 INFO L273 TraceCheckUtils]: 85: Hoare triple {35063#(= (select |#memory_int| ULTIMATE.start_main_p1) 82)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35067#(= (select |#memory_int| ULTIMATE.start_main_p1) 83)} is VALID [2019-05-15 10:40:34,489 INFO L273 TraceCheckUtils]: 86: Hoare triple {35067#(= (select |#memory_int| ULTIMATE.start_main_p1) 83)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35071#(= (select |#memory_int| ULTIMATE.start_main_p1) 84)} is VALID [2019-05-15 10:40:34,490 INFO L273 TraceCheckUtils]: 87: Hoare triple {35071#(= (select |#memory_int| ULTIMATE.start_main_p1) 84)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35075#(= (select |#memory_int| ULTIMATE.start_main_p1) 85)} is VALID [2019-05-15 10:40:34,490 INFO L273 TraceCheckUtils]: 88: Hoare triple {35075#(= (select |#memory_int| ULTIMATE.start_main_p1) 85)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35079#(= (select |#memory_int| ULTIMATE.start_main_p1) 86)} is VALID [2019-05-15 10:40:34,491 INFO L273 TraceCheckUtils]: 89: Hoare triple {35079#(= (select |#memory_int| ULTIMATE.start_main_p1) 86)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35083#(= (select |#memory_int| ULTIMATE.start_main_p1) 87)} is VALID [2019-05-15 10:40:34,492 INFO L273 TraceCheckUtils]: 90: Hoare triple {35083#(= (select |#memory_int| ULTIMATE.start_main_p1) 87)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35087#(= (select |#memory_int| ULTIMATE.start_main_p1) 88)} is VALID [2019-05-15 10:40:34,493 INFO L273 TraceCheckUtils]: 91: Hoare triple {35087#(= (select |#memory_int| ULTIMATE.start_main_p1) 88)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35091#(= (select |#memory_int| ULTIMATE.start_main_p1) 89)} is VALID [2019-05-15 10:40:34,493 INFO L273 TraceCheckUtils]: 92: Hoare triple {35091#(= (select |#memory_int| ULTIMATE.start_main_p1) 89)} assume !(#memory_int[main_p1] >= 0); {34725#false} is VALID [2019-05-15 10:40:34,504 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:40:34,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:40:34,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-05-15 10:40:34,505 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 93 [2019-05-15 10:40:34,505 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:40:34,505 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 92 states. [2019-05-15 10:40:34,577 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:40:34,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-05-15 10:40:34,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-05-15 10:40:34,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2019-05-15 10:40:34,579 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 92 states. [2019-05-15 10:40:51,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:40:51,052 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-05-15 10:40:51,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-05-15 10:40:51,052 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 93 [2019-05-15 10:40:51,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:40:51,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-05-15 10:40:51,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2019-05-15 10:40:51,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-05-15 10:40:51,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2019-05-15 10:40:51,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 92 states and 96 transitions. [2019-05-15 10:40:51,129 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:51,131 INFO L225 Difference]: With dead ends: 95 [2019-05-15 10:40:51,131 INFO L226 Difference]: Without dead ends: 95 [2019-05-15 10:40:51,131 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2019-05-15 10:40:51,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-05-15 10:40:51,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-05-15 10:40:51,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:40:51,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 95 states. [2019-05-15 10:40:51,134 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 95 states. [2019-05-15 10:40:51,134 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 95 states. [2019-05-15 10:40:51,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:40:51,135 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-05-15 10:40:51,135 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-05-15 10:40:51,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:40:51,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:40:51,135 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 95 states. [2019-05-15 10:40:51,135 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 95 states. [2019-05-15 10:40:51,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:40:51,136 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-05-15 10:40:51,136 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-05-15 10:40:51,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:40:51,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:40:51,137 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:40:51,137 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:40:51,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-05-15 10:40:51,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-05-15 10:40:51,138 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2019-05-15 10:40:51,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:40:51,138 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-05-15 10:40:51,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-05-15 10:40:51,138 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-05-15 10:40:51,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-05-15 10:40:51,138 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:40:51,138 INFO L399 BasicCegarLoop]: trace histogram [90, 1, 1, 1, 1] [2019-05-15 10:40:51,138 INFO L418 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:40:51,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:40:51,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1061581256, now seen corresponding path program 90 times [2019-05-15 10:40:51,139 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:40:51,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:40:51,176 WARN L254 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 92 conjunts are in the unsatisfiable core [2019-05-15 10:40:51,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:40:51,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:40:51,202 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:51,202 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:51,204 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:51,204 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:51,204 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:40:51,206 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:51,207 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4102|]. (= (store |v_#memory_int_4102| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:40:51,207 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:40:51,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 16 treesize of output 11 [2019-05-15 10:40:51,217 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:51,219 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:51,219 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:51,219 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:51,227 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:51,227 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4103|]. (let ((.cse0 (select |v_#memory_int_4103| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4103| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 0))) [2019-05-15 10:40:51,227 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:40:51,237 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:51,238 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:51,240 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:51,240 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:51,240 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:51,248 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:51,248 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4104|]. (let ((.cse0 (select |v_#memory_int_4104| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4104| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 1 .cse0))) [2019-05-15 10:40:51,248 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:40:51,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 16 treesize of output 11 [2019-05-15 10:40:51,261 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:51,263 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:51,263 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:51,263 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:51,271 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:51,271 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4105|]. (let ((.cse0 (select |v_#memory_int_4105| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4105| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 2 .cse0))) [2019-05-15 10:40:51,271 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:40:51,282 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:51,283 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:51,285 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:51,286 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:51,286 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:51,293 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:51,294 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4106|]. (let ((.cse0 (select |v_#memory_int_4106| ULTIMATE.start_main_p1))) (and (= 3 .cse0) (= |#memory_int| (store |v_#memory_int_4106| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:51,294 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:40:51,307 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:51,308 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:51,310 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:51,310 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:51,310 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:51,317 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:51,318 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4107|]. (let ((.cse0 (select |v_#memory_int_4107| ULTIMATE.start_main_p1))) (and (= .cse0 4) (= |#memory_int| (store |v_#memory_int_4107| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:51,318 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:40:51,332 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:51,333 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:51,335 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:51,335 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:51,335 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:51,343 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:51,343 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4108|]. (let ((.cse0 (select |v_#memory_int_4108| ULTIMATE.start_main_p1))) (and (= .cse0 5) (= (store |v_#memory_int_4108| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:51,343 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:40:51,358 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:51,359 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:51,361 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:51,361 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:51,361 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:51,369 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:51,369 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4109|]. (let ((.cse0 (select |v_#memory_int_4109| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4109| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 6))) [2019-05-15 10:40:51,369 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:40:51,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:51,385 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:51,387 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:51,387 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:51,388 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:51,395 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:51,395 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4110|]. (let ((.cse0 (select |v_#memory_int_4110| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4110| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 7))) [2019-05-15 10:40:51,395 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:40:51,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 16 treesize of output 11 [2019-05-15 10:40:51,411 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:51,413 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:51,413 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:51,414 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:51,421 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:51,421 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4111|]. (let ((.cse0 (select |v_#memory_int_4111| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4111| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 8 .cse0))) [2019-05-15 10:40:51,421 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:40:51,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:51,438 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:51,440 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:51,440 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:51,440 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:51,447 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:51,448 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4112|]. (let ((.cse0 (select |v_#memory_int_4112| ULTIMATE.start_main_p1))) (and (= .cse0 9) (= (store |v_#memory_int_4112| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:51,448 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:40:51,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:51,464 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:51,466 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:51,466 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:51,466 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:51,474 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:51,474 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4113|]. (let ((.cse0 (select |v_#memory_int_4113| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4113| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 10 .cse0))) [2019-05-15 10:40:51,474 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:40:51,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 16 treesize of output 11 [2019-05-15 10:40:51,495 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:51,497 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:51,497 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:51,497 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:51,503 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:51,503 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4114|]. (let ((.cse0 (select |v_#memory_int_4114| ULTIMATE.start_main_p1))) (and (= 11 .cse0) (= (store |v_#memory_int_4114| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:51,503 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:40:51,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 16 treesize of output 11 [2019-05-15 10:40:51,524 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:51,526 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:51,526 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:51,526 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:51,534 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:51,534 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4115|]. (let ((.cse0 (select |v_#memory_int_4115| ULTIMATE.start_main_p1))) (and (= 12 .cse0) (= (store |v_#memory_int_4115| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:51,534 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:40:51,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 16 treesize of output 11 [2019-05-15 10:40:51,553 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:51,555 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:51,555 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:51,555 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:51,563 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:51,563 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4116|]. (let ((.cse0 (select |v_#memory_int_4116| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4116| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 13))) [2019-05-15 10:40:51,563 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:40:51,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 16 treesize of output 11 [2019-05-15 10:40:51,583 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:51,586 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:51,586 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:51,586 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:51,593 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:51,593 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4117|]. (let ((.cse0 (select |v_#memory_int_4117| ULTIMATE.start_main_p1))) (and (= 14 .cse0) (= (store |v_#memory_int_4117| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:51,594 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:40:51,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 16 treesize of output 11 [2019-05-15 10:40:51,614 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:51,616 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:51,616 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:51,616 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:51,624 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:51,624 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4118|]. (let ((.cse0 (select |v_#memory_int_4118| ULTIMATE.start_main_p1))) (and (= .cse0 15) (= (store |v_#memory_int_4118| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:51,624 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:40:51,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:51,646 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:51,648 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:51,648 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:51,648 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:51,656 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:51,656 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4119|]. (let ((.cse0 (select |v_#memory_int_4119| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4119| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 16))) [2019-05-15 10:40:51,656 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:40:51,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 16 treesize of output 11 [2019-05-15 10:40:51,684 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:51,686 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:51,686 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:51,686 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:51,694 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:51,694 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4120|]. (let ((.cse0 (select |v_#memory_int_4120| ULTIMATE.start_main_p1))) (and (= 17 .cse0) (= (store |v_#memory_int_4120| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:51,694 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:40:51,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 16 treesize of output 11 [2019-05-15 10:40:51,719 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:51,721 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:51,721 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:51,721 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:51,728 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:51,729 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4121|]. (let ((.cse0 (select |v_#memory_int_4121| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4121| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 18))) [2019-05-15 10:40:51,729 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:40:51,750 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:51,751 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:51,753 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:51,753 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:51,753 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:51,761 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:51,761 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4122|]. (let ((.cse0 (select |v_#memory_int_4122| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4122| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 19))) [2019-05-15 10:40:51,761 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:40:51,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 16 treesize of output 11 [2019-05-15 10:40:51,785 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:51,787 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:51,787 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:51,787 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:51,794 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:51,795 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4123|]. (let ((.cse0 (select |v_#memory_int_4123| ULTIMATE.start_main_p1))) (and (= 20 .cse0) (= (store |v_#memory_int_4123| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:51,795 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:40:51,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 16 treesize of output 11 [2019-05-15 10:40:51,821 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:51,824 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:51,824 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:51,824 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:51,831 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:51,831 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4124|]. (let ((.cse0 (select |v_#memory_int_4124| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4124| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 21 .cse0))) [2019-05-15 10:40:51,832 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:40:51,856 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:51,857 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:51,859 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:51,859 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:51,859 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:51,866 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:51,867 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4125|]. (let ((.cse0 (select |v_#memory_int_4125| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4125| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 22 .cse0))) [2019-05-15 10:40:51,867 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:40:51,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 16 treesize of output 11 [2019-05-15 10:40:51,893 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:51,895 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:51,895 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:51,895 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:51,903 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:51,903 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4126|]. (let ((.cse0 (select |v_#memory_int_4126| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4126| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 23))) [2019-05-15 10:40:51,903 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:40:51,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 16 treesize of output 11 [2019-05-15 10:40:51,932 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:51,934 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:51,934 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:51,934 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:51,942 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:51,942 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4127|]. (let ((.cse0 (select |v_#memory_int_4127| ULTIMATE.start_main_p1))) (and (= 24 .cse0) (= |#memory_int| (store |v_#memory_int_4127| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:51,942 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:40:51,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 16 treesize of output 11 [2019-05-15 10:40:51,972 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:51,974 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:51,974 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:51,974 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:51,981 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:51,981 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4128|]. (let ((.cse0 (select |v_#memory_int_4128| ULTIMATE.start_main_p1))) (and (= 25 .cse0) (= |#memory_int| (store |v_#memory_int_4128| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:51,982 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:40:52,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:52,011 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:52,013 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:52,014 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:52,014 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:52,021 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:52,021 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4129|]. (let ((.cse0 (select |v_#memory_int_4129| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4129| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 26))) [2019-05-15 10:40:52,021 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:40:52,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:52,053 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:52,055 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:52,055 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:52,055 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:52,063 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:52,063 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4130|]. (let ((.cse0 (select |v_#memory_int_4130| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4130| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 27))) [2019-05-15 10:40:52,063 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:40:52,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:52,094 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:52,096 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:52,096 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:52,097 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:52,103 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:52,104 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4131|]. (let ((.cse0 (select |v_#memory_int_4131| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4131| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 28))) [2019-05-15 10:40:52,104 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:40:52,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 16 treesize of output 11 [2019-05-15 10:40:52,140 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:52,142 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:52,142 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:52,142 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:52,149 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:52,150 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4132|]. (let ((.cse0 (select |v_#memory_int_4132| ULTIMATE.start_main_p1))) (and (= 29 .cse0) (= (store |v_#memory_int_4132| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:52,150 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:40:52,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 16 treesize of output 11 [2019-05-15 10:40:52,184 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:52,186 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:52,186 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:52,186 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:52,193 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:52,193 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4133|]. (let ((.cse0 (select |v_#memory_int_4133| ULTIMATE.start_main_p1))) (and (= .cse0 30) (= (store |v_#memory_int_4133| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:52,194 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:40:52,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:52,226 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:52,228 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:52,228 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:52,228 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:52,236 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:52,236 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4134|]. (let ((.cse0 (select |v_#memory_int_4134| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4134| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 31 .cse0))) [2019-05-15 10:40:52,236 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:40:52,269 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:52,270 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:52,272 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:52,273 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:52,273 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:52,279 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:52,279 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4135|]. (let ((.cse0 (select |v_#memory_int_4135| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4135| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 32 .cse0))) [2019-05-15 10:40:52,279 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:40:52,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:52,314 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:52,316 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:52,316 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:52,316 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:52,323 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:52,323 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4136|]. (let ((.cse0 (select |v_#memory_int_4136| ULTIMATE.start_main_p1))) (and (= .cse0 33) (= |#memory_int| (store |v_#memory_int_4136| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:52,323 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:40:52,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:52,360 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:52,362 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:52,362 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:52,362 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:52,369 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:52,370 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4137|]. (let ((.cse0 (select |v_#memory_int_4137| ULTIMATE.start_main_p1))) (and (= .cse0 34) (= (store |v_#memory_int_4137| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:52,370 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:40:52,404 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:52,405 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:52,407 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:52,408 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:52,408 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:52,416 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:52,416 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4138|]. (let ((.cse0 (select |v_#memory_int_4138| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4138| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 35))) [2019-05-15 10:40:52,416 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:40:52,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 16 treesize of output 11 [2019-05-15 10:40:52,453 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:52,455 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:52,456 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:52,456 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:52,463 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:52,463 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4139|]. (let ((.cse0 (select |v_#memory_int_4139| ULTIMATE.start_main_p1))) (and (= 36 .cse0) (= |#memory_int| (store |v_#memory_int_4139| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:52,463 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:40:52,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 16 treesize of output 11 [2019-05-15 10:40:52,502 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:52,504 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:52,504 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:52,505 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:52,512 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:52,512 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4140|]. (let ((.cse0 (select |v_#memory_int_4140| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4140| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 37 .cse0))) [2019-05-15 10:40:52,512 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:40:52,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 16 treesize of output 11 [2019-05-15 10:40:52,553 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:52,555 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:52,555 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:52,555 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:52,564 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:52,564 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4141|]. (let ((.cse0 (select |v_#memory_int_4141| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4141| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 38))) [2019-05-15 10:40:52,564 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:40:52,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 16 treesize of output 11 [2019-05-15 10:40:52,611 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:52,613 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:52,613 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:52,613 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:52,621 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:52,621 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4142|]. (let ((.cse0 (select |v_#memory_int_4142| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4142| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 39 .cse0))) [2019-05-15 10:40:52,621 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:40:52,661 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:52,662 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:52,664 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:52,664 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:52,665 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:52,673 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:52,673 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4143|]. (let ((.cse0 (select |v_#memory_int_4143| ULTIMATE.start_main_p1))) (and (= .cse0 40) (= (store |v_#memory_int_4143| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:52,673 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:40:52,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:52,712 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:52,714 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:52,715 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:52,715 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:52,723 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:52,723 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4144|]. (let ((.cse0 (select |v_#memory_int_4144| ULTIMATE.start_main_p1))) (and (= .cse0 41) (= (store |v_#memory_int_4144| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:52,723 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:40:52,764 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:52,765 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:52,767 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:52,767 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:52,767 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:52,775 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:52,775 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4145|]. (let ((.cse0 (select |v_#memory_int_4145| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4145| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 42))) [2019-05-15 10:40:52,776 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:40:52,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:52,820 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:52,823 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:52,823 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:52,823 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:52,831 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:52,831 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4146|]. (let ((.cse0 (select |v_#memory_int_4146| ULTIMATE.start_main_p1))) (and (= .cse0 43) (= (store |v_#memory_int_4146| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:52,831 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:40:52,873 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:52,873 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:52,875 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:52,876 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:52,876 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:52,882 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:52,882 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4147|]. (let ((.cse0 (select |v_#memory_int_4147| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4147| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 44 .cse0))) [2019-05-15 10:40:52,882 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:40:52,924 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:52,925 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:52,927 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:52,927 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:52,927 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:52,936 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:52,936 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4148|]. (let ((.cse0 (select |v_#memory_int_4148| ULTIMATE.start_main_p1))) (and (= .cse0 45) (= |#memory_int| (store |v_#memory_int_4148| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:52,937 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:40:52,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 16 treesize of output 11 [2019-05-15 10:40:52,980 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:52,982 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:52,983 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:52,983 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:52,990 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:52,990 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4149|]. (let ((.cse0 (select |v_#memory_int_4149| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4149| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 46 .cse0))) [2019-05-15 10:40:52,991 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:40:53,038 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:53,039 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:53,041 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:53,041 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:53,042 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:53,049 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:53,049 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4150|]. (let ((.cse0 (select |v_#memory_int_4150| ULTIMATE.start_main_p1))) (and (= 47 .cse0) (= |#memory_int| (store |v_#memory_int_4150| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:53,049 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:40:53,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:53,100 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:53,101 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:53,102 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:53,102 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:53,109 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:53,109 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4151|]. (let ((.cse0 (select |v_#memory_int_4151| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4151| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 48 .cse0))) [2019-05-15 10:40:53,109 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:40:53,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:53,157 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:53,159 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:53,159 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:53,159 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:53,167 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:53,167 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4152|]. (let ((.cse0 (select |v_#memory_int_4152| ULTIMATE.start_main_p1))) (and (= .cse0 49) (= (store |v_#memory_int_4152| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:53,168 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:40:53,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:53,215 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:53,217 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:53,217 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:53,218 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:53,225 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:53,225 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4153|]. (let ((.cse0 (select |v_#memory_int_4153| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4153| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 50))) [2019-05-15 10:40:53,225 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:40:53,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:53,273 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:53,275 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:53,275 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:53,276 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:53,283 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:53,283 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4154|]. (let ((.cse0 (select |v_#memory_int_4154| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4154| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 51 .cse0))) [2019-05-15 10:40:53,283 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:40:53,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:53,331 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:53,333 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:53,333 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:53,333 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:53,341 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:53,341 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4155|]. (let ((.cse0 (select |v_#memory_int_4155| ULTIMATE.start_main_p1))) (and (= .cse0 52) (= |#memory_int| (store |v_#memory_int_4155| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:53,341 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:40:53,390 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:53,391 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:53,393 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:53,393 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:53,393 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:53,401 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:53,402 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4156|]. (let ((.cse0 (select |v_#memory_int_4156| ULTIMATE.start_main_p1))) (and (= .cse0 53) (= |#memory_int| (store |v_#memory_int_4156| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:53,402 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:40:53,453 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:53,454 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:53,456 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:53,456 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:53,456 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:53,464 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:53,464 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4157|]. (let ((.cse0 (select |v_#memory_int_4157| ULTIMATE.start_main_p1))) (and (= .cse0 54) (= (store |v_#memory_int_4157| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:53,464 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:40:53,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:53,516 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:53,518 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:53,518 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:53,519 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:53,526 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:53,526 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4158|]. (let ((.cse0 (select |v_#memory_int_4158| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4158| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 55 .cse0))) [2019-05-15 10:40:53,526 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:40:53,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:53,580 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:53,582 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:53,582 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:53,582 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:53,590 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:53,591 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4159|]. (let ((.cse0 (select |v_#memory_int_4159| ULTIMATE.start_main_p1))) (and (= .cse0 56) (= (store |v_#memory_int_4159| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:53,591 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:40:53,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:53,651 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:53,653 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:53,653 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:53,653 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:53,660 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:53,660 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4160|]. (let ((.cse0 (select |v_#memory_int_4160| ULTIMATE.start_main_p1))) (and (= 57 .cse0) (= |#memory_int| (store |v_#memory_int_4160| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:53,660 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:40:53,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:53,715 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:53,717 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:53,718 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:53,718 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:53,725 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:53,725 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4161|]. (let ((.cse0 (select |v_#memory_int_4161| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4161| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 58 .cse0))) [2019-05-15 10:40:53,725 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:40:53,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 16 treesize of output 11 [2019-05-15 10:40:53,779 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:53,781 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:53,782 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:53,782 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:53,788 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:53,788 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4162|]. (let ((.cse0 (select |v_#memory_int_4162| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4162| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 59 .cse0))) [2019-05-15 10:40:53,788 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:40:53,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:53,841 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:53,843 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:53,843 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:53,843 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:53,851 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:53,851 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4163|]. (let ((.cse0 (select |v_#memory_int_4163| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4163| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 60 .cse0))) [2019-05-15 10:40:53,851 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:40:53,906 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:53,907 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:53,909 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:53,909 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:53,909 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:53,917 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:53,917 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4164|]. (let ((.cse0 (select |v_#memory_int_4164| ULTIMATE.start_main_p1))) (and (= .cse0 61) (= |#memory_int| (store |v_#memory_int_4164| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:53,917 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:40:53,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 16 treesize of output 11 [2019-05-15 10:40:53,972 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:53,974 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:53,974 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:53,974 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:53,982 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:53,982 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4165|]. (let ((.cse0 (select |v_#memory_int_4165| ULTIMATE.start_main_p1))) (and (= 62 .cse0) (= |#memory_int| (store |v_#memory_int_4165| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:53,983 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:40:54,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:54,042 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:54,044 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:54,045 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:54,045 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:54,052 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:54,052 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4166|]. (let ((.cse0 (select |v_#memory_int_4166| ULTIMATE.start_main_p1))) (and (= .cse0 63) (= (store |v_#memory_int_4166| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:54,052 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 64) [2019-05-15 10:40:54,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 16 treesize of output 11 [2019-05-15 10:40:54,109 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:54,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:54,111 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:54,111 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:54,119 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:54,119 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4167|]. (let ((.cse0 (select |v_#memory_int_4167| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4167| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 64))) [2019-05-15 10:40:54,119 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 65) [2019-05-15 10:40:54,181 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:54,182 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:54,184 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:54,184 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:54,185 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:54,192 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:54,192 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4168|]. (let ((.cse0 (select |v_#memory_int_4168| ULTIMATE.start_main_p1))) (and (= 65 .cse0) (= (store |v_#memory_int_4168| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:54,192 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 66) [2019-05-15 10:40:54,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 16 treesize of output 11 [2019-05-15 10:40:54,249 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:54,251 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:54,251 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:54,251 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:54,259 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:54,259 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4169|]. (let ((.cse0 (select |v_#memory_int_4169| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4169| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 66 .cse0))) [2019-05-15 10:40:54,259 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 67) [2019-05-15 10:40:54,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 16 treesize of output 11 [2019-05-15 10:40:54,324 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:54,326 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:54,326 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:54,326 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:54,333 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:54,333 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4170|]. (let ((.cse0 (select |v_#memory_int_4170| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4170| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 67 .cse0))) [2019-05-15 10:40:54,334 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 68) [2019-05-15 10:40:54,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:54,393 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:54,395 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:54,396 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:54,396 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:54,404 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:54,404 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4171|]. (let ((.cse0 (select |v_#memory_int_4171| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4171| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 68 .cse0))) [2019-05-15 10:40:54,404 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 69) [2019-05-15 10:40:54,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 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:54,467 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:54,469 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:54,469 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:54,469 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:54,477 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:54,477 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4172|]. (let ((.cse0 (select |v_#memory_int_4172| ULTIMATE.start_main_p1))) (and (= 69 .cse0) (= (store |v_#memory_int_4172| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:54,477 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 70) [2019-05-15 10:40:54,541 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:54,542 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:54,544 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:54,545 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:54,545 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:54,552 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:54,552 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4173|]. (let ((.cse0 (select |v_#memory_int_4173| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4173| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 70))) [2019-05-15 10:40:54,552 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 71) [2019-05-15 10:40:54,615 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:54,616 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:54,618 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:54,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:54,619 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:54,626 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:54,627 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4174|]. (let ((.cse0 (select |v_#memory_int_4174| ULTIMATE.start_main_p1))) (and (= 71 .cse0) (= |#memory_int| (store |v_#memory_int_4174| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:54,627 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 72) [2019-05-15 10:40:54,691 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:54,692 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:54,694 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:54,694 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:54,694 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:54,701 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:54,702 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4175|]. (let ((.cse0 (select |v_#memory_int_4175| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4175| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 72 .cse0))) [2019-05-15 10:40:54,702 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 73) [2019-05-15 10:40:54,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 16 treesize of output 11 [2019-05-15 10:40:54,772 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:54,774 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:54,774 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:54,774 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:54,781 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:54,781 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4176|]. (let ((.cse0 (select |v_#memory_int_4176| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4176| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 73 .cse0))) [2019-05-15 10:40:54,781 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 74) [2019-05-15 10:40:54,846 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:54,847 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:54,849 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:54,849 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:54,850 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:54,857 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:54,857 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4177|]. (let ((.cse0 (select |v_#memory_int_4177| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4177| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 74))) [2019-05-15 10:40:54,857 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 75) [2019-05-15 10:40:54,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 16 treesize of output 11 [2019-05-15 10:40:54,922 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:54,924 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:54,924 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:54,924 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:54,932 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:54,932 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4178|]. (let ((.cse0 (select |v_#memory_int_4178| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4178| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 75 .cse0))) [2019-05-15 10:40:54,933 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 76) [2019-05-15 10:40:54,997 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:54,998 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:55,000 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:55,001 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:55,001 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:55,008 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:55,009 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4179|]. (let ((.cse0 (select |v_#memory_int_4179| ULTIMATE.start_main_p1))) (and (= .cse0 76) (= (store |v_#memory_int_4179| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:55,009 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 77) [2019-05-15 10:40:55,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 16 treesize of output 11 [2019-05-15 10:40:55,076 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:55,078 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:55,079 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:55,079 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:55,086 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:55,086 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4180|]. (let ((.cse0 (select |v_#memory_int_4180| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4180| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 77 .cse0))) [2019-05-15 10:40:55,086 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 78) [2019-05-15 10:40:55,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 16 treesize of output 11 [2019-05-15 10:40:55,155 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:55,157 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:55,157 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:55,157 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:55,164 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:55,164 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4181|]. (let ((.cse0 (select |v_#memory_int_4181| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4181| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 78 .cse0))) [2019-05-15 10:40:55,165 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 79) [2019-05-15 10:40:55,231 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:55,232 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:55,234 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:55,234 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:55,234 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:55,240 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:55,240 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4182|]. (let ((.cse0 (select |v_#memory_int_4182| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4182| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 79))) [2019-05-15 10:40:55,240 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 80) [2019-05-15 10:40:55,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 16 treesize of output 11 [2019-05-15 10:40:55,309 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:55,311 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:55,312 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:55,312 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:55,319 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:55,320 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4183|]. (let ((.cse0 (select |v_#memory_int_4183| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4183| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 80 .cse0))) [2019-05-15 10:40:55,320 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 81) [2019-05-15 10:40:55,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:55,396 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:55,398 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:55,398 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:55,398 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:55,406 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:55,406 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4184|]. (let ((.cse0 (select |v_#memory_int_4184| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4184| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 81))) [2019-05-15 10:40:55,406 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 82) [2019-05-15 10:40:55,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:55,479 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:55,481 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:55,481 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:55,481 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:55,489 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:55,489 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4185|]. (let ((.cse0 (select |v_#memory_int_4185| ULTIMATE.start_main_p1))) (and (= .cse0 82) (= (store |v_#memory_int_4185| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:55,489 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 83) [2019-05-15 10:40:55,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:55,562 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:55,564 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:55,564 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:55,564 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:55,571 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:55,571 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4186|]. (let ((.cse0 (select |v_#memory_int_4186| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4186| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 83 .cse0))) [2019-05-15 10:40:55,571 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 84) [2019-05-15 10:40:55,642 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:55,643 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:55,645 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:55,646 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:55,646 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:55,653 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:55,653 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4187|]. (let ((.cse0 (select |v_#memory_int_4187| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4187| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 84))) [2019-05-15 10:40:55,654 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 85) [2019-05-15 10:40:55,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:55,731 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:55,733 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:55,733 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:55,733 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:55,740 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:55,741 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4188|]. (let ((.cse0 (select |v_#memory_int_4188| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4188| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 85))) [2019-05-15 10:40:55,741 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 86) [2019-05-15 10:40:55,816 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:55,817 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:55,819 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:55,819 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:55,820 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:55,827 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:55,827 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4189|]. (let ((.cse0 (select |v_#memory_int_4189| ULTIMATE.start_main_p1))) (and (= 86 .cse0) (= (store |v_#memory_int_4189| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:55,827 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 87) [2019-05-15 10:40:55,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 16 treesize of output 11 [2019-05-15 10:40:55,902 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:55,904 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:55,905 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:55,905 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:55,913 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:55,913 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4190|]. (let ((.cse0 (select |v_#memory_int_4190| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4190| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 87))) [2019-05-15 10:40:55,913 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 88) [2019-05-15 10:40:55,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 16 treesize of output 11 [2019-05-15 10:40:55,990 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:55,992 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:55,992 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:55,992 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:56,001 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:56,001 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4191|]. (let ((.cse0 (select |v_#memory_int_4191| ULTIMATE.start_main_p1))) (and (= .cse0 88) (= |#memory_int| (store |v_#memory_int_4191| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:56,001 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 89) [2019-05-15 10:40: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 16 treesize of output 11 [2019-05-15 10:40:56,084 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:56,086 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:56,086 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:56,086 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:56,093 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:56,093 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4192|]. (let ((.cse0 (select |v_#memory_int_4192| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4192| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 89 .cse0))) [2019-05-15 10:40:56,093 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 90) [2019-05-15 10:40:56,169 INFO L273 TraceCheckUtils]: 0: Hoare triple {35474#true} havoc main_p1; {35474#true} is VALID [2019-05-15 10:40:56,169 INFO L273 TraceCheckUtils]: 1: Hoare triple {35474#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {35474#true} is VALID [2019-05-15 10:40:56,170 INFO L273 TraceCheckUtils]: 2: Hoare triple {35474#true} #memory_int := #memory_int[main_p1 := 0]; {35485#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:40:56,171 INFO L273 TraceCheckUtils]: 3: Hoare triple {35485#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35489#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:40:56,171 INFO L273 TraceCheckUtils]: 4: Hoare triple {35489#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35493#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:40:56,172 INFO L273 TraceCheckUtils]: 5: Hoare triple {35493#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35497#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:40:56,172 INFO L273 TraceCheckUtils]: 6: Hoare triple {35497#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35501#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:40:56,173 INFO L273 TraceCheckUtils]: 7: Hoare triple {35501#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35505#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:40:56,173 INFO L273 TraceCheckUtils]: 8: Hoare triple {35505#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35509#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:40:56,174 INFO L273 TraceCheckUtils]: 9: Hoare triple {35509#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35513#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:40:56,175 INFO L273 TraceCheckUtils]: 10: Hoare triple {35513#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35517#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:40:56,176 INFO L273 TraceCheckUtils]: 11: Hoare triple {35517#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35521#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:40:56,176 INFO L273 TraceCheckUtils]: 12: Hoare triple {35521#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35525#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:40:56,177 INFO L273 TraceCheckUtils]: 13: Hoare triple {35525#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35529#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:40:56,178 INFO L273 TraceCheckUtils]: 14: Hoare triple {35529#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35533#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:40:56,179 INFO L273 TraceCheckUtils]: 15: Hoare triple {35533#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35537#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:40:56,179 INFO L273 TraceCheckUtils]: 16: Hoare triple {35537#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35541#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:40:56,180 INFO L273 TraceCheckUtils]: 17: Hoare triple {35541#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35545#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:40:56,181 INFO L273 TraceCheckUtils]: 18: Hoare triple {35545#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35549#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:40:56,182 INFO L273 TraceCheckUtils]: 19: Hoare triple {35549#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35553#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:40:56,182 INFO L273 TraceCheckUtils]: 20: Hoare triple {35553#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35557#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:40:56,183 INFO L273 TraceCheckUtils]: 21: Hoare triple {35557#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35561#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:40:56,184 INFO L273 TraceCheckUtils]: 22: Hoare triple {35561#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35565#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:40:56,185 INFO L273 TraceCheckUtils]: 23: Hoare triple {35565#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35569#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:40:56,185 INFO L273 TraceCheckUtils]: 24: Hoare triple {35569#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35573#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:40:56,186 INFO L273 TraceCheckUtils]: 25: Hoare triple {35573#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35577#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:40:56,187 INFO L273 TraceCheckUtils]: 26: Hoare triple {35577#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35581#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:40:56,188 INFO L273 TraceCheckUtils]: 27: Hoare triple {35581#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35585#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:40:56,188 INFO L273 TraceCheckUtils]: 28: Hoare triple {35585#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35589#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:40:56,189 INFO L273 TraceCheckUtils]: 29: Hoare triple {35589#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35593#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:40:56,190 INFO L273 TraceCheckUtils]: 30: Hoare triple {35593#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35597#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:40:56,191 INFO L273 TraceCheckUtils]: 31: Hoare triple {35597#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35601#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:40:56,191 INFO L273 TraceCheckUtils]: 32: Hoare triple {35601#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35605#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:40:56,192 INFO L273 TraceCheckUtils]: 33: Hoare triple {35605#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35609#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:40:56,193 INFO L273 TraceCheckUtils]: 34: Hoare triple {35609#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35613#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:40:56,194 INFO L273 TraceCheckUtils]: 35: Hoare triple {35613#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35617#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:40:56,194 INFO L273 TraceCheckUtils]: 36: Hoare triple {35617#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35621#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:40:56,195 INFO L273 TraceCheckUtils]: 37: Hoare triple {35621#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35625#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:40:56,196 INFO L273 TraceCheckUtils]: 38: Hoare triple {35625#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35629#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:40:56,197 INFO L273 TraceCheckUtils]: 39: Hoare triple {35629#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35633#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:40:56,197 INFO L273 TraceCheckUtils]: 40: Hoare triple {35633#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35637#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:40:56,198 INFO L273 TraceCheckUtils]: 41: Hoare triple {35637#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35641#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:40:56,199 INFO L273 TraceCheckUtils]: 42: Hoare triple {35641#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35645#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:40:56,200 INFO L273 TraceCheckUtils]: 43: Hoare triple {35645#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35649#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:40:56,200 INFO L273 TraceCheckUtils]: 44: Hoare triple {35649#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35653#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:40:56,201 INFO L273 TraceCheckUtils]: 45: Hoare triple {35653#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35657#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:40:56,202 INFO L273 TraceCheckUtils]: 46: Hoare triple {35657#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35661#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:40:56,203 INFO L273 TraceCheckUtils]: 47: Hoare triple {35661#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35665#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:40:56,203 INFO L273 TraceCheckUtils]: 48: Hoare triple {35665#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35669#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:40:56,204 INFO L273 TraceCheckUtils]: 49: Hoare triple {35669#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35673#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:40:56,205 INFO L273 TraceCheckUtils]: 50: Hoare triple {35673#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35677#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:40:56,205 INFO L273 TraceCheckUtils]: 51: Hoare triple {35677#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35681#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:40:56,206 INFO L273 TraceCheckUtils]: 52: Hoare triple {35681#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35685#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:40:56,207 INFO L273 TraceCheckUtils]: 53: Hoare triple {35685#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35689#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:40:56,208 INFO L273 TraceCheckUtils]: 54: Hoare triple {35689#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35693#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:40:56,208 INFO L273 TraceCheckUtils]: 55: Hoare triple {35693#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35697#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:40:56,209 INFO L273 TraceCheckUtils]: 56: Hoare triple {35697#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35701#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:40:56,210 INFO L273 TraceCheckUtils]: 57: Hoare triple {35701#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35705#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:40:56,211 INFO L273 TraceCheckUtils]: 58: Hoare triple {35705#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35709#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:40:56,211 INFO L273 TraceCheckUtils]: 59: Hoare triple {35709#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35713#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:40:56,212 INFO L273 TraceCheckUtils]: 60: Hoare triple {35713#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35717#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:40:56,213 INFO L273 TraceCheckUtils]: 61: Hoare triple {35717#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35721#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:40:56,214 INFO L273 TraceCheckUtils]: 62: Hoare triple {35721#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35725#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:40:56,214 INFO L273 TraceCheckUtils]: 63: Hoare triple {35725#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35729#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:40:56,215 INFO L273 TraceCheckUtils]: 64: Hoare triple {35729#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35733#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:40:56,216 INFO L273 TraceCheckUtils]: 65: Hoare triple {35733#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35737#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:40:56,217 INFO L273 TraceCheckUtils]: 66: Hoare triple {35737#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35741#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} is VALID [2019-05-15 10:40:56,217 INFO L273 TraceCheckUtils]: 67: Hoare triple {35741#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35745#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} is VALID [2019-05-15 10:40:56,218 INFO L273 TraceCheckUtils]: 68: Hoare triple {35745#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35749#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} is VALID [2019-05-15 10:40:56,219 INFO L273 TraceCheckUtils]: 69: Hoare triple {35749#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35753#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} is VALID [2019-05-15 10:40:56,220 INFO L273 TraceCheckUtils]: 70: Hoare triple {35753#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35757#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} is VALID [2019-05-15 10:40:56,220 INFO L273 TraceCheckUtils]: 71: Hoare triple {35757#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35761#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} is VALID [2019-05-15 10:40:56,221 INFO L273 TraceCheckUtils]: 72: Hoare triple {35761#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35765#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} is VALID [2019-05-15 10:40:56,222 INFO L273 TraceCheckUtils]: 73: Hoare triple {35765#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35769#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} is VALID [2019-05-15 10:40:56,223 INFO L273 TraceCheckUtils]: 74: Hoare triple {35769#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35773#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} is VALID [2019-05-15 10:40:56,223 INFO L273 TraceCheckUtils]: 75: Hoare triple {35773#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35777#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} is VALID [2019-05-15 10:40:56,224 INFO L273 TraceCheckUtils]: 76: Hoare triple {35777#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35781#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} is VALID [2019-05-15 10:40:56,225 INFO L273 TraceCheckUtils]: 77: Hoare triple {35781#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35785#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} is VALID [2019-05-15 10:40:56,226 INFO L273 TraceCheckUtils]: 78: Hoare triple {35785#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35789#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} is VALID [2019-05-15 10:40:56,226 INFO L273 TraceCheckUtils]: 79: Hoare triple {35789#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35793#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} is VALID [2019-05-15 10:40:56,227 INFO L273 TraceCheckUtils]: 80: Hoare triple {35793#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35797#(= (select |#memory_int| ULTIMATE.start_main_p1) 78)} is VALID [2019-05-15 10:40:56,228 INFO L273 TraceCheckUtils]: 81: Hoare triple {35797#(= (select |#memory_int| ULTIMATE.start_main_p1) 78)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35801#(= (select |#memory_int| ULTIMATE.start_main_p1) 79)} is VALID [2019-05-15 10:40:56,229 INFO L273 TraceCheckUtils]: 82: Hoare triple {35801#(= (select |#memory_int| ULTIMATE.start_main_p1) 79)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35805#(= (select |#memory_int| ULTIMATE.start_main_p1) 80)} is VALID [2019-05-15 10:40:56,229 INFO L273 TraceCheckUtils]: 83: Hoare triple {35805#(= (select |#memory_int| ULTIMATE.start_main_p1) 80)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35809#(= (select |#memory_int| ULTIMATE.start_main_p1) 81)} is VALID [2019-05-15 10:40:56,230 INFO L273 TraceCheckUtils]: 84: Hoare triple {35809#(= (select |#memory_int| ULTIMATE.start_main_p1) 81)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35813#(= (select |#memory_int| ULTIMATE.start_main_p1) 82)} is VALID [2019-05-15 10:40:56,231 INFO L273 TraceCheckUtils]: 85: Hoare triple {35813#(= (select |#memory_int| ULTIMATE.start_main_p1) 82)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35817#(= (select |#memory_int| ULTIMATE.start_main_p1) 83)} is VALID [2019-05-15 10:40:56,231 INFO L273 TraceCheckUtils]: 86: Hoare triple {35817#(= (select |#memory_int| ULTIMATE.start_main_p1) 83)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35821#(= (select |#memory_int| ULTIMATE.start_main_p1) 84)} is VALID [2019-05-15 10:40:56,232 INFO L273 TraceCheckUtils]: 87: Hoare triple {35821#(= (select |#memory_int| ULTIMATE.start_main_p1) 84)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35825#(= (select |#memory_int| ULTIMATE.start_main_p1) 85)} is VALID [2019-05-15 10:40:56,233 INFO L273 TraceCheckUtils]: 88: Hoare triple {35825#(= (select |#memory_int| ULTIMATE.start_main_p1) 85)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35829#(= (select |#memory_int| ULTIMATE.start_main_p1) 86)} is VALID [2019-05-15 10:40:56,234 INFO L273 TraceCheckUtils]: 89: Hoare triple {35829#(= (select |#memory_int| ULTIMATE.start_main_p1) 86)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35833#(= (select |#memory_int| ULTIMATE.start_main_p1) 87)} is VALID [2019-05-15 10:40:56,234 INFO L273 TraceCheckUtils]: 90: Hoare triple {35833#(= (select |#memory_int| ULTIMATE.start_main_p1) 87)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35837#(= (select |#memory_int| ULTIMATE.start_main_p1) 88)} is VALID [2019-05-15 10:40:56,235 INFO L273 TraceCheckUtils]: 91: Hoare triple {35837#(= (select |#memory_int| ULTIMATE.start_main_p1) 88)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35841#(= (select |#memory_int| ULTIMATE.start_main_p1) 89)} is VALID [2019-05-15 10:40:56,236 INFO L273 TraceCheckUtils]: 92: Hoare triple {35841#(= (select |#memory_int| ULTIMATE.start_main_p1) 89)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35845#(= (select |#memory_int| ULTIMATE.start_main_p1) 90)} is VALID [2019-05-15 10:40:56,237 INFO L273 TraceCheckUtils]: 93: Hoare triple {35845#(= (select |#memory_int| ULTIMATE.start_main_p1) 90)} assume !(#memory_int[main_p1] >= 0); {35475#false} is VALID [2019-05-15 10:40:56,248 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:40:56,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:40:56,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-05-15 10:40:56,248 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 94 [2019-05-15 10:40:56,248 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:40:56,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 93 states. [2019-05-15 10:40:56,322 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:40:56,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-05-15 10:40:56,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-05-15 10:40:56,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2019-05-15 10:40:56,323 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 93 states.