WORST_CASE(?, O(n^2))

Initial complexity problem:
1:	T:
		(Comp: ?, Cost: 1)    evalwhile2start(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2entryin(Ar_0, Ar_1, Ar_2))
		(Comp: ?, Cost: 1)    evalwhile2entryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb4in(Ar_1, Ar_1, Ar_2))
		(Comp: ?, Cost: 1)    evalwhile2bb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb2in(Ar_0, Ar_1, Ar_1)) [ Ar_0 >= 1 ]
		(Comp: ?, Cost: 1)    evalwhile2bb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2returnin(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_0 ]
		(Comp: ?, Cost: 1)    evalwhile2bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb1in(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= 1 ]
		(Comp: ?, Cost: 1)    evalwhile2bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb3in(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_2 ]
		(Comp: ?, Cost: 1)    evalwhile2bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb2in(Ar_0, Ar_1, Ar_2 - 1))
		(Comp: ?, Cost: 1)    evalwhile2bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb4in(Ar_0 - 1, Ar_1, Ar_2))
		(Comp: ?, Cost: 1)    evalwhile2returnin(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2stop(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2start(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)    evalwhile2start(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2entryin(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    evalwhile2entryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb4in(Ar_1, Ar_1, Ar_2))
		(Comp: ?, Cost: 1)    evalwhile2bb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb2in(Ar_0, Ar_1, Ar_1)) [ Ar_0 >= 1 ]
		(Comp: ?, Cost: 1)    evalwhile2bb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2returnin(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_0 ]
		(Comp: ?, Cost: 1)    evalwhile2bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb1in(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= 1 ]
		(Comp: ?, Cost: 1)    evalwhile2bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb3in(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_2 ]
		(Comp: ?, Cost: 1)    evalwhile2bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb2in(Ar_0, Ar_1, Ar_2 - 1))
		(Comp: ?, Cost: 1)    evalwhile2bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb4in(Ar_0 - 1, Ar_1, Ar_2))
		(Comp: ?, Cost: 1)    evalwhile2returnin(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2stop(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2start(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(evalwhile2start) = 1
	Pol(evalwhile2entryin) = 1
	Pol(evalwhile2bb4in) = 1
	Pol(evalwhile2bb2in) = 1
	Pol(evalwhile2returnin) = 0
	Pol(evalwhile2bb1in) = 1
	Pol(evalwhile2bb3in) = 1
	Pol(evalwhile2stop) = -1
	Pol(koat_start) = 1
orients all transitions weakly and the transition
	evalwhile2bb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2returnin(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_0 ]
strictly and produces the following problem:
3:	T:
		(Comp: 1, Cost: 1)    evalwhile2start(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2entryin(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    evalwhile2entryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb4in(Ar_1, Ar_1, Ar_2))
		(Comp: ?, Cost: 1)    evalwhile2bb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb2in(Ar_0, Ar_1, Ar_1)) [ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)    evalwhile2bb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2returnin(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_0 ]
		(Comp: ?, Cost: 1)    evalwhile2bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb1in(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= 1 ]
		(Comp: ?, Cost: 1)    evalwhile2bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb3in(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_2 ]
		(Comp: ?, Cost: 1)    evalwhile2bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb2in(Ar_0, Ar_1, Ar_2 - 1))
		(Comp: ?, Cost: 1)    evalwhile2bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb4in(Ar_0 - 1, Ar_1, Ar_2))
		(Comp: ?, Cost: 1)    evalwhile2returnin(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2stop(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2start(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Repeatedly propagating knowledge in problem 3 produces the following problem:
4:	T:
		(Comp: 1, Cost: 1)    evalwhile2start(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2entryin(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    evalwhile2entryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb4in(Ar_1, Ar_1, Ar_2))
		(Comp: ?, Cost: 1)    evalwhile2bb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb2in(Ar_0, Ar_1, Ar_1)) [ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)    evalwhile2bb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2returnin(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_0 ]
		(Comp: ?, Cost: 1)    evalwhile2bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb1in(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= 1 ]
		(Comp: ?, Cost: 1)    evalwhile2bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb3in(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_2 ]
		(Comp: ?, Cost: 1)    evalwhile2bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb2in(Ar_0, Ar_1, Ar_2 - 1))
		(Comp: ?, Cost: 1)    evalwhile2bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb4in(Ar_0 - 1, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    evalwhile2returnin(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2stop(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2start(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(evalwhile2start) = V_2 + 1
	Pol(evalwhile2entryin) = V_2 + 1
	Pol(evalwhile2bb4in) = V_1 + 1
	Pol(evalwhile2bb2in) = V_1
	Pol(evalwhile2returnin) = V_1 + 1
	Pol(evalwhile2bb1in) = V_1
	Pol(evalwhile2bb3in) = V_1
	Pol(evalwhile2stop) = V_1 + 1
	Pol(koat_start) = V_2 + 1
orients all transitions weakly and the transition
	evalwhile2bb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb2in(Ar_0, Ar_1, Ar_1)) [ Ar_0 >= 1 ]
strictly and produces the following problem:
5:	T:
		(Comp: 1, Cost: 1)           evalwhile2start(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2entryin(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)           evalwhile2entryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb4in(Ar_1, Ar_1, Ar_2))
		(Comp: Ar_1 + 1, Cost: 1)    evalwhile2bb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb2in(Ar_0, Ar_1, Ar_1)) [ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)           evalwhile2bb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2returnin(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_0 ]
		(Comp: ?, Cost: 1)           evalwhile2bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb1in(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= 1 ]
		(Comp: ?, Cost: 1)           evalwhile2bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb3in(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_2 ]
		(Comp: ?, Cost: 1)           evalwhile2bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb2in(Ar_0, Ar_1, Ar_2 - 1))
		(Comp: ?, Cost: 1)           evalwhile2bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb4in(Ar_0 - 1, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)           evalwhile2returnin(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2stop(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 0)           koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2start(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(evalwhile2bb3in) = 1
	Pol(evalwhile2bb4in) = 0
	Pol(evalwhile2bb2in) = 2
	Pol(evalwhile2bb1in) = 2
and size complexities
	S("koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2start(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]", 0-0) = Ar_0
	S("koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2start(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]", 0-1) = Ar_1
	S("koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2start(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]", 0-2) = Ar_2
	S("evalwhile2returnin(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2stop(Ar_0, Ar_1, Ar_2))", 0-0) = ?
	S("evalwhile2returnin(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2stop(Ar_0, Ar_1, Ar_2))", 0-1) = Ar_1
	S("evalwhile2returnin(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2stop(Ar_0, Ar_1, Ar_2))", 0-2) = ?
	S("evalwhile2bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb4in(Ar_0 - 1, Ar_1, Ar_2))", 0-0) = ?
	S("evalwhile2bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb4in(Ar_0 - 1, Ar_1, Ar_2))", 0-1) = Ar_1
	S("evalwhile2bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb4in(Ar_0 - 1, Ar_1, Ar_2))", 0-2) = ?
	S("evalwhile2bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb2in(Ar_0, Ar_1, Ar_2 - 1))", 0-0) = ?
	S("evalwhile2bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb2in(Ar_0, Ar_1, Ar_2 - 1))", 0-1) = Ar_1
	S("evalwhile2bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb2in(Ar_0, Ar_1, Ar_2 - 1))", 0-2) = ?
	S("evalwhile2bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb3in(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_2 ]", 0-0) = ?
	S("evalwhile2bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb3in(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_2 ]", 0-1) = Ar_1
	S("evalwhile2bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb3in(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_2 ]", 0-2) = ?
	S("evalwhile2bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb1in(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= 1 ]", 0-0) = ?
	S("evalwhile2bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb1in(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= 1 ]", 0-1) = Ar_1
	S("evalwhile2bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb1in(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= 1 ]", 0-2) = ?
	S("evalwhile2bb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2returnin(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_0 ]", 0-0) = ?
	S("evalwhile2bb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2returnin(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_0 ]", 0-1) = Ar_1
	S("evalwhile2bb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2returnin(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_0 ]", 0-2) = ?
	S("evalwhile2bb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb2in(Ar_0, Ar_1, Ar_1)) [ Ar_0 >= 1 ]", 0-0) = ?
	S("evalwhile2bb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb2in(Ar_0, Ar_1, Ar_1)) [ Ar_0 >= 1 ]", 0-1) = Ar_1
	S("evalwhile2bb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb2in(Ar_0, Ar_1, Ar_1)) [ Ar_0 >= 1 ]", 0-2) = Ar_1
	S("evalwhile2entryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb4in(Ar_1, Ar_1, Ar_2))", 0-0) = Ar_1
	S("evalwhile2entryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb4in(Ar_1, Ar_1, Ar_2))", 0-1) = Ar_1
	S("evalwhile2entryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb4in(Ar_1, Ar_1, Ar_2))", 0-2) = Ar_2
	S("evalwhile2start(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2entryin(Ar_0, Ar_1, Ar_2))", 0-0) = Ar_0
	S("evalwhile2start(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2entryin(Ar_0, Ar_1, Ar_2))", 0-1) = Ar_1
	S("evalwhile2start(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2entryin(Ar_0, Ar_1, Ar_2))", 0-2) = Ar_2
orients the transitions
	evalwhile2bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb4in(Ar_0 - 1, Ar_1, Ar_2))
	evalwhile2bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb3in(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_2 ]
	evalwhile2bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb1in(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= 1 ]
	evalwhile2bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb2in(Ar_0, Ar_1, Ar_2 - 1))
weakly and the transitions
	evalwhile2bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb4in(Ar_0 - 1, Ar_1, Ar_2))
	evalwhile2bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb3in(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_2 ]
strictly and produces the following problem:
6:	T:
		(Comp: 1, Cost: 1)             evalwhile2start(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2entryin(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)             evalwhile2entryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb4in(Ar_1, Ar_1, Ar_2))
		(Comp: Ar_1 + 1, Cost: 1)      evalwhile2bb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb2in(Ar_0, Ar_1, Ar_1)) [ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)             evalwhile2bb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2returnin(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_0 ]
		(Comp: ?, Cost: 1)             evalwhile2bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb1in(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= 1 ]
		(Comp: 2*Ar_1 + 2, Cost: 1)    evalwhile2bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb3in(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_2 ]
		(Comp: ?, Cost: 1)             evalwhile2bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb2in(Ar_0, Ar_1, Ar_2 - 1))
		(Comp: 2*Ar_1 + 2, Cost: 1)    evalwhile2bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb4in(Ar_0 - 1, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)             evalwhile2returnin(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2stop(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 0)             koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2start(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(evalwhile2bb2in) = 2*V_3 + 2
	Pol(evalwhile2bb1in) = 2*V_3 + 1
and size complexities
	S("koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2start(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]", 0-0) = Ar_0
	S("koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2start(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]", 0-1) = Ar_1
	S("koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2start(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]", 0-2) = Ar_2
	S("evalwhile2returnin(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2stop(Ar_0, Ar_1, Ar_2))", 0-0) = 3*Ar_1 + 162
	S("evalwhile2returnin(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2stop(Ar_0, Ar_1, Ar_2))", 0-1) = Ar_1
	S("evalwhile2returnin(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2stop(Ar_0, Ar_1, Ar_2))", 0-2) = ?
	S("evalwhile2bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb4in(Ar_0 - 1, Ar_1, Ar_2))", 0-0) = 3*Ar_1 + 18
	S("evalwhile2bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb4in(Ar_0 - 1, Ar_1, Ar_2))", 0-1) = Ar_1
	S("evalwhile2bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb4in(Ar_0 - 1, Ar_1, Ar_2))", 0-2) = ?
	S("evalwhile2bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb2in(Ar_0, Ar_1, Ar_2 - 1))", 0-0) = 3*Ar_1 + 18
	S("evalwhile2bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb2in(Ar_0, Ar_1, Ar_2 - 1))", 0-1) = Ar_1
	S("evalwhile2bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb2in(Ar_0, Ar_1, Ar_2 - 1))", 0-2) = ?
	S("evalwhile2bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb3in(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_2 ]", 0-0) = 3*Ar_1 + 18
	S("evalwhile2bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb3in(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_2 ]", 0-1) = Ar_1
	S("evalwhile2bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb3in(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_2 ]", 0-2) = ?
	S("evalwhile2bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb1in(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= 1 ]", 0-0) = 3*Ar_1 + 18
	S("evalwhile2bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb1in(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= 1 ]", 0-1) = Ar_1
	S("evalwhile2bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb1in(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= 1 ]", 0-2) = ?
	S("evalwhile2bb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2returnin(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_0 ]", 0-0) = 3*Ar_1 + 54
	S("evalwhile2bb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2returnin(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_0 ]", 0-1) = Ar_1
	S("evalwhile2bb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2returnin(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_0 ]", 0-2) = ?
	S("evalwhile2bb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb2in(Ar_0, Ar_1, Ar_1)) [ Ar_0 >= 1 ]", 0-0) = 3*Ar_1 + 18
	S("evalwhile2bb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb2in(Ar_0, Ar_1, Ar_1)) [ Ar_0 >= 1 ]", 0-1) = Ar_1
	S("evalwhile2bb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb2in(Ar_0, Ar_1, Ar_1)) [ Ar_0 >= 1 ]", 0-2) = Ar_1
	S("evalwhile2entryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb4in(Ar_1, Ar_1, Ar_2))", 0-0) = Ar_1
	S("evalwhile2entryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb4in(Ar_1, Ar_1, Ar_2))", 0-1) = Ar_1
	S("evalwhile2entryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb4in(Ar_1, Ar_1, Ar_2))", 0-2) = Ar_2
	S("evalwhile2start(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2entryin(Ar_0, Ar_1, Ar_2))", 0-0) = Ar_0
	S("evalwhile2start(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2entryin(Ar_0, Ar_1, Ar_2))", 0-1) = Ar_1
	S("evalwhile2start(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2entryin(Ar_0, Ar_1, Ar_2))", 0-2) = Ar_2
orients the transitions
	evalwhile2bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb1in(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= 1 ]
	evalwhile2bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb2in(Ar_0, Ar_1, Ar_2 - 1))
weakly and the transition
	evalwhile2bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb1in(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= 1 ]
strictly and produces the following problem:
7:	T:
		(Comp: 1, Cost: 1)                        evalwhile2start(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2entryin(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                        evalwhile2entryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb4in(Ar_1, Ar_1, Ar_2))
		(Comp: Ar_1 + 1, Cost: 1)                 evalwhile2bb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb2in(Ar_0, Ar_1, Ar_1)) [ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)                        evalwhile2bb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2returnin(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_0 ]
		(Comp: 2*Ar_1^2 + 4*Ar_1 + 2, Cost: 1)    evalwhile2bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb1in(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= 1 ]
		(Comp: 2*Ar_1 + 2, Cost: 1)               evalwhile2bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb3in(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_2 ]
		(Comp: ?, Cost: 1)                        evalwhile2bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb2in(Ar_0, Ar_1, Ar_2 - 1))
		(Comp: 2*Ar_1 + 2, Cost: 1)               evalwhile2bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb4in(Ar_0 - 1, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                        evalwhile2returnin(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2stop(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 0)                        koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2start(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Repeatedly propagating knowledge in problem 7 produces the following problem:
8:	T:
		(Comp: 1, Cost: 1)                        evalwhile2start(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2entryin(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                        evalwhile2entryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb4in(Ar_1, Ar_1, Ar_2))
		(Comp: Ar_1 + 1, Cost: 1)                 evalwhile2bb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb2in(Ar_0, Ar_1, Ar_1)) [ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)                        evalwhile2bb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2returnin(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_0 ]
		(Comp: 2*Ar_1^2 + 4*Ar_1 + 2, Cost: 1)    evalwhile2bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb1in(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= 1 ]
		(Comp: 2*Ar_1 + 2, Cost: 1)               evalwhile2bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb3in(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_2 ]
		(Comp: 2*Ar_1^2 + 4*Ar_1 + 2, Cost: 1)    evalwhile2bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb2in(Ar_0, Ar_1, Ar_2 - 1))
		(Comp: 2*Ar_1 + 2, Cost: 1)               evalwhile2bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2bb4in(Ar_0 - 1, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                        evalwhile2returnin(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2stop(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 0)                        koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalwhile2start(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Complexity upper bound 13*Ar_1 + 4*Ar_1^2 + 13

Time: 0.710 sec (SMT: 0.680 sec)