WORST_CASE(INF,?)

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

Initial linear ITS problem
   Start location: l5
      0: l0 -> l1 : x_13^0'=x_13^post_1, x_27^0'=x_27^post_1, x_32^0'=x_32^post_1, y_16^0'=y_16^post_1, y_28^0'=y_28^post_1, y_33^0'=y_33^post_1, [ x_13^post_1==x_13^post_1 && y_16^post_1==y_16^post_1 && x_27^0==x_27^post_1 && x_32^0==x_32^post_1 && y_28^0==y_28^post_1 && y_33^0==y_33^post_1 ], cost: 1
      1: l1 -> l2 : x_13^0'=x_13^post_2, x_27^0'=x_27^post_2, x_32^0'=x_32^post_2, y_16^0'=y_16^post_2, y_28^0'=y_28^post_2, y_33^0'=y_33^post_2, [ 1<=x_13^0 && y_16^post_2==5000 && 1<=y_16^post_2 && 1<=x_13^0 && x_13^0==x_13^post_2 && x_27^0==x_27^post_2 && x_32^0==x_32^post_2 && y_28^0==y_28^post_2 && y_33^0==y_33^post_2 ], cost: 1
      3: l2 -> l1 : x_13^0'=x_13^post_4, x_27^0'=x_27^post_4, x_32^0'=x_32^post_4, y_16^0'=y_16^post_4, y_28^0'=y_28^post_4, y_33^0'=y_33^post_4, [ y_16^0<=0 && y_16^0<=0 && x_13^0==x_13^post_4 && x_27^0==x_27^post_4 && x_32^0==x_32^post_4 && y_16^0==y_16^post_4 && y_28^0==y_28^post_4 && y_33^0==y_33^post_4 ], cost: 1
      4: l2 -> l4 : x_13^0'=x_13^post_5, x_27^0'=x_27^post_5, x_32^0'=x_32^post_5, y_16^0'=y_16^post_5, y_28^0'=y_28^post_5, y_33^0'=y_33^post_5, [ x_32^post_5==x_32^post_5 && y_33^post_5==y_33^post_5 && 1<=y_16^0 && x_13^post_5==-1+x_13^0 && y_16^post_5==-1+y_16^0 && x_13^post_5<=-1+x_32^post_5 && -1+x_32^post_5<=x_13^post_5 && y_16^post_5<=-1+y_33^post_5 && -1+y_33^post_5<=y_16^post_5 && 1<=y_33^post_5 && x_27^0==x_27^post_5 && y_28^0==y_28^post_5 ], cost: 1
      2: l3 -> l2 : x_13^0'=x_13^post_3, x_27^0'=x_27^post_3, x_32^0'=x_32^post_3, y_16^0'=y_16^post_3, y_28^0'=y_28^post_3, y_33^0'=y_33^post_3, [ x_27^post_3==x_27^post_3 && y_28^post_3==y_28^post_3 && 1<=y_16^0 && x_13^post_3==-1+x_13^0 && y_16^post_3==-1+y_16^0 && x_13^post_3<=-1+x_27^post_3 && -1+x_27^post_3<=x_13^post_3 && y_16^post_3<=-1+y_28^post_3 && -1+y_28^post_3<=y_16^post_3 && 1<=x_27^post_3 && 1<=y_28^post_3 && x_32^0==x_32^post_3 && y_33^0==y_33^post_3 ], cost: 1
      5: l4 -> l2 : x_13^0'=x_13^post_6, x_27^0'=x_27^post_6, x_32^0'=x_32^post_6, y_16^0'=y_16^post_6, y_28^0'=y_28^post_6, y_33^0'=y_33^post_6, [ x_13^0==x_13^post_6 && x_27^0==x_27^post_6 && x_32^0==x_32^post_6 && y_16^0==y_16^post_6 && y_28^0==y_28^post_6 && y_33^0==y_33^post_6 ], cost: 1
      6: l5 -> l0 : x_13^0'=x_13^post_7, x_27^0'=x_27^post_7, x_32^0'=x_32^post_7, y_16^0'=y_16^post_7, y_28^0'=y_28^post_7, y_33^0'=y_33^post_7, [ x_13^0==x_13^post_7 && x_27^0==x_27^post_7 && x_32^0==x_32^post_7 && y_16^0==y_16^post_7 && y_28^0==y_28^post_7 && y_33^0==y_33^post_7 ], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
      6: l5 -> l0 : x_13^0'=x_13^post_7, x_27^0'=x_27^post_7, x_32^0'=x_32^post_7, y_16^0'=y_16^post_7, y_28^0'=y_28^post_7, y_33^0'=y_33^post_7, [ x_13^0==x_13^post_7 && x_27^0==x_27^post_7 && x_32^0==x_32^post_7 && y_16^0==y_16^post_7 && y_28^0==y_28^post_7 && y_33^0==y_33^post_7 ], cost: 1

Removed unreachable and leaf rules:
   Start location: l5
      0: l0 -> l1 : x_13^0'=x_13^post_1, x_27^0'=x_27^post_1, x_32^0'=x_32^post_1, y_16^0'=y_16^post_1, y_28^0'=y_28^post_1, y_33^0'=y_33^post_1, [ x_13^post_1==x_13^post_1 && y_16^post_1==y_16^post_1 && x_27^0==x_27^post_1 && x_32^0==x_32^post_1 && y_28^0==y_28^post_1 && y_33^0==y_33^post_1 ], cost: 1
      1: l1 -> l2 : x_13^0'=x_13^post_2, x_27^0'=x_27^post_2, x_32^0'=x_32^post_2, y_16^0'=y_16^post_2, y_28^0'=y_28^post_2, y_33^0'=y_33^post_2, [ 1<=x_13^0 && y_16^post_2==5000 && 1<=y_16^post_2 && 1<=x_13^0 && x_13^0==x_13^post_2 && x_27^0==x_27^post_2 && x_32^0==x_32^post_2 && y_28^0==y_28^post_2 && y_33^0==y_33^post_2 ], cost: 1
      3: l2 -> l1 : x_13^0'=x_13^post_4, x_27^0'=x_27^post_4, x_32^0'=x_32^post_4, y_16^0'=y_16^post_4, y_28^0'=y_28^post_4, y_33^0'=y_33^post_4, [ y_16^0<=0 && y_16^0<=0 && x_13^0==x_13^post_4 && x_27^0==x_27^post_4 && x_32^0==x_32^post_4 && y_16^0==y_16^post_4 && y_28^0==y_28^post_4 && y_33^0==y_33^post_4 ], cost: 1
      4: l2 -> l4 : x_13^0'=x_13^post_5, x_27^0'=x_27^post_5, x_32^0'=x_32^post_5, y_16^0'=y_16^post_5, y_28^0'=y_28^post_5, y_33^0'=y_33^post_5, [ x_32^post_5==x_32^post_5 && y_33^post_5==y_33^post_5 && 1<=y_16^0 && x_13^post_5==-1+x_13^0 && y_16^post_5==-1+y_16^0 && x_13^post_5<=-1+x_32^post_5 && -1+x_32^post_5<=x_13^post_5 && y_16^post_5<=-1+y_33^post_5 && -1+y_33^post_5<=y_16^post_5 && 1<=y_33^post_5 && x_27^0==x_27^post_5 && y_28^0==y_28^post_5 ], cost: 1
      5: l4 -> l2 : x_13^0'=x_13^post_6, x_27^0'=x_27^post_6, x_32^0'=x_32^post_6, y_16^0'=y_16^post_6, y_28^0'=y_28^post_6, y_33^0'=y_33^post_6, [ x_13^0==x_13^post_6 && x_27^0==x_27^post_6 && x_32^0==x_32^post_6 && y_16^0==y_16^post_6 && y_28^0==y_28^post_6 && y_33^0==y_33^post_6 ], cost: 1
      6: l5 -> l0 : x_13^0'=x_13^post_7, x_27^0'=x_27^post_7, x_32^0'=x_32^post_7, y_16^0'=y_16^post_7, y_28^0'=y_28^post_7, y_33^0'=y_33^post_7, [ x_13^0==x_13^post_7 && x_27^0==x_27^post_7 && x_32^0==x_32^post_7 && y_16^0==y_16^post_7 && y_28^0==y_28^post_7 && y_33^0==y_33^post_7 ], cost: 1

Simplified all rules, resulting in:
   Start location: l5
      0: l0 -> l1 : x_13^0'=x_13^post_1, y_16^0'=y_16^post_1, [], cost: 1
      1: l1 -> l2 : y_16^0'=5000, [ 1<=x_13^0 ], cost: 1
      3: l2 -> l1 : [ y_16^0<=0 ], cost: 1
      4: l2 -> l4 : x_13^0'=-1+x_13^0, x_32^0'=x_13^0, y_16^0'=-1+y_16^0, y_33^0'=y_16^0, [ 1<=y_16^0 ], cost: 1
      5: l4 -> l2 : [], cost: 1
      6: l5 -> l0 : [], cost: 1

### Simplification by acceleration and chaining ###

Eliminated locations (on linear paths):
   Start location: l5
      1: l1 -> l2 : y_16^0'=5000, [ 1<=x_13^0 ], cost: 1
      3: l2 -> l1 : [ y_16^0<=0 ], cost: 1
      8: l2 -> l2 : x_13^0'=-1+x_13^0, x_32^0'=x_13^0, y_16^0'=-1+y_16^0, y_33^0'=y_16^0, [ 1<=y_16^0 ], cost: 2
      7: l5 -> l1 : x_13^0'=x_13^post_1, y_16^0'=y_16^post_1, [], cost: 2

Accelerating simple loops of location 2.
   Accelerating the following rules:
      8: l2 -> l2 : x_13^0'=-1+x_13^0, x_32^0'=x_13^0, y_16^0'=-1+y_16^0, y_33^0'=y_16^0, [ 1<=y_16^0 ], cost: 2

   Accelerated rule 8 with metering function y_16^0, yielding the new rule 9.
   Removing the simple loops: 8.

Accelerated all simple loops using metering functions (where possible):
   Start location: l5
      1: l1 -> l2 : y_16^0'=5000, [ 1<=x_13^0 ], cost: 1
      3: l2 -> l1 : [ y_16^0<=0 ], cost: 1
      9: l2 -> l2 : x_13^0'=-y_16^0+x_13^0, x_32^0'=1-y_16^0+x_13^0, y_16^0'=0, y_33^0'=1, [ 1<=y_16^0 ], cost: 2*y_16^0
      7: l5 -> l1 : x_13^0'=x_13^post_1, y_16^0'=y_16^post_1, [], cost: 2

Chained accelerated rules (with incoming rules):
   Start location: l5
      1: l1 -> l2 : y_16^0'=5000, [ 1<=x_13^0 ], cost: 1
     10: l1 -> l2 : x_13^0'=-5000+x_13^0, x_32^0'=-4999+x_13^0, y_16^0'=0, y_33^0'=1, [ 1<=x_13^0 ], cost: 10001
      3: l2 -> l1 : [ y_16^0<=0 ], cost: 1
      7: l5 -> l1 : x_13^0'=x_13^post_1, y_16^0'=y_16^post_1, [], cost: 2

Eliminated locations (on tree-shaped paths):
   Start location: l5
     11: l1 -> l1 : x_13^0'=-5000+x_13^0, x_32^0'=-4999+x_13^0, y_16^0'=0, y_33^0'=1, [ 1<=x_13^0 ], cost: 10002
      7: l5 -> l1 : x_13^0'=x_13^post_1, y_16^0'=y_16^post_1, [], cost: 2

Accelerating simple loops of location 1.
   Accelerating the following rules:
     11: l1 -> l1 : x_13^0'=-5000+x_13^0, x_32^0'=-4999+x_13^0, y_16^0'=0, y_33^0'=1, [ 1<=x_13^0 ], cost: 10002

   Accelerated rule 11 with metering function meter (where 5000*meter==x_13^0), yielding the new rule 12.
   Removing the simple loops: 11.

Accelerated all simple loops using metering functions (where possible):
   Start location: l5
     12: l1 -> l1 : x_13^0'=-5000*meter+x_13^0, x_32^0'=1-5000*meter+x_13^0, y_16^0'=0, y_33^0'=1, [ 1<=x_13^0 && 5000*meter==x_13^0 && meter>=1 ], cost: 10002*meter
      7: l5 -> l1 : x_13^0'=x_13^post_1, y_16^0'=y_16^post_1, [], cost: 2

Chained accelerated rules (with incoming rules):
   Start location: l5
      7: l5 -> l1 : x_13^0'=x_13^post_1, y_16^0'=y_16^post_1, [], cost: 2
     13: l5 -> l1 : x_13^0'=0, x_32^0'=1, y_16^0'=0, y_33^0'=1, [ 1<=5000*meter && meter>=1 ], cost: 2+10002*meter

Removed unreachable locations (and leaf rules with constant cost):
   Start location: l5
     13: l5 -> l1 : x_13^0'=0, x_32^0'=1, y_16^0'=0, y_33^0'=1, [ 1<=5000*meter && meter>=1 ], cost: 2+10002*meter

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: l5
     13: l5 -> l1 : x_13^0'=0, x_32^0'=1, y_16^0'=0, y_33^0'=1, [ 1<=5000*meter && meter>=1 ], cost: 2+10002*meter

Computing asymptotic complexity for rule 13
   Solved the limit problem by the following transformations:
      Created initial limit problem:
      5000*meter (+/+!), 2+10002*meter (+) [not solved]

      removing all constraints (solved by SMT)
      resulting limit problem: [solved]

      applying transformation rule (C) using substitution {meter==n}
      resulting limit problem:
      [solved]

   Solution:
      meter / n
   Resulting cost 2+10002*n has complexity: Unbounded

Found new complexity Unbounded.

Obtained the following overall complexity (w.r.t. the length of the input n):
   Complexity:  Unbounded
   Cpx degree:  Unbounded
   Solved cost: 2+10002*n
   Rule cost:   2+10002*meter
   Rule guard:  [ 1<=5000*meter ]

WORST_CASE(INF,?)