WORST_CASE(?, O(1)) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) f8(Ar_0, Ar_1, Ar_2) -> Com_1(f12(2, 1, Ar_2)) [ Ar_0 = 2 ] (Comp: ?, Cost: 1) f8(Ar_0, Ar_1, Ar_2) -> Com_1(f12(Ar_0, 0, Ar_2)) [ 1 >= Ar_0 ] (Comp: ?, Cost: 1) f8(Ar_0, Ar_1, Ar_2) -> Com_1(f12(Ar_0, 0, Ar_2)) [ Ar_0 >= 3 ] (Comp: ?, Cost: 1) f0(Ar_0, Ar_1, Ar_2) -> Com_1(f12(1, 1, 1)) (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(f0(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 Testing for reachability in the complexity graph removes the following transitions from problem 1: f8(Ar_0, Ar_1, Ar_2) -> Com_1(f12(2, 1, Ar_2)) [ Ar_0 = 2 ] f8(Ar_0, Ar_1, Ar_2) -> Com_1(f12(Ar_0, 0, Ar_2)) [ 1 >= Ar_0 ] f8(Ar_0, Ar_1, Ar_2) -> Com_1(f12(Ar_0, 0, Ar_2)) [ Ar_0 >= 3 ] We thus obtain the following problem: 2: T: (Comp: ?, Cost: 1) f0(Ar_0, Ar_1, Ar_2) -> Com_1(f12(1, 1, 1)) (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(f0(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 Repeatedly propagating knowledge in problem 2 produces the following problem: 3: T: (Comp: 1, Cost: 1) f0(Ar_0, Ar_1, Ar_2) -> Com_1(f12(1, 1, 1)) (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(f0(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 Complexity upper bound 1 Time: 0.074 sec (SMT: 0.073 sec)