WORST_CASE(Omega(0),?)

Initial ITS
Start location: l2
   0: l0 -> l1 : tmp^0'=tmp^post0, x68^0'=x68^post0, x35^0'=x35^post0, 0 == 0, cost: 1
   1: l2 -> l0 : tmp^0'=tmp^post1, x68^0'=x68^post1, x35^0'=x35^post1, (x68^0-x68^post1 == 0 /\ tmp^0-tmp^post1 == 0 /\ x35^0-x35^post1 == 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