WORST_CASE(Omega(1),?)

### Pre-processing the ITS problem ###

Initial linear ITS problem
   Start location: l7
      0: l0 -> l1 : Result_4^0'=Result_4^post_1, __disjvr_0^0'=__disjvr_0^post_1, tmp_7^0'=tmp_7^post_1, x_5^0'=x_5^post_1, y_6^0'=y_6^post_1, [ x_5^0<=0 && Result_4^post_1==Result_4^post_1 && __disjvr_0^0==__disjvr_0^post_1 && tmp_7^0==tmp_7^post_1 && x_5^0==x_5^post_1 && y_6^0==y_6^post_1 ], cost: 1
      1: l0 -> l1 : Result_4^0'=Result_4^post_2, __disjvr_0^0'=__disjvr_0^post_2, tmp_7^0'=tmp_7^post_2, x_5^0'=x_5^post_2, y_6^0'=y_6^post_2, [ 0<=-1+x_5^0 && y_6^0<=0 && Result_4^post_2==Result_4^post_2 && __disjvr_0^0==__disjvr_0^post_2 && tmp_7^0==tmp_7^post_2 && x_5^0==x_5^post_2 && y_6^0==y_6^post_2 ], cost: 1
      2: l0 -> l1 : Result_4^0'=Result_4^post_3, __disjvr_0^0'=__disjvr_0^post_3, tmp_7^0'=tmp_7^post_3, x_5^0'=x_5^post_3, y_6^0'=y_6^post_3, [ 0<=-1+x_5^0 && 0<=-1+y_6^0 && y_6^0+x_5^0<=0 && Result_4^post_3==Result_4^post_3 && __disjvr_0^0==__disjvr_0^post_3 && tmp_7^0==tmp_7^post_3 && x_5^0==x_5^post_3 && y_6^0==y_6^post_3 ], cost: 1
      3: l0 -> l2 : Result_4^0'=Result_4^post_4, __disjvr_0^0'=__disjvr_0^post_4, tmp_7^0'=tmp_7^post_4, x_5^0'=x_5^post_4, y_6^0'=y_6^post_4, [ 0<=-1+x_5^0 && 0<=-1+y_6^0 && 0<=-1+y_6^0+x_5^0 && tmp_7^post_4==tmp_7^post_4 && tmp_7^post_4<=0 && 0<=tmp_7^post_4 && x_5^post_4==-2+y_6^0 && y_6^post_4==1+x_5^post_4 && Result_4^0==Result_4^post_4 && __disjvr_0^0==__disjvr_0^post_4 ], cost: 1
      5: l0 -> l4 : Result_4^0'=Result_4^post_6, __disjvr_0^0'=__disjvr_0^post_6, tmp_7^0'=tmp_7^post_6, x_5^0'=x_5^post_6, y_6^0'=y_6^post_6, [ 0<=-1+x_5^0 && 0<=-1+y_6^0 && 0<=-1+y_6^0+x_5^0 && tmp_7^post_6==tmp_7^post_6 && Result_4^0==Result_4^post_6 && __disjvr_0^0==__disjvr_0^post_6 && x_5^0==x_5^post_6 && y_6^0==y_6^post_6 ], cost: 1
      4: l2 -> l0 : Result_4^0'=Result_4^post_5, __disjvr_0^0'=__disjvr_0^post_5, tmp_7^0'=tmp_7^post_5, x_5^0'=x_5^post_5, y_6^0'=y_6^post_5, [ Result_4^0==Result_4^post_5 && __disjvr_0^0==__disjvr_0^post_5 && tmp_7^0==tmp_7^post_5 && x_5^0==x_5^post_5 && y_6^0==y_6^post_5 ], cost: 1
      6: l4 -> l5 : Result_4^0'=Result_4^post_7, __disjvr_0^0'=__disjvr_0^post_7, tmp_7^0'=tmp_7^post_7, x_5^0'=x_5^post_7, y_6^0'=y_6^post_7, [ __disjvr_0^post_7==__disjvr_0^0 && Result_4^0==Result_4^post_7 && __disjvr_0^0==__disjvr_0^post_7 && tmp_7^0==tmp_7^post_7 && x_5^0==x_5^post_7 && y_6^0==y_6^post_7 ], cost: 1
      7: l5 -> l3 : Result_4^0'=Result_4^post_8, __disjvr_0^0'=__disjvr_0^post_8, tmp_7^0'=tmp_7^post_8, x_5^0'=x_5^post_8, y_6^0'=y_6^post_8, [ x_5^post_8==-1+x_5^0 && y_6^post_8==x_5^post_8 && Result_4^0==Result_4^post_8 && __disjvr_0^0==__disjvr_0^post_8 && tmp_7^0==tmp_7^post_8 ], cost: 1
      8: l3 -> l0 : Result_4^0'=Result_4^post_9, __disjvr_0^0'=__disjvr_0^post_9, tmp_7^0'=tmp_7^post_9, x_5^0'=x_5^post_9, y_6^0'=y_6^post_9, [ Result_4^0==Result_4^post_9 && __disjvr_0^0==__disjvr_0^post_9 && tmp_7^0==tmp_7^post_9 && x_5^0==x_5^post_9 && y_6^0==y_6^post_9 ], cost: 1
      9: l6 -> l0 : Result_4^0'=Result_4^post_10, __disjvr_0^0'=__disjvr_0^post_10, tmp_7^0'=tmp_7^post_10, x_5^0'=x_5^post_10, y_6^0'=y_6^post_10, [ Result_4^0==Result_4^post_10 && __disjvr_0^0==__disjvr_0^post_10 && tmp_7^0==tmp_7^post_10 && x_5^0==x_5^post_10 && y_6^0==y_6^post_10 ], cost: 1
     10: l7 -> l6 : Result_4^0'=Result_4^post_11, __disjvr_0^0'=__disjvr_0^post_11, tmp_7^0'=tmp_7^post_11, x_5^0'=x_5^post_11, y_6^0'=y_6^post_11, [ Result_4^0==Result_4^post_11 && __disjvr_0^0==__disjvr_0^post_11 && tmp_7^0==tmp_7^post_11 && x_5^0==x_5^post_11 && y_6^0==y_6^post_11 ], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
     10: l7 -> l6 : Result_4^0'=Result_4^post_11, __disjvr_0^0'=__disjvr_0^post_11, tmp_7^0'=tmp_7^post_11, x_5^0'=x_5^post_11, y_6^0'=y_6^post_11, [ Result_4^0==Result_4^post_11 && __disjvr_0^0==__disjvr_0^post_11 && tmp_7^0==tmp_7^post_11 && x_5^0==x_5^post_11 && y_6^0==y_6^post_11 ], cost: 1

Removed unreachable and leaf rules:
   Start location: l7
      3: l0 -> l2 : Result_4^0'=Result_4^post_4, __disjvr_0^0'=__disjvr_0^post_4, tmp_7^0'=tmp_7^post_4, x_5^0'=x_5^post_4, y_6^0'=y_6^post_4, [ 0<=-1+x_5^0 && 0<=-1+y_6^0 && 0<=-1+y_6^0+x_5^0 && tmp_7^post_4==tmp_7^post_4 && tmp_7^post_4<=0 && 0<=tmp_7^post_4 && x_5^post_4==-2+y_6^0 && y_6^post_4==1+x_5^post_4 && Result_4^0==Result_4^post_4 && __disjvr_0^0==__disjvr_0^post_4 ], cost: 1
      5: l0 -> l4 : Result_4^0'=Result_4^post_6, __disjvr_0^0'=__disjvr_0^post_6, tmp_7^0'=tmp_7^post_6, x_5^0'=x_5^post_6, y_6^0'=y_6^post_6, [ 0<=-1+x_5^0 && 0<=-1+y_6^0 && 0<=-1+y_6^0+x_5^0 && tmp_7^post_6==tmp_7^post_6 && Result_4^0==Result_4^post_6 && __disjvr_0^0==__disjvr_0^post_6 && x_5^0==x_5^post_6 && y_6^0==y_6^post_6 ], cost: 1
      4: l2 -> l0 : Result_4^0'=Result_4^post_5, __disjvr_0^0'=__disjvr_0^post_5, tmp_7^0'=tmp_7^post_5, x_5^0'=x_5^post_5, y_6^0'=y_6^post_5, [ Result_4^0==Result_4^post_5 && __disjvr_0^0==__disjvr_0^post_5 && tmp_7^0==tmp_7^post_5 && x_5^0==x_5^post_5 && y_6^0==y_6^post_5 ], cost: 1
      6: l4 -> l5 : Result_4^0'=Result_4^post_7, __disjvr_0^0'=__disjvr_0^post_7, tmp_7^0'=tmp_7^post_7, x_5^0'=x_5^post_7, y_6^0'=y_6^post_7, [ __disjvr_0^post_7==__disjvr_0^0 && Result_4^0==Result_4^post_7 && __disjvr_0^0==__disjvr_0^post_7 && tmp_7^0==tmp_7^post_7 && x_5^0==x_5^post_7 && y_6^0==y_6^post_7 ], cost: 1
      7: l5 -> l3 : Result_4^0'=Result_4^post_8, __disjvr_0^0'=__disjvr_0^post_8, tmp_7^0'=tmp_7^post_8, x_5^0'=x_5^post_8, y_6^0'=y_6^post_8, [ x_5^post_8==-1+x_5^0 && y_6^post_8==x_5^post_8 && Result_4^0==Result_4^post_8 && __disjvr_0^0==__disjvr_0^post_8 && tmp_7^0==tmp_7^post_8 ], cost: 1
      8: l3 -> l0 : Result_4^0'=Result_4^post_9, __disjvr_0^0'=__disjvr_0^post_9, tmp_7^0'=tmp_7^post_9, x_5^0'=x_5^post_9, y_6^0'=y_6^post_9, [ Result_4^0==Result_4^post_9 && __disjvr_0^0==__disjvr_0^post_9 && tmp_7^0==tmp_7^post_9 && x_5^0==x_5^post_9 && y_6^0==y_6^post_9 ], cost: 1
      9: l6 -> l0 : Result_4^0'=Result_4^post_10, __disjvr_0^0'=__disjvr_0^post_10, tmp_7^0'=tmp_7^post_10, x_5^0'=x_5^post_10, y_6^0'=y_6^post_10, [ Result_4^0==Result_4^post_10 && __disjvr_0^0==__disjvr_0^post_10 && tmp_7^0==tmp_7^post_10 && x_5^0==x_5^post_10 && y_6^0==y_6^post_10 ], cost: 1
     10: l7 -> l6 : Result_4^0'=Result_4^post_11, __disjvr_0^0'=__disjvr_0^post_11, tmp_7^0'=tmp_7^post_11, x_5^0'=x_5^post_11, y_6^0'=y_6^post_11, [ Result_4^0==Result_4^post_11 && __disjvr_0^0==__disjvr_0^post_11 && tmp_7^0==tmp_7^post_11 && x_5^0==x_5^post_11 && y_6^0==y_6^post_11 ], cost: 1

Simplified all rules, resulting in:
   Start location: l7
      3: l0 -> l2 : tmp_7^0'=0, x_5^0'=-2+y_6^0, y_6^0'=-1+y_6^0, [ 0<=-1+x_5^0 && 0<=-1+y_6^0 ], cost: 1
      5: l0 -> l4 : tmp_7^0'=tmp_7^post_6, [ 0<=-1+x_5^0 && 0<=-1+y_6^0 ], cost: 1
      4: l2 -> l0 : [], cost: 1
      6: l4 -> l5 : [], cost: 1
      7: l5 -> l3 : x_5^0'=-1+x_5^0, y_6^0'=-1+x_5^0, [], cost: 1
      8: l3 -> l0 : [], cost: 1
      9: l6 -> l0 : [], cost: 1
     10: l7 -> l6 : [], cost: 1

### Simplification by acceleration and chaining ###

Eliminated locations (on linear paths):
   Start location: l7
     12: l0 -> l0 : tmp_7^0'=0, x_5^0'=-2+y_6^0, y_6^0'=-1+y_6^0, [ 0<=-1+x_5^0 && 0<=-1+y_6^0 ], cost: 2
     15: l0 -> l0 : tmp_7^0'=tmp_7^post_6, x_5^0'=-1+x_5^0, y_6^0'=-1+x_5^0, [ 0<=-1+x_5^0 && 0<=-1+y_6^0 ], cost: 4
     11: l7 -> l0 : [], cost: 2

Accelerating simple loops of location 0.
   Accelerating the following rules:
     12: l0 -> l0 : tmp_7^0'=0, x_5^0'=-2+y_6^0, y_6^0'=-1+y_6^0, [ 0<=-1+x_5^0 && 0<=-1+y_6^0 ], cost: 2
     15: l0 -> l0 : tmp_7^0'=tmp_7^post_6, x_5^0'=-1+x_5^0, y_6^0'=-1+x_5^0, [ 0<=-1+x_5^0 && 0<=-1+y_6^0 ], cost: 4

[test] deduced pseudo-invariant -1+y_6^0-x_5^0<=0, also trying 1-y_6^0+x_5^0<=-1
   Accelerated rule 12 with backward acceleration, yielding the new rule 16.
   Accelerated rule 12 with backward acceleration, yielding the new rule 17.
[test] deduced pseudo-invariant -1-y_6^0+x_5^0<=0, also trying 1+y_6^0-x_5^0<=-1
   Accelerated rule 15 with backward acceleration, yielding the new rule 18.
   Accelerated rule 15 with backward acceleration, yielding the new rule 19.
[accelerate] Nesting with 4 inner and 2 outer candidates
   Also removing duplicate rules: 18.

Accelerated all simple loops using metering functions (where possible):
   Start location: l7
     12: l0 -> l0 : tmp_7^0'=0, x_5^0'=-2+y_6^0, y_6^0'=-1+y_6^0, [ 0<=-1+x_5^0 && 0<=-1+y_6^0 ], cost: 2
     15: l0 -> l0 : tmp_7^0'=tmp_7^post_6, x_5^0'=-1+x_5^0, y_6^0'=-1+x_5^0, [ 0<=-1+x_5^0 && 0<=-1+y_6^0 ], cost: 4
     16: l0 -> l0 : tmp_7^0'=0, x_5^0'=0, y_6^0'=1, [ -1+y_6^0-x_5^0<=0 && -1+y_6^0>=1 ], cost: -2+2*y_6^0
     17: l0 -> l0 : tmp_7^0'=0, x_5^0'=-1, y_6^0'=0, [ 0<=-1 ], cost: 2*y_6^0
     19: l0 -> l0 : tmp_7^0'=tmp_7^post_6, x_5^0'=0, y_6^0'=0, [ -1-y_6^0+x_5^0<=0 && x_5^0>=1 ], cost: 4*x_5^0
     11: l7 -> l0 : [], cost: 2

Chained accelerated rules (with incoming rules):
   Start location: l7
     11: l7 -> l0 : [], cost: 2
     20: l7 -> l0 : tmp_7^0'=0, x_5^0'=-2+y_6^0, y_6^0'=-1+y_6^0, [ 0<=-1+x_5^0 && 0<=-1+y_6^0 ], cost: 4
     21: l7 -> l0 : tmp_7^0'=tmp_7^post_6, x_5^0'=-1+x_5^0, y_6^0'=-1+x_5^0, [ 0<=-1+x_5^0 && 0<=-1+y_6^0 ], cost: 6
     22: l7 -> l0 : tmp_7^0'=0, x_5^0'=0, y_6^0'=1, [ -1+y_6^0-x_5^0<=0 && -1+y_6^0>=1 ], cost: 2*y_6^0
     23: l7 -> l0 : tmp_7^0'=tmp_7^post_6, x_5^0'=0, y_6^0'=0, [ -1-y_6^0+x_5^0<=0 && x_5^0>=1 ], cost: 2+4*x_5^0

Removed unreachable locations (and leaf rules with constant cost):
   Start location: l7
     22: l7 -> l0 : tmp_7^0'=0, x_5^0'=0, y_6^0'=1, [ -1+y_6^0-x_5^0<=0 && -1+y_6^0>=1 ], cost: 2*y_6^0
     23: l7 -> l0 : tmp_7^0'=tmp_7^post_6, x_5^0'=0, y_6^0'=0, [ -1-y_6^0+x_5^0<=0 && x_5^0>=1 ], cost: 2+4*x_5^0

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: l7
     22: l7 -> l0 : tmp_7^0'=0, x_5^0'=0, y_6^0'=1, [ -1+y_6^0-x_5^0<=0 && -1+y_6^0>=1 ], cost: 2*y_6^0
     23: l7 -> l0 : tmp_7^0'=tmp_7^post_6, x_5^0'=0, y_6^0'=0, [ -1-y_6^0+x_5^0<=0 && x_5^0>=1 ], cost: 2+4*x_5^0

Computing asymptotic complexity for rule 22
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 23
   Resulting cost 0 has complexity: Unknown

Obtained the following overall complexity (w.r.t. the length of the input n):
   Complexity:  Constant
   Cpx degree:  0
   Solved cost: 1
   Rule cost:   1
   Rule guard:  [ Result_4^0==Result_4^post_11 && __disjvr_0^0==__disjvr_0^post_11 && tmp_7^0==tmp_7^post_11 && x_5^0==x_5^post_11 && y_6^0==y_6^post_11 ]

WORST_CASE(Omega(1),?)