MAYBE

Initial complexity problem:
1:	T:
		(Comp: ?, Cost: 1)    evalspeedFails4start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3))
		(Comp: ?, Cost: 1)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(1, Ar_2, Ar_0, Ar_1)) [ Ar_0 >= 1 ]
		(Comp: ?, Cost: 1)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(-1, Ar_2, Ar_0, Ar_1)) [ 0 >= Ar_0 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_1 >= Ar_3 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4returnin(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_3 >= Ar_1 + 1 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb4in(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_2 >= 1 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb5in(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 >= Ar_2 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb4in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3 + Ar_0))
		(Comp: ?, Cost: 1)    evalspeedFails4bb5in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3 - Ar_0))
		(Comp: ?, Cost: 1)    evalspeedFails4returnin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4start(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)    evalspeedFails4start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3))
		(Comp: 1, Cost: 1)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(1, Ar_2, Ar_0, Ar_1)) [ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(-1, Ar_2, Ar_0, Ar_1)) [ 0 >= Ar_0 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_1 >= Ar_3 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4returnin(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_3 >= Ar_1 + 1 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb4in(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_2 >= 1 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb5in(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 >= Ar_2 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb4in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3 + Ar_0))
		(Comp: ?, Cost: 1)    evalspeedFails4bb5in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3 - Ar_0))
		(Comp: ?, Cost: 1)    evalspeedFails4returnin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4start(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(evalspeedFails4start) = 2
	Pol(evalspeedFails4entryin) = 2
	Pol(evalspeedFails4bb6in) = 2
	Pol(evalspeedFails4bb3in) = 2
	Pol(evalspeedFails4returnin) = 1
	Pol(evalspeedFails4bb4in) = 2
	Pol(evalspeedFails4bb5in) = 2
	Pol(evalspeedFails4stop) = 0
	Pol(koat_start) = 2
orients all transitions weakly and the transitions
	evalspeedFails4returnin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3))
	evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4returnin(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_3 >= Ar_1 + 1 ]
strictly and produces the following problem:
3:	T:
		(Comp: 1, Cost: 1)    evalspeedFails4start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3))
		(Comp: 1, Cost: 1)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(1, Ar_2, Ar_0, Ar_1)) [ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(-1, Ar_2, Ar_0, Ar_1)) [ 0 >= Ar_0 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_1 >= Ar_3 ]
		(Comp: 2, Cost: 1)    evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4returnin(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_3 >= Ar_1 + 1 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb4in(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_2 >= 1 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb5in(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 >= Ar_2 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb4in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3 + Ar_0))
		(Comp: ?, Cost: 1)    evalspeedFails4bb5in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3 - Ar_0))
		(Comp: 2, Cost: 1)    evalspeedFails4returnin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4start(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Applied AI with 'oct' on problem 3 to obtain the following invariants:
  For symbol evalspeedFails4bb3in: X_2 - X_4 >= 0 /\ -X_1 + 1 >= 0 /\ X_1 + 1 >= 0
  For symbol evalspeedFails4bb4in: X_2 - X_4 >= 0 /\ X_3 - 1 >= 0 /\ X_1 + X_3 >= 0 /\ -X_1 + X_3 >= 0 /\ -X_1 + 1 >= 0 /\ X_1 + 1 >= 0
  For symbol evalspeedFails4bb5in: X_2 - X_4 >= 0 /\ -X_3 >= 0 /\ X_1 - X_3 + 1 >= 0 /\ -X_1 - X_3 + 1 >= 0 /\ -X_1 + 1 >= 0 /\ X_1 + 1 >= 0
  For symbol evalspeedFails4bb6in: -X_1 + 1 >= 0 /\ X_1 + 1 >= 0
  For symbol evalspeedFails4returnin: -X_2 + X_4 - 1 >= 0 /\ -X_1 + 1 >= 0 /\ X_1 + 1 >= 0


This yielded the following problem:
4:	T:
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4start(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]
		(Comp: 2, Cost: 1)    evalspeedFails4returnin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_1 + Ar_3 - 1 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb5in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3 - Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_2 >= 0 /\ Ar_0 - Ar_2 + 1 >= 0 /\ -Ar_0 - Ar_2 + 1 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb4in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3 + Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ Ar_2 - 1 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb5in(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ 0 >= Ar_2 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb4in(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 ]
		(Comp: 2, Cost: 1)    evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4returnin(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_3 >= Ar_1 + 1 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 >= Ar_3 ]
		(Comp: 1, Cost: 1)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(-1, Ar_2, Ar_0, Ar_1)) [ 0 >= Ar_0 ]
		(Comp: 1, Cost: 1)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(1, Ar_2, Ar_0, Ar_1)) [ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)    evalspeedFails4start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3))
	start location:	koat_start
	leaf cost:	0

Complexity upper bound ?

Time: 3.560 sec (SMT: 3.459 sec)