java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/20181010-MemSafetyPathprograms/alternating_list_true-unreach-call_true-valid-memsafety.i_46.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:03:54,711 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:03:54,713 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:03:54,725 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:03:54,726 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:03:54,727 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:03:54,728 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:03:54,730 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:03:54,732 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:03:54,733 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:03:54,734 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:03:54,734 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:03:54,735 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:03:54,736 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:03:54,737 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:03:54,738 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:03:54,739 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:03:54,740 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:03:54,741 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:03:54,744 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:03:54,745 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:03:54,746 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:03:54,748 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:03:54,749 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:03:54,751 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:03:54,751 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:03:54,751 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:03:54,752 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:03:54,753 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:03:54,754 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:03:54,754 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:03:54,755 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:03:54,756 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:03:54,757 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:03:54,758 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:03:54,758 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:03:54,759 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:03:54,759 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:03:54,759 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:03:54,760 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:03:54,761 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:03:54,788 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:03:54,801 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:03:54,805 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:03:54,806 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:03:54,807 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:03:54,808 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/alternating_list_true-unreach-call_true-valid-memsafety.i_46.bpl [2019-08-05 11:03:54,808 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/alternating_list_true-unreach-call_true-valid-memsafety.i_46.bpl' [2019-08-05 11:03:54,864 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:03:54,866 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:03:54,866 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:03:54,867 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:03:54,867 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:03:54,884 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "alternating_list_true-unreach-call_true-valid-memsafety.i_46.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:03:54" (1/1) ... [2019-08-05 11:03:54,901 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "alternating_list_true-unreach-call_true-valid-memsafety.i_46.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:03:54" (1/1) ... [2019-08-05 11:03:54,909 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:03:54,910 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:03:54,910 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:03:54,911 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:03:54,922 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_46.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:03:54" (1/1) ... [2019-08-05 11:03:54,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_46.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:03:54" (1/1) ... [2019-08-05 11:03:54,927 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_46.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:03:54" (1/1) ... [2019-08-05 11:03:54,927 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_46.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:03:54" (1/1) ... [2019-08-05 11:03:54,936 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_46.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:03:54" (1/1) ... [2019-08-05 11:03:54,938 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_46.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:03:54" (1/1) ... [2019-08-05 11:03:54,941 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_46.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:03:54" (1/1) ... [2019-08-05 11:03:54,944 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:03:54,945 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:03:54,945 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:03:54,945 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:03:54,946 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "alternating_list_true-unreach-call_true-valid-memsafety.i_46.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:03:54" (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-08-05 11:03:55,016 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 11:03:55,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 11:03:55,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 11:03:55,505 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2019-08-05 11:03:55,672 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 11:03:55,673 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:03:55,674 INFO L202 PluginConnector]: Adding new model alternating_list_true-unreach-call_true-valid-memsafety.i_46.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:03:55 BoogieIcfgContainer [2019-08-05 11:03:55,675 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:03:55,676 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:03:55,677 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:03:55,680 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:03:55,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "alternating_list_true-unreach-call_true-valid-memsafety.i_46.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:03:54" (1/2) ... [2019-08-05 11:03:55,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@314c8241 and model type alternating_list_true-unreach-call_true-valid-memsafety.i_46.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:03:55, skipping insertion in model container [2019-08-05 11:03:55,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "alternating_list_true-unreach-call_true-valid-memsafety.i_46.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:03:55" (2/2) ... [2019-08-05 11:03:55,684 INFO L109 eAbstractionObserver]: Analyzing ICFG alternating_list_true-unreach-call_true-valid-memsafety.i_46.bpl [2019-08-05 11:03:55,693 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:03:55,702 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:03:55,718 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:03:55,745 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:03:55,746 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:03:55,746 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:03:55,746 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:03:55,747 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:03:55,747 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:03:55,747 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:03:55,747 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:03:55,748 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:03:55,762 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2019-08-05 11:03:55,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:03:55,771 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:55,772 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 11:03:55,775 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:55,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:55,781 INFO L82 PathProgramCache]: Analyzing trace with hash 889539725, now seen corresponding path program 1 times [2019-08-05 11:03:55,833 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:55,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:55,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 11:03:55,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:56,024 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-08-05 11:03:56,025 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:56,104 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:56,105 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:03:56,106 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:03:56,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:56,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:03:56,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:03:56,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:03:56,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:03:56,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:03:56,307 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 5 states. [2019-08-05 11:03:56,670 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 15 [2019-08-05 11:03:56,914 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2019-08-05 11:03:56,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:56,990 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2019-08-05 11:03:56,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:03:56,993 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-05 11:03:56,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:57,002 INFO L225 Difference]: With dead ends: 12 [2019-08-05 11:03:57,003 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 11:03:57,005 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:03:57,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 11:03:57,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2019-08-05 11:03:57,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 11:03:57,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2019-08-05 11:03:57,036 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 6 [2019-08-05 11:03:57,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:57,037 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-08-05 11:03:57,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:03:57,037 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2019-08-05 11:03:57,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:03:57,038 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:57,039 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:03:57,039 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:57,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:57,040 INFO L82 PathProgramCache]: Analyzing trace with hash 332065109, now seen corresponding path program 1 times [2019-08-05 11:03:57,041 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:57,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:57,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:03:57,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:57,200 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-08-05 11:03:57,200 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:57,230 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:57,231 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:57,231 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-08-05 11:03:57,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:57,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:03:57,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:03:57,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:03:57,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:03:57,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:03:57,332 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand 5 states. [2019-08-05 11:03:57,510 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 19 [2019-08-05 11:03:57,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:57,696 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2019-08-05 11:03:57,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:03:57,697 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-08-05 11:03:57,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:57,698 INFO L225 Difference]: With dead ends: 14 [2019-08-05 11:03:57,698 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 11:03:57,699 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:03:57,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 11:03:57,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 11:03:57,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 11:03:57,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-08-05 11:03:57,702 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 9 [2019-08-05 11:03:57,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:57,702 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-08-05 11:03:57,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:03:57,702 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-08-05 11:03:57,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 11:03:57,703 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:57,703 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:03:57,704 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:57,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:57,704 INFO L82 PathProgramCache]: Analyzing trace with hash 980899835, now seen corresponding path program 1 times [2019-08-05 11:03:57,705 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:57,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:57,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 11:03:57,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:57,951 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:03:57,983 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2019-08-05 11:03:57,983 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:58,127 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-08-05 11:03:58,127 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:58,152 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-08-05 11:03:58,152 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:58,269 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-08-05 11:03:58,270 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:58,286 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-08-05 11:03:58,287 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:58,305 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:58,325 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-08-05 11:03:58,325 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:58,355 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:58,375 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-08-05 11:03:58,375 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:58,476 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-08-05 11:03:58,477 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:58,478 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:03:58,478 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:48, output treesize:24 [2019-08-05 11:03:58,637 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-08-05 11:03:58,638 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:58,660 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:58,663 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-08-05 11:03:58,664 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:58,674 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:58,675 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:03:58,676 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:9 [2019-08-05 11:03:58,736 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:58,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:58,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:03:58,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:03:58,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:03:58,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:03:58,738 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 7 states. [2019-08-05 11:03:59,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:59,045 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2019-08-05 11:03:59,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:03:59,046 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-08-05 11:03:59,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:59,047 INFO L225 Difference]: With dead ends: 17 [2019-08-05 11:03:59,047 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 11:03:59,047 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:03:59,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 11:03:59,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2019-08-05 11:03:59,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 11:03:59,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-08-05 11:03:59,051 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2019-08-05 11:03:59,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:59,051 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-08-05 11:03:59,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:03:59,051 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-08-05 11:03:59,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 11:03:59,052 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:59,052 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1] [2019-08-05 11:03:59,053 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:59,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:59,053 INFO L82 PathProgramCache]: Analyzing trace with hash -968163545, now seen corresponding path program 2 times [2019-08-05 11:03:59,054 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:59,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:59,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 11:03:59,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:59,324 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-08-05 11:03:59,324 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:59,339 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:59,355 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-08-05 11:03:59,355 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:59,371 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:59,372 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:03:59,372 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:28 [2019-08-05 11:03:59,438 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 13 [2019-08-05 11:03:59,439 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:59,455 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:59,456 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:59,457 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:38 [2019-08-05 11:03:59,489 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:03:59,514 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-08-05 11:03:59,515 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:59,555 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:59,565 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2019-08-05 11:03:59,566 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:59,633 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:59,636 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:59,637 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:78, output treesize:42 [2019-08-05 11:03:59,703 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:59,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:59,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:03:59,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:03:59,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:03:59,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:03:59,704 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 6 states. [2019-08-05 11:03:59,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:59,904 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-08-05 11:03:59,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:03:59,905 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-08-05 11:03:59,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:59,907 INFO L225 Difference]: With dead ends: 23 [2019-08-05 11:03:59,907 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 11:03:59,908 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:03:59,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 11:03:59,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 11:03:59,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 11:03:59,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-08-05 11:03:59,912 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2019-08-05 11:03:59,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:59,912 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-08-05 11:03:59,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:03:59,913 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-08-05 11:03:59,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 11:03:59,913 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:59,913 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:03:59,914 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:59,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:59,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1149777855, now seen corresponding path program 3 times [2019-08-05 11:03:59,915 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:00,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:00,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-05 11:04:00,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:00,249 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:00,258 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_22|], 1=[|ULTIMATE.start_#Ultimate.alloc_old_#valid|]} [2019-08-05 11:04:00,272 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2019-08-05 11:04:00,273 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:00,349 INFO L567 ElimStorePlain]: treesize reduction 3, result has 96.0 percent of original size [2019-08-05 11:04:00,382 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:00,382 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-08-05 11:04:00,383 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:00,384 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:00,409 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:00,418 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-08-05 11:04:00,418 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:00,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:00,448 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-08-05 11:04:00,448 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:00,481 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:00,504 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-08-05 11:04:00,504 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:00,530 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:00,531 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:00,532 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:82, output treesize:51 [2019-08-05 11:04:00,588 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-08-05 11:04:00,588 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:00,628 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:00,636 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2019-08-05 11:04:00,636 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:00,664 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:00,666 INFO L392 ElimStorePlain]: Different costs {0=[|ULTIMATE.start_write~int_old_#memory_int|], 2=[|ULTIMATE.start_write~int_old_#memory_$Pointer$.offset|, |ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$.base|]} [2019-08-05 11:04:00,670 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-08-05 11:04:00,671 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:00,698 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:00,705 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 31 [2019-08-05 11:04:00,706 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:00,738 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:00,745 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:04:00,757 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:00,758 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 62 [2019-08-05 11:04:00,759 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:00,760 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:00,761 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2019-08-05 11:04:00,823 INFO L567 ElimStorePlain]: treesize reduction 66, result has 53.2 percent of original size [2019-08-05 11:04:00,825 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:00,826 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:131, output treesize:59 [2019-08-05 11:04:01,233 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:04:01,234 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:04:01,249 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-08-05 11:04:01,249 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 43 [2019-08-05 11:04:01,250 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:01,252 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:01,253 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:01,291 INFO L567 ElimStorePlain]: treesize reduction 8, result has 86.4 percent of original size [2019-08-05 11:04:01,300 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:01,300 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 25 [2019-08-05 11:04:01,301 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:01,328 INFO L567 ElimStorePlain]: treesize reduction 7, result has 78.1 percent of original size [2019-08-05 11:04:01,329 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:01,329 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:84, output treesize:9 [2019-08-05 11:04:01,366 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:01,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:01,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:04:01,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:04:01,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:04:01,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:04:01,368 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 11 states. [2019-08-05 11:04:01,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:01,902 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2019-08-05 11:04:01,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:04:01,903 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-08-05 11:04:01,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:01,904 INFO L225 Difference]: With dead ends: 29 [2019-08-05 11:04:01,904 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 11:04:01,905 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:04:01,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 11:04:01,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2019-08-05 11:04:01,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 11:04:01,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-08-05 11:04:01,911 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 16 [2019-08-05 11:04:01,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:01,912 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-08-05 11:04:01,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:04:01,912 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-08-05 11:04:01,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 11:04:01,913 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:01,913 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1] [2019-08-05 11:04:01,913 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:01,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:01,914 INFO L82 PathProgramCache]: Analyzing trace with hash 412529371, now seen corresponding path program 4 times [2019-08-05 11:04:01,915 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:02,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:02,172 WARN L254 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 179 conjunts are in the unsatisfiable core [2019-08-05 11:04:02,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:02,223 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-08-05 11:04:02,223 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:02,385 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-08-05 11:04:02,386 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:02,411 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-08-05 11:04:02,412 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:02,582 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-08-05 11:04:02,583 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:02,583 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:02,584 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:23 [2019-08-05 11:04:02,774 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-08-05 11:04:02,785 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:02,805 INFO L392 ElimStorePlain]: Different costs {1=[|ULTIMATE.start_#Ultimate.alloc_old_#length|], 3=[|ULTIMATE.start_#Ultimate.alloc_old_#valid|]} [2019-08-05 11:04:02,854 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:02,855 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2019-08-05 11:04:02,856 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:03,082 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-08-05 11:04:03,083 INFO L567 ElimStorePlain]: treesize reduction 15, result has 85.4 percent of original size [2019-08-05 11:04:03,114 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:03,115 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-08-05 11:04:03,116 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:03,116 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:03,192 INFO L567 ElimStorePlain]: treesize reduction 14, result has 86.0 percent of original size [2019-08-05 11:04:03,199 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-08-05 11:04:03,200 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:03,229 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:03,237 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-08-05 11:04:03,238 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:03,266 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:03,275 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-08-05 11:04:03,276 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:03,302 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:03,303 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:03,303 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:104, output treesize:74 [2019-08-05 11:04:03,595 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2019-08-05 11:04:03,601 INFO L392 ElimStorePlain]: Different costs {3=[|ULTIMATE.start_#Ultimate.alloc_old_#length|], 6=[|ULTIMATE.start_#Ultimate.alloc_old_#valid|]} [2019-08-05 11:04:03,608 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:03,609 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:03,619 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2019-08-05 11:04:03,619 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:03,688 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:03,789 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:03,790 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 99 [2019-08-05 11:04:03,791 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:03,792 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:03,792 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:03,987 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-08-05 11:04:03,988 INFO L567 ElimStorePlain]: treesize reduction 46, result has 82.0 percent of original size [2019-08-05 11:04:03,998 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2019-08-05 11:04:03,998 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:04,154 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2019-08-05 11:04:04,155 INFO L567 ElimStorePlain]: treesize reduction 10, result has 95.0 percent of original size [2019-08-05 11:04:04,181 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:04,181 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 101 [2019-08-05 11:04:04,182 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:04,183 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:04,184 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:04,305 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-08-05 11:04:04,306 INFO L567 ElimStorePlain]: treesize reduction 42, result has 79.6 percent of original size [2019-08-05 11:04:04,329 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:04,329 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 94 [2019-08-05 11:04:04,330 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:04,331 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:04,333 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:04,334 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2019-08-05 11:04:04,671 WARN L188 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2019-08-05 11:04:04,672 INFO L567 ElimStorePlain]: treesize reduction 344, result has 31.1 percent of original size [2019-08-05 11:04:04,673 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:04,674 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:202, output treesize:196 [2019-08-05 11:04:04,884 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2019-08-05 11:04:04,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:04,999 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:05,000 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 53 [2019-08-05 11:04:05,001 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:05,088 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:05,108 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:05,109 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 65 [2019-08-05 11:04:05,110 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:05,315 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 79 [2019-08-05 11:04:05,315 INFO L567 ElimStorePlain]: treesize reduction 16, result has 95.6 percent of original size [2019-08-05 11:04:05,317 INFO L392 ElimStorePlain]: Different costs {2=[|ULTIMATE.start_write~int_old_#memory_int|], 6=[|ULTIMATE.start_write~int_old_#memory_$Pointer$.offset|], 12=[|ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$.base|]} [2019-08-05 11:04:05,334 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:05,335 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 7 [2019-08-05 11:04:05,336 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:05,428 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:05,506 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:05,507 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 211 treesize of output 256 [2019-08-05 11:04:05,509 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:05,509 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:05,510 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:05,510 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:05,511 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:05,512 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:05,514 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:05,515 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:05,515 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:05,517 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:05,518 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:05,518 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:05,518 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:05,519 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:05,520 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:05,521 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:05,522 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:05,522 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:05,524 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:05,728 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 68 [2019-08-05 11:04:05,729 INFO L567 ElimStorePlain]: treesize reduction 148, result has 63.5 percent of original size [2019-08-05 11:04:05,738 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:04:05,743 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:04:05,871 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-08-05 11:04:05,872 INFO L341 Elim1Store]: treesize reduction 8, result has 94.3 percent of original size [2019-08-05 11:04:05,872 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 217 treesize of output 215 [2019-08-05 11:04:05,874 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:05,875 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:05,876 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:05,877 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:05,877 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:05,878 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:05,880 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:05,881 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:05,881 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:05,882 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:05,883 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:05,884 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:05,885 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:05,886 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:05,887 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:05,888 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:05,890 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2019-08-05 11:04:06,350 WARN L188 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 64 [2019-08-05 11:04:06,351 INFO L567 ElimStorePlain]: treesize reduction 2367, result has 9.6 percent of original size [2019-08-05 11:04:06,354 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:06,354 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 9 variables, input treesize:363, output treesize:279 [2019-08-05 11:04:06,492 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 71 treesize of output 47 [2019-08-05 11:04:06,492 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:06,566 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:06,568 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:06,569 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:263, output treesize:239 [2019-08-05 11:04:06,766 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2019-08-05 11:04:06,768 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:06,994 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:06,995 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-08-05 11:04:06,996 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:07,153 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2019-08-05 11:04:07,154 INFO L567 ElimStorePlain]: treesize reduction 78, result has 75.7 percent of original size [2019-08-05 11:04:07,161 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:04:07,162 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:04:07,240 INFO L341 Elim1Store]: treesize reduction 8, result has 88.6 percent of original size [2019-08-05 11:04:07,241 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 141 [2019-08-05 11:04:07,242 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:07,242 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:07,243 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:07,243 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:07,244 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:07,245 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:07,245 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:07,246 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:07,247 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:07,248 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:07,248 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:07,249 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:07,249 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:07,250 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:07,251 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:07,251 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:07,252 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:07,253 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:07,254 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:07,413 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-08-05 11:04:07,414 INFO L567 ElimStorePlain]: treesize reduction 50, result has 71.9 percent of original size [2019-08-05 11:04:07,443 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:07,444 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 61 [2019-08-05 11:04:07,445 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:07,446 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:07,447 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:07,609 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 56 [2019-08-05 11:04:07,610 INFO L567 ElimStorePlain]: treesize reduction 56, result has 61.6 percent of original size [2019-08-05 11:04:07,615 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:04:07,628 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:07,628 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 34 [2019-08-05 11:04:07,629 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:07,670 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:07,672 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:07,673 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:335, output treesize:56 [2019-08-05 11:04:07,770 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:07,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:07,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:04:07,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:04:07,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:04:07,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:04:07,771 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 12 states. [2019-08-05 11:04:08,325 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 87 [2019-08-05 11:04:08,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:08,858 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-08-05 11:04:08,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:04:08,859 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-08-05 11:04:08,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:08,860 INFO L225 Difference]: With dead ends: 34 [2019-08-05 11:04:08,860 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 11:04:08,861 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:04:08,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 11:04:08,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 24. [2019-08-05 11:04:08,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 11:04:08,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2019-08-05 11:04:08,864 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 18 [2019-08-05 11:04:08,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:08,865 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-08-05 11:04:08,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:04:08,865 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2019-08-05 11:04:08,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 11:04:08,865 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:08,866 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1] [2019-08-05 11:04:08,866 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:08,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:08,866 INFO L82 PathProgramCache]: Analyzing trace with hash -665558751, now seen corresponding path program 5 times [2019-08-05 11:04:08,867 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:09,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:09,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 136 conjunts are in the unsatisfiable core [2019-08-05 11:04:09,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:09,159 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-08-05 11:04:09,159 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:09,289 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-08-05 11:04:09,289 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:09,290 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:09,290 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2019-08-05 11:04:09,361 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:09,497 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:09,498 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-08-05 11:04:09,498 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:09,555 INFO L567 ElimStorePlain]: treesize reduction 10, result has 86.5 percent of original size [2019-08-05 11:04:09,561 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:04:09,561 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:09,587 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:09,594 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-08-05 11:04:09,594 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:09,616 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:09,621 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-08-05 11:04:09,621 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:09,642 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:09,643 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:09,643 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:80, output treesize:58 [2019-08-05 11:04:09,730 INFO L392 ElimStorePlain]: Different costs {0=[|v_#valid_29|], 3=[|ULTIMATE.start_#Ultimate.alloc_old_#length|]} [2019-08-05 11:04:09,748 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-08-05 11:04:09,749 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:09,788 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:09,820 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:09,821 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 79 [2019-08-05 11:04:09,822 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:09,917 INFO L567 ElimStorePlain]: treesize reduction 46, result has 74.9 percent of original size [2019-08-05 11:04:09,918 INFO L392 ElimStorePlain]: Different costs {0=[|ULTIMATE.start_write~int_old_#memory_int|], 2=[|ULTIMATE.start_write~int_old_#memory_$Pointer$.offset|, |ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$.base|]} [2019-08-05 11:04:09,926 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-08-05 11:04:09,926 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:09,960 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:09,970 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2019-08-05 11:04:09,971 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:10,001 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:10,025 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:10,026 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 92 [2019-08-05 11:04:10,027 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:10,028 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:10,358 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-08-05 11:04:10,359 INFO L567 ElimStorePlain]: treesize reduction 28, result has 79.7 percent of original size [2019-08-05 11:04:10,360 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:10,360 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:159, output treesize:107 [2019-08-05 11:04:10,425 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 17 [2019-08-05 11:04:10,425 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:10,458 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:10,459 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:10,460 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:114, output treesize:100 [2019-08-05 11:04:10,966 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-08-05 11:04:10,966 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:10,967 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 59 [2019-08-05 11:04:10,967 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:11,501 WARN L188 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2019-08-05 11:04:11,501 INFO L567 ElimStorePlain]: treesize reduction 3, result has 97.2 percent of original size [2019-08-05 11:04:11,554 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:04:11,570 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:04:11,857 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2019-08-05 11:04:11,858 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-08-05 11:04:11,858 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 60 [2019-08-05 11:04:11,859 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:11,862 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:11,863 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:12,381 WARN L188 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-08-05 11:04:12,381 INFO L567 ElimStorePlain]: treesize reduction 8, result has 88.7 percent of original size [2019-08-05 11:04:12,479 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:12,480 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 31 [2019-08-05 11:04:12,481 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:12,483 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:12,817 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 21 [2019-08-05 11:04:12,817 INFO L567 ElimStorePlain]: treesize reduction 10, result has 73.7 percent of original size [2019-08-05 11:04:12,818 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:12,819 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:146, output treesize:17 [2019-08-05 11:04:12,869 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:12,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:12,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:04:12,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:04:12,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:04:12,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:04:12,870 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 10 states. [2019-08-05 11:04:13,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:13,391 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2019-08-05 11:04:13,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:04:13,392 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-08-05 11:04:13,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:13,393 INFO L225 Difference]: With dead ends: 32 [2019-08-05 11:04:13,394 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 11:04:13,394 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:04:13,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 11:04:13,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 11:04:13,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 11:04:13,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-08-05 11:04:13,397 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 19 [2019-08-05 11:04:13,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:13,398 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-08-05 11:04:13,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:04:13,398 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-08-05 11:04:13,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 11:04:13,399 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:13,399 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 1, 1, 1, 1] [2019-08-05 11:04:13,399 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:13,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:13,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1448780043, now seen corresponding path program 6 times [2019-08-05 11:04:13,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:13,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:13,937 WARN L254 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 199 conjunts are in the unsatisfiable core [2019-08-05 11:04:13,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:13,984 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-08-05 11:04:13,984 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:14,127 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-08-05 11:04:14,128 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:14,128 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:14,128 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2019-08-05 11:04:14,166 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:14,187 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:14,188 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-08-05 11:04:14,189 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:14,189 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:14,237 INFO L567 ElimStorePlain]: treesize reduction 10, result has 85.7 percent of original size [2019-08-05 11:04:14,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:04:14,242 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:14,263 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:14,268 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-08-05 11:04:14,269 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:14,288 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:14,294 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-08-05 11:04:14,294 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:14,313 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:14,314 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:14,314 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:76, output treesize:54 [2019-08-05 11:04:14,453 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-08-05 11:04:14,457 INFO L392 ElimStorePlain]: Different costs {3=[|ULTIMATE.start_#Ultimate.alloc_old_#length|], 6=[|ULTIMATE.start_#Ultimate.alloc_old_#valid|]} [2019-08-05 11:04:14,465 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:14,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:14,475 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2019-08-05 11:04:14,476 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:14,544 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:14,595 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:14,596 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 99 [2019-08-05 11:04:14,596 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:14,597 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:14,598 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:14,750 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-08-05 11:04:14,751 INFO L567 ElimStorePlain]: treesize reduction 46, result has 80.1 percent of original size [2019-08-05 11:04:14,752 INFO L392 ElimStorePlain]: Different costs {0=[|ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$.offset|], 2=[|ULTIMATE.start_write~int_old_#memory_int|, |ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$.base|]} [2019-08-05 11:04:14,759 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2019-08-05 11:04:14,760 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:14,824 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:14,830 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2019-08-05 11:04:14,830 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:14,956 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-08-05 11:04:14,957 INFO L567 ElimStorePlain]: treesize reduction 10, result has 93.9 percent of original size [2019-08-05 11:04:14,985 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:14,985 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 94 [2019-08-05 11:04:14,986 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:14,988 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2019-08-05 11:04:15,109 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-08-05 11:04:15,110 INFO L567 ElimStorePlain]: treesize reduction 100, result has 59.3 percent of original size [2019-08-05 11:04:15,111 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:15,111 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:178, output treesize:172 [2019-08-05 11:04:15,159 INFO L392 ElimStorePlain]: Different costs {10=[|ULTIMATE.start_#Ultimate.alloc_old_#length|], 15=[|ULTIMATE.start_#Ultimate.alloc_old_#valid|]} [2019-08-05 11:04:15,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:15,185 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:15,187 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:15,189 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:15,362 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-08-05 11:04:15,362 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:15,362 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 163 [2019-08-05 11:04:15,363 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:15,594 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2019-08-05 11:04:15,594 INFO L567 ElimStorePlain]: treesize reduction 181, result has 61.3 percent of original size [2019-08-05 11:04:15,603 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:15,659 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:15,659 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 179 [2019-08-05 11:04:15,661 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:15,893 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 83 [2019-08-05 11:04:15,894 INFO L567 ElimStorePlain]: treesize reduction 90, result has 77.4 percent of original size [2019-08-05 11:04:15,896 INFO L392 ElimStorePlain]: Different costs {2=[|ULTIMATE.start_write~int_old_#memory_int|, |ULTIMATE.start_write~int_old_#memory_$Pointer$.offset|], 12=[|ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$.base|]} [2019-08-05 11:04:15,905 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:15,906 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2019-08-05 11:04:15,907 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:15,996 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:16,022 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:16,023 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 38 [2019-08-05 11:04:16,023 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:16,115 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:16,235 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-08-05 11:04:16,236 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:16,236 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 235 treesize of output 252 [2019-08-05 11:04:16,238 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:16,239 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:16,239 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,240 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,240 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,241 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,241 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,242 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:16,243 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,244 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,245 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,246 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,247 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,248 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,248 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,249 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,250 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,250 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:16,251 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,252 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,253 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,254 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,255 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,255 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,257 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,257 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,258 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:16,258 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,259 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,260 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,261 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,262 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,263 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,263 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,265 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,266 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,266 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,267 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,268 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,268 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,269 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,270 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,271 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,271 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,272 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,273 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,274 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,275 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,275 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,276 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:16,277 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,278 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,279 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,281 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,281 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,282 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,283 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,283 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,284 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:16,285 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,286 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,287 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,288 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,288 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,289 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,290 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,291 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,291 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,292 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,292 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,293 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,294 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:16,294 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,295 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,296 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,298 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,298 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,299 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,300 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,301 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,303 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,303 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,304 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,305 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,305 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,307 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,307 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,309 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,309 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,310 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,311 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,311 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,312 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,313 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,314 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,314 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,315 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,315 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,316 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,316 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,317 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,318 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,319 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,319 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,320 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,320 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,321 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:16,322 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,323 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,324 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,324 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,325 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,325 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,326 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,327 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,327 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,329 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,330 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,331 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:16,332 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,334 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,335 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,337 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:16,338 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,340 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,341 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,342 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,343 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,346 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,347 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,348 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,349 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,351 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,352 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,353 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,354 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,356 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,356 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,358 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,359 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,360 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,361 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,362 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,363 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,364 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,365 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,366 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,368 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,370 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,371 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,372 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,373 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,375 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,376 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,377 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,378 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,379 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,380 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,381 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,382 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,383 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,384 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,386 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,387 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,389 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,390 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,391 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,392 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,393 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,394 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,395 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,397 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,398 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,399 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,400 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,403 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,403 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,404 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,404 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,406 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:16,406 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,408 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,409 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,410 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,411 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,412 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,412 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,413 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,414 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,416 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:16,416 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,418 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,419 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,427 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,428 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,429 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,430 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,431 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,432 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,433 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,434 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,435 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,436 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,437 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,438 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,439 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,440 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,441 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,442 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,442 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:16,446 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,447 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,448 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:16,450 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,450 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,452 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,452 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,453 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,454 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,455 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,456 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,457 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,458 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,459 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,459 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,461 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:16,461 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,462 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,463 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,463 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,464 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,465 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,466 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,467 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,469 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,470 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,471 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,472 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,473 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,474 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,476 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:16,477 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,478 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,480 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,480 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,481 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,481 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,482 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,483 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,484 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,484 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,485 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,485 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:16,494 INFO L496 ElimStorePlain]: Start of recursive call 6: 25 dim-0 vars, End of recursive call: 25 dim-0 vars, and 6 xjuncts. [2019-08-05 11:04:17,962 WARN L188 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 593 DAG size of output: 68 [2019-08-05 11:04:17,962 INFO L567 ElimStorePlain]: treesize reduction 7150, result has 3.4 percent of original size [2019-08-05 11:04:18,076 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-08-05 11:04:18,078 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:18,078 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 10 variables, input treesize:305, output treesize:286 [2019-08-05 11:04:18,372 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-08-05 11:04:18,514 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:18,554 INFO L235 Elim1Store]: Index analysis took 120 ms [2019-08-05 11:04:18,844 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-08-05 11:04:18,845 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:18,845 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 80 [2019-08-05 11:04:18,846 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:19,478 WARN L188 SmtUtils]: Spent 630.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-08-05 11:04:19,478 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:19,599 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:19,599 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 94 [2019-08-05 11:04:19,600 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:20,245 WARN L188 SmtUtils]: Spent 644.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 77 [2019-08-05 11:04:20,246 INFO L567 ElimStorePlain]: treesize reduction 22, result has 94.8 percent of original size [2019-08-05 11:04:20,247 INFO L392 ElimStorePlain]: Different costs {2=[|ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$.offset|], 12=[|ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$.base|]} [2019-08-05 11:04:20,255 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 40 [2019-08-05 11:04:20,256 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:20,352 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:20,458 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:20,459 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 357 treesize of output 259 [2019-08-05 11:04:20,460 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:20,461 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:20,461 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:20,462 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:20,463 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:20,464 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:20,465 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:20,466 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:20,467 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:20,467 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:20,469 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:20,470 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:20,470 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:20,471 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:20,472 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:20,473 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:20,473 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:20,475 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:20,476 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:20,476 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:20,477 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:20,478 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:20,479 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:20,480 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:20,480 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:20,481 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:20,482 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:20,483 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:20,484 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:20,484 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:20,485 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:20,486 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:20,487 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:20,488 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:20,488 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:20,489 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:20,490 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:20,491 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:20,492 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:20,493 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:20,494 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:20,494 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:20,495 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:20,496 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:20,498 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2019-08-05 11:04:20,831 WARN L188 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 70 [2019-08-05 11:04:20,831 INFO L567 ElimStorePlain]: treesize reduction 3236, result has 10.0 percent of original size [2019-08-05 11:04:20,833 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:20,834 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:410, output treesize:414 [2019-08-05 11:04:20,921 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:20,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:20,989 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-08-05 11:04:20,989 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:21,218 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-08-05 11:04:21,219 INFO L567 ElimStorePlain]: treesize reduction 16, result has 96.5 percent of original size [2019-08-05 11:04:21,220 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_int|], 6=[|#memory_$Pointer$.offset|], 20=[|#memory_$Pointer$.base|]} [2019-08-05 11:04:21,226 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:21,226 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-08-05 11:04:21,227 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:21,329 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-08-05 11:04:21,329 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:21,364 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:04:21,366 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 35 [2019-08-05 11:04:21,366 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:22,228 WARN L188 SmtUtils]: Spent 861.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-08-05 11:04:22,228 INFO L567 ElimStorePlain]: treesize reduction 23, result has 93.7 percent of original size [2019-08-05 11:04:22,331 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:22,331 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 321 treesize of output 214 [2019-08-05 11:04:22,333 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:22,333 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:22,334 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:22,334 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:22,335 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:22,335 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:22,336 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:22,336 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:22,337 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:22,337 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:22,338 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:22,339 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:22,339 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:22,340 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:22,341 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:22,341 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:22,342 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:22,343 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:22,345 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:22,345 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:22,346 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:22,346 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:22,347 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:22,347 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:22,348 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:22,348 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:22,349 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:22,349 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:22,350 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:22,351 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:22,351 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:22,352 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:22,353 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:22,354 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:22,354 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:22,356 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:22,357 INFO L496 ElimStorePlain]: Start of recursive call 5: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:22,526 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 59 [2019-08-05 11:04:22,527 INFO L567 ElimStorePlain]: treesize reduction 117, result has 47.8 percent of original size [2019-08-05 11:04:22,706 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:22,707 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:474, output treesize:74 [2019-08-05 11:04:22,793 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:22,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:22,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:04:22,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:04:22,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:04:22,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:04:22,795 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 11 states. [2019-08-05 11:04:23,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:23,887 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2019-08-05 11:04:23,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:04:23,887 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-08-05 11:04:23,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:23,888 INFO L225 Difference]: With dead ends: 36 [2019-08-05 11:04:23,888 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 11:04:23,889 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:04:23,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 11:04:23,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 26. [2019-08-05 11:04:23,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 11:04:23,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2019-08-05 11:04:23,892 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 20 [2019-08-05 11:04:23,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:23,892 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2019-08-05 11:04:23,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:04:23,892 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2019-08-05 11:04:23,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 11:04:23,893 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:23,893 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:04:23,893 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:23,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:23,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1763391559, now seen corresponding path program 7 times [2019-08-05 11:04:23,894 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:24,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:24,159 WARN L254 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 181 conjunts are in the unsatisfiable core [2019-08-05 11:04:24,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:24,215 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-08-05 11:04:24,215 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:24,320 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-08-05 11:04:24,320 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:24,320 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:24,320 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2019-08-05 11:04:24,335 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:24,337 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_33|], 3=[|ULTIMATE.start_#Ultimate.alloc_old_#valid|]} [2019-08-05 11:04:24,343 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2019-08-05 11:04:24,343 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:24,402 INFO L567 ElimStorePlain]: treesize reduction 13, result has 85.7 percent of original size [2019-08-05 11:04:24,428 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:24,428 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-08-05 11:04:24,429 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:24,492 INFO L567 ElimStorePlain]: treesize reduction 14, result has 84.4 percent of original size [2019-08-05 11:04:24,514 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-08-05 11:04:24,514 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:24,539 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:24,553 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-08-05 11:04:24,554 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:24,575 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:24,581 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-08-05 11:04:24,581 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:24,601 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:24,601 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:24,602 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:98, output treesize:67 [2019-08-05 11:04:24,644 INFO L392 ElimStorePlain]: Different costs {0=[|ULTIMATE.start_#Ultimate.alloc_old_#length|, |v_#length_34|], 3=[|ULTIMATE.start_#Ultimate.alloc_old_#valid|]} [2019-08-05 11:04:24,675 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-08-05 11:04:24,675 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:24,807 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-08-05 11:04:24,808 INFO L567 ElimStorePlain]: treesize reduction 9, result has 96.0 percent of original size [2019-08-05 11:04:24,814 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-08-05 11:04:24,814 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:24,889 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:24,964 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:24,965 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2019-08-05 11:04:24,965 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:25,013 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:25,021 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2019-08-05 11:04:25,021 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:25,103 INFO L567 ElimStorePlain]: treesize reduction 10, result has 94.4 percent of original size [2019-08-05 11:04:25,126 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:25,127 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 141 [2019-08-05 11:04:25,128 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:25,211 INFO L567 ElimStorePlain]: treesize reduction 42, result has 74.1 percent of original size [2019-08-05 11:04:25,215 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:04:25,225 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:25,226 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 70 [2019-08-05 11:04:25,226 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:25,227 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2019-08-05 11:04:25,291 INFO L567 ElimStorePlain]: treesize reduction 70, result has 61.3 percent of original size [2019-08-05 11:04:25,292 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:25,292 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:224, output treesize:124 [2019-08-05 11:04:25,344 INFO L392 ElimStorePlain]: Different costs {0=[|v_#valid_36|], 1=[|ULTIMATE.start_#Ultimate.alloc_old_#length|]} [2019-08-05 11:04:25,377 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2019-08-05 11:04:25,377 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:25,600 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-08-05 11:04:25,601 INFO L567 ElimStorePlain]: treesize reduction 13, result has 94.3 percent of original size [2019-08-05 11:04:25,620 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:25,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 83 [2019-08-05 11:04:25,621 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:25,622 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:25,707 INFO L567 ElimStorePlain]: treesize reduction 58, result has 78.7 percent of original size [2019-08-05 11:04:25,708 INFO L392 ElimStorePlain]: Different costs {2=[|ULTIMATE.start_write~int_old_#memory_int|], 6=[|ULTIMATE.start_write~int_old_#memory_$Pointer$.offset|, |ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$.base|]} [2019-08-05 11:04:25,724 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:25,725 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2019-08-05 11:04:25,726 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:25,752 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:25,756 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:25,757 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 101 [2019-08-05 11:04:25,758 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:25,783 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:25,791 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:04:25,829 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:25,830 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 162 treesize of output 145 [2019-08-05 11:04:25,831 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:25,832 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:25,832 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:25,833 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:25,834 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:25,931 INFO L567 ElimStorePlain]: treesize reduction 458, result has 26.6 percent of original size [2019-08-05 11:04:25,932 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:25,932 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:242, output treesize:162 [2019-08-05 11:04:26,109 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,121 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 350 treesize of output 334 [2019-08-05 11:04:26,122 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:26,282 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 102 [2019-08-05 11:04:26,282 INFO L567 ElimStorePlain]: treesize reduction 138, result has 79.8 percent of original size [2019-08-05 11:04:26,291 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 281 treesize of output 265 [2019-08-05 11:04:26,291 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:26,366 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:26,368 INFO L392 ElimStorePlain]: Different costs {0=[v_prenex_31, |#memory_int|], 19=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|, v_prenex_28, v_prenex_26]} [2019-08-05 11:04:26,376 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 262 treesize of output 230 [2019-08-05 11:04:26,377 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:26,452 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:26,458 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 262 treesize of output 230 [2019-08-05 11:04:26,459 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:26,539 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:26,544 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:04:26,695 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-08-05 11:04:26,696 INFO L341 Elim1Store]: treesize reduction 8, result has 93.1 percent of original size [2019-08-05 11:04:26,696 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 227 treesize of output 231 [2019-08-05 11:04:26,698 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,699 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,699 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,699 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,700 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,700 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,700 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,701 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,701 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,702 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,702 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,703 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,703 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,703 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,704 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,705 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,705 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,705 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,706 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,706 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,706 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,707 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,708 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,708 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,708 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,709 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,710 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,710 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,710 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,711 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,711 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,712 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,712 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,713 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,713 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,714 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,714 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,715 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,715 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,715 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,716 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,716 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,717 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,717 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,718 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,718 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,719 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,719 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,720 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,721 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,722 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,722 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,723 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,725 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,725 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,726 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,726 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,727 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,727 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,728 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,729 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,729 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,730 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,731 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,732 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,733 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,733 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,734 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,734 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,735 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,736 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,736 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,737 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,738 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,739 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,739 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,740 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,741 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,742 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,742 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,743 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,744 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,745 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,745 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,746 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,746 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,747 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,748 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,748 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,749 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,750 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,751 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,751 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,753 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,753 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,754 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,754 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,755 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,755 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,756 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,756 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,757 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,757 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,758 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,759 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,759 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:26,761 INFO L496 ElimStorePlain]: Start of recursive call 6: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:26,944 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 82 [2019-08-05 11:04:26,944 INFO L567 ElimStorePlain]: treesize reduction 165, result has 66.2 percent of original size [2019-08-05 11:04:26,960 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:26,961 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 76 [2019-08-05 11:04:26,962 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:27,008 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:27,013 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:27,052 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:27,052 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 5 case distinctions, treesize of input 227 treesize of output 209 [2019-08-05 11:04:27,054 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:27,054 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:27,055 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:27,056 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:27,056 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:27,056 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:27,057 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:27,136 INFO L567 ElimStorePlain]: treesize reduction 46, result has 73.9 percent of original size [2019-08-05 11:04:27,160 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:27,161 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 73 [2019-08-05 11:04:27,162 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:27,162 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:27,163 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:27,163 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:27,164 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:27,164 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:27,165 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:27,165 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:27,166 INFO L496 ElimStorePlain]: Start of recursive call 9: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:27,243 INFO L567 ElimStorePlain]: treesize reduction 28, result has 71.7 percent of original size [2019-08-05 11:04:27,244 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, 6 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-08-05 11:04:27,244 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 10 variables, input treesize:701, output treesize:39 [2019-08-05 11:04:27,306 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:27,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:27,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:04:27,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:04:27,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:04:27,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:04:27,307 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 12 states. [2019-08-05 11:04:28,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:28,264 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2019-08-05 11:04:28,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:04:28,265 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-08-05 11:04:28,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:28,266 INFO L225 Difference]: With dead ends: 44 [2019-08-05 11:04:28,266 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 11:04:28,266 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:04:28,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 11:04:28,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 29. [2019-08-05 11:04:28,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 11:04:28,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-08-05 11:04:28,270 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 21 [2019-08-05 11:04:28,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:28,270 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-08-05 11:04:28,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:04:28,270 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-08-05 11:04:28,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 11:04:28,271 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:28,271 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 3, 2, 2, 1, 1, 1, 1] [2019-08-05 11:04:28,271 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:28,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:28,272 INFO L82 PathProgramCache]: Analyzing trace with hash 834235535, now seen corresponding path program 8 times [2019-08-05 11:04:28,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:28,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:28,872 WARN L254 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 253 conjunts are in the unsatisfiable core [2019-08-05 11:04:28,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:28,919 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-08-05 11:04:28,919 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:29,044 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-08-05 11:04:29,044 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:29,045 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:29,045 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2019-08-05 11:04:29,202 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-08-05 11:04:29,206 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:29,219 INFO L392 ElimStorePlain]: Different costs {0=[|ULTIMATE.start_#Ultimate.alloc_old_#length|, |v_#length_36|], 3=[|ULTIMATE.start_#Ultimate.alloc_old_#valid|]} [2019-08-05 11:04:29,245 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-08-05 11:04:29,246 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:29,339 INFO L567 ElimStorePlain]: treesize reduction 8, result has 91.8 percent of original size [2019-08-05 11:04:29,362 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2019-08-05 11:04:29,362 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:29,438 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:29,458 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:29,459 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-08-05 11:04:29,459 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:29,529 INFO L567 ElimStorePlain]: treesize reduction 14, result has 85.3 percent of original size [2019-08-05 11:04:29,533 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-08-05 11:04:29,533 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:29,562 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:29,569 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-08-05 11:04:29,569 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:29,597 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:29,602 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-08-05 11:04:29,603 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:29,626 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:29,627 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:29,627 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:99, output treesize:78 [2019-08-05 11:04:29,663 INFO L392 ElimStorePlain]: Different costs {1=[|ULTIMATE.start_#Ultimate.alloc_old_#length|], 6=[|ULTIMATE.start_#Ultimate.alloc_old_#valid|]} [2019-08-05 11:04:29,670 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:29,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2019-08-05 11:04:29,671 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:29,795 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-08-05 11:04:29,795 INFO L567 ElimStorePlain]: treesize reduction 14, result has 92.6 percent of original size [2019-08-05 11:04:29,837 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:29,838 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 99 [2019-08-05 11:04:29,839 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:29,992 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-08-05 11:04:29,992 INFO L567 ElimStorePlain]: treesize reduction 46, result has 80.0 percent of original size [2019-08-05 11:04:30,012 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2019-08-05 11:04:30,013 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:30,132 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-08-05 11:04:30,132 INFO L567 ElimStorePlain]: treesize reduction 10, result has 94.3 percent of original size [2019-08-05 11:04:30,157 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:30,158 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 77 [2019-08-05 11:04:30,158 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:30,265 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-08-05 11:04:30,265 INFO L567 ElimStorePlain]: treesize reduction 46, result has 76.3 percent of original size [2019-08-05 11:04:30,299 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:04:30,360 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:30,360 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 79 [2019-08-05 11:04:30,361 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:30,361 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:30,362 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:30,363 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2019-08-05 11:04:30,483 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-08-05 11:04:30,484 INFO L567 ElimStorePlain]: treesize reduction 162, result has 46.2 percent of original size [2019-08-05 11:04:30,485 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:30,485 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:201, output treesize:171 [2019-08-05 11:04:30,647 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 86 [2019-08-05 11:04:30,650 INFO L392 ElimStorePlain]: Different costs {3=[|ULTIMATE.start_#Ultimate.alloc_old_#length|], 10=[|ULTIMATE.start_#Ultimate.alloc_old_#valid|]} [2019-08-05 11:04:30,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:30,659 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:30,668 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2019-08-05 11:04:30,668 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:30,765 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:30,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:30,832 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:30,833 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 189 [2019-08-05 11:04:30,834 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:31,102 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 86 [2019-08-05 11:04:31,103 INFO L567 ElimStorePlain]: treesize reduction 96, result has 78.4 percent of original size [2019-08-05 11:04:31,109 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:31,111 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 46 [2019-08-05 11:04:31,111 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:31,295 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 82 [2019-08-05 11:04:31,295 INFO L567 ElimStorePlain]: treesize reduction 22, result has 93.4 percent of original size [2019-08-05 11:04:31,302 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:31,304 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:31,305 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 52 [2019-08-05 11:04:31,306 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:31,393 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:31,401 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:04:31,444 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:31,445 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 244 treesize of output 190 [2019-08-05 11:04:31,446 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:31,446 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:31,447 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:31,447 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:31,448 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:31,449 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:31,718 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 75 [2019-08-05 11:04:31,719 INFO L567 ElimStorePlain]: treesize reduction 876, result has 23.1 percent of original size [2019-08-05 11:04:31,720 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:31,720 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:325, output treesize:331 [2019-08-05 11:04:32,028 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 110 [2019-08-05 11:04:32,031 INFO L392 ElimStorePlain]: Different costs {6=[|ULTIMATE.start_#Ultimate.alloc_old_#length|], 15=[|ULTIMATE.start_#Ultimate.alloc_old_#valid|]} [2019-08-05 11:04:32,040 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:32,042 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:32,044 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:32,050 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:32,050 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 97 [2019-08-05 11:04:32,051 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:32,381 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 107 [2019-08-05 11:04:32,381 INFO L567 ElimStorePlain]: treesize reduction 48, result has 92.0 percent of original size [2019-08-05 11:04:32,392 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:32,394 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:32,401 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:32,482 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:32,483 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 68 treesize of output 309 [2019-08-05 11:04:32,484 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:32,878 WARN L188 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 112 [2019-08-05 11:04:32,879 INFO L567 ElimStorePlain]: treesize reduction 164, result has 78.5 percent of original size [2019-08-05 11:04:32,913 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:32,915 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:32,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:32,917 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 74 [2019-08-05 11:04:32,918 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:33,219 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 106 [2019-08-05 11:04:33,220 INFO L567 ElimStorePlain]: treesize reduction 56, result has 90.3 percent of original size [2019-08-05 11:04:33,228 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:33,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:33,231 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:33,232 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:33,234 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:33,242 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 82 [2019-08-05 11:04:33,243 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:33,381 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-08-05 11:04:33,382 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:33,390 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:04:33,477 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:33,478 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 446 treesize of output 314 [2019-08-05 11:04:33,480 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,481 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,482 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,482 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,483 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:33,484 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,484 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,485 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,486 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,487 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:33,487 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,489 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,490 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:33,490 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:33,491 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,492 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,493 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,494 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,495 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:33,495 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,496 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:33,497 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,497 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,498 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,498 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,499 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,500 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,500 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,501 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:33,501 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,502 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:33,502 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,503 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,503 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,504 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,504 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,505 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,505 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,506 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:33,506 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,507 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,507 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,508 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,508 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:33,508 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,509 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,509 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,509 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:33,510 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,510 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,511 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,511 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,512 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,512 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,513 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,514 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:33,514 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,515 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,516 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,517 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,517 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:33,518 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,518 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,519 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,520 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,521 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,522 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,522 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,523 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,524 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,524 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,525 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:33,525 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,526 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,527 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,527 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:33,528 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,528 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,529 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,530 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,530 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,531 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,532 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,532 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,533 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,533 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:33,533 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,534 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,534 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,535 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,535 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,536 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,536 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:33,536 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,537 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,537 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,538 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,539 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:33,539 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:33,539 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,540 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,541 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:33,541 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,541 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:33,542 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,542 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,542 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,543 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,543 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,544 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:33,544 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,544 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,545 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,545 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,546 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:33,546 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,546 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:33,547 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,547 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,547 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,548 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,548 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,549 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:33,549 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,549 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,550 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,550 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,551 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,551 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,552 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,552 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:33,552 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,552 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,553 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,553 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:33,554 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,554 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:33,554 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,554 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,555 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,555 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,556 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,556 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:33,556 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,557 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,557 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,557 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,558 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,559 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,559 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:33,560 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,560 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,561 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,562 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,563 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:33,563 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,565 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,565 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:33,566 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:33,567 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,567 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,569 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,570 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,571 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,571 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,572 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:33,572 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,573 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,573 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,574 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:33,574 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,575 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:33,575 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,576 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,576 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,577 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,577 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,578 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:33,578 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,579 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,579 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,580 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,586 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,587 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,588 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,588 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:33,589 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,589 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,590 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,590 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,591 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,591 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,592 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,593 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,593 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:33,594 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,595 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:33,595 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,596 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:33,596 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,596 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,597 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,598 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,598 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,599 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:33,599 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,600 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,600 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,601 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,602 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,603 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,604 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,604 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,605 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,605 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:33,606 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,607 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,607 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,608 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:33,608 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,609 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,609 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,610 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,611 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,611 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,612 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:33,612 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,613 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,614 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,614 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,615 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:33,616 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,617 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,618 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:33,618 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:33,619 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,620 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,621 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:33,630 INFO L496 ElimStorePlain]: Start of recursive call 6: 18 dim-0 vars, End of recursive call: 18 dim-0 vars, and 5 xjuncts. [2019-08-05 11:04:35,598 WARN L188 SmtUtils]: Spent 1.97 s on a formula simplification. DAG size of input: 928 DAG size of output: 98 [2019-08-05 11:04:35,598 INFO L567 ElimStorePlain]: treesize reduction 13108, result has 3.3 percent of original size [2019-08-05 11:04:35,600 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:35,601 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 10 variables, input treesize:554, output treesize:537 [2019-08-05 11:04:35,673 INFO L392 ElimStorePlain]: Different costs {10=[|ULTIMATE.start_#Ultimate.alloc_old_#length|], 15=[|ULTIMATE.start_#Ultimate.alloc_old_#valid|]} [2019-08-05 11:04:35,725 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:35,733 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:35,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:35,739 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:35,755 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:35,756 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 230 [2019-08-05 11:04:35,757 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:36,100 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 103 [2019-08-05 11:04:36,101 INFO L567 ElimStorePlain]: treesize reduction 236, result has 75.2 percent of original size [2019-08-05 11:04:36,110 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:36,114 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:36,116 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:36,120 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:36,122 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:36,128 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:36,157 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:36,158 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 91 treesize of output 119 [2019-08-05 11:04:36,159 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:36,306 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-08-05 11:04:36,307 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:36,308 INFO L392 ElimStorePlain]: Different costs {12=[|ULTIMATE.start_write~int_old_#memory_int|], 20=[|ULTIMATE.start_write~int_old_#memory_$Pointer$.offset|, |ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$.base|]} [2019-08-05 11:04:36,315 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:36,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:36,319 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:36,321 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:36,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:36,324 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:36,325 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 13 [2019-08-05 11:04:36,326 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:36,457 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-08-05 11:04:36,458 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:36,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:36,464 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:36,465 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:36,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:36,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:36,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:36,471 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 298 treesize of output 213 [2019-08-05 11:04:36,472 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:36,588 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-08-05 11:04:36,588 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:36,592 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:04:36,751 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-08-05 11:04:36,752 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:36,752 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 580 treesize of output 391 [2019-08-05 11:04:36,754 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,755 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,756 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,756 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:36,756 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:36,757 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,757 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,758 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:36,758 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,759 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,760 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:36,760 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,761 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,762 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,762 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,763 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:36,763 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,764 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,765 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,766 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,767 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:36,767 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,767 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,768 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:36,769 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,769 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,770 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,771 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,771 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:36,772 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,773 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,775 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,775 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,776 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:36,777 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,782 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,784 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:36,784 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,785 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,786 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,787 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,787 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:36,788 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,788 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,790 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:36,790 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,791 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,792 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:36,792 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,793 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,794 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:36,794 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,795 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,797 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,797 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,798 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:36,799 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,800 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,802 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,802 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,803 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:36,804 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,804 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,805 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:36,806 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,807 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,808 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,809 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,809 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:36,810 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,811 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,813 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,814 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,814 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:36,815 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,816 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,817 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:36,817 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,818 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,820 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,820 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,821 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:36,822 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,823 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,825 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:36,825 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,826 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,827 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:36,828 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,828 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,829 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:36,829 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,830 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,831 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,831 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,832 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:36,832 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,833 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,834 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,835 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,835 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:36,836 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,836 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,836 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:36,837 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,838 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,839 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,839 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,840 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:36,840 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,841 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,842 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,842 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,843 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:36,843 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,844 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,845 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:36,845 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,846 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,848 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,848 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,849 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:36,850 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,851 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,866 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:38,200 WARN L188 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 208 DAG size of output: 74 [2019-08-05 11:04:38,201 INFO L567 ElimStorePlain]: treesize reduction 46396, result has 0.9 percent of original size [2019-08-05 11:04:38,202 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:38,203 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 9 variables, input treesize:772, output treesize:704 [2019-08-05 11:04:38,534 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:04:38,535 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:04:38,838 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-08-05 11:04:38,838 INFO L341 Elim1Store]: treesize reduction 8, result has 95.8 percent of original size [2019-08-05 11:04:38,839 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 11 new quantified variables, introduced 15 case distinctions, treesize of input 646 treesize of output 324 [2019-08-05 11:04:38,841 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,842 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,843 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,843 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,844 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,844 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,845 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,845 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,846 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,846 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,846 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,847 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,848 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,849 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,849 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,850 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,850 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,851 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,852 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,853 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,853 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,854 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,855 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,856 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,857 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,858 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,858 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,858 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,859 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,859 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,859 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,861 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,861 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,862 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,862 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,863 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,863 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,864 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,864 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,865 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,866 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,866 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,867 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,867 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,868 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,869 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,870 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,871 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,871 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,872 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,872 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,873 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,873 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,874 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,874 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,874 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,875 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,875 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,876 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,876 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,877 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,877 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,878 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,878 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,879 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,879 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,880 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,880 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,881 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,881 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,882 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,882 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,883 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,884 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,885 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,886 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,886 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,887 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,887 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,887 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,888 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,888 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,889 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,889 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,890 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,890 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,891 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,892 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,892 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,893 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,894 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,894 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,895 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,895 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,896 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,896 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,897 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,897 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,898 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,898 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,900 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,901 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,901 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,903 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,904 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,905 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,906 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,907 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,908 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,910 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,910 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,912 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,913 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,914 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,914 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,915 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,915 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,916 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,917 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,918 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,919 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,919 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,920 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,921 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,921 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,923 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,923 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,924 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,924 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,925 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,926 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,926 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,927 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,928 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,928 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,929 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,930 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,930 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,932 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,933 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,934 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,934 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,935 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,936 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,937 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,937 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,938 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,938 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,939 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,940 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,942 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,943 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,943 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,943 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,944 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,945 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,945 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,946 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,946 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,947 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,947 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,949 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,949 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,950 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,951 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,952 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,952 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,953 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,955 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,955 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,956 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,957 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,959 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,959 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,961 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,962 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,962 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,962 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,963 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,963 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,964 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,966 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,966 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,967 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,968 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,968 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,969 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,969 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,970 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,970 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,971 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,971 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,972 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,972 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,973 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,974 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,975 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,975 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,976 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,977 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,982 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,983 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,983 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,985 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,986 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,986 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,987 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,988 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,988 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,989 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,990 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,991 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,992 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,992 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,993 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,993 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,994 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,995 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,996 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,997 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,998 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,998 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,999 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,000 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,001 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,002 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,002 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,003 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,003 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,003 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,004 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,004 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,005 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,005 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,006 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,006 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,007 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,007 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,008 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,009 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,009 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,010 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,010 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,010 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,011 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,011 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,012 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,013 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,013 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,014 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,015 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,016 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,016 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,018 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,019 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,020 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,020 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,021 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,022 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,024 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,025 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,027 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,028 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,028 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,029 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,030 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,030 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,032 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,032 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,034 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,035 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,035 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,036 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,036 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,037 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,039 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,040 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,040 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,041 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,042 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,042 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,043 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,044 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,044 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,045 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,046 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,047 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,048 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,049 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,051 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,052 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,052 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,053 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,056 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,056 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,057 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,058 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,058 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,059 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,060 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:39,061 INFO L496 ElimStorePlain]: Start of recursive call 2: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:39,442 WARN L188 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 89 [2019-08-05 11:04:39,442 INFO L567 ElimStorePlain]: treesize reduction 178, result has 51.4 percent of original size [2019-08-05 11:04:39,454 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:39,454 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 46 [2019-08-05 11:04:39,455 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:39,603 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-08-05 11:04:39,604 INFO L567 ElimStorePlain]: treesize reduction 7, result has 94.5 percent of original size [2019-08-05 11:04:39,660 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:39,661 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:677, output treesize:74 [2019-08-05 11:04:39,719 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-08-05 11:04:39,719 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:39,753 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:39,754 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:39,755 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:72 [2019-08-05 11:04:39,809 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:39,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:39,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:04:39,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:04:39,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:04:39,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:04:39,810 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 14 states. [2019-08-05 11:04:54,137 WARN L193 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000) stderr output: (error "out of memory") [2019-08-05 11:04:54,139 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:122) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:137) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:102) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.pop(ManagedScript.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertPostcondition(IncrementalHoareTripleChecker.java:660) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:264) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:279) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.ProtectiveHoareTripleChecker.releaseLock(ProtectiveHoareTripleChecker.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.releaseLock(EfficientHoareTripleChecker.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:712) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:625) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:467) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.io.IOException: Stream closed at java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:433) at java.io.OutputStream.write(OutputStream.java:116) at java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:82) at java.io.BufferedOutputStream.flush(BufferedOutputStream.java:140) at sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:297) at sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:141) at java.io.OutputStreamWriter.flush(OutputStreamWriter.java:229) at java.io.BufferedWriter.flush(BufferedWriter.java:254) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:119) ... 28 more [2019-08-05 11:04:54,144 INFO L168 Benchmark]: Toolchain (without parser) took 59278.75 ms. Allocated memory was 135.3 MB in the beginning and 541.6 MB in the end (delta: 406.3 MB). Free memory was 112.0 MB in the beginning and 320.5 MB in the end (delta: -208.5 MB). Peak memory consumption was 197.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:04:54,144 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 135.3 MB. Free memory was 114.0 MB in the beginning and 113.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-08-05 11:04:54,144 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.20 ms. Allocated memory is still 135.3 MB. Free memory was 112.0 MB in the beginning and 110.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-08-05 11:04:54,145 INFO L168 Benchmark]: Boogie Preprocessor took 34.11 ms. Allocated memory is still 135.3 MB. Free memory was 110.0 MB in the beginning and 108.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2019-08-05 11:04:54,145 INFO L168 Benchmark]: RCFGBuilder took 730.00 ms. Allocated memory is still 135.3 MB. Free memory was 108.5 MB in the beginning and 82.9 MB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. [2019-08-05 11:04:54,145 INFO L168 Benchmark]: TraceAbstraction took 58466.42 ms. Allocated memory was 135.3 MB in the beginning and 541.6 MB in the end (delta: 406.3 MB). Free memory was 82.7 MB in the beginning and 320.5 MB in the end (delta: -237.8 MB). Peak memory consumption was 168.6 MB. Max. memory is 7.1 GB. [2019-08-05 11:04:54,147 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 135.3 MB. Free memory was 114.0 MB in the beginning and 113.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 43.20 ms. Allocated memory is still 135.3 MB. Free memory was 112.0 MB in the beginning and 110.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.11 ms. Allocated memory is still 135.3 MB. Free memory was 110.0 MB in the beginning and 108.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 730.00 ms. Allocated memory is still 135.3 MB. Free memory was 108.5 MB in the beginning and 82.9 MB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 58466.42 ms. Allocated memory was 135.3 MB in the beginning and 541.6 MB in the end (delta: 406.3 MB). Free memory was 82.7 MB in the beginning and 320.5 MB in the end (delta: -237.8 MB). Peak memory consumption was 168.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:122) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...