WORST_CASE(?, O(1))

Initial complexity problem:
1:	T:
		(Comp: ?, Cost: 1)    eval_relation1_start(Ar_0, Ar_1) -> Com_1(eval_relation1_bb0_in(Ar_0, Ar_1))
		(Comp: ?, Cost: 1)    eval_relation1_bb0_in(Ar_0, Ar_1) -> Com_1(eval_relation1_0(Ar_0, Ar_1))
		(Comp: ?, Cost: 1)    eval_relation1_0(Ar_0, Ar_1) -> Com_1(eval_relation1_1(Ar_0, Ar_1))
		(Comp: ?, Cost: 1)    eval_relation1_1(Ar_0, Ar_1) -> Com_1(eval_relation1_2(Ar_0, Ar_1))
		(Comp: ?, Cost: 1)    eval_relation1_2(Ar_0, Ar_1) -> Com_1(eval_relation1_3(Ar_0, Ar_1))
		(Comp: ?, Cost: 1)    eval_relation1_3(Ar_0, Ar_1) -> Com_1(eval_relation1_4(Ar_0, Ar_1))
		(Comp: ?, Cost: 1)    eval_relation1_4(Ar_0, Ar_1) -> Com_1(eval_relation1_5(Ar_0, Ar_1))
		(Comp: ?, Cost: 1)    eval_relation1_5(Ar_0, Ar_1) -> Com_1(eval_relation1_bb1_in(Ar_0, Ar_1))
		(Comp: ?, Cost: 1)    eval_relation1_bb1_in(Ar_0, Ar_1) -> Com_1(eval_relation1_6(Ar_0, Ar_1))
		(Comp: ?, Cost: 1)    eval_relation1_6(Ar_0, Ar_1) -> Com_1(eval_relation1_7(Ar_0, Ar_1))
		(Comp: ?, Cost: 1)    eval_relation1_7(Ar_0, Ar_1) -> Com_1(eval_relation1_bb2_in(Ar_0, Ar_1))
		(Comp: ?, Cost: 1)    eval_relation1_bb2_in(Ar_0, Ar_1) -> Com_1(eval_relation1_stop(Ar_0, Ar_1))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1) -> Com_1(eval_relation1_start(Ar_0, Ar_1)) [ 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)    eval_relation1_start(Ar_0, Ar_1) -> Com_1(eval_relation1_bb0_in(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)    eval_relation1_bb0_in(Ar_0, Ar_1) -> Com_1(eval_relation1_0(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)    eval_relation1_0(Ar_0, Ar_1) -> Com_1(eval_relation1_1(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)    eval_relation1_1(Ar_0, Ar_1) -> Com_1(eval_relation1_2(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)    eval_relation1_2(Ar_0, Ar_1) -> Com_1(eval_relation1_3(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)    eval_relation1_3(Ar_0, Ar_1) -> Com_1(eval_relation1_4(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)    eval_relation1_4(Ar_0, Ar_1) -> Com_1(eval_relation1_5(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)    eval_relation1_5(Ar_0, Ar_1) -> Com_1(eval_relation1_bb1_in(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)    eval_relation1_bb1_in(Ar_0, Ar_1) -> Com_1(eval_relation1_6(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)    eval_relation1_6(Ar_0, Ar_1) -> Com_1(eval_relation1_7(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)    eval_relation1_7(Ar_0, Ar_1) -> Com_1(eval_relation1_bb2_in(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)    eval_relation1_bb2_in(Ar_0, Ar_1) -> Com_1(eval_relation1_stop(Ar_0, Ar_1))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1) -> Com_1(eval_relation1_start(Ar_0, Ar_1)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Complexity upper bound 12

Time: 0.473 sec (SMT: 0.464 sec)