WORST_CASE(?, O(1))

Initial complexity problem:
1:	T:
		(Comp: ?, Cost: 1)    f0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(f17(Fresh_6, Fresh_7, Fresh_8, Ar_3, Ar_4, Ar_5)) [ 0 >= Fresh_7 + 2 ]
		(Comp: ?, Cost: 1)    f0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(f17(Fresh_3, Fresh_4, Fresh_5, Ar_3, Ar_4, Ar_5)) [ Fresh_4 >= 0 ]
		(Comp: ?, Cost: 1)    f0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(f17(Fresh_0, -1, Ar_2, 0, Fresh_1, Fresh_2))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(f0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) [ 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)    f0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(f17(Fresh_6, Fresh_7, Fresh_8, Ar_3, Ar_4, Ar_5)) [ 0 >= Fresh_7 + 2 ]
		(Comp: 1, Cost: 1)    f0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(f17(Fresh_3, Fresh_4, Fresh_5, Ar_3, Ar_4, Ar_5)) [ Fresh_4 >= 0 ]
		(Comp: 1, Cost: 1)    f0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(f17(Fresh_0, -1, Ar_2, 0, Fresh_1, Fresh_2))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(f0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Complexity upper bound 3

Time: 0.335 sec (SMT: 0.329 sec)