WORST_CASE(Omega(0),?)

Initial ITS
Start location: l4
   0: l0 -> l1 : __const_10^0'=__const_10^post0, tmp___08^0'=tmp___08^post0, length4^0'=length4^post0, tmp^0'=tmp^post0, i5^0'=i5^post0, s^0'=s^post0, (-length4^post0+length4^0 == 0 /\ length4^0-i5^0 <= 0 /\ -s^post0+s^0 == 0 /\ __const_10^0-__const_10^post0 == 0 /\ tmp___08^0-tmp___08^post0 == 0 /\ i5^0-i5^post0 == 0 /\ -tmp^post0+tmp^0 == 0), cost: 1
   1: l0 -> l2 : __const_10^0'=__const_10^post1, tmp___08^0'=tmp___08^post1, length4^0'=length4^post1, tmp^0'=tmp^post1, i5^0'=i5^post1, s^0'=s^post1, (0 == 0 /\ __const_10^0-__const_10^post1 == 0 /\ -s^post1+s^0 == 0 /\ 1-length4^0+i5^0 <= 0 /\ -1-i5^0+i5^post1 == 0 /\ tmp^0-tmp^post1 == 0 /\ -length4^post1+length4^0 == 0), cost: 1
   2: l2 -> l0 : __const_10^0'=__const_10^post2, tmp___08^0'=tmp___08^post2, length4^0'=length4^post2, tmp^0'=tmp^post2, i5^0'=i5^post2, s^0'=s^post2, (-tmp^post2+tmp^0 == 0 /\ __const_10^0-__const_10^post2 == 0 /\ s^0-s^post2 == 0 /\ tmp___08^0-tmp___08^post2 == 0 /\ i5^0-i5^post2 == 0 /\ length4^0-length4^post2 == 0), cost: 1
   3: l3 -> l2 : __const_10^0'=__const_10^post3, tmp___08^0'=tmp___08^post3, length4^0'=length4^post3, tmp^0'=tmp^post3, i5^0'=i5^post3, s^0'=s^post3, (0 == 0 /\ -__const_10^0+length4^post3 == 0 /\ tmp___08^0-tmp___08^post3 == 0 /\ i5^post3 == 0 /\ __const_10^0-__const_10^post3 == 0 /\ -tmp^post3+s^post3 == 0), cost: 1
   4: l4 -> l3 : __const_10^0'=__const_10^post4, tmp___08^0'=tmp___08^post4, length4^0'=length4^post4, tmp^0'=tmp^post4, i5^0'=i5^post4, s^0'=s^post4, (__const_10^0-__const_10^post4 == 0 /\ tmp___08^0-tmp___08^post4 == 0 /\ length4^0-length4^post4 == 0 /\ -tmp^post4+tmp^0 == 0 /\ -s^post4+s^0 == 0 /\ -i5^post4+i5^0 == 0), cost: 1


Removed unreachable rules and leafs
Start location: l4
   1: l0 -> l2 : __const_10^0'=__const_10^post1, tmp___08^0'=tmp___08^post1, length4^0'=length4^post1, tmp^0'=tmp^post1, i5^0'=i5^post1, s^0'=s^post1, (0 == 0 /\ __const_10^0-__const_10^post1 == 0 /\ -s^post1+s^0 == 0 /\ 1-length4^0+i5^0 <= 0 /\ -1-i5^0+i5^post1 == 0 /\ tmp^0-tmp^post1 == 0 /\ -length4^post1+length4^0 == 0), cost: 1
   2: l2 -> l0 : __const_10^0'=__const_10^post2, tmp___08^0'=tmp___08^post2, length4^0'=length4^post2, tmp^0'=tmp^post2, i5^0'=i5^post2, s^0'=s^post2, (-tmp^post2+tmp^0 == 0 /\ __const_10^0-__const_10^post2 == 0 /\ s^0-s^post2 == 0 /\ tmp___08^0-tmp___08^post2 == 0 /\ i5^0-i5^post2 == 0 /\ length4^0-length4^post2 == 0), cost: 1
   3: l3 -> l2 : __const_10^0'=__const_10^post3, tmp___08^0'=tmp___08^post3, length4^0'=length4^post3, tmp^0'=tmp^post3, i5^0'=i5^post3, s^0'=s^post3, (0 == 0 /\ -__const_10^0+length4^post3 == 0 /\ tmp___08^0-tmp___08^post3 == 0 /\ i5^post3 == 0 /\ __const_10^0-__const_10^post3 == 0 /\ -tmp^post3+s^post3 == 0), cost: 1
   4: l4 -> l3 : __const_10^0'=__const_10^post4, tmp___08^0'=tmp___08^post4, length4^0'=length4^post4, tmp^0'=tmp^post4, i5^0'=i5^post4, s^0'=s^post4, (__const_10^0-__const_10^post4 == 0 /\ tmp___08^0-tmp___08^post4 == 0 /\ length4^0-length4^post4 == 0 /\ -tmp^post4+tmp^0 == 0 /\ -s^post4+s^0 == 0 /\ -i5^post4+i5^0 == 0), cost: 1


Applied preprocessing
Original rule:
l0 -> l2 : __const_10^0'=__const_10^post1, tmp___08^0'=tmp___08^post1, length4^0'=length4^post1, tmp^0'=tmp^post1, i5^0'=i5^post1, s^0'=s^post1, (0 == 0 /\ __const_10^0-__const_10^post1 == 0 /\ -s^post1+s^0 == 0 /\ 1-length4^0+i5^0 <= 0 /\ -1-i5^0+i5^post1 == 0 /\ tmp^0-tmp^post1 == 0 /\ -length4^post1+length4^0 == 0), cost: 1
New rule:
l0 -> l2 : tmp___08^0'=tmp___08^post1, i5^0'=1+i5^0, 1-length4^0+i5^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l2 -> l0 : __const_10^0'=__const_10^post2, tmp___08^0'=tmp___08^post2, length4^0'=length4^post2, tmp^0'=tmp^post2, i5^0'=i5^post2, s^0'=s^post2, (-tmp^post2+tmp^0 == 0 /\ __const_10^0-__const_10^post2 == 0 /\ s^0-s^post2 == 0 /\ tmp___08^0-tmp___08^post2 == 0 /\ i5^0-i5^post2 == 0 /\ length4^0-length4^post2 == 0), cost: 1
New rule:
l2 -> l0 : TRUE, cost: 1

Applied preprocessing
Original rule:
l3 -> l2 : __const_10^0'=__const_10^post3, tmp___08^0'=tmp___08^post3, length4^0'=length4^post3, tmp^0'=tmp^post3, i5^0'=i5^post3, s^0'=s^post3, (0 == 0 /\ -__const_10^0+length4^post3 == 0 /\ tmp___08^0-tmp___08^post3 == 0 /\ i5^post3 == 0 /\ __const_10^0-__const_10^post3 == 0 /\ -tmp^post3+s^post3 == 0), cost: 1
New rule:
l3 -> l2 : length4^0'=__const_10^0, tmp^0'=s^post3, i5^0'=0, s^0'=s^post3, 0 == 0, cost: 1

Applied preprocessing
Original rule:
l4 -> l3 : __const_10^0'=__const_10^post4, tmp___08^0'=tmp___08^post4, length4^0'=length4^post4, tmp^0'=tmp^post4, i5^0'=i5^post4, s^0'=s^post4, (__const_10^0-__const_10^post4 == 0 /\ tmp___08^0-tmp___08^post4 == 0 /\ length4^0-length4^post4 == 0 /\ -tmp^post4+tmp^0 == 0 /\ -s^post4+s^0 == 0 /\ -i5^post4+i5^0 == 0), cost: 1
New rule:
l4 -> l3 : TRUE, cost: 1

Simplified rules
Start location: l4
   5: l0 -> l2 : tmp___08^0'=tmp___08^post1, i5^0'=1+i5^0, 1-length4^0+i5^0 <= 0, cost: 1
   6: l2 -> l0 : TRUE, cost: 1
   7: l3 -> l2 : length4^0'=__const_10^0, tmp^0'=s^post3, i5^0'=0, s^0'=s^post3, 0 == 0, cost: 1
   8: l4 -> l3 : TRUE, cost: 1


Eliminating location l3 by chaining:

Applied chaining
First rule:
l4 -> l3 : TRUE, cost: 1
Second rule:
l3 -> l2 : length4^0'=__const_10^0, tmp^0'=s^post3, i5^0'=0, s^0'=s^post3, 0 == 0, cost: 1
New rule:
l4 -> l2 : length4^0'=__const_10^0, tmp^0'=s^post3, i5^0'=0, s^0'=s^post3, 0 == 0, cost: 2

Applied deletion
Removed the following rules: 7 8

Eliminating location l0 by chaining:

Applied chaining
First rule:
l2 -> l0 : TRUE, cost: 1
Second rule:
l0 -> l2 : tmp___08^0'=tmp___08^post1, i5^0'=1+i5^0, 1-length4^0+i5^0 <= 0, cost: 1
New rule:
l2 -> l2 : tmp___08^0'=tmp___08^post1, i5^0'=1+i5^0, 1-length4^0+i5^0 <= 0, cost: 2

Applied deletion
Removed the following rules: 5 6

Eliminated locations on linear paths
Start location: l4
  10: l2 -> l2 : tmp___08^0'=tmp___08^post1, i5^0'=1+i5^0, 1-length4^0+i5^0 <= 0, cost: 2
   9: l4 -> l2 : length4^0'=__const_10^0, tmp^0'=s^post3, i5^0'=0, s^0'=s^post3, 0 == 0, cost: 2


Applied acceleration
Original rule:
l2 -> l2 : tmp___08^0'=tmp___08^post1, i5^0'=1+i5^0, 1-length4^0+i5^0 <= 0, cost: 2
New rule:
l2 -> l2 : tmp___08^0'=tmp___08^post1, i5^0'=n0+i5^0, (length4^0-n0-i5^0 >= 0 /\ -1+n0 >= 0), cost: 2*n0

Applied instantiation
Original rule:
l2 -> l2 : tmp___08^0'=tmp___08^post1, i5^0'=n0+i5^0, (length4^0-n0-i5^0 >= 0 /\ -1+n0 >= 0), cost: 2*n0
New rule:
l2 -> l2 : tmp___08^0'=tmp___08^post1, i5^0'=length4^0, (0 >= 0 /\ -1+length4^0-i5^0 >= 0), cost: 2*length4^0-2*i5^0

Applied simplification
Original rule:
l2 -> l2 : tmp___08^0'=tmp___08^post1, i5^0'=length4^0, (0 >= 0 /\ -1+length4^0-i5^0 >= 0), cost: 2*length4^0-2*i5^0
New rule:
l2 -> l2 : tmp___08^0'=tmp___08^post1, i5^0'=length4^0, -1+length4^0-i5^0 >= 0, cost: 2*length4^0-2*i5^0

Applied deletion
Removed the following rules: 10

Accelerated simple loops
Start location: l4
  12: l2 -> l2 : tmp___08^0'=tmp___08^post1, i5^0'=length4^0, -1+length4^0-i5^0 >= 0, cost: 2*length4^0-2*i5^0
   9: l4 -> l2 : length4^0'=__const_10^0, tmp^0'=s^post3, i5^0'=0, s^0'=s^post3, 0 == 0, cost: 2


Applied chaining
First rule:
l4 -> l2 : length4^0'=__const_10^0, tmp^0'=s^post3, i5^0'=0, s^0'=s^post3, 0 == 0, cost: 2
Second rule:
l2 -> l2 : tmp___08^0'=tmp___08^post1, i5^0'=length4^0, -1+length4^0-i5^0 >= 0, cost: 2*length4^0-2*i5^0
New rule:
l4 -> l2 : tmp___08^0'=tmp___08^post1, length4^0'=__const_10^0, tmp^0'=s^post3, i5^0'=__const_10^0, s^0'=s^post3, -1+__const_10^0 >= 0, cost: 2+2*__const_10^0

Applied deletion
Removed the following rules: 12

Chained accelerated rules with incoming rules
Start location: l4
   9: l4 -> l2 : length4^0'=__const_10^0, tmp^0'=s^post3, i5^0'=0, s^0'=s^post3, 0 == 0, cost: 2
  13: l4 -> l2 : tmp___08^0'=tmp___08^post1, length4^0'=__const_10^0, tmp^0'=s^post3, i5^0'=__const_10^0, s^0'=s^post3, -1+__const_10^0 >= 0, cost: 2+2*__const_10^0


Removed unreachable locations and irrelevant leafs
Start location: l4
  <empty>


Computing asymptotic complexity

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

Solved cost: 0
Rule cost:   0