/export/starexec/sandbox2/solver/bin/starexec_run_c_complexity /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?, O(n^1)) proof of /export/starexec/sandbox2/output/output_files/bench.koat # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, n^1). (0) CpxIntTrs (1) Koat Proof [FINISHED, 87 ms] (2) BOUNDS(1, n^1) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_foo_start(v_.0, v_.1, v_i, v_m, v_n, v_x) -> Com_1(eval_foo_bb0_in(v_.0, v_.1, v_i, v_m, v_n, v_x)) :|: TRUE eval_foo_bb0_in(v_.0, v_.1, v_i, v_m, v_n, v_x) -> Com_1(eval_foo_bb1_in(v_x, v_.1, v_i, v_m, v_n, v_x)) :|: TRUE eval_foo_bb1_in(v_.0, v_.1, v_i, v_m, v_n, v_x) -> Com_1(eval_foo_bb2_in(v_.0, v_.1, v_i, v_m, v_n, v_x)) :|: v_.0 < v_n eval_foo_bb1_in(v_.0, v_.1, v_i, v_m, v_n, v_x) -> Com_1(eval_foo_bb3_in(v_.0, v_.0, v_i, v_m, v_n, v_x)) :|: v_.0 >= v_n eval_foo_bb2_in(v_.0, v_.1, v_i, v_m, v_n, v_x) -> Com_1(eval_foo_bb1_in(v_.0 + 1, v_.1, v_i, v_m, v_n, v_x)) :|: TRUE eval_foo_bb3_in(v_.0, v_.1, v_i, v_m, v_n, v_x) -> Com_1(eval_foo_bb4_in(v_.0, v_.1, v_i, v_m, v_n, v_x)) :|: v_.1 < v_m eval_foo_bb3_in(v_.0, v_.1, v_i, v_m, v_n, v_x) -> Com_1(eval_foo_bb5_in(v_.0, v_.1, v_i, v_m, v_n, v_x)) :|: v_.1 >= v_m eval_foo_bb4_in(v_.0, v_.1, v_i, v_m, v_n, v_x) -> Com_1(eval_foo_bb3_in(v_.0, v_.1 + 1, v_i, v_m, v_n, v_x)) :|: TRUE eval_foo_bb5_in(v_.0, v_.1, v_i, v_m, v_n, v_x) -> Com_1(eval_foo_stop(v_.0, v_.1, v_i, v_m, v_n, v_x)) :|: TRUE The start-symbols are:[eval_foo_start_6] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 2*Ar_1 + 4*Ar_2 + 2*Ar_4 + 11) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalfoostart(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb0in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: ?, Cost: 1) evalfoobb0in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb1in(Ar_1, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: ?, Cost: 1) evalfoobb1in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb2in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) evalfoobb1in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb3in(Ar_0, Ar_1, Ar_2, Ar_0, Ar_4)) [ Ar_0 >= Ar_2 ] (Comp: ?, Cost: 1) evalfoobb2in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb1in(Ar_0 + 1, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: ?, Cost: 1) evalfoobb3in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb4in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_4 >= Ar_3 + 1 ] (Comp: ?, Cost: 1) evalfoobb3in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb5in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_3 >= Ar_4 ] (Comp: ?, Cost: 1) evalfoobb4in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb3in(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_4)) (Comp: ?, Cost: 1) evalfoobb5in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoostop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoostart(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 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) evalfoostart(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb0in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: 1, Cost: 1) evalfoobb0in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb1in(Ar_1, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: ?, Cost: 1) evalfoobb1in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb2in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) evalfoobb1in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb3in(Ar_0, Ar_1, Ar_2, Ar_0, Ar_4)) [ Ar_0 >= Ar_2 ] (Comp: ?, Cost: 1) evalfoobb2in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb1in(Ar_0 + 1, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: ?, Cost: 1) evalfoobb3in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb4in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_4 >= Ar_3 + 1 ] (Comp: ?, Cost: 1) evalfoobb3in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb5in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_3 >= Ar_4 ] (Comp: ?, Cost: 1) evalfoobb4in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb3in(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_4)) (Comp: ?, Cost: 1) evalfoobb5in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoostop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoostart(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 A polynomial rank function with Pol(evalfoostart) = 3 Pol(evalfoobb0in) = 3 Pol(evalfoobb1in) = 3 Pol(evalfoobb2in) = 3 Pol(evalfoobb3in) = 2 Pol(evalfoobb4in) = 2 Pol(evalfoobb5in) = 1 Pol(evalfoostop) = 0 Pol(koat_start) = 3 orients all transitions weakly and the transitions evalfoobb5in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoostop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) evalfoobb3in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb5in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_3 >= Ar_4 ] evalfoobb1in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb3in(Ar_0, Ar_1, Ar_2, Ar_0, Ar_4)) [ Ar_0 >= Ar_2 ] strictly and produces the following problem: 3: T: (Comp: 1, Cost: 1) evalfoostart(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb0in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: 1, Cost: 1) evalfoobb0in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb1in(Ar_1, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: ?, Cost: 1) evalfoobb1in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb2in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= Ar_0 + 1 ] (Comp: 3, Cost: 1) evalfoobb1in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb3in(Ar_0, Ar_1, Ar_2, Ar_0, Ar_4)) [ Ar_0 >= Ar_2 ] (Comp: ?, Cost: 1) evalfoobb2in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb1in(Ar_0 + 1, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: ?, Cost: 1) evalfoobb3in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb4in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_4 >= Ar_3 + 1 ] (Comp: 3, Cost: 1) evalfoobb3in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb5in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_3 >= Ar_4 ] (Comp: ?, Cost: 1) evalfoobb4in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb3in(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_4)) (Comp: 3, Cost: 1) evalfoobb5in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoostop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoostart(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 A polynomial rank function with Pol(evalfoostart) = -V_2 + V_3 Pol(evalfoobb0in) = -V_2 + V_3 Pol(evalfoobb1in) = -V_1 + V_3 Pol(evalfoobb2in) = -V_1 + V_3 - 1 Pol(evalfoobb3in) = V_3 - V_4 Pol(evalfoobb4in) = V_3 - V_4 - 1 Pol(evalfoobb5in) = V_3 - V_4 Pol(evalfoostop) = V_3 - V_4 Pol(koat_start) = -V_2 + V_3 orients all transitions weakly and the transition evalfoobb1in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb2in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= Ar_0 + 1 ] strictly and produces the following problem: 4: T: (Comp: 1, Cost: 1) evalfoostart(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb0in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: 1, Cost: 1) evalfoobb0in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb1in(Ar_1, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: Ar_1 + Ar_2, Cost: 1) evalfoobb1in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb2in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= Ar_0 + 1 ] (Comp: 3, Cost: 1) evalfoobb1in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb3in(Ar_0, Ar_1, Ar_2, Ar_0, Ar_4)) [ Ar_0 >= Ar_2 ] (Comp: ?, Cost: 1) evalfoobb2in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb1in(Ar_0 + 1, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: ?, Cost: 1) evalfoobb3in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb4in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_4 >= Ar_3 + 1 ] (Comp: 3, Cost: 1) evalfoobb3in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb5in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_3 >= Ar_4 ] (Comp: ?, Cost: 1) evalfoobb4in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb3in(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_4)) (Comp: 3, Cost: 1) evalfoobb5in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoostop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoostart(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 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) evalfoostart(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb0in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: 1, Cost: 1) evalfoobb0in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb1in(Ar_1, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: Ar_1 + Ar_2, Cost: 1) evalfoobb1in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb2in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= Ar_0 + 1 ] (Comp: 3, Cost: 1) evalfoobb1in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb3in(Ar_0, Ar_1, Ar_2, Ar_0, Ar_4)) [ Ar_0 >= Ar_2 ] (Comp: Ar_1 + Ar_2, Cost: 1) evalfoobb2in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb1in(Ar_0 + 1, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: ?, Cost: 1) evalfoobb3in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb4in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_4 >= Ar_3 + 1 ] (Comp: 3, Cost: 1) evalfoobb3in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb5in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_3 >= Ar_4 ] (Comp: ?, Cost: 1) evalfoobb4in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb3in(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_4)) (Comp: 3, Cost: 1) evalfoobb5in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoostop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoostart(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 A polynomial rank function with Pol(evalfoostart) = -V_3 + V_5 Pol(evalfoobb0in) = -V_3 + V_5 Pol(evalfoobb1in) = -V_3 + V_5 Pol(evalfoobb2in) = -V_3 + V_5 Pol(evalfoobb3in) = -V_4 + V_5 Pol(evalfoobb4in) = -V_4 + V_5 - 1 Pol(evalfoobb5in) = -V_4 + V_5 Pol(evalfoostop) = -V_4 + V_5 Pol(koat_start) = -V_3 + V_5 orients all transitions weakly and the transition evalfoobb3in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb4in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_4 >= Ar_3 + 1 ] strictly and produces the following problem: 6: T: (Comp: 1, Cost: 1) evalfoostart(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb0in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: 1, Cost: 1) evalfoobb0in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb1in(Ar_1, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: Ar_1 + Ar_2, Cost: 1) evalfoobb1in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb2in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= Ar_0 + 1 ] (Comp: 3, Cost: 1) evalfoobb1in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb3in(Ar_0, Ar_1, Ar_2, Ar_0, Ar_4)) [ Ar_0 >= Ar_2 ] (Comp: Ar_1 + Ar_2, Cost: 1) evalfoobb2in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb1in(Ar_0 + 1, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: Ar_2 + Ar_4, Cost: 1) evalfoobb3in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb4in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_4 >= Ar_3 + 1 ] (Comp: 3, Cost: 1) evalfoobb3in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb5in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_3 >= Ar_4 ] (Comp: ?, Cost: 1) evalfoobb4in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb3in(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_4)) (Comp: 3, Cost: 1) evalfoobb5in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoostop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoostart(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 Repeatedly propagating knowledge in problem 6 produces the following problem: 7: T: (Comp: 1, Cost: 1) evalfoostart(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb0in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: 1, Cost: 1) evalfoobb0in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb1in(Ar_1, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: Ar_1 + Ar_2, Cost: 1) evalfoobb1in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb2in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= Ar_0 + 1 ] (Comp: 3, Cost: 1) evalfoobb1in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb3in(Ar_0, Ar_1, Ar_2, Ar_0, Ar_4)) [ Ar_0 >= Ar_2 ] (Comp: Ar_1 + Ar_2, Cost: 1) evalfoobb2in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb1in(Ar_0 + 1, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: Ar_2 + Ar_4, Cost: 1) evalfoobb3in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb4in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_4 >= Ar_3 + 1 ] (Comp: 3, Cost: 1) evalfoobb3in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb5in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_3 >= Ar_4 ] (Comp: Ar_2 + Ar_4, Cost: 1) evalfoobb4in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoobb3in(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_4)) (Comp: 3, Cost: 1) evalfoobb5in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoostop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(evalfoostart(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 Complexity upper bound 2*Ar_1 + 4*Ar_2 + 2*Ar_4 + 11 Time: 0.088 sec (SMT: 0.067 sec) ---------------------------------------- (2) BOUNDS(1, n^1)