WORST_CASE(Omega(1),?)

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

Initial linear ITS problem
   Start location: l2
      0: l0 -> l1 : rt_11^0'=rt_11^post_1, st_14^0'=st_14^post_1, x_13^0'=x_13^post_1, [ 0<=x_13^0 && x_13^post_1==-1+x_13^0 && rt_11^post_1==st_14^0 && st_14^0==st_14^post_1 ], cost: 1
      1: l0 -> l1 : rt_11^0'=rt_11^post_2, st_14^0'=st_14^post_2, x_13^0'=x_13^post_2, [ 1+x_13^0<=0 && rt_11^post_2==st_14^0 && st_14^0==st_14^post_2 && x_13^0==x_13^post_2 ], cost: 1
      2: l2 -> l0 : rt_11^0'=rt_11^post_3, st_14^0'=st_14^post_3, x_13^0'=x_13^post_3, [ rt_11^0==rt_11^post_3 && st_14^0==st_14^post_3 && x_13^0==x_13^post_3 ], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
      2: l2 -> l0 : rt_11^0'=rt_11^post_3, st_14^0'=st_14^post_3, x_13^0'=x_13^post_3, [ rt_11^0==rt_11^post_3 && st_14^0==st_14^post_3 && x_13^0==x_13^post_3 ], cost: 1

Removed unreachable and leaf rules:
   Start location: l2
     <empty>

Empty problem, aborting

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:  [ rt_11^0==rt_11^post_3 && st_14^0==st_14^post_3 && x_13^0==x_13^post_3 ]

WORST_CASE(Omega(1),?)