WORST_CASE(Omega(0),?)

Initial ITS
Start location: l2
   0: l0 -> l1 : A^0'=A^post0, NLocBuffer^0'=NLocBuffer^post0, istemp^0'=istemp^post0, NBuffers^0'=NBuffers^post0, R^0'=R^post0, (0 == 0 /\ R^post0 == 0 /\ A^post0-R^post0 == 0), cost: 1
   1: l2 -> l0 : A^0'=A^post1, NLocBuffer^0'=NLocBuffer^post1, istemp^0'=istemp^post1, NBuffers^0'=NBuffers^post1, R^0'=R^post1, (-istemp^post1+istemp^0 == 0 /\ A^0-A^post1 == 0 /\ NBuffers^0-NBuffers^post1 == 0 /\ -R^post1+R^0 == 0 /\ -NLocBuffer^post1+NLocBuffer^0 == 0), cost: 1


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


Computing asymptotic complexity

Proved the following lower bound
Complexity:  Unknown
Cpx degree: ?

Solved cost: 0
Rule cost:   0