WORST_CASE(Omega(n^1),?)

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

Initial linear ITS problem
   Start location: l6
      0: l0 -> l1 : c^0'=c^post_1, ox^0'=ox^post_1, x^0'=x^post_1, [ 1+x^0<=ox^0 && c^0==c^post_1 && ox^0==ox^post_1 && x^0==x^post_1 ], cost: 1
      1: l0 -> l2 : c^0'=c^post_2, ox^0'=ox^post_2, x^0'=x^post_2, [ ox^0<=x^0 && c^0==c^post_2 && ox^0==ox^post_2 && x^0==x^post_2 ], cost: 1
      6: l1 -> l4 : c^0'=c^post_7, ox^0'=ox^post_7, x^0'=x^post_7, [ 1<=x^0 && x^post_7==-1+x^0 && c^0==c^post_7 && ox^0==ox^post_7 ], cost: 1
      2: l3 -> l1 : c^0'=c^post_3, ox^0'=ox^post_3, x^0'=x^post_3, [ c^0<=0 && c^0==c^post_3 && ox^0==ox^post_3 && x^0==x^post_3 ], cost: 1
      3: l3 -> l1 : c^0'=c^post_4, ox^0'=ox^post_4, x^0'=x^post_4, [ ox^post_4==x^0 && c^post_4==1 && x^0==x^post_4 ], cost: 1
      4: l4 -> l3 : c^0'=c^post_5, ox^0'=ox^post_5, x^0'=x^post_5, [ c^0<=0 && c^0==c^post_5 && ox^0==ox^post_5 && x^0==x^post_5 ], cost: 1
      5: l4 -> l0 : c^0'=c^post_6, ox^0'=ox^post_6, x^0'=x^post_6, [ 1<=c^0 && c^0==c^post_6 && ox^0==ox^post_6 && x^0==x^post_6 ], cost: 1
      7: l5 -> l1 : c^0'=c^post_8, ox^0'=ox^post_8, x^0'=x^post_8, [ c^0<=0 && c^0==c^post_8 && ox^0==ox^post_8 && x^0==x^post_8 ], cost: 1
      8: l6 -> l5 : c^0'=c^post_9, ox^0'=ox^post_9, x^0'=x^post_9, [ c^0==c^post_9 && ox^0==ox^post_9 && x^0==x^post_9 ], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
      8: l6 -> l5 : c^0'=c^post_9, ox^0'=ox^post_9, x^0'=x^post_9, [ c^0==c^post_9 && ox^0==ox^post_9 && x^0==x^post_9 ], cost: 1

Removed unreachable and leaf rules:
   Start location: l6
      0: l0 -> l1 : c^0'=c^post_1, ox^0'=ox^post_1, x^0'=x^post_1, [ 1+x^0<=ox^0 && c^0==c^post_1 && ox^0==ox^post_1 && x^0==x^post_1 ], cost: 1
      6: l1 -> l4 : c^0'=c^post_7, ox^0'=ox^post_7, x^0'=x^post_7, [ 1<=x^0 && x^post_7==-1+x^0 && c^0==c^post_7 && ox^0==ox^post_7 ], cost: 1
      2: l3 -> l1 : c^0'=c^post_3, ox^0'=ox^post_3, x^0'=x^post_3, [ c^0<=0 && c^0==c^post_3 && ox^0==ox^post_3 && x^0==x^post_3 ], cost: 1
      3: l3 -> l1 : c^0'=c^post_4, ox^0'=ox^post_4, x^0'=x^post_4, [ ox^post_4==x^0 && c^post_4==1 && x^0==x^post_4 ], cost: 1
      4: l4 -> l3 : c^0'=c^post_5, ox^0'=ox^post_5, x^0'=x^post_5, [ c^0<=0 && c^0==c^post_5 && ox^0==ox^post_5 && x^0==x^post_5 ], cost: 1
      5: l4 -> l0 : c^0'=c^post_6, ox^0'=ox^post_6, x^0'=x^post_6, [ 1<=c^0 && c^0==c^post_6 && ox^0==ox^post_6 && x^0==x^post_6 ], cost: 1
      7: l5 -> l1 : c^0'=c^post_8, ox^0'=ox^post_8, x^0'=x^post_8, [ c^0<=0 && c^0==c^post_8 && ox^0==ox^post_8 && x^0==x^post_8 ], cost: 1
      8: l6 -> l5 : c^0'=c^post_9, ox^0'=ox^post_9, x^0'=x^post_9, [ c^0==c^post_9 && ox^0==ox^post_9 && x^0==x^post_9 ], cost: 1

Simplified all rules, resulting in:
   Start location: l6
      0: l0 -> l1 : [ 1+x^0<=ox^0 ], cost: 1
      6: l1 -> l4 : x^0'=-1+x^0, [ 1<=x^0 ], cost: 1
      2: l3 -> l1 : [ c^0<=0 ], cost: 1
      3: l3 -> l1 : c^0'=1, ox^0'=x^0, [], cost: 1
      4: l4 -> l3 : [ c^0<=0 ], cost: 1
      5: l4 -> l0 : [ 1<=c^0 ], cost: 1
      7: l5 -> l1 : [ c^0<=0 ], cost: 1
      8: l6 -> l5 : [], cost: 1

### Simplification by acceleration and chaining ###

Eliminated locations (on linear paths):
   Start location: l6
      6: l1 -> l4 : x^0'=-1+x^0, [ 1<=x^0 ], cost: 1
      2: l3 -> l1 : [ c^0<=0 ], cost: 1
      3: l3 -> l1 : c^0'=1, ox^0'=x^0, [], cost: 1
      4: l4 -> l3 : [ c^0<=0 ], cost: 1
     10: l4 -> l1 : [ 1<=c^0 && 1+x^0<=ox^0 ], cost: 2
      9: l6 -> l1 : [ c^0<=0 ], cost: 2

Eliminated locations (on tree-shaped paths):
   Start location: l6
     11: l1 -> l3 : x^0'=-1+x^0, [ 1<=x^0 && c^0<=0 ], cost: 2
     12: l1 -> l1 : x^0'=-1+x^0, [ 1<=x^0 && 1<=c^0 && x^0<=ox^0 ], cost: 3
      2: l3 -> l1 : [ c^0<=0 ], cost: 1
      3: l3 -> l1 : c^0'=1, ox^0'=x^0, [], cost: 1
      9: l6 -> l1 : [ c^0<=0 ], cost: 2

Accelerating simple loops of location 1.
   Accelerating the following rules:
     12: l1 -> l1 : x^0'=-1+x^0, [ 1<=x^0 && 1<=c^0 && x^0<=ox^0 ], cost: 3

   Accelerated rule 12 with metering function x^0, yielding the new rule 13.
   Removing the simple loops: 12.

Accelerated all simple loops using metering functions (where possible):
   Start location: l6
     11: l1 -> l3 : x^0'=-1+x^0, [ 1<=x^0 && c^0<=0 ], cost: 2
     13: l1 -> l1 : x^0'=0, [ 1<=x^0 && 1<=c^0 && x^0<=ox^0 ], cost: 3*x^0
      2: l3 -> l1 : [ c^0<=0 ], cost: 1
      3: l3 -> l1 : c^0'=1, ox^0'=x^0, [], cost: 1
      9: l6 -> l1 : [ c^0<=0 ], cost: 2

Chained accelerated rules (with incoming rules):
   Start location: l6
     11: l1 -> l3 : x^0'=-1+x^0, [ 1<=x^0 && c^0<=0 ], cost: 2
      2: l3 -> l1 : [ c^0<=0 ], cost: 1
      3: l3 -> l1 : c^0'=1, ox^0'=x^0, [], cost: 1
     14: l3 -> l1 : c^0'=1, ox^0'=x^0, x^0'=0, [ 1<=x^0 ], cost: 1+3*x^0
      9: l6 -> l1 : [ c^0<=0 ], cost: 2

Eliminated locations (on tree-shaped paths):
   Start location: l6
     15: l1 -> l1 : x^0'=-1+x^0, [ 1<=x^0 && c^0<=0 ], cost: 3
     16: l1 -> l1 : c^0'=1, ox^0'=-1+x^0, x^0'=-1+x^0, [ 1<=x^0 && c^0<=0 ], cost: 3
     17: l1 -> l1 : c^0'=1, ox^0'=-1+x^0, x^0'=0, [ c^0<=0 && 1<=-1+x^0 ], cost: 3*x^0
      9: l6 -> l1 : [ c^0<=0 ], cost: 2

Accelerating simple loops of location 1.
   Accelerating the following rules:
     15: l1 -> l1 : x^0'=-1+x^0, [ 1<=x^0 && c^0<=0 ], cost: 3
     16: l1 -> l1 : c^0'=1, ox^0'=-1+x^0, x^0'=-1+x^0, [ 1<=x^0 && c^0<=0 ], cost: 3
     17: l1 -> l1 : c^0'=1, ox^0'=-1+x^0, x^0'=0, [ c^0<=0 && 1<=-1+x^0 ], cost: 3*x^0

   Accelerated rule 15 with metering function x^0, yielding the new rule 18.
   Found no metering function for rule 16.
   Found no metering function for rule 17.
   Removing the simple loops: 15.

Accelerated all simple loops using metering functions (where possible):
   Start location: l6
     16: l1 -> l1 : c^0'=1, ox^0'=-1+x^0, x^0'=-1+x^0, [ 1<=x^0 && c^0<=0 ], cost: 3
     17: l1 -> l1 : c^0'=1, ox^0'=-1+x^0, x^0'=0, [ c^0<=0 && 1<=-1+x^0 ], cost: 3*x^0
     18: l1 -> l1 : x^0'=0, [ 1<=x^0 && c^0<=0 ], cost: 3*x^0
      9: l6 -> l1 : [ c^0<=0 ], cost: 2

Chained accelerated rules (with incoming rules):
   Start location: l6
      9: l6 -> l1 : [ c^0<=0 ], cost: 2
     19: l6 -> l1 : c^0'=1, ox^0'=-1+x^0, x^0'=-1+x^0, [ c^0<=0 && 1<=x^0 ], cost: 5
     20: l6 -> l1 : c^0'=1, ox^0'=-1+x^0, x^0'=0, [ c^0<=0 && 1<=-1+x^0 ], cost: 2+3*x^0
     21: l6 -> l1 : x^0'=0, [ c^0<=0 && 1<=x^0 ], cost: 2+3*x^0

Removed unreachable locations (and leaf rules with constant cost):
   Start location: l6
     20: l6 -> l1 : c^0'=1, ox^0'=-1+x^0, x^0'=0, [ c^0<=0 && 1<=-1+x^0 ], cost: 2+3*x^0
     21: l6 -> l1 : x^0'=0, [ c^0<=0 && 1<=x^0 ], cost: 2+3*x^0

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: l6
     20: l6 -> l1 : c^0'=1, ox^0'=-1+x^0, x^0'=0, [ c^0<=0 && 1<=-1+x^0 ], cost: 2+3*x^0
     21: l6 -> l1 : x^0'=0, [ c^0<=0 && 1<=x^0 ], cost: 2+3*x^0

Computing asymptotic complexity for rule 20
   Solved the limit problem by the following transformations:
      Created initial limit problem:
      2+3*x^0 (+), 1-c^0 (+/+!), -1+x^0 (+/+!) [not solved]

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

      applying transformation rule (C) using substitution {x^0==n,c^0==-n}
      resulting limit problem:
      [solved]

   Solution:
      x^0 / n
      c^0 / -n
   Resulting cost 2+3*n has complexity: Poly(n^1)

Found new complexity Poly(n^1).

Obtained the following overall complexity (w.r.t. the length of the input n):
   Complexity:  Poly(n^1)
   Cpx degree:  1
   Solved cost: 2+3*n
   Rule cost:   2+3*x^0
   Rule guard:  [ c^0<=0 && 1<=-1+x^0 ]

WORST_CASE(Omega(n^1),?)