WORST_CASE(?, O(n^1))

Initial complexity problem:
1:	T:
		(Comp: ?, Cost: 1)    evalwcet1start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1entryin(Ar_0, Ar_1, Ar_2, Ar_3))
		(Comp: ?, Cost: 1)    evalwcet1entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bbin(Ar_0, 0, Ar_0, Ar_3)) [ Ar_0 >= 1 ]
		(Comp: ?, Cost: 1)    evalwcet1entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1returnin(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 >= Ar_0 ]
		(Comp: ?, Cost: 1)    evalwcet1bbin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb1in(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 >= E + 1 ]
		(Comp: ?, Cost: 1)    evalwcet1bbin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb1in(Ar_0, Ar_1, Ar_2, Ar_3)) [ E >= 1 ]
		(Comp: ?, Cost: 1)    evalwcet1bbin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb4in(Ar_0, Ar_1, Ar_2, Ar_3))
		(Comp: ?, Cost: 1)    evalwcet1bb1in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb6in(Ar_0, Ar_1, Ar_2, 0)) [ Ar_1 + 1 >= Ar_0 ]
		(Comp: ?, Cost: 1)    evalwcet1bb1in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb6in(Ar_0, Ar_1, Ar_2, Ar_1 + 1)) [ Ar_0 >= Ar_1 + 2 ]
		(Comp: ?, Cost: 1)    evalwcet1bb4in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb5in(Ar_0, Ar_1, Ar_2, Ar_3)) [ 1 >= Ar_1 ]
		(Comp: ?, Cost: 1)    evalwcet1bb4in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb6in(Ar_0, Ar_1, Ar_2, Ar_1 - 1)) [ Ar_1 >= 2 ]
		(Comp: ?, Cost: 1)    evalwcet1bb5in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb6in(Ar_0, Ar_1, Ar_2, 0))
		(Comp: ?, Cost: 1)    evalwcet1bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bbin(Ar_0, Ar_3, Ar_2 - 1, Ar_3)) [ Ar_2 >= 2 ]
		(Comp: ?, Cost: 1)    evalwcet1bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1returnin(Ar_0, Ar_1, Ar_2, Ar_3)) [ 1 >= Ar_2 ]
		(Comp: ?, Cost: 1)    evalwcet1returnin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1stop(Ar_0, Ar_1, Ar_2, Ar_3))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1start(Ar_0, Ar_1, Ar_2, Ar_3)) [ 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)    evalwcet1start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1entryin(Ar_0, Ar_1, Ar_2, Ar_3))
		(Comp: 1, Cost: 1)    evalwcet1entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bbin(Ar_0, 0, Ar_0, Ar_3)) [ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)    evalwcet1entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1returnin(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 >= Ar_0 ]
		(Comp: ?, Cost: 1)    evalwcet1bbin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb1in(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 >= E + 1 ]
		(Comp: ?, Cost: 1)    evalwcet1bbin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb1in(Ar_0, Ar_1, Ar_2, Ar_3)) [ E >= 1 ]
		(Comp: ?, Cost: 1)    evalwcet1bbin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb4in(Ar_0, Ar_1, Ar_2, Ar_3))
		(Comp: ?, Cost: 1)    evalwcet1bb1in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb6in(Ar_0, Ar_1, Ar_2, 0)) [ Ar_1 + 1 >= Ar_0 ]
		(Comp: ?, Cost: 1)    evalwcet1bb1in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb6in(Ar_0, Ar_1, Ar_2, Ar_1 + 1)) [ Ar_0 >= Ar_1 + 2 ]
		(Comp: ?, Cost: 1)    evalwcet1bb4in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb5in(Ar_0, Ar_1, Ar_2, Ar_3)) [ 1 >= Ar_1 ]
		(Comp: ?, Cost: 1)    evalwcet1bb4in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb6in(Ar_0, Ar_1, Ar_2, Ar_1 - 1)) [ Ar_1 >= 2 ]
		(Comp: ?, Cost: 1)    evalwcet1bb5in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb6in(Ar_0, Ar_1, Ar_2, 0))
		(Comp: ?, Cost: 1)    evalwcet1bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bbin(Ar_0, Ar_3, Ar_2 - 1, Ar_3)) [ Ar_2 >= 2 ]
		(Comp: ?, Cost: 1)    evalwcet1bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1returnin(Ar_0, Ar_1, Ar_2, Ar_3)) [ 1 >= Ar_2 ]
		(Comp: ?, Cost: 1)    evalwcet1returnin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1stop(Ar_0, Ar_1, Ar_2, Ar_3))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1start(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(evalwcet1start) = 2
	Pol(evalwcet1entryin) = 2
	Pol(evalwcet1bbin) = 2
	Pol(evalwcet1returnin) = 1
	Pol(evalwcet1bb1in) = 2
	Pol(evalwcet1bb4in) = 2
	Pol(evalwcet1bb6in) = 2
	Pol(evalwcet1bb5in) = 2
	Pol(evalwcet1stop) = 0
	Pol(koat_start) = 2
orients all transitions weakly and the transitions
	evalwcet1returnin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1stop(Ar_0, Ar_1, Ar_2, Ar_3))
	evalwcet1bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1returnin(Ar_0, Ar_1, Ar_2, Ar_3)) [ 1 >= Ar_2 ]
strictly and produces the following problem:
3:	T:
		(Comp: 1, Cost: 1)    evalwcet1start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1entryin(Ar_0, Ar_1, Ar_2, Ar_3))
		(Comp: 1, Cost: 1)    evalwcet1entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bbin(Ar_0, 0, Ar_0, Ar_3)) [ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)    evalwcet1entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1returnin(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 >= Ar_0 ]
		(Comp: ?, Cost: 1)    evalwcet1bbin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb1in(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 >= E + 1 ]
		(Comp: ?, Cost: 1)    evalwcet1bbin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb1in(Ar_0, Ar_1, Ar_2, Ar_3)) [ E >= 1 ]
		(Comp: ?, Cost: 1)    evalwcet1bbin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb4in(Ar_0, Ar_1, Ar_2, Ar_3))
		(Comp: ?, Cost: 1)    evalwcet1bb1in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb6in(Ar_0, Ar_1, Ar_2, 0)) [ Ar_1 + 1 >= Ar_0 ]
		(Comp: ?, Cost: 1)    evalwcet1bb1in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb6in(Ar_0, Ar_1, Ar_2, Ar_1 + 1)) [ Ar_0 >= Ar_1 + 2 ]
		(Comp: ?, Cost: 1)    evalwcet1bb4in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb5in(Ar_0, Ar_1, Ar_2, Ar_3)) [ 1 >= Ar_1 ]
		(Comp: ?, Cost: 1)    evalwcet1bb4in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb6in(Ar_0, Ar_1, Ar_2, Ar_1 - 1)) [ Ar_1 >= 2 ]
		(Comp: ?, Cost: 1)    evalwcet1bb5in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb6in(Ar_0, Ar_1, Ar_2, 0))
		(Comp: ?, Cost: 1)    evalwcet1bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bbin(Ar_0, Ar_3, Ar_2 - 1, Ar_3)) [ Ar_2 >= 2 ]
		(Comp: 2, Cost: 1)    evalwcet1bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1returnin(Ar_0, Ar_1, Ar_2, Ar_3)) [ 1 >= Ar_2 ]
		(Comp: 2, Cost: 1)    evalwcet1returnin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1stop(Ar_0, Ar_1, Ar_2, Ar_3))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1start(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(evalwcet1bbin) = 2*V_3 - 2
	Pol(evalwcet1bb4in) = 2*V_3 - 2
	Pol(evalwcet1bb1in) = 2*V_3 - 2
	Pol(evalwcet1bb6in) = 2*V_3 - 2
	Pol(evalwcet1bb5in) = 2*V_3 - 2
and size complexities
	S("koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1start(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]", 0-0) = Ar_0
	S("koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1start(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]", 0-1) = Ar_1
	S("koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1start(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]", 0-2) = Ar_2
	S("koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1start(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]", 0-3) = Ar_3
	S("evalwcet1returnin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1stop(Ar_0, Ar_1, Ar_2, Ar_3))", 0-0) = Ar_0
	S("evalwcet1returnin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1stop(Ar_0, Ar_1, Ar_2, Ar_3))", 0-1) = ?
	S("evalwcet1returnin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1stop(Ar_0, Ar_1, Ar_2, Ar_3))", 0-2) = Ar_0 + Ar_2
	S("evalwcet1returnin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1stop(Ar_0, Ar_1, Ar_2, Ar_3))", 0-3) = ?
	S("evalwcet1bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1returnin(Ar_0, Ar_1, Ar_2, Ar_3)) [ 1 >= Ar_2 ]", 0-0) = Ar_0
	S("evalwcet1bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1returnin(Ar_0, Ar_1, Ar_2, Ar_3)) [ 1 >= Ar_2 ]", 0-1) = ?
	S("evalwcet1bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1returnin(Ar_0, Ar_1, Ar_2, Ar_3)) [ 1 >= Ar_2 ]", 0-2) = Ar_0
	S("evalwcet1bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1returnin(Ar_0, Ar_1, Ar_2, Ar_3)) [ 1 >= Ar_2 ]", 0-3) = ?
	S("evalwcet1bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bbin(Ar_0, Ar_3, Ar_2 - 1, Ar_3)) [ Ar_2 >= 2 ]", 0-0) = Ar_0
	S("evalwcet1bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bbin(Ar_0, Ar_3, Ar_2 - 1, Ar_3)) [ Ar_2 >= 2 ]", 0-1) = ?
	S("evalwcet1bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bbin(Ar_0, Ar_3, Ar_2 - 1, Ar_3)) [ Ar_2 >= 2 ]", 0-2) = Ar_0
	S("evalwcet1bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bbin(Ar_0, Ar_3, Ar_2 - 1, Ar_3)) [ Ar_2 >= 2 ]", 0-3) = ?
	S("evalwcet1bb5in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb6in(Ar_0, Ar_1, Ar_2, 0))", 0-0) = Ar_0
	S("evalwcet1bb5in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb6in(Ar_0, Ar_1, Ar_2, 0))", 0-1) = ?
	S("evalwcet1bb5in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb6in(Ar_0, Ar_1, Ar_2, 0))", 0-2) = Ar_0
	S("evalwcet1bb5in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb6in(Ar_0, Ar_1, Ar_2, 0))", 0-3) = 0
	S("evalwcet1bb4in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb6in(Ar_0, Ar_1, Ar_2, Ar_1 - 1)) [ Ar_1 >= 2 ]", 0-0) = Ar_0
	S("evalwcet1bb4in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb6in(Ar_0, Ar_1, Ar_2, Ar_1 - 1)) [ Ar_1 >= 2 ]", 0-1) = ?
	S("evalwcet1bb4in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb6in(Ar_0, Ar_1, Ar_2, Ar_1 - 1)) [ Ar_1 >= 2 ]", 0-2) = Ar_0
	S("evalwcet1bb4in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb6in(Ar_0, Ar_1, Ar_2, Ar_1 - 1)) [ Ar_1 >= 2 ]", 0-3) = ?
	S("evalwcet1bb4in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb5in(Ar_0, Ar_1, Ar_2, Ar_3)) [ 1 >= Ar_1 ]", 0-0) = Ar_0
	S("evalwcet1bb4in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb5in(Ar_0, Ar_1, Ar_2, Ar_3)) [ 1 >= Ar_1 ]", 0-1) = ?
	S("evalwcet1bb4in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb5in(Ar_0, Ar_1, Ar_2, Ar_3)) [ 1 >= Ar_1 ]", 0-2) = Ar_0
	S("evalwcet1bb4in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb5in(Ar_0, Ar_1, Ar_2, Ar_3)) [ 1 >= Ar_1 ]", 0-3) = ?
	S("evalwcet1bb1in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb6in(Ar_0, Ar_1, Ar_2, Ar_1 + 1)) [ Ar_0 >= Ar_1 + 2 ]", 0-0) = Ar_0
	S("evalwcet1bb1in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb6in(Ar_0, Ar_1, Ar_2, Ar_1 + 1)) [ Ar_0 >= Ar_1 + 2 ]", 0-1) = ?
	S("evalwcet1bb1in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb6in(Ar_0, Ar_1, Ar_2, Ar_1 + 1)) [ Ar_0 >= Ar_1 + 2 ]", 0-2) = Ar_0
	S("evalwcet1bb1in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb6in(Ar_0, Ar_1, Ar_2, Ar_1 + 1)) [ Ar_0 >= Ar_1 + 2 ]", 0-3) = ?
	S("evalwcet1bb1in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb6in(Ar_0, Ar_1, Ar_2, 0)) [ Ar_1 + 1 >= Ar_0 ]", 0-0) = Ar_0
	S("evalwcet1bb1in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb6in(Ar_0, Ar_1, Ar_2, 0)) [ Ar_1 + 1 >= Ar_0 ]", 0-1) = ?
	S("evalwcet1bb1in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb6in(Ar_0, Ar_1, Ar_2, 0)) [ Ar_1 + 1 >= Ar_0 ]", 0-2) = Ar_0
	S("evalwcet1bb1in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb6in(Ar_0, Ar_1, Ar_2, 0)) [ Ar_1 + 1 >= Ar_0 ]", 0-3) = 0
	S("evalwcet1bbin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb4in(Ar_0, Ar_1, Ar_2, Ar_3))", 0-0) = Ar_0
	S("evalwcet1bbin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb4in(Ar_0, Ar_1, Ar_2, Ar_3))", 0-1) = ?
	S("evalwcet1bbin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb4in(Ar_0, Ar_1, Ar_2, Ar_3))", 0-2) = Ar_0
	S("evalwcet1bbin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb4in(Ar_0, Ar_1, Ar_2, Ar_3))", 0-3) = ?
	S("evalwcet1bbin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb1in(Ar_0, Ar_1, Ar_2, Ar_3)) [ E >= 1 ]", 0-0) = Ar_0
	S("evalwcet1bbin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb1in(Ar_0, Ar_1, Ar_2, Ar_3)) [ E >= 1 ]", 0-1) = ?
	S("evalwcet1bbin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb1in(Ar_0, Ar_1, Ar_2, Ar_3)) [ E >= 1 ]", 0-2) = Ar_0
	S("evalwcet1bbin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb1in(Ar_0, Ar_1, Ar_2, Ar_3)) [ E >= 1 ]", 0-3) = ?
	S("evalwcet1bbin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb1in(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 >= E + 1 ]", 0-0) = Ar_0
	S("evalwcet1bbin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb1in(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 >= E + 1 ]", 0-1) = ?
	S("evalwcet1bbin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb1in(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 >= E + 1 ]", 0-2) = Ar_0
	S("evalwcet1bbin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb1in(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 >= E + 1 ]", 0-3) = ?
	S("evalwcet1entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1returnin(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 >= Ar_0 ]", 0-0) = Ar_0
	S("evalwcet1entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1returnin(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 >= Ar_0 ]", 0-1) = Ar_1
	S("evalwcet1entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1returnin(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 >= Ar_0 ]", 0-2) = Ar_2
	S("evalwcet1entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1returnin(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 >= Ar_0 ]", 0-3) = Ar_3
	S("evalwcet1entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bbin(Ar_0, 0, Ar_0, Ar_3)) [ Ar_0 >= 1 ]", 0-0) = Ar_0
	S("evalwcet1entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bbin(Ar_0, 0, Ar_0, Ar_3)) [ Ar_0 >= 1 ]", 0-1) = 0
	S("evalwcet1entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bbin(Ar_0, 0, Ar_0, Ar_3)) [ Ar_0 >= 1 ]", 0-2) = Ar_0
	S("evalwcet1entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bbin(Ar_0, 0, Ar_0, Ar_3)) [ Ar_0 >= 1 ]", 0-3) = Ar_3
	S("evalwcet1start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1entryin(Ar_0, Ar_1, Ar_2, Ar_3))", 0-0) = Ar_0
	S("evalwcet1start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1entryin(Ar_0, Ar_1, Ar_2, Ar_3))", 0-1) = Ar_1
	S("evalwcet1start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1entryin(Ar_0, Ar_1, Ar_2, Ar_3))", 0-2) = Ar_2
	S("evalwcet1start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1entryin(Ar_0, Ar_1, Ar_2, Ar_3))", 0-3) = Ar_3
orients the transitions
	evalwcet1bbin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb4in(Ar_0, Ar_1, Ar_2, Ar_3))
	evalwcet1bbin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb1in(Ar_0, Ar_1, Ar_2, Ar_3)) [ E >= 1 ]
	evalwcet1bbin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb1in(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 >= E + 1 ]
	evalwcet1bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bbin(Ar_0, Ar_3, Ar_2 - 1, Ar_3)) [ Ar_2 >= 2 ]
	evalwcet1bb5in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb6in(Ar_0, Ar_1, Ar_2, 0))
	evalwcet1bb4in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb6in(Ar_0, Ar_1, Ar_2, Ar_1 - 1)) [ Ar_1 >= 2 ]
	evalwcet1bb4in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb5in(Ar_0, Ar_1, Ar_2, Ar_3)) [ 1 >= Ar_1 ]
	evalwcet1bb1in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb6in(Ar_0, Ar_1, Ar_2, Ar_1 + 1)) [ Ar_0 >= Ar_1 + 2 ]
	evalwcet1bb1in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb6in(Ar_0, Ar_1, Ar_2, 0)) [ Ar_1 + 1 >= Ar_0 ]
weakly and the transition
	evalwcet1bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bbin(Ar_0, Ar_3, Ar_2 - 1, Ar_3)) [ Ar_2 >= 2 ]
strictly and produces the following problem:
4:	T:
		(Comp: 1, Cost: 1)             evalwcet1start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1entryin(Ar_0, Ar_1, Ar_2, Ar_3))
		(Comp: 1, Cost: 1)             evalwcet1entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bbin(Ar_0, 0, Ar_0, Ar_3)) [ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)             evalwcet1entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1returnin(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 >= Ar_0 ]
		(Comp: ?, Cost: 1)             evalwcet1bbin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb1in(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 >= E + 1 ]
		(Comp: ?, Cost: 1)             evalwcet1bbin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb1in(Ar_0, Ar_1, Ar_2, Ar_3)) [ E >= 1 ]
		(Comp: ?, Cost: 1)             evalwcet1bbin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb4in(Ar_0, Ar_1, Ar_2, Ar_3))
		(Comp: ?, Cost: 1)             evalwcet1bb1in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb6in(Ar_0, Ar_1, Ar_2, 0)) [ Ar_1 + 1 >= Ar_0 ]
		(Comp: ?, Cost: 1)             evalwcet1bb1in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb6in(Ar_0, Ar_1, Ar_2, Ar_1 + 1)) [ Ar_0 >= Ar_1 + 2 ]
		(Comp: ?, Cost: 1)             evalwcet1bb4in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb5in(Ar_0, Ar_1, Ar_2, Ar_3)) [ 1 >= Ar_1 ]
		(Comp: ?, Cost: 1)             evalwcet1bb4in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb6in(Ar_0, Ar_1, Ar_2, Ar_1 - 1)) [ Ar_1 >= 2 ]
		(Comp: ?, Cost: 1)             evalwcet1bb5in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb6in(Ar_0, Ar_1, Ar_2, 0))
		(Comp: 2*Ar_0 + 2, Cost: 1)    evalwcet1bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bbin(Ar_0, Ar_3, Ar_2 - 1, Ar_3)) [ Ar_2 >= 2 ]
		(Comp: 2, Cost: 1)             evalwcet1bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1returnin(Ar_0, Ar_1, Ar_2, Ar_3)) [ 1 >= Ar_2 ]
		(Comp: 2, Cost: 1)             evalwcet1returnin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1stop(Ar_0, Ar_1, Ar_2, Ar_3))
		(Comp: 1, Cost: 0)             koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1start(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Repeatedly propagating knowledge in problem 4 produces the following problem:
5:	T:
		(Comp: 1, Cost: 1)             evalwcet1start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1entryin(Ar_0, Ar_1, Ar_2, Ar_3))
		(Comp: 1, Cost: 1)             evalwcet1entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bbin(Ar_0, 0, Ar_0, Ar_3)) [ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)             evalwcet1entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1returnin(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 >= Ar_0 ]
		(Comp: 2*Ar_0 + 3, Cost: 1)    evalwcet1bbin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb1in(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 >= E + 1 ]
		(Comp: 2*Ar_0 + 3, Cost: 1)    evalwcet1bbin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb1in(Ar_0, Ar_1, Ar_2, Ar_3)) [ E >= 1 ]
		(Comp: 2*Ar_0 + 3, Cost: 1)    evalwcet1bbin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb4in(Ar_0, Ar_1, Ar_2, Ar_3))
		(Comp: 4*Ar_0 + 6, Cost: 1)    evalwcet1bb1in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb6in(Ar_0, Ar_1, Ar_2, 0)) [ Ar_1 + 1 >= Ar_0 ]
		(Comp: 4*Ar_0 + 6, Cost: 1)    evalwcet1bb1in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb6in(Ar_0, Ar_1, Ar_2, Ar_1 + 1)) [ Ar_0 >= Ar_1 + 2 ]
		(Comp: 2*Ar_0 + 3, Cost: 1)    evalwcet1bb4in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb5in(Ar_0, Ar_1, Ar_2, Ar_3)) [ 1 >= Ar_1 ]
		(Comp: 2*Ar_0 + 3, Cost: 1)    evalwcet1bb4in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb6in(Ar_0, Ar_1, Ar_2, Ar_1 - 1)) [ Ar_1 >= 2 ]
		(Comp: 2*Ar_0 + 3, Cost: 1)    evalwcet1bb5in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bb6in(Ar_0, Ar_1, Ar_2, 0))
		(Comp: 2*Ar_0 + 2, Cost: 1)    evalwcet1bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1bbin(Ar_0, Ar_3, Ar_2 - 1, Ar_3)) [ Ar_2 >= 2 ]
		(Comp: 2, Cost: 1)             evalwcet1bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1returnin(Ar_0, Ar_1, Ar_2, Ar_3)) [ 1 >= Ar_2 ]
		(Comp: 2, Cost: 1)             evalwcet1returnin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1stop(Ar_0, Ar_1, Ar_2, Ar_3))
		(Comp: 1, Cost: 0)             koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalwcet1start(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Complexity upper bound 22*Ar_0 + 39

Time: 1.441 sec (SMT: 1.396 sec)