WORST_CASE(Omega(1),?)

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

Initial linear ITS problem
   Start location: l2
      0: l0 -> l1 : A^0'=A^post_1, NBuffers^0'=NBuffers^post_1, NLocBuffer^0'=NLocBuffer^post_1, R^0'=R^post_1, istemp^0'=istemp^post_1, [ R^post_1==0 && A^post_1==R^post_1 && istemp^post_1==istemp^post_1 && NLocBuffer^post_1==NLocBuffer^post_1 && NBuffers^post_1==NBuffers^post_1 ], cost: 1
      1: l2 -> l0 : A^0'=A^post_2, NBuffers^0'=NBuffers^post_2, NLocBuffer^0'=NLocBuffer^post_2, R^0'=R^post_2, istemp^0'=istemp^post_2, [ A^0==A^post_2 && NBuffers^0==NBuffers^post_2 && NLocBuffer^0==NLocBuffer^post_2 && R^0==R^post_2 && istemp^0==istemp^post_2 ], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
      1: l2 -> l0 : A^0'=A^post_2, NBuffers^0'=NBuffers^post_2, NLocBuffer^0'=NLocBuffer^post_2, R^0'=R^post_2, istemp^0'=istemp^post_2, [ A^0==A^post_2 && NBuffers^0==NBuffers^post_2 && NLocBuffer^0==NLocBuffer^post_2 && R^0==R^post_2 && istemp^0==istemp^post_2 ], 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:  [ A^0==A^post_2 && NBuffers^0==NBuffers^post_2 && NLocBuffer^0==NLocBuffer^post_2 && R^0==R^post_2 && istemp^0==istemp^post_2 ]

WORST_CASE(Omega(1),?)