
Initial complexity problem:
1:	T:
		(Comp: ?, Cost: 1)    evalrsdstart(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdentryin(Ar_0, Ar_1, Ar_2))
		(Comp: ?, Cost: 1)    evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbbin(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 ]
		(Comp: ?, Cost: 1)    evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdreturnin(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_0 + 1 ]
		(Comp: ?, Cost: 1)    evalrsdbbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, 2*Ar_0, 2*Ar_0))
		(Comp: ?, Cost: 1)    evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= Ar_0 ]
		(Comp: ?, Cost: 1)    evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdreturnin(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= Ar_2 + 1 ]
		(Comp: ?, Cost: 1)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb2in(Ar_0, Ar_1, Ar_2)) [ 0 >= D + 1 ]
		(Comp: ?, Cost: 1)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb2in(Ar_0, Ar_1, Ar_2)) [ D >= 1 ]
		(Comp: ?, Cost: 1)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb3in(Ar_0, Ar_1, Ar_2))
		(Comp: ?, Cost: 1)    evalrsdbb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1))
		(Comp: ?, Cost: 1)    evalrsdbb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1 - 1, Ar_1 - 1))
		(Comp: ?, Cost: 1)    evalrsdreturnin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstart(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Repeatedly propagating knowledge in problem 1 produces the following problem:
2:	T:
		(Comp: 1, Cost: 1)    evalrsdstart(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdentryin(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbbin(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 ]
		(Comp: 1, Cost: 1)    evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdreturnin(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_0 + 1 ]
		(Comp: 1, Cost: 1)    evalrsdbbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, 2*Ar_0, 2*Ar_0))
		(Comp: ?, Cost: 1)    evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= Ar_0 ]
		(Comp: ?, Cost: 1)    evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdreturnin(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= Ar_2 + 1 ]
		(Comp: ?, Cost: 1)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb2in(Ar_0, Ar_1, Ar_2)) [ 0 >= D + 1 ]
		(Comp: ?, Cost: 1)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb2in(Ar_0, Ar_1, Ar_2)) [ D >= 1 ]
		(Comp: ?, Cost: 1)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb3in(Ar_0, Ar_1, Ar_2))
		(Comp: ?, Cost: 1)    evalrsdbb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1))
		(Comp: ?, Cost: 1)    evalrsdbb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1 - 1, Ar_1 - 1))
		(Comp: ?, Cost: 1)    evalrsdreturnin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstart(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(evalrsdstart) = 2
	Pol(evalrsdentryin) = 2
	Pol(evalrsdbbin) = 2
	Pol(evalrsdreturnin) = 1
	Pol(evalrsdbb4in) = 2
	Pol(evalrsdbb1in) = 2
	Pol(evalrsdbb2in) = 2
	Pol(evalrsdbb3in) = 2
	Pol(evalrsdstop) = 0
	Pol(koat_start) = 2
orients all transitions weakly and the transitions
	evalrsdreturnin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1, Ar_2))
	evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdreturnin(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= Ar_2 + 1 ]
strictly and produces the following problem:
3:	T:
		(Comp: 1, Cost: 1)    evalrsdstart(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdentryin(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbbin(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 ]
		(Comp: 1, Cost: 1)    evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdreturnin(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_0 + 1 ]
		(Comp: 1, Cost: 1)    evalrsdbbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, 2*Ar_0, 2*Ar_0))
		(Comp: ?, Cost: 1)    evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= Ar_0 ]
		(Comp: 2, Cost: 1)    evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdreturnin(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= Ar_2 + 1 ]
		(Comp: ?, Cost: 1)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb2in(Ar_0, Ar_1, Ar_2)) [ 0 >= D + 1 ]
		(Comp: ?, Cost: 1)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb2in(Ar_0, Ar_1, Ar_2)) [ D >= 1 ]
		(Comp: ?, Cost: 1)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb3in(Ar_0, Ar_1, Ar_2))
		(Comp: ?, Cost: 1)    evalrsdbb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1))
		(Comp: ?, Cost: 1)    evalrsdbb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1 - 1, Ar_1 - 1))
		(Comp: 2, Cost: 1)    evalrsdreturnin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstart(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Applied AI with 'oct' on problem 3 to obtain the following invariants:
  For symbol evalrsdbb1in: X_3 >= 0 /\ X_1 + X_3 >= 0 /\ -X_1 + X_3 >= 0 /\ X_1 >= 0
  For symbol evalrsdbb2in: X_3 >= 0 /\ X_1 + X_3 >= 0 /\ -X_1 + X_3 >= 0 /\ X_1 >= 0
  For symbol evalrsdbb3in: X_3 >= 0 /\ X_1 + X_3 >= 0 /\ -X_1 + X_3 >= 0 /\ X_1 >= 0
  For symbol evalrsdbb4in: X_1 >= 0
  For symbol evalrsdbbin: X_1 >= 0


This yielded the following problem:
4:	T:
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstart(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
		(Comp: 2, Cost: 1)    evalrsdreturnin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1, Ar_2))
		(Comp: ?, Cost: 1)    evalrsdbb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1 - 1, Ar_1 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 ]
		(Comp: ?, Cost: 1)    evalrsdbb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 ]
		(Comp: ?, Cost: 1)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb3in(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 ]
		(Comp: ?, Cost: 1)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb2in(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ D >= 1 ]
		(Comp: ?, Cost: 1)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb2in(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ 0 >= D + 1 ]
		(Comp: 2, Cost: 1)    evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdreturnin(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 /\ Ar_0 >= Ar_2 + 1 ]
		(Comp: ?, Cost: 1)    evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 /\ Ar_2 >= Ar_0 ]
		(Comp: 1, Cost: 1)    evalrsdbbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, 2*Ar_0, 2*Ar_0)) [ Ar_0 >= 0 ]
		(Comp: 1, Cost: 1)    evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdreturnin(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_0 + 1 ]
		(Comp: 1, Cost: 1)    evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbbin(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 ]
		(Comp: 1, Cost: 1)    evalrsdstart(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdentryin(Ar_0, Ar_1, Ar_2))
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstart(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ] with all transitions in problem 4, the following new transition is obtained:
	koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdentryin(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
We thus obtain the following problem:
5:	T:
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdentryin(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
		(Comp: 2, Cost: 1)    evalrsdreturnin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1, Ar_2))
		(Comp: ?, Cost: 1)    evalrsdbb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1 - 1, Ar_1 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 ]
		(Comp: ?, Cost: 1)    evalrsdbb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 ]
		(Comp: ?, Cost: 1)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb3in(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 ]
		(Comp: ?, Cost: 1)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb2in(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ D >= 1 ]
		(Comp: ?, Cost: 1)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb2in(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ 0 >= D + 1 ]
		(Comp: 2, Cost: 1)    evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdreturnin(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 /\ Ar_0 >= Ar_2 + 1 ]
		(Comp: ?, Cost: 1)    evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 /\ Ar_2 >= Ar_0 ]
		(Comp: 1, Cost: 1)    evalrsdbbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, 2*Ar_0, 2*Ar_0)) [ Ar_0 >= 0 ]
		(Comp: 1, Cost: 1)    evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdreturnin(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_0 + 1 ]
		(Comp: 1, Cost: 1)    evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbbin(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 ]
		(Comp: 1, Cost: 1)    evalrsdstart(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdentryin(Ar_0, Ar_1, Ar_2))
	start location:	koat_start
	leaf cost:	0

Testing for reachability in the complexity graph removes the following transition from problem 5:
	evalrsdstart(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdentryin(Ar_0, Ar_1, Ar_2))
We thus obtain the following problem:
6:	T:
		(Comp: 2, Cost: 1)    evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdreturnin(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 /\ Ar_0 >= Ar_2 + 1 ]
		(Comp: ?, Cost: 1)    evalrsdbb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 ]
		(Comp: ?, Cost: 1)    evalrsdbb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1 - 1, Ar_1 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 ]
		(Comp: ?, Cost: 1)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb2in(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ 0 >= D + 1 ]
		(Comp: ?, Cost: 1)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb2in(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ D >= 1 ]
		(Comp: ?, Cost: 1)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb3in(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 ]
		(Comp: ?, Cost: 1)    evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 /\ Ar_2 >= Ar_0 ]
		(Comp: 1, Cost: 1)    evalrsdbbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, 2*Ar_0, 2*Ar_0)) [ Ar_0 >= 0 ]
		(Comp: 2, Cost: 1)    evalrsdreturnin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbbin(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 ]
		(Comp: 1, Cost: 1)    evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdreturnin(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_0 + 1 ]
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdentryin(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdreturnin(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 /\ Ar_0 >= Ar_2 + 1 ] with all transitions in problem 6, the following new transition is obtained:
	evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 /\ Ar_0 >= Ar_2 + 1 ]
We thus obtain the following problem:
7:	T:
		(Comp: 2, Cost: 2)    evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 /\ Ar_0 >= Ar_2 + 1 ]
		(Comp: ?, Cost: 1)    evalrsdbb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 ]
		(Comp: ?, Cost: 1)    evalrsdbb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1 - 1, Ar_1 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 ]
		(Comp: ?, Cost: 1)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb2in(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ 0 >= D + 1 ]
		(Comp: ?, Cost: 1)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb2in(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ D >= 1 ]
		(Comp: ?, Cost: 1)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb3in(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 ]
		(Comp: ?, Cost: 1)    evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 /\ Ar_2 >= Ar_0 ]
		(Comp: 1, Cost: 1)    evalrsdbbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, 2*Ar_0, 2*Ar_0)) [ Ar_0 >= 0 ]
		(Comp: 2, Cost: 1)    evalrsdreturnin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbbin(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 ]
		(Comp: 1, Cost: 1)    evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdreturnin(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_0 + 1 ]
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdentryin(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb2in(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ 0 >= D + 1 ] with all transitions in problem 7, the following new transition is obtained:
	evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ 0 >= D + 1 ]
We thus obtain the following problem:
8:	T:
		(Comp: ?, Cost: 2)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ 0 >= D + 1 ]
		(Comp: 2, Cost: 2)    evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 /\ Ar_0 >= Ar_2 + 1 ]
		(Comp: ?, Cost: 1)    evalrsdbb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 ]
		(Comp: ?, Cost: 1)    evalrsdbb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1 - 1, Ar_1 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 ]
		(Comp: ?, Cost: 1)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb2in(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ D >= 1 ]
		(Comp: ?, Cost: 1)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb3in(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 ]
		(Comp: ?, Cost: 1)    evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 /\ Ar_2 >= Ar_0 ]
		(Comp: 1, Cost: 1)    evalrsdbbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, 2*Ar_0, 2*Ar_0)) [ Ar_0 >= 0 ]
		(Comp: 2, Cost: 1)    evalrsdreturnin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbbin(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 ]
		(Comp: 1, Cost: 1)    evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdreturnin(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_0 + 1 ]
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdentryin(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb2in(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ D >= 1 ] with all transitions in problem 8, the following new transition is obtained:
	evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ D >= 1 ]
We thus obtain the following problem:
9:	T:
		(Comp: ?, Cost: 2)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ D >= 1 ]
		(Comp: ?, Cost: 2)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ 0 >= D + 1 ]
		(Comp: 2, Cost: 2)    evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 /\ Ar_0 >= Ar_2 + 1 ]
		(Comp: ?, Cost: 1)    evalrsdbb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 ]
		(Comp: ?, Cost: 1)    evalrsdbb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1 - 1, Ar_1 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 ]
		(Comp: ?, Cost: 1)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb3in(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 ]
		(Comp: ?, Cost: 1)    evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 /\ Ar_2 >= Ar_0 ]
		(Comp: 1, Cost: 1)    evalrsdbbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, 2*Ar_0, 2*Ar_0)) [ Ar_0 >= 0 ]
		(Comp: 2, Cost: 1)    evalrsdreturnin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbbin(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 ]
		(Comp: 1, Cost: 1)    evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdreturnin(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_0 + 1 ]
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdentryin(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Testing for reachability in the complexity graph removes the following transition from problem 9:
	evalrsdbb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 ]
We thus obtain the following problem:
10:	T:
		(Comp: 2, Cost: 2)    evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 /\ Ar_0 >= Ar_2 + 1 ]
		(Comp: ?, Cost: 1)    evalrsdbb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1 - 1, Ar_1 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 ]
		(Comp: ?, Cost: 2)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ D >= 1 ]
		(Comp: ?, Cost: 2)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ 0 >= D + 1 ]
		(Comp: ?, Cost: 1)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb3in(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 ]
		(Comp: ?, Cost: 1)    evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 /\ Ar_2 >= Ar_0 ]
		(Comp: 1, Cost: 1)    evalrsdbbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, 2*Ar_0, 2*Ar_0)) [ Ar_0 >= 0 ]
		(Comp: 2, Cost: 1)    evalrsdreturnin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbbin(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 ]
		(Comp: 1, Cost: 1)    evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdreturnin(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_0 + 1 ]
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdentryin(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb3in(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 ] with all transitions in problem 10, the following new transition is obtained:
	evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1 - 1, Ar_1 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 ]
We thus obtain the following problem:
11:	T:
		(Comp: ?, Cost: 2)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1 - 1, Ar_1 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 ]
		(Comp: 2, Cost: 2)    evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 /\ Ar_0 >= Ar_2 + 1 ]
		(Comp: ?, Cost: 1)    evalrsdbb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1 - 1, Ar_1 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 ]
		(Comp: ?, Cost: 2)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ D >= 1 ]
		(Comp: ?, Cost: 2)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ 0 >= D + 1 ]
		(Comp: ?, Cost: 1)    evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 /\ Ar_2 >= Ar_0 ]
		(Comp: 1, Cost: 1)    evalrsdbbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, 2*Ar_0, 2*Ar_0)) [ Ar_0 >= 0 ]
		(Comp: 2, Cost: 1)    evalrsdreturnin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbbin(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 ]
		(Comp: 1, Cost: 1)    evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdreturnin(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_0 + 1 ]
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdentryin(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Testing for reachability in the complexity graph removes the following transition from problem 11:
	evalrsdbb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1 - 1, Ar_1 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 ]
We thus obtain the following problem:
12:	T:
		(Comp: 2, Cost: 2)    evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 /\ Ar_0 >= Ar_2 + 1 ]
		(Comp: ?, Cost: 2)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1 - 1, Ar_1 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 ]
		(Comp: ?, Cost: 2)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ D >= 1 ]
		(Comp: ?, Cost: 2)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ 0 >= D + 1 ]
		(Comp: ?, Cost: 1)    evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 /\ Ar_2 >= Ar_0 ]
		(Comp: 1, Cost: 1)    evalrsdbbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, 2*Ar_0, 2*Ar_0)) [ Ar_0 >= 0 ]
		(Comp: 2, Cost: 1)    evalrsdreturnin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbbin(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 ]
		(Comp: 1, Cost: 1)    evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdreturnin(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_0 + 1 ]
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdentryin(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition evalrsdbbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, 2*Ar_0, 2*Ar_0)) [ Ar_0 >= 0 ] with all transitions in problem 12, the following new transition is obtained:
	evalrsdbbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, 2*Ar_0, 2*Ar_0)) [ Ar_0 >= 0 /\ 2*Ar_0 >= Ar_0 ]
We thus obtain the following problem:
13:	T:
		(Comp: 1, Cost: 2)    evalrsdbbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, 2*Ar_0, 2*Ar_0)) [ Ar_0 >= 0 /\ 2*Ar_0 >= Ar_0 ]
		(Comp: 2, Cost: 2)    evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 /\ Ar_0 >= Ar_2 + 1 ]
		(Comp: ?, Cost: 2)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1 - 1, Ar_1 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 ]
		(Comp: ?, Cost: 2)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ D >= 1 ]
		(Comp: ?, Cost: 2)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ 0 >= D + 1 ]
		(Comp: ?, Cost: 1)    evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 /\ Ar_2 >= Ar_0 ]
		(Comp: 2, Cost: 1)    evalrsdreturnin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbbin(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 ]
		(Comp: 1, Cost: 1)    evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdreturnin(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_0 + 1 ]
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdentryin(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbbin(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 ] with all transitions in problem 13, the following new transition is obtained:
	evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, 2*Ar_0, 2*Ar_0)) [ Ar_0 >= 0 /\ 2*Ar_0 >= Ar_0 ]
We thus obtain the following problem:
14:	T:
		(Comp: 1, Cost: 3)    evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, 2*Ar_0, 2*Ar_0)) [ Ar_0 >= 0 /\ 2*Ar_0 >= Ar_0 ]
		(Comp: 1, Cost: 2)    evalrsdbbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, 2*Ar_0, 2*Ar_0)) [ Ar_0 >= 0 /\ 2*Ar_0 >= Ar_0 ]
		(Comp: 2, Cost: 2)    evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 /\ Ar_0 >= Ar_2 + 1 ]
		(Comp: ?, Cost: 2)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1 - 1, Ar_1 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 ]
		(Comp: ?, Cost: 2)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ D >= 1 ]
		(Comp: ?, Cost: 2)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ 0 >= D + 1 ]
		(Comp: ?, Cost: 1)    evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 /\ Ar_2 >= Ar_0 ]
		(Comp: 2, Cost: 1)    evalrsdreturnin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdreturnin(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_0 + 1 ]
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdentryin(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Testing for reachability in the complexity graph removes the following transition from problem 14:
	evalrsdbbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, 2*Ar_0, 2*Ar_0)) [ Ar_0 >= 0 /\ 2*Ar_0 >= Ar_0 ]
We thus obtain the following problem:
15:	T:
		(Comp: 2, Cost: 2)    evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 /\ Ar_0 >= Ar_2 + 1 ]
		(Comp: ?, Cost: 1)    evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 /\ Ar_2 >= Ar_0 ]
		(Comp: ?, Cost: 2)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1 - 1, Ar_1 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 ]
		(Comp: ?, Cost: 2)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ D >= 1 ]
		(Comp: ?, Cost: 2)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ 0 >= D + 1 ]
		(Comp: 2, Cost: 1)    evalrsdreturnin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 3)    evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, 2*Ar_0, 2*Ar_0)) [ Ar_0 >= 0 /\ 2*Ar_0 >= Ar_0 ]
		(Comp: 1, Cost: 1)    evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdreturnin(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_0 + 1 ]
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdentryin(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdreturnin(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_0 + 1 ] with all transitions in problem 15, the following new transition is obtained:
	evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_0 + 1 ]
We thus obtain the following problem:
16:	T:
		(Comp: 1, Cost: 2)    evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_0 + 1 ]
		(Comp: 2, Cost: 2)    evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 /\ Ar_0 >= Ar_2 + 1 ]
		(Comp: ?, Cost: 1)    evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 /\ Ar_2 >= Ar_0 ]
		(Comp: ?, Cost: 2)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1 - 1, Ar_1 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 ]
		(Comp: ?, Cost: 2)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ D >= 1 ]
		(Comp: ?, Cost: 2)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ 0 >= D + 1 ]
		(Comp: 2, Cost: 1)    evalrsdreturnin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 3)    evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, 2*Ar_0, 2*Ar_0)) [ Ar_0 >= 0 /\ 2*Ar_0 >= Ar_0 ]
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdentryin(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Testing for reachability in the complexity graph removes the following transition from problem 16:
	evalrsdreturnin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1, Ar_2))
We thus obtain the following problem:
17:	T:
		(Comp: 2, Cost: 2)    evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 /\ Ar_0 >= Ar_2 + 1 ]
		(Comp: ?, Cost: 1)    evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 /\ Ar_2 >= Ar_0 ]
		(Comp: ?, Cost: 2)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1 - 1, Ar_1 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 ]
		(Comp: ?, Cost: 2)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ D >= 1 ]
		(Comp: ?, Cost: 2)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ 0 >= D + 1 ]
		(Comp: 1, Cost: 2)    evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_0 + 1 ]
		(Comp: 1, Cost: 3)    evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, 2*Ar_0, 2*Ar_0)) [ Ar_0 >= 0 /\ 2*Ar_0 >= Ar_0 ]
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdentryin(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1 - 1, Ar_1 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 ] with all transitions in problem 17, the following new transitions are obtained:
	evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1 - 1, Ar_1 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_0 >= Ar_1 ]
	evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, Ar_1 - 1, Ar_1 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 - 1 >= Ar_0 ]
We thus obtain the following problem:
18:	T:
		(Comp: ?, Cost: 4)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1 - 1, Ar_1 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_0 >= Ar_1 ]
		(Comp: ?, Cost: 3)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, Ar_1 - 1, Ar_1 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 - 1 >= Ar_0 ]
		(Comp: 2, Cost: 2)    evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 /\ Ar_0 >= Ar_2 + 1 ]
		(Comp: ?, Cost: 1)    evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 /\ Ar_2 >= Ar_0 ]
		(Comp: ?, Cost: 2)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ D >= 1 ]
		(Comp: ?, Cost: 2)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ 0 >= D + 1 ]
		(Comp: 1, Cost: 2)    evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_0 + 1 ]
		(Comp: 1, Cost: 3)    evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, 2*Ar_0, 2*Ar_0)) [ Ar_0 >= 0 /\ 2*Ar_0 >= Ar_0 ]
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdentryin(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(evalrsdbb1in) = 1
	Pol(evalrsdstop) = 0
	Pol(evalrsdbb4in) = 1
	Pol(evalrsdentryin) = 1
	Pol(koat_start) = 1
orients all transitions weakly and the transition
	evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1 - 1, Ar_1 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_0 >= Ar_1 ]
strictly and produces the following problem:
19:	T:
		(Comp: 1, Cost: 4)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1 - 1, Ar_1 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_0 >= Ar_1 ]
		(Comp: ?, Cost: 3)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, Ar_1 - 1, Ar_1 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 - 1 >= Ar_0 ]
		(Comp: 2, Cost: 2)    evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 /\ Ar_0 >= Ar_2 + 1 ]
		(Comp: ?, Cost: 1)    evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 /\ Ar_2 >= Ar_0 ]
		(Comp: ?, Cost: 2)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ D >= 1 ]
		(Comp: ?, Cost: 2)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ 0 >= D + 1 ]
		(Comp: 1, Cost: 2)    evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_0 + 1 ]
		(Comp: 1, Cost: 3)    evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, 2*Ar_0, 2*Ar_0)) [ Ar_0 >= 0 /\ 2*Ar_0 >= Ar_0 ]
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdentryin(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(evalrsdbb4in) = V_2
	Pol(evalrsdbb1in) = V_2
and size complexities
	S("koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdentryin(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]", 0-0) = Ar_0
	S("koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdentryin(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]", 0-1) = Ar_1
	S("koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdentryin(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]", 0-2) = Ar_2
	S("evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, 2*Ar_0, 2*Ar_0)) [ Ar_0 >= 0 /\\ 2*Ar_0 >= Ar_0 ]", 0-0) = Ar_0
	S("evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, 2*Ar_0, 2*Ar_0)) [ Ar_0 >= 0 /\\ 2*Ar_0 >= Ar_0 ]", 0-1) = 2*Ar_0
	S("evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, 2*Ar_0, 2*Ar_0)) [ Ar_0 >= 0 /\\ 2*Ar_0 >= Ar_0 ]", 0-2) = 2*Ar_0
	S("evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_0 + 1 ]", 0-0) = Ar_0
	S("evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_0 + 1 ]", 0-1) = Ar_1
	S("evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_0 + 1 ]", 0-2) = Ar_2
	S("evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 >= 0 /\\ Ar_0 + Ar_2 >= 0 /\\ -Ar_0 + Ar_2 >= 0 /\\ Ar_0 >= 0 /\\ 0 >= D + 1 ]", 0-0) = Ar_0
	S("evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 >= 0 /\\ Ar_0 + Ar_2 >= 0 /\\ -Ar_0 + Ar_2 >= 0 /\\ Ar_0 >= 0 /\\ 0 >= D + 1 ]", 0-1) = 2*Ar_0
	S("evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 >= 0 /\\ Ar_0 + Ar_2 >= 0 /\\ -Ar_0 + Ar_2 >= 0 /\\ Ar_0 >= 0 /\\ 0 >= D + 1 ]", 0-2) = 2*Ar_0 + 8
	S("evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 >= 0 /\\ Ar_0 + Ar_2 >= 0 /\\ -Ar_0 + Ar_2 >= 0 /\\ Ar_0 >= 0 /\\ D >= 1 ]", 0-0) = Ar_0
	S("evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 >= 0 /\\ Ar_0 + Ar_2 >= 0 /\\ -Ar_0 + Ar_2 >= 0 /\\ Ar_0 >= 0 /\\ D >= 1 ]", 0-1) = 2*Ar_0
	S("evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 >= 0 /\\ Ar_0 + Ar_2 >= 0 /\\ -Ar_0 + Ar_2 >= 0 /\\ Ar_0 >= 0 /\\ D >= 1 ]", 0-2) = 2*Ar_0 + 8
	S("evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 /\\ Ar_2 >= Ar_0 ]", 0-0) = Ar_0
	S("evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 /\\ Ar_2 >= Ar_0 ]", 0-1) = 2*Ar_0
	S("evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 /\\ Ar_2 >= Ar_0 ]", 0-2) = 2*Ar_0 + 8
	S("evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 /\\ Ar_0 >= Ar_2 + 1 ]", 0-0) = Ar_0
	S("evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 /\\ Ar_0 >= Ar_2 + 1 ]", 0-1) = 2*Ar_0
	S("evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 /\\ Ar_0 >= Ar_2 + 1 ]", 0-2) = 2*Ar_0 + 16
	S("evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, Ar_1 - 1, Ar_1 - 1)) [ Ar_2 >= 0 /\\ Ar_0 + Ar_2 >= 0 /\\ -Ar_0 + Ar_2 >= 0 /\\ Ar_0 >= 0 /\\ Ar_1 - 1 >= Ar_0 ]", 0-0) = Ar_0
	S("evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, Ar_1 - 1, Ar_1 - 1)) [ Ar_2 >= 0 /\\ Ar_0 + Ar_2 >= 0 /\\ -Ar_0 + Ar_2 >= 0 /\\ Ar_0 >= 0 /\\ Ar_1 - 1 >= Ar_0 ]", 0-1) = 2*Ar_0
	S("evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, Ar_1 - 1, Ar_1 - 1)) [ Ar_2 >= 0 /\\ Ar_0 + Ar_2 >= 0 /\\ -Ar_0 + Ar_2 >= 0 /\\ Ar_0 >= 0 /\\ Ar_1 - 1 >= Ar_0 ]", 0-2) = 2*Ar_0
	S("evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1 - 1, Ar_1 - 1)) [ Ar_2 >= 0 /\\ Ar_0 + Ar_2 >= 0 /\\ -Ar_0 + Ar_2 >= 0 /\\ Ar_0 >= 0 /\\ Ar_0 >= Ar_1 ]", 0-0) = Ar_0
	S("evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1 - 1, Ar_1 - 1)) [ Ar_2 >= 0 /\\ Ar_0 + Ar_2 >= 0 /\\ -Ar_0 + Ar_2 >= 0 /\\ Ar_0 >= 0 /\\ Ar_0 >= Ar_1 ]", 0-1) = 2*Ar_0 + 2
	S("evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1 - 1, Ar_1 - 1)) [ Ar_2 >= 0 /\\ Ar_0 + Ar_2 >= 0 /\\ -Ar_0 + Ar_2 >= 0 /\\ Ar_0 >= 0 /\\ Ar_0 >= Ar_1 ]", 0-2) = 2*Ar_0 + 2
orients the transitions
	evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 /\ Ar_2 >= Ar_0 ]
	evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ D >= 1 ]
	evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ 0 >= D + 1 ]
	evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, Ar_1 - 1, Ar_1 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 - 1 >= Ar_0 ]
weakly and the transition
	evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, Ar_1 - 1, Ar_1 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 - 1 >= Ar_0 ]
strictly and produces the following problem:
20:	T:
		(Comp: 1, Cost: 4)         evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1 - 1, Ar_1 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_0 >= Ar_1 ]
		(Comp: 2*Ar_0, Cost: 3)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, Ar_1 - 1, Ar_1 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 - 1 >= Ar_0 ]
		(Comp: 2, Cost: 2)         evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 /\ Ar_0 >= Ar_2 + 1 ]
		(Comp: ?, Cost: 1)         evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 /\ Ar_2 >= Ar_0 ]
		(Comp: ?, Cost: 2)         evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ D >= 1 ]
		(Comp: ?, Cost: 2)         evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ 0 >= D + 1 ]
		(Comp: 1, Cost: 2)         evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_0 + 1 ]
		(Comp: 1, Cost: 3)         evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, 2*Ar_0, 2*Ar_0)) [ Ar_0 >= 0 /\ 2*Ar_0 >= Ar_0 ]
		(Comp: 1, Cost: 1)         koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdentryin(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(evalrsdbb4in) = 2*V_3 + 2
	Pol(evalrsdbb1in) = 2*V_3 + 1
and size complexities
	S("koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdentryin(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]", 0-0) = Ar_0
	S("koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdentryin(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]", 0-1) = Ar_1
	S("koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdentryin(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]", 0-2) = Ar_2
	S("evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, 2*Ar_0, 2*Ar_0)) [ Ar_0 >= 0 /\\ 2*Ar_0 >= Ar_0 ]", 0-0) = Ar_0
	S("evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, 2*Ar_0, 2*Ar_0)) [ Ar_0 >= 0 /\\ 2*Ar_0 >= Ar_0 ]", 0-1) = 2*Ar_0
	S("evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, 2*Ar_0, 2*Ar_0)) [ Ar_0 >= 0 /\\ 2*Ar_0 >= Ar_0 ]", 0-2) = 2*Ar_0
	S("evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_0 + 1 ]", 0-0) = Ar_0
	S("evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_0 + 1 ]", 0-1) = Ar_1
	S("evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_0 + 1 ]", 0-2) = Ar_2
	S("evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 >= 0 /\\ Ar_0 + Ar_2 >= 0 /\\ -Ar_0 + Ar_2 >= 0 /\\ Ar_0 >= 0 /\\ 0 >= D + 1 ]", 0-0) = Ar_0
	S("evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 >= 0 /\\ Ar_0 + Ar_2 >= 0 /\\ -Ar_0 + Ar_2 >= 0 /\\ Ar_0 >= 0 /\\ 0 >= D + 1 ]", 0-1) = 2*Ar_0
	S("evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 >= 0 /\\ Ar_0 + Ar_2 >= 0 /\\ -Ar_0 + Ar_2 >= 0 /\\ Ar_0 >= 0 /\\ 0 >= D + 1 ]", 0-2) = 2*Ar_0 + 8
	S("evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 >= 0 /\\ Ar_0 + Ar_2 >= 0 /\\ -Ar_0 + Ar_2 >= 0 /\\ Ar_0 >= 0 /\\ D >= 1 ]", 0-0) = Ar_0
	S("evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 >= 0 /\\ Ar_0 + Ar_2 >= 0 /\\ -Ar_0 + Ar_2 >= 0 /\\ Ar_0 >= 0 /\\ D >= 1 ]", 0-1) = 2*Ar_0
	S("evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 >= 0 /\\ Ar_0 + Ar_2 >= 0 /\\ -Ar_0 + Ar_2 >= 0 /\\ Ar_0 >= 0 /\\ D >= 1 ]", 0-2) = 2*Ar_0 + 8
	S("evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 /\\ Ar_2 >= Ar_0 ]", 0-0) = Ar_0
	S("evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 /\\ Ar_2 >= Ar_0 ]", 0-1) = 2*Ar_0
	S("evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 /\\ Ar_2 >= Ar_0 ]", 0-2) = 2*Ar_0 + 8
	S("evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 /\\ Ar_0 >= Ar_2 + 1 ]", 0-0) = Ar_0
	S("evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 /\\ Ar_0 >= Ar_2 + 1 ]", 0-1) = 2*Ar_0
	S("evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 /\\ Ar_0 >= Ar_2 + 1 ]", 0-2) = 2*Ar_0 + 16
	S("evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, Ar_1 - 1, Ar_1 - 1)) [ Ar_2 >= 0 /\\ Ar_0 + Ar_2 >= 0 /\\ -Ar_0 + Ar_2 >= 0 /\\ Ar_0 >= 0 /\\ Ar_1 - 1 >= Ar_0 ]", 0-0) = Ar_0
	S("evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, Ar_1 - 1, Ar_1 - 1)) [ Ar_2 >= 0 /\\ Ar_0 + Ar_2 >= 0 /\\ -Ar_0 + Ar_2 >= 0 /\\ Ar_0 >= 0 /\\ Ar_1 - 1 >= Ar_0 ]", 0-1) = 2*Ar_0
	S("evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, Ar_1 - 1, Ar_1 - 1)) [ Ar_2 >= 0 /\\ Ar_0 + Ar_2 >= 0 /\\ -Ar_0 + Ar_2 >= 0 /\\ Ar_0 >= 0 /\\ Ar_1 - 1 >= Ar_0 ]", 0-2) = 2*Ar_0
	S("evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1 - 1, Ar_1 - 1)) [ Ar_2 >= 0 /\\ Ar_0 + Ar_2 >= 0 /\\ -Ar_0 + Ar_2 >= 0 /\\ Ar_0 >= 0 /\\ Ar_0 >= Ar_1 ]", 0-0) = Ar_0
	S("evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1 - 1, Ar_1 - 1)) [ Ar_2 >= 0 /\\ Ar_0 + Ar_2 >= 0 /\\ -Ar_0 + Ar_2 >= 0 /\\ Ar_0 >= 0 /\\ Ar_0 >= Ar_1 ]", 0-1) = 2*Ar_0 + 2
	S("evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1 - 1, Ar_1 - 1)) [ Ar_2 >= 0 /\\ Ar_0 + Ar_2 >= 0 /\\ -Ar_0 + Ar_2 >= 0 /\\ Ar_0 >= 0 /\\ Ar_0 >= Ar_1 ]", 0-2) = 2*Ar_0 + 2
orients the transitions
	evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 /\ Ar_2 >= Ar_0 ]
	evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ D >= 1 ]
	evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ 0 >= D + 1 ]
weakly and the transitions
	evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 /\ Ar_2 >= Ar_0 ]
	evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ D >= 1 ]
	evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ 0 >= D + 1 ]
strictly and produces the following problem:
21:	T:
		(Comp: 1, Cost: 4)                        evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1 - 1, Ar_1 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_0 >= Ar_1 ]
		(Comp: 2*Ar_0, Cost: 3)                   evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, Ar_1 - 1, Ar_1 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 - 1 >= Ar_0 ]
		(Comp: 2, Cost: 2)                        evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 /\ Ar_0 >= Ar_2 + 1 ]
		(Comp: 8*Ar_0^2 + 6*Ar_0 + 1, Cost: 1)    evalrsdbb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 /\ Ar_2 >= Ar_0 ]
		(Comp: 8*Ar_0^2 + 6*Ar_0 + 1, Cost: 2)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ D >= 1 ]
		(Comp: 8*Ar_0^2 + 6*Ar_0 + 1, Cost: 2)    evalrsdbb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb4in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ 0 >= D + 1 ]
		(Comp: 1, Cost: 2)                        evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdstop(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_0 + 1 ]
		(Comp: 1, Cost: 3)                        evalrsdentryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdbb1in(Ar_0, 2*Ar_0, 2*Ar_0)) [ Ar_0 >= 0 /\ 2*Ar_0 >= Ar_0 ]
		(Comp: 1, Cost: 1)                        koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalrsdentryin(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Complexity upper bound 36*Ar_0 + 40*Ar_0^2 + 19

Time: 0.319 sec (SMT: 0.268 sec)
