3.40/3.20 WORST_CASE(?, O(1)) 3.40/3.21 proof of /export/starexec/sandbox/output/output_files/bench.koat 3.40/3.21 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 3.40/3.21 3.40/3.21 3.40/3.21 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, 1). 3.40/3.21 3.40/3.21 (0) CpxIntTrs 3.40/3.21 (1) Koat Proof [FINISHED, 1079 ms] 3.40/3.21 (2) BOUNDS(1, 1) 3.40/3.21 3.40/3.21 3.40/3.21 ---------------------------------------- 3.40/3.21 3.40/3.21 (0) 3.40/3.21 Obligation: 3.40/3.21 Complexity Int TRS consisting of the following rules: 3.40/3.21 eval_foo_start(v_.0, v_.01, v_.02, v_3, v_oldy, v_x, v_y) -> Com_1(eval_foo_bb0_in(v_.0, v_.01, v_.02, v_3, v_oldy, v_x, v_y)) :|: TRUE 3.40/3.21 eval_foo_bb0_in(v_.0, v_.01, v_.02, v_3, v_oldy, v_x, v_y) -> Com_1(eval_foo_bb1_in(v_x, v_y, v_oldy, v_3, v_oldy, v_x, v_y)) :|: TRUE 3.40/3.21 eval_foo_bb1_in(v_.0, v_.01, v_.02, v_3, v_oldy, v_x, v_y) -> Com_1(eval_foo_bb2_in(v_.0, v_.01, v_.02, v_3, v_oldy, v_x, v_y)) :|: v_.0 > 0 3.40/3.21 eval_foo_bb1_in(v_.0, v_.01, v_.02, v_3, v_oldy, v_x, v_y) -> Com_1(eval_foo_.critedge_in(v_.0, v_.01, v_.02, v_3, v_oldy, v_x, v_y)) :|: v_.0 <= 0 3.40/3.21 eval_foo_bb2_in(v_.0, v_.01, v_.02, v_3, v_oldy, v_x, v_y) -> Com_1(eval_foo_bb3_in(v_.0, v_.01, v_.02, v_3, v_oldy, v_x, v_y)) :|: v_.01 <= -(v_.02) 3.40/3.21 eval_foo_bb2_in(v_.0, v_.01, v_.02, v_3, v_oldy, v_x, v_y) -> Com_1(eval_foo_.critedge_in(v_.0, v_.01, v_.02, v_3, v_oldy, v_x, v_y)) :|: v_.01 > -(v_.02) 3.40/3.21 eval_foo_bb3_in(v_.0, v_.01, v_.02, v_3, v_oldy, v_x, v_y) -> Com_1(eval_foo_2(v_.0, v_.01, v_.02, v_3, v_oldy, v_x, v_y)) :|: TRUE 3.40/3.21 eval_foo_2(v_.0, v_.01, v_.02, v_3, v_oldy, v_x, v_y) -> Com_2(eval___VERIFIER_nondet_int_start(v_.0, v_.01, v_.02, v_3, v_oldy, v_x, v_y), eval_foo_3(v_.0, v_.01, v_.02, nondef.0, v_oldy, v_x, v_y)) :|: TRUE 3.40/3.21 eval_foo_3(v_.0, v_.01, v_.02, v_3, v_oldy, v_x, v_y) -> Com_1(eval_foo_bb1_in(v_.01, v_3, v_.01, v_3, v_oldy, v_x, v_y)) :|: TRUE 3.40/3.21 eval_foo_.critedge_in(v_.0, v_.01, v_.02, v_3, v_oldy, v_x, v_y) -> Com_1(eval_foo_stop(v_.0, v_.01, v_.02, v_3, v_oldy, v_x, v_y)) :|: TRUE 3.40/3.21 3.40/3.21 The start-symbols are:[eval_foo_start_7] 3.40/3.21 3.40/3.21 3.40/3.21 ---------------------------------------- 3.40/3.21 3.40/3.21 (1) Koat Proof (FINISHED) 3.40/3.21 YES(?, 31) 3.40/3.21 3.40/3.21 3.40/3.21 3.40/3.21 Initial complexity problem: 3.40/3.21 3.40/3.21 1: T: 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoostart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb1in(ar_1, ar_1, ar_3, ar_3, ar_5, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 >= 1 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 >= ar_0 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 >= ar_4 + ar_2 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_2 + ar_4 >= 1 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoo2(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalVERIFIERnondetintstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoo3(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_7, ar_7)) 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoo2(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_2(evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i), evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i)) 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoo3(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb1in(ar_2, ar_1, ar_6, ar_3, ar_2, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 <= 0 ] 3.40/3.21 3.40/3.21 start location: koat_start 3.40/3.21 3.40/3.21 leaf cost: 0 3.40/3.21 3.40/3.21 3.40/3.21 3.40/3.21 Repeatedly propagating knowledge in problem 1 produces the following problem: 3.40/3.21 3.40/3.21 2: T: 3.40/3.21 3.40/3.21 (Comp: 1, Cost: 1) evalfoostart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 (Comp: 1, Cost: 1) evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb1in(ar_1, ar_1, ar_3, ar_3, ar_5, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 >= 1 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 >= ar_0 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 >= ar_4 + ar_2 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_2 + ar_4 >= 1 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoo2(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalVERIFIERnondetintstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoo3(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_7, ar_7)) 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoo2(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_2(evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i), evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i)) 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoo3(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb1in(ar_2, ar_1, ar_6, ar_3, ar_2, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 <= 0 ] 3.40/3.21 3.40/3.21 start location: koat_start 3.40/3.21 3.40/3.21 leaf cost: 0 3.40/3.21 3.40/3.21 3.40/3.21 3.40/3.21 A polynomial rank function with 3.40/3.21 3.40/3.21 Pol(evalfoostart) = 2 3.40/3.21 3.40/3.21 Pol(evalfoobb0in) = 2 3.40/3.21 3.40/3.21 Pol(evalfoobb1in) = 2 3.40/3.21 3.40/3.21 Pol(evalfoobb2in) = 2 3.40/3.21 3.40/3.21 Pol(evalfoocritedgein) = 1 3.40/3.21 3.40/3.21 Pol(evalfoobb3in) = 2 3.40/3.21 3.40/3.21 Pol(evalfoo2) = 2 3.40/3.21 3.40/3.21 Pol(evalfoo20) = 0 3.40/3.21 3.40/3.21 Pol(evalVERIFIERnondetintstart) = 0 3.40/3.21 3.40/3.21 Pol(evalfoo21) = 2 3.40/3.21 3.40/3.21 Pol(evalfoo3) = 2 3.40/3.21 3.40/3.21 Pol(evalfoostop) = 0 3.40/3.21 3.40/3.21 Pol(koat_start) = 2 3.40/3.21 3.40/3.21 orients all transitions weakly and the transitions 3.40/3.21 3.40/3.21 evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_2 + ar_4 >= 1 ] 3.40/3.21 3.40/3.21 evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 >= ar_0 ] 3.40/3.21 3.40/3.21 strictly and produces the following problem: 3.40/3.21 3.40/3.21 3: T: 3.40/3.21 3.40/3.21 (Comp: 1, Cost: 1) evalfoostart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 (Comp: 1, Cost: 1) evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb1in(ar_1, ar_1, ar_3, ar_3, ar_5, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 >= 1 ] 3.40/3.21 3.40/3.21 (Comp: 2, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 >= ar_0 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 >= ar_4 + ar_2 ] 3.40/3.21 3.40/3.21 (Comp: 2, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_2 + ar_4 >= 1 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoo2(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalVERIFIERnondetintstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoo3(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_7, ar_7)) 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoo2(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_2(evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i), evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i)) 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoo3(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb1in(ar_2, ar_1, ar_6, ar_3, ar_2, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 (Comp: 2, Cost: 1) evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 <= 0 ] 3.40/3.21 3.40/3.21 start location: koat_start 3.40/3.21 3.40/3.21 leaf cost: 0 3.40/3.21 3.40/3.21 3.40/3.21 3.40/3.21 Applied AI with 'oct' on problem 3 to obtain the following invariants: 3.40/3.21 3.40/3.21 For symbol evalfoo2: -X_3 - X_5 >= 0 /\ X_1 - 1 >= 0 3.40/3.21 3.40/3.21 For symbol evalfoo20: -X_3 - X_5 >= 0 /\ X_1 - 1 >= 0 3.40/3.21 3.40/3.21 For symbol evalfoo21: -X_3 - X_5 >= 0 /\ X_1 - 1 >= 0 3.40/3.21 3.40/3.21 For symbol evalfoo3: X_7 - X_8 >= 0 /\ -X_7 + X_8 >= 0 /\ -X_3 - X_5 >= 0 /\ X_1 - 1 >= 0 3.40/3.21 3.40/3.21 For symbol evalfoobb2in: X_1 - 1 >= 0 3.40/3.21 3.40/3.21 For symbol evalfoobb3in: -X_3 - X_5 >= 0 /\ X_1 - 1 >= 0 3.40/3.21 3.40/3.21 3.40/3.21 3.40/3.21 3.40/3.21 3.40/3.21 This yielded the following problem: 3.40/3.21 3.40/3.21 4: T: 3.40/3.21 3.40/3.21 (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 <= 0 ] 3.40/3.21 3.40/3.21 (Comp: 2, Cost: 1) evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoo3(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb1in(ar_2, ar_1, ar_6, ar_3, ar_2, ar_5, ar_6, ar_7)) [ ar_6 - ar_7 >= 0 /\ -ar_6 + ar_7 >= 0 /\ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoo2(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_2(evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i), evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoo3(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_7, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalVERIFIERnondetintstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoo2(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: 2, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 - 1 >= 0 /\ ar_2 + ar_4 >= 1 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 - 1 >= 0 /\ 0 >= ar_4 + ar_2 ] 3.40/3.21 3.40/3.21 (Comp: 2, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 >= ar_0 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 >= 1 ] 3.40/3.21 3.40/3.21 (Comp: 1, Cost: 1) evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb1in(ar_1, ar_1, ar_3, ar_3, ar_5, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 (Comp: 1, Cost: 1) evalfoostart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 start location: koat_start 3.40/3.21 3.40/3.21 leaf cost: 0 3.40/3.21 3.40/3.21 3.40/3.21 3.40/3.21 By chaining the transition koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 <= 0 ] with all transitions in problem 4, the following new transition is obtained: 3.40/3.21 3.40/3.21 koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 <= 0 ] 3.40/3.21 3.40/3.21 We thus obtain the following problem: 3.40/3.21 3.40/3.21 5: T: 3.40/3.21 3.40/3.21 (Comp: 1, Cost: 1) koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 <= 0 ] 3.40/3.21 3.40/3.21 (Comp: 2, Cost: 1) evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoo3(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb1in(ar_2, ar_1, ar_6, ar_3, ar_2, ar_5, ar_6, ar_7)) [ ar_6 - ar_7 >= 0 /\ -ar_6 + ar_7 >= 0 /\ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoo2(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_2(evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i), evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoo3(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_7, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalVERIFIERnondetintstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoo2(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: 2, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 - 1 >= 0 /\ ar_2 + ar_4 >= 1 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 - 1 >= 0 /\ 0 >= ar_4 + ar_2 ] 3.40/3.21 3.40/3.21 (Comp: 2, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 >= ar_0 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 >= 1 ] 3.40/3.21 3.40/3.21 (Comp: 1, Cost: 1) evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb1in(ar_1, ar_1, ar_3, ar_3, ar_5, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 (Comp: 1, Cost: 1) evalfoostart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 start location: koat_start 3.40/3.21 3.40/3.21 leaf cost: 0 3.40/3.21 3.40/3.21 3.40/3.21 3.40/3.21 Testing for reachability in the complexity graph removes the following transition from problem 5: 3.40/3.21 3.40/3.21 evalfoostart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 We thus obtain the following problem: 3.40/3.21 3.40/3.21 6: T: 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoo3(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb1in(ar_2, ar_1, ar_6, ar_3, ar_2, ar_5, ar_6, ar_7)) [ ar_6 - ar_7 >= 0 /\ -ar_6 + ar_7 >= 0 /\ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalVERIFIERnondetintstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoo3(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_7, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoo2(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_2(evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i), evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoo2(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 - 1 >= 0 /\ 0 >= ar_4 + ar_2 ] 3.40/3.21 3.40/3.21 (Comp: 2, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 - 1 >= 0 /\ ar_2 + ar_4 >= 1 ] 3.40/3.21 3.40/3.21 (Comp: 2, Cost: 1) evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 >= 1 ] 3.40/3.21 3.40/3.21 (Comp: 2, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 >= ar_0 ] 3.40/3.21 3.40/3.21 (Comp: 1, Cost: 1) evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb1in(ar_1, ar_1, ar_3, ar_3, ar_5, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 (Comp: 1, Cost: 1) koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 <= 0 ] 3.40/3.21 3.40/3.21 start location: koat_start 3.40/3.21 3.40/3.21 leaf cost: 0 3.40/3.21 3.40/3.21 3.40/3.21 3.40/3.21 By chaining the transition evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoo3(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_7, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 ] with all transitions in problem 6, the following new transition is obtained: 3.40/3.21 3.40/3.21 evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb1in(ar_2, ar_1, ar_7, ar_3, ar_2, ar_5, ar_7, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 /\ 0 >= 0 ] 3.40/3.21 3.40/3.21 We thus obtain the following problem: 3.40/3.21 3.40/3.21 7: T: 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 2) evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb1in(ar_2, ar_1, ar_7, ar_3, ar_2, ar_5, ar_7, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 /\ 0 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoo3(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb1in(ar_2, ar_1, ar_6, ar_3, ar_2, ar_5, ar_6, ar_7)) [ ar_6 - ar_7 >= 0 /\ -ar_6 + ar_7 >= 0 /\ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalVERIFIERnondetintstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoo2(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_2(evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i), evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoo2(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 - 1 >= 0 /\ 0 >= ar_4 + ar_2 ] 3.40/3.21 3.40/3.21 (Comp: 2, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 - 1 >= 0 /\ ar_2 + ar_4 >= 1 ] 3.40/3.21 3.40/3.21 (Comp: 2, Cost: 1) evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 >= 1 ] 3.40/3.21 3.40/3.21 (Comp: 2, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 >= ar_0 ] 3.40/3.21 3.40/3.21 (Comp: 1, Cost: 1) evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb1in(ar_1, ar_1, ar_3, ar_3, ar_5, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 (Comp: 1, Cost: 1) koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 <= 0 ] 3.40/3.21 3.40/3.21 start location: koat_start 3.40/3.21 3.40/3.21 leaf cost: 0 3.40/3.21 3.40/3.21 3.40/3.21 3.40/3.21 Testing for reachability in the complexity graph removes the following transition from problem 7: 3.40/3.21 3.40/3.21 evalfoo3(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb1in(ar_2, ar_1, ar_6, ar_3, ar_2, ar_5, ar_6, ar_7)) [ ar_6 - ar_7 >= 0 /\ -ar_6 + ar_7 >= 0 /\ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 ] 3.40/3.21 3.40/3.21 We thus obtain the following problem: 3.40/3.21 3.40/3.21 8: T: 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 2) evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb1in(ar_2, ar_1, ar_7, ar_3, ar_2, ar_5, ar_7, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 /\ 0 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalVERIFIERnondetintstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoo2(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_2(evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i), evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoo2(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 - 1 >= 0 /\ 0 >= ar_4 + ar_2 ] 3.40/3.21 3.40/3.21 (Comp: 2, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 - 1 >= 0 /\ ar_2 + ar_4 >= 1 ] 3.40/3.21 3.40/3.21 (Comp: 2, Cost: 1) evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 >= 1 ] 3.40/3.21 3.40/3.21 (Comp: 2, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 >= ar_0 ] 3.40/3.21 3.40/3.21 (Comp: 1, Cost: 1) evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb1in(ar_1, ar_1, ar_3, ar_3, ar_5, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 (Comp: 1, Cost: 1) koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 <= 0 ] 3.40/3.21 3.40/3.21 start location: koat_start 3.40/3.21 3.40/3.21 leaf cost: 0 3.40/3.21 3.40/3.21 3.40/3.21 3.40/3.21 By chaining the transition evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoo2(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 ] with all transitions in problem 8, the following new transition is obtained: 3.40/3.21 3.40/3.21 evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_2(evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i), evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 ] 3.40/3.21 3.40/3.21 We thus obtain the following problem: 3.40/3.21 3.40/3.21 9: T: 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 2) evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_2(evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i), evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 2) evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb1in(ar_2, ar_1, ar_7, ar_3, ar_2, ar_5, ar_7, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 /\ 0 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalVERIFIERnondetintstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoo2(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_2(evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i), evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 - 1 >= 0 /\ 0 >= ar_4 + ar_2 ] 3.40/3.21 3.40/3.21 (Comp: 2, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 - 1 >= 0 /\ ar_2 + ar_4 >= 1 ] 3.40/3.21 3.40/3.21 (Comp: 2, Cost: 1) evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 >= 1 ] 3.40/3.21 3.40/3.21 (Comp: 2, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 >= ar_0 ] 3.40/3.21 3.40/3.21 (Comp: 1, Cost: 1) evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb1in(ar_1, ar_1, ar_3, ar_3, ar_5, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 (Comp: 1, Cost: 1) koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 <= 0 ] 3.40/3.21 3.40/3.21 start location: koat_start 3.40/3.21 3.40/3.21 leaf cost: 0 3.40/3.21 3.40/3.21 3.40/3.21 3.40/3.21 Testing for reachability in the complexity graph removes the following transition from problem 9: 3.40/3.21 3.40/3.21 evalfoo2(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_2(evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i), evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 ] 3.40/3.21 3.40/3.21 We thus obtain the following problem: 3.40/3.21 3.40/3.21 10: T: 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 2) evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb1in(ar_2, ar_1, ar_7, ar_3, ar_2, ar_5, ar_7, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 /\ 0 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalVERIFIERnondetintstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 2) evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_2(evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i), evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 - 1 >= 0 /\ 0 >= ar_4 + ar_2 ] 3.40/3.21 3.40/3.21 (Comp: 2, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 - 1 >= 0 /\ ar_2 + ar_4 >= 1 ] 3.40/3.21 3.40/3.21 (Comp: 2, Cost: 1) evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 >= 1 ] 3.40/3.21 3.40/3.21 (Comp: 2, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 >= ar_0 ] 3.40/3.21 3.40/3.21 (Comp: 1, Cost: 1) evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb1in(ar_1, ar_1, ar_3, ar_3, ar_5, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 (Comp: 1, Cost: 1) koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 <= 0 ] 3.40/3.21 3.40/3.21 start location: koat_start 3.40/3.21 3.40/3.21 leaf cost: 0 3.40/3.21 3.40/3.21 3.40/3.21 3.40/3.21 By chaining the transition evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 - 1 >= 0 /\ 0 >= ar_4 + ar_2 ] with all transitions in problem 10, the following new transition is obtained: 3.40/3.21 3.40/3.21 evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_2(evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i), evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i)) [ ar_0 - 1 >= 0 /\ 0 >= ar_4 + ar_2 /\ -ar_2 - ar_4 >= 0 ] 3.40/3.21 3.40/3.21 We thus obtain the following problem: 3.40/3.21 3.40/3.21 11: T: 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 3) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_2(evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i), evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i)) [ ar_0 - 1 >= 0 /\ 0 >= ar_4 + ar_2 /\ -ar_2 - ar_4 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 2) evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb1in(ar_2, ar_1, ar_7, ar_3, ar_2, ar_5, ar_7, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 /\ 0 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalVERIFIERnondetintstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 2) evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_2(evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i), evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: 2, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 - 1 >= 0 /\ ar_2 + ar_4 >= 1 ] 3.40/3.21 3.40/3.21 (Comp: 2, Cost: 1) evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 >= 1 ] 3.40/3.21 3.40/3.21 (Comp: 2, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 >= ar_0 ] 3.40/3.21 3.40/3.21 (Comp: 1, Cost: 1) evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb1in(ar_1, ar_1, ar_3, ar_3, ar_5, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 (Comp: 1, Cost: 1) koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 <= 0 ] 3.40/3.21 3.40/3.21 start location: koat_start 3.40/3.21 3.40/3.21 leaf cost: 0 3.40/3.21 3.40/3.21 3.40/3.21 3.40/3.21 Testing for reachability in the complexity graph removes the following transition from problem 11: 3.40/3.21 3.40/3.21 evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_2(evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i), evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 ] 3.40/3.21 3.40/3.21 We thus obtain the following problem: 3.40/3.21 3.40/3.21 12: T: 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 2) evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb1in(ar_2, ar_1, ar_7, ar_3, ar_2, ar_5, ar_7, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 /\ 0 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalVERIFIERnondetintstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 3) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_2(evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i), evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i)) [ ar_0 - 1 >= 0 /\ 0 >= ar_4 + ar_2 /\ -ar_2 - ar_4 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: 2, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 - 1 >= 0 /\ ar_2 + ar_4 >= 1 ] 3.40/3.21 3.40/3.21 (Comp: 2, Cost: 1) evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 >= 1 ] 3.40/3.21 3.40/3.21 (Comp: 2, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 >= ar_0 ] 3.40/3.21 3.40/3.21 (Comp: 1, Cost: 1) evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb1in(ar_1, ar_1, ar_3, ar_3, ar_5, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 (Comp: 1, Cost: 1) koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 <= 0 ] 3.40/3.21 3.40/3.21 start location: koat_start 3.40/3.21 3.40/3.21 leaf cost: 0 3.40/3.21 3.40/3.21 3.40/3.21 3.40/3.21 By chaining the transition evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 - 1 >= 0 /\ ar_2 + ar_4 >= 1 ] with all transitions in problem 12, the following new transition is obtained: 3.40/3.21 3.40/3.21 evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 - 1 >= 0 /\ ar_2 + ar_4 >= 1 ] 3.40/3.21 3.40/3.21 We thus obtain the following problem: 3.40/3.21 3.40/3.21 13: T: 3.40/3.21 3.40/3.21 (Comp: 2, Cost: 2) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 - 1 >= 0 /\ ar_2 + ar_4 >= 1 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 2) evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb1in(ar_2, ar_1, ar_7, ar_3, ar_2, ar_5, ar_7, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 /\ 0 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalVERIFIERnondetintstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 3) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_2(evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i), evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i)) [ ar_0 - 1 >= 0 /\ 0 >= ar_4 + ar_2 /\ -ar_2 - ar_4 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: 2, Cost: 1) evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 >= 1 ] 3.40/3.21 3.40/3.21 (Comp: 2, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 >= ar_0 ] 3.40/3.21 3.40/3.21 (Comp: 1, Cost: 1) evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb1in(ar_1, ar_1, ar_3, ar_3, ar_5, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 (Comp: 1, Cost: 1) koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 <= 0 ] 3.40/3.21 3.40/3.21 start location: koat_start 3.40/3.21 3.40/3.21 leaf cost: 0 3.40/3.21 3.40/3.21 3.40/3.21 3.40/3.21 By chaining the transition evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 >= ar_0 ] with all transitions in problem 13, the following new transition is obtained: 3.40/3.21 3.40/3.21 evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 >= ar_0 ] 3.40/3.21 3.40/3.21 We thus obtain the following problem: 3.40/3.21 3.40/3.21 14: T: 3.40/3.21 3.40/3.21 (Comp: 2, Cost: 2) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 >= ar_0 ] 3.40/3.21 3.40/3.21 (Comp: 2, Cost: 2) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 - 1 >= 0 /\ ar_2 + ar_4 >= 1 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 2) evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb1in(ar_2, ar_1, ar_7, ar_3, ar_2, ar_5, ar_7, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 /\ 0 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalVERIFIERnondetintstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 3) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_2(evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i), evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i)) [ ar_0 - 1 >= 0 /\ 0 >= ar_4 + ar_2 /\ -ar_2 - ar_4 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: 2, Cost: 1) evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 >= 1 ] 3.40/3.21 3.40/3.21 (Comp: 1, Cost: 1) evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb1in(ar_1, ar_1, ar_3, ar_3, ar_5, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 (Comp: 1, Cost: 1) koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 <= 0 ] 3.40/3.21 3.40/3.21 start location: koat_start 3.40/3.21 3.40/3.21 leaf cost: 0 3.40/3.21 3.40/3.21 3.40/3.21 3.40/3.21 Testing for reachability in the complexity graph removes the following transition from problem 14: 3.40/3.21 3.40/3.21 evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 We thus obtain the following problem: 3.40/3.21 3.40/3.21 15: T: 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 2) evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb1in(ar_2, ar_1, ar_7, ar_3, ar_2, ar_5, ar_7, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 /\ 0 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalVERIFIERnondetintstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: 2, Cost: 2) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 - 1 >= 0 /\ ar_2 + ar_4 >= 1 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 3) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_2(evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i), evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i)) [ ar_0 - 1 >= 0 /\ 0 >= ar_4 + ar_2 /\ -ar_2 - ar_4 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: 2, Cost: 2) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 >= ar_0 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 >= 1 ] 3.40/3.21 3.40/3.21 (Comp: 1, Cost: 1) evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb1in(ar_1, ar_1, ar_3, ar_3, ar_5, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 (Comp: 1, Cost: 1) koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 <= 0 ] 3.40/3.21 3.40/3.21 start location: koat_start 3.40/3.21 3.40/3.21 leaf cost: 0 3.40/3.21 3.40/3.21 3.40/3.21 3.40/3.21 By chaining the transition koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 <= 0 ] with all transitions in problem 15, the following new transition is obtained: 3.40/3.21 3.40/3.21 koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb1in(ar_1, ar_1, ar_3, ar_3, ar_5, ar_5, ar_6, ar_7)) [ 0 <= 0 ] 3.40/3.21 3.40/3.21 We thus obtain the following problem: 3.40/3.21 3.40/3.21 16: T: 3.40/3.21 3.40/3.21 (Comp: 1, Cost: 2) koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb1in(ar_1, ar_1, ar_3, ar_3, ar_5, ar_5, ar_6, ar_7)) [ 0 <= 0 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 2) evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb1in(ar_2, ar_1, ar_7, ar_3, ar_2, ar_5, ar_7, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 /\ 0 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalVERIFIERnondetintstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: 2, Cost: 2) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 - 1 >= 0 /\ ar_2 + ar_4 >= 1 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 3) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_2(evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i), evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i)) [ ar_0 - 1 >= 0 /\ 0 >= ar_4 + ar_2 /\ -ar_2 - ar_4 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: 2, Cost: 2) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 >= ar_0 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 >= 1 ] 3.40/3.21 3.40/3.21 (Comp: 1, Cost: 1) evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb1in(ar_1, ar_1, ar_3, ar_3, ar_5, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 start location: koat_start 3.40/3.21 3.40/3.21 leaf cost: 0 3.40/3.21 3.40/3.21 3.40/3.21 3.40/3.21 Testing for reachability in the complexity graph removes the following transition from problem 16: 3.40/3.21 3.40/3.21 evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb1in(ar_1, ar_1, ar_3, ar_3, ar_5, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 We thus obtain the following problem: 3.40/3.21 3.40/3.21 17: T: 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 2) evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb1in(ar_2, ar_1, ar_7, ar_3, ar_2, ar_5, ar_7, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 /\ 0 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalVERIFIERnondetintstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: 2, Cost: 2) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 - 1 >= 0 /\ ar_2 + ar_4 >= 1 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 3) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_2(evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i), evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i)) [ ar_0 - 1 >= 0 /\ 0 >= ar_4 + ar_2 /\ -ar_2 - ar_4 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: 2, Cost: 2) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 >= ar_0 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 >= 1 ] 3.40/3.21 3.40/3.21 (Comp: 1, Cost: 2) koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb1in(ar_1, ar_1, ar_3, ar_3, ar_5, ar_5, ar_6, ar_7)) [ 0 <= 0 ] 3.40/3.21 3.40/3.21 start location: koat_start 3.40/3.21 3.40/3.21 leaf cost: 0 3.40/3.21 3.40/3.21 3.40/3.21 3.40/3.21 By chaining the transition evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb1in(ar_2, ar_1, ar_7, ar_3, ar_2, ar_5, ar_7, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 /\ 0 >= 0 ] with all transitions in problem 17, the following new transitions are obtained: 3.40/3.21 3.40/3.21 evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostop(ar_2, ar_1, ar_7, ar_3, ar_2, ar_5, ar_7, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 /\ 0 >= 0 /\ 0 >= ar_2 ] 3.40/3.21 3.40/3.21 evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb2in(ar_2, ar_1, ar_7, ar_3, ar_2, ar_5, ar_7, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 /\ 0 >= 0 /\ ar_2 >= 1 ] 3.40/3.21 3.40/3.21 We thus obtain the following problem: 3.40/3.21 3.40/3.21 18: T: 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 4) evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostop(ar_2, ar_1, ar_7, ar_3, ar_2, ar_5, ar_7, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 /\ 0 >= 0 /\ 0 >= ar_2 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 3) evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb2in(ar_2, ar_1, ar_7, ar_3, ar_2, ar_5, ar_7, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 /\ 0 >= 0 /\ ar_2 >= 1 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalVERIFIERnondetintstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: 2, Cost: 2) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 - 1 >= 0 /\ ar_2 + ar_4 >= 1 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 3) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_2(evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i), evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i)) [ ar_0 - 1 >= 0 /\ 0 >= ar_4 + ar_2 /\ -ar_2 - ar_4 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: 2, Cost: 2) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 >= ar_0 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 >= 1 ] 3.40/3.21 3.40/3.21 (Comp: 1, Cost: 2) koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb1in(ar_1, ar_1, ar_3, ar_3, ar_5, ar_5, ar_6, ar_7)) [ 0 <= 0 ] 3.40/3.21 3.40/3.21 start location: koat_start 3.40/3.21 3.40/3.21 leaf cost: 0 3.40/3.21 3.40/3.21 3.40/3.21 3.40/3.21 Repeatedly propagating knowledge in problem 18 produces the following problem: 3.40/3.21 3.40/3.21 19: T: 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 4) evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostop(ar_2, ar_1, ar_7, ar_3, ar_2, ar_5, ar_7, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 /\ 0 >= 0 /\ 0 >= ar_2 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 3) evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb2in(ar_2, ar_1, ar_7, ar_3, ar_2, ar_5, ar_7, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 /\ 0 >= 0 /\ ar_2 >= 1 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalVERIFIERnondetintstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: 2, Cost: 2) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 - 1 >= 0 /\ ar_2 + ar_4 >= 1 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 3) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_2(evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i), evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i)) [ ar_0 - 1 >= 0 /\ 0 >= ar_4 + ar_2 /\ -ar_2 - ar_4 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: 2, Cost: 2) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 >= ar_0 ] 3.40/3.21 3.40/3.21 (Comp: 1, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 >= 1 ] 3.40/3.21 3.40/3.21 (Comp: 1, Cost: 2) koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb1in(ar_1, ar_1, ar_3, ar_3, ar_5, ar_5, ar_6, ar_7)) [ 0 <= 0 ] 3.40/3.21 3.40/3.21 start location: koat_start 3.40/3.21 3.40/3.21 leaf cost: 0 3.40/3.21 3.40/3.21 3.40/3.21 3.40/3.21 A polynomial rank function with 3.40/3.21 3.40/3.21 Pol(evalfoo21) = 1 3.40/3.21 3.40/3.21 Pol(evalfoostop) = 0 3.40/3.21 3.40/3.21 Pol(evalfoobb2in) = 1 3.40/3.21 3.40/3.21 Pol(evalfoo20) = 0 3.40/3.21 3.40/3.21 Pol(evalVERIFIERnondetintstart) = 0 3.40/3.21 3.40/3.21 Pol(evalfoobb1in) = 1 3.40/3.21 3.40/3.21 Pol(koat_start) = 1 3.40/3.21 3.40/3.21 orients all transitions weakly and the transition 3.40/3.21 3.40/3.21 evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostop(ar_2, ar_1, ar_7, ar_3, ar_2, ar_5, ar_7, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 /\ 0 >= 0 /\ 0 >= ar_2 ] 3.40/3.21 3.40/3.21 strictly and produces the following problem: 3.40/3.21 3.40/3.21 20: T: 3.40/3.21 3.40/3.21 (Comp: 1, Cost: 4) evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostop(ar_2, ar_1, ar_7, ar_3, ar_2, ar_5, ar_7, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 /\ 0 >= 0 /\ 0 >= ar_2 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 3) evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb2in(ar_2, ar_1, ar_7, ar_3, ar_2, ar_5, ar_7, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 /\ 0 >= 0 /\ ar_2 >= 1 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalVERIFIERnondetintstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: 2, Cost: 2) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 - 1 >= 0 /\ ar_2 + ar_4 >= 1 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 3) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_2(evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i), evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i)) [ ar_0 - 1 >= 0 /\ 0 >= ar_4 + ar_2 /\ -ar_2 - ar_4 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: 2, Cost: 2) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 >= ar_0 ] 3.40/3.21 3.40/3.21 (Comp: 1, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 >= 1 ] 3.40/3.21 3.40/3.21 (Comp: 1, Cost: 2) koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb1in(ar_1, ar_1, ar_3, ar_3, ar_5, ar_5, ar_6, ar_7)) [ 0 <= 0 ] 3.40/3.21 3.40/3.21 start location: koat_start 3.40/3.21 3.40/3.21 leaf cost: 0 3.40/3.21 3.40/3.21 3.40/3.21 3.40/3.21 By chaining the transition evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb2in(ar_2, ar_1, ar_7, ar_3, ar_2, ar_5, ar_7, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 /\ 0 >= 0 /\ ar_2 >= 1 ] with all transitions in problem 20, the following new transitions are obtained: 3.40/3.21 3.40/3.21 evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostop(ar_2, ar_1, ar_7, ar_3, ar_2, ar_5, ar_7, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 /\ 0 >= 0 /\ ar_2 >= 1 /\ ar_2 - 1 >= 0 /\ ar_7 + ar_2 >= 1 ] 3.40/3.21 3.40/3.21 evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_2(evalfoo20(ar_2, ar_1, ar_7, ar_3, ar_2, ar_5, ar_7, i), evalfoo21(ar_2, ar_1, ar_7, ar_3, ar_2, ar_5, ar_7, i)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 /\ 0 >= 0 /\ ar_2 >= 1 /\ ar_2 - 1 >= 0 /\ 0 >= ar_2 + ar_7 /\ -ar_7 - ar_2 >= 0 ] 3.40/3.21 3.40/3.21 We thus obtain the following problem: 3.40/3.21 3.40/3.21 21: T: 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 5) evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostop(ar_2, ar_1, ar_7, ar_3, ar_2, ar_5, ar_7, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 /\ 0 >= 0 /\ ar_2 >= 1 /\ ar_2 - 1 >= 0 /\ ar_7 + ar_2 >= 1 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 6) evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_2(evalfoo20(ar_2, ar_1, ar_7, ar_3, ar_2, ar_5, ar_7, i), evalfoo21(ar_2, ar_1, ar_7, ar_3, ar_2, ar_5, ar_7, i)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 /\ 0 >= 0 /\ ar_2 >= 1 /\ ar_2 - 1 >= 0 /\ 0 >= ar_2 + ar_7 /\ -ar_7 - ar_2 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: 1, Cost: 4) evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostop(ar_2, ar_1, ar_7, ar_3, ar_2, ar_5, ar_7, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 /\ 0 >= 0 /\ 0 >= ar_2 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalVERIFIERnondetintstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: 2, Cost: 2) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 - 1 >= 0 /\ ar_2 + ar_4 >= 1 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 3) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_2(evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i), evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i)) [ ar_0 - 1 >= 0 /\ 0 >= ar_4 + ar_2 /\ -ar_2 - ar_4 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: 2, Cost: 2) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 >= ar_0 ] 3.40/3.21 3.40/3.21 (Comp: 1, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 >= 1 ] 3.40/3.21 3.40/3.21 (Comp: 1, Cost: 2) koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb1in(ar_1, ar_1, ar_3, ar_3, ar_5, ar_5, ar_6, ar_7)) [ 0 <= 0 ] 3.40/3.21 3.40/3.21 start location: koat_start 3.40/3.21 3.40/3.21 leaf cost: 0 3.40/3.21 3.40/3.21 3.40/3.21 3.40/3.21 Repeatedly propagating knowledge in problem 21 produces the following problem: 3.40/3.21 3.40/3.21 22: T: 3.40/3.21 3.40/3.21 (Comp: 1, Cost: 5) evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostop(ar_2, ar_1, ar_7, ar_3, ar_2, ar_5, ar_7, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 /\ 0 >= 0 /\ ar_2 >= 1 /\ ar_2 - 1 >= 0 /\ ar_7 + ar_2 >= 1 ] 3.40/3.21 3.40/3.21 (Comp: 1, Cost: 6) evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_2(evalfoo20(ar_2, ar_1, ar_7, ar_3, ar_2, ar_5, ar_7, i), evalfoo21(ar_2, ar_1, ar_7, ar_3, ar_2, ar_5, ar_7, i)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 /\ 0 >= 0 /\ ar_2 >= 1 /\ ar_2 - 1 >= 0 /\ 0 >= ar_2 + ar_7 /\ -ar_7 - ar_2 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: 1, Cost: 4) evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostop(ar_2, ar_1, ar_7, ar_3, ar_2, ar_5, ar_7, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 /\ 0 >= 0 /\ 0 >= ar_2 ] 3.40/3.21 3.40/3.21 (Comp: 2, Cost: 1) evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalVERIFIERnondetintstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ -ar_2 - ar_4 >= 0 /\ ar_0 - 1 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: 2, Cost: 2) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 - 1 >= 0 /\ ar_2 + ar_4 >= 1 ] 3.40/3.21 3.40/3.21 (Comp: 1, Cost: 3) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_2(evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i), evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i)) [ ar_0 - 1 >= 0 /\ 0 >= ar_4 + ar_2 /\ -ar_2 - ar_4 >= 0 ] 3.40/3.21 3.40/3.21 (Comp: 2, Cost: 2) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 >= ar_0 ] 3.40/3.21 3.40/3.21 (Comp: 1, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 >= 1 ] 3.40/3.21 3.40/3.21 (Comp: 1, Cost: 2) koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb1in(ar_1, ar_1, ar_3, ar_3, ar_5, ar_5, ar_6, ar_7)) [ 0 <= 0 ] 3.40/3.21 3.40/3.21 start location: koat_start 3.40/3.21 3.40/3.21 leaf cost: 0 3.40/3.21 3.40/3.21 3.40/3.21 3.40/3.21 Complexity upper bound 31 3.40/3.21 3.40/3.21 3.40/3.21 3.40/3.21 Time: 1.071 sec (SMT: 0.762 sec) 3.40/3.21 3.40/3.21 3.40/3.21 ---------------------------------------- 3.40/3.21 3.40/3.21 (2) 3.40/3.21 BOUNDS(1, 1) 3.40/3.23 EOF