83.33/36.13 WORST_CASE(Omega(n^1), ?) 83.33/36.14 proof of /export/starexec/sandbox/benchmark/theBenchmark.koat 83.33/36.14 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 83.33/36.14 83.33/36.14 83.33/36.14 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(n^1, INF). 83.33/36.14 83.33/36.14 (0) CpxIntTrs 83.33/36.14 (1) Loat Proof [FINISHED, 34.4 s] 83.33/36.14 (2) BOUNDS(n^1, INF) 83.33/36.14 83.33/36.14 83.33/36.14 ---------------------------------------- 83.33/36.14 83.33/36.14 (0) 83.33/36.14 Obligation: 83.33/36.14 Complexity Int TRS consisting of the following rules: 83.33/36.14 evalbinsearchStepSize2start(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2entryin(A, B, C, D, E, F, G, H, I)) :|: TRUE 83.33/36.14 evalbinsearchStepSize2entryin(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bbin(0, 0, 4, A, E, F, G, H, I)) :|: TRUE 83.33/36.14 evalbinsearchStepSize2bbin(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2returnin(A, B, C, D, E, F, G, H, I)) :|: C >= 1 && C <= 1 83.33/36.14 evalbinsearchStepSize2bbin(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb1in(A, B, C, D, J, F, G, H, I)) :|: 0 >= C 83.33/36.14 evalbinsearchStepSize2bbin(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb1in(A, B, C, D, J, F, G, H, I)) :|: C >= 2 83.33/36.14 evalbinsearchStepSize2bb1in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb2in(A, B, C, D, E, F, G, H, I)) :|: 0 >= B + 1 83.33/36.14 evalbinsearchStepSize2bb1in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb2in(A, B, C, D, E, F, G, H, I)) :|: B >= 1 83.33/36.14 evalbinsearchStepSize2bb1in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb3in(A, B, C, D, E, C, G, H, I)) :|: B >= 0 && B <= 0 83.33/36.14 evalbinsearchStepSize2bb2in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb3in(A, B, C, D, E, 0, G, H, I)) :|: C >= 0 && C <= 0 83.33/36.14 evalbinsearchStepSize2bb2in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb3in(A, B, C, D, E, J, G, H, I)) :|: C >= 1 && J >= 0 && C >= 2 * J && 1 + 2 * J >= C 83.33/36.14 evalbinsearchStepSize2bb2in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb3in(A, B, C, D, E, J, G, H, I)) :|: 0 >= C + 1 && 0 >= J && 2 * J >= C && 1 + C >= 2 * J 83.33/36.14 evalbinsearchStepSize2bb3in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb4in(A, B, C, D, E, F, G, H, I)) :|: E >= G + 1 83.33/36.14 evalbinsearchStepSize2bb3in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb9in(A, B, C, D, E, F, G, H, I)) :|: G >= E 83.33/36.14 evalbinsearchStepSize2bb4in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb6in(A, B, C, D, E, F, G, H, I)) :|: A >= 1 && A <= 1 && B >= 0 && B <= 0 83.33/36.14 evalbinsearchStepSize2bb4in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb7in(A, B, C, D, E, F, G, B, F)) :|: 0 >= A 83.33/36.14 evalbinsearchStepSize2bb4in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb7in(A, B, C, D, E, F, G, B, F)) :|: A >= 2 83.33/36.14 evalbinsearchStepSize2bb4in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb7in(A, B, C, D, E, F, G, B, F)) :|: 0 >= B + 1 83.33/36.14 evalbinsearchStepSize2bb4in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb7in(A, B, C, D, E, F, G, B, F)) :|: B >= 1 83.33/36.14 evalbinsearchStepSize2bb6in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb7in(A, B, C, D, E, F, G, 1, 0)) :|: F >= 0 && F <= 0 83.33/36.14 evalbinsearchStepSize2bb6in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb7in(A, B, C, D, E, F, G, 1, J)) :|: F >= 1 && J >= 0 && F >= 2 * J && 1 + 2 * J >= F 83.33/36.14 evalbinsearchStepSize2bb6in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb7in(A, B, C, D, E, F, G, 1, J)) :|: 0 >= F + 1 && 0 >= J && 2 * J >= F && 1 + F >= 2 * J 83.33/36.14 evalbinsearchStepSize2bb7in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2returnin(A, B, C, D, E, F, G, H, I)) :|: D + I >= 256 83.33/36.14 evalbinsearchStepSize2bb7in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bbin(2, H, I, D + I, E, F, G, H, I)) :|: 255 >= D + I 83.33/36.14 evalbinsearchStepSize2bb9in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb10in(A, B, C, D, E, F, G, H, I)) :|: G >= E + 1 83.33/36.14 evalbinsearchStepSize2bb9in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2returnin(A, B, C, D, E, F, G, H, I)) :|: E >= G 83.33/36.14 evalbinsearchStepSize2bb10in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb12in(A, B, C, D, E, F, G, H, I)) :|: A >= 2 && A <= 2 && B >= 0 && B <= 0 83.33/36.14 evalbinsearchStepSize2bb10in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb13in(A, B, C, D, E, F, G, B, F)) :|: 1 >= A 83.33/36.14 evalbinsearchStepSize2bb10in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb13in(A, B, C, D, E, F, G, B, F)) :|: A >= 3 83.33/36.14 evalbinsearchStepSize2bb10in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb13in(A, B, C, D, E, F, G, B, F)) :|: 0 >= B + 1 83.33/36.14 evalbinsearchStepSize2bb10in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb13in(A, B, C, D, E, F, G, B, F)) :|: B >= 1 83.33/36.14 evalbinsearchStepSize2bb12in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb13in(A, B, C, D, E, F, G, 1, 0)) :|: F >= 0 && F <= 0 83.33/36.14 evalbinsearchStepSize2bb12in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb13in(A, B, C, D, E, F, G, 1, J)) :|: F >= 1 && J >= 0 && F >= 2 * J && 1 + 2 * J >= F 83.33/36.14 evalbinsearchStepSize2bb12in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb13in(A, B, C, D, E, F, G, 1, J)) :|: 0 >= F + 1 && 0 >= J && 2 * J >= F && 1 + F >= 2 * J 83.33/36.14 evalbinsearchStepSize2bb13in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2returnin(A, B, C, D, E, F, G, H, I)) :|: I >= D + 1 83.33/36.14 evalbinsearchStepSize2bb13in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bbin(1, H, I, D - I, E, F, G, H, I)) :|: D >= I 83.33/36.14 evalbinsearchStepSize2returnin(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2stop(A, B, C, D, E, F, G, H, I)) :|: TRUE 83.33/36.14 83.33/36.14 The start-symbols are:[evalbinsearchStepSize2start_9] 83.33/36.14 83.33/36.14 83.33/36.14 ---------------------------------------- 83.33/36.14 83.33/36.14 (1) Loat Proof (FINISHED) 83.33/36.14 83.33/36.14 83.33/36.14 ### Pre-processing the ITS problem ### 83.33/36.14 83.33/36.14 83.33/36.14 83.33/36.14 Initial linear ITS problem 83.33/36.14 83.33/36.14 Start location: evalbinsearchStepSize2start 83.33/36.14 83.33/36.14 0: evalbinsearchStepSize2start -> evalbinsearchStepSize2entryin : [], cost: 1 83.33/36.14 83.33/36.14 1: evalbinsearchStepSize2entryin -> evalbinsearchStepSize2bbin : A'=0, B'=0, C'=4, D'=A, [], cost: 1 83.33/36.14 83.33/36.14 2: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2returnin : [ C==1 ], cost: 1 83.33/36.14 83.33/36.14 3: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb1in : E'=free, [ 0>=C ], cost: 1 83.33/36.14 83.33/36.14 4: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb1in : E'=free_1, [ C>=2 ], cost: 1 83.33/36.14 83.33/36.14 5: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb2in : [ 0>=1+B ], cost: 1 83.33/36.14 83.33/36.14 6: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb2in : [ B>=1 ], cost: 1 83.33/36.14 83.33/36.14 7: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb3in : F'=C, [ B==0 ], cost: 1 83.33/36.14 83.33/36.14 8: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb3in : F'=0, [ C==0 ], cost: 1 83.33/36.14 83.33/36.14 9: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb3in : F'=free_2, [ C>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C ], cost: 1 83.33/36.14 83.33/36.14 10: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb3in : F'=free_3, [ 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 ], cost: 1 83.33/36.14 83.33/36.14 11: evalbinsearchStepSize2bb3in -> evalbinsearchStepSize2bb4in : [ E>=1+G ], cost: 1 83.33/36.14 83.33/36.14 12: evalbinsearchStepSize2bb3in -> evalbinsearchStepSize2bb9in : [ G>=E ], cost: 1 83.33/36.14 83.33/36.14 13: evalbinsearchStepSize2bb4in -> evalbinsearchStepSize2bb6in : [ A==1 && B==0 ], cost: 1 83.33/36.14 83.33/36.14 14: evalbinsearchStepSize2bb4in -> evalbinsearchStepSize2bb7in : H'=B, Q'=F, [ 0>=A ], cost: 1 83.33/36.14 83.33/36.14 15: evalbinsearchStepSize2bb4in -> evalbinsearchStepSize2bb7in : H'=B, Q'=F, [ A>=2 ], cost: 1 83.33/36.14 83.33/36.14 16: evalbinsearchStepSize2bb4in -> evalbinsearchStepSize2bb7in : H'=B, Q'=F, [ 0>=1+B ], cost: 1 83.33/36.14 83.33/36.14 17: evalbinsearchStepSize2bb4in -> evalbinsearchStepSize2bb7in : H'=B, Q'=F, [ B>=1 ], cost: 1 83.33/36.14 83.33/36.14 18: evalbinsearchStepSize2bb6in -> evalbinsearchStepSize2bb7in : H'=1, Q'=0, [ F==0 ], cost: 1 83.33/36.14 83.33/36.14 19: evalbinsearchStepSize2bb6in -> evalbinsearchStepSize2bb7in : H'=1, Q'=free_4, [ F>=1 && free_4>=0 && F>=2*free_4 && 1+2*free_4>=F ], cost: 1 83.33/36.14 83.33/36.14 20: evalbinsearchStepSize2bb6in -> evalbinsearchStepSize2bb7in : H'=1, Q'=free_5, [ 0>=1+F && 0>=free_5 && 2*free_5>=F && 1+F>=2*free_5 ], cost: 1 83.33/36.14 83.33/36.14 21: evalbinsearchStepSize2bb7in -> evalbinsearchStepSize2returnin : [ Q+D>=256 ], cost: 1 83.33/36.14 83.33/36.14 22: evalbinsearchStepSize2bb7in -> evalbinsearchStepSize2bbin : A'=2, B'=H, C'=Q, D'=Q+D, [ 255>=Q+D ], cost: 1 83.33/36.14 83.33/36.14 23: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb10in : [ G>=1+E ], cost: 1 83.33/36.14 83.33/36.14 24: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2returnin : [ E>=G ], cost: 1 83.33/36.14 83.33/36.14 25: evalbinsearchStepSize2bb10in -> evalbinsearchStepSize2bb12in : [ A==2 && B==0 ], cost: 1 83.33/36.14 83.33/36.14 26: evalbinsearchStepSize2bb10in -> evalbinsearchStepSize2bb13in : H'=B, Q'=F, [ 1>=A ], cost: 1 83.33/36.14 83.33/36.14 27: evalbinsearchStepSize2bb10in -> evalbinsearchStepSize2bb13in : H'=B, Q'=F, [ A>=3 ], cost: 1 83.33/36.14 83.33/36.14 28: evalbinsearchStepSize2bb10in -> evalbinsearchStepSize2bb13in : H'=B, Q'=F, [ 0>=1+B ], cost: 1 83.33/36.14 83.33/36.14 29: evalbinsearchStepSize2bb10in -> evalbinsearchStepSize2bb13in : H'=B, Q'=F, [ B>=1 ], cost: 1 83.33/36.14 83.33/36.14 30: evalbinsearchStepSize2bb12in -> evalbinsearchStepSize2bb13in : H'=1, Q'=0, [ F==0 ], cost: 1 83.33/36.14 83.33/36.14 31: evalbinsearchStepSize2bb12in -> evalbinsearchStepSize2bb13in : H'=1, Q'=free_6, [ F>=1 && free_6>=0 && F>=2*free_6 && 1+2*free_6>=F ], cost: 1 83.33/36.14 83.33/36.14 32: evalbinsearchStepSize2bb12in -> evalbinsearchStepSize2bb13in : H'=1, Q'=free_7, [ 0>=1+F && 0>=free_7 && 2*free_7>=F && 1+F>=2*free_7 ], cost: 1 83.33/36.14 83.33/36.14 33: evalbinsearchStepSize2bb13in -> evalbinsearchStepSize2returnin : [ Q>=1+D ], cost: 1 83.33/36.14 83.33/36.14 34: evalbinsearchStepSize2bb13in -> evalbinsearchStepSize2bbin : A'=1, B'=H, C'=Q, D'=-Q+D, [ D>=Q ], cost: 1 83.33/36.14 83.33/36.14 35: evalbinsearchStepSize2returnin -> evalbinsearchStepSize2stop : [], cost: 1 83.33/36.14 83.33/36.14 83.33/36.14 83.33/36.14 Removed unreachable and leaf rules: 83.33/36.14 83.33/36.14 Start location: evalbinsearchStepSize2start 83.33/36.14 83.33/36.14 0: evalbinsearchStepSize2start -> evalbinsearchStepSize2entryin : [], cost: 1 83.33/36.14 83.33/36.14 1: evalbinsearchStepSize2entryin -> evalbinsearchStepSize2bbin : A'=0, B'=0, C'=4, D'=A, [], cost: 1 83.33/36.14 83.33/36.14 3: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb1in : E'=free, [ 0>=C ], cost: 1 83.33/36.14 83.33/36.14 4: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb1in : E'=free_1, [ C>=2 ], cost: 1 83.33/36.14 83.33/36.14 5: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb2in : [ 0>=1+B ], cost: 1 83.33/36.14 83.33/36.14 6: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb2in : [ B>=1 ], cost: 1 83.33/36.14 83.33/36.14 7: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb3in : F'=C, [ B==0 ], cost: 1 83.33/36.14 83.33/36.14 8: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb3in : F'=0, [ C==0 ], cost: 1 83.33/36.14 83.33/36.14 9: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb3in : F'=free_2, [ C>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C ], cost: 1 83.33/36.14 83.33/36.14 10: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb3in : F'=free_3, [ 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 ], cost: 1 83.33/36.14 83.33/36.14 11: evalbinsearchStepSize2bb3in -> evalbinsearchStepSize2bb4in : [ E>=1+G ], cost: 1 83.33/36.14 83.33/36.14 12: evalbinsearchStepSize2bb3in -> evalbinsearchStepSize2bb9in : [ G>=E ], cost: 1 83.33/36.14 83.33/36.14 13: evalbinsearchStepSize2bb4in -> evalbinsearchStepSize2bb6in : [ A==1 && B==0 ], cost: 1 83.33/36.14 83.33/36.14 14: evalbinsearchStepSize2bb4in -> evalbinsearchStepSize2bb7in : H'=B, Q'=F, [ 0>=A ], cost: 1 83.33/36.14 83.33/36.14 15: evalbinsearchStepSize2bb4in -> evalbinsearchStepSize2bb7in : H'=B, Q'=F, [ A>=2 ], cost: 1 83.33/36.14 83.33/36.14 16: evalbinsearchStepSize2bb4in -> evalbinsearchStepSize2bb7in : H'=B, Q'=F, [ 0>=1+B ], cost: 1 83.33/36.14 83.33/36.14 17: evalbinsearchStepSize2bb4in -> evalbinsearchStepSize2bb7in : H'=B, Q'=F, [ B>=1 ], cost: 1 83.33/36.14 83.33/36.14 18: evalbinsearchStepSize2bb6in -> evalbinsearchStepSize2bb7in : H'=1, Q'=0, [ F==0 ], cost: 1 83.33/36.14 83.33/36.14 19: evalbinsearchStepSize2bb6in -> evalbinsearchStepSize2bb7in : H'=1, Q'=free_4, [ F>=1 && free_4>=0 && F>=2*free_4 && 1+2*free_4>=F ], cost: 1 83.33/36.14 83.33/36.14 20: evalbinsearchStepSize2bb6in -> evalbinsearchStepSize2bb7in : H'=1, Q'=free_5, [ 0>=1+F && 0>=free_5 && 2*free_5>=F && 1+F>=2*free_5 ], cost: 1 83.33/36.14 83.33/36.14 22: evalbinsearchStepSize2bb7in -> evalbinsearchStepSize2bbin : A'=2, B'=H, C'=Q, D'=Q+D, [ 255>=Q+D ], cost: 1 83.33/36.14 83.33/36.14 23: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb10in : [ G>=1+E ], cost: 1 83.33/36.14 83.33/36.14 25: evalbinsearchStepSize2bb10in -> evalbinsearchStepSize2bb12in : [ A==2 && B==0 ], cost: 1 83.33/36.14 83.33/36.14 26: evalbinsearchStepSize2bb10in -> evalbinsearchStepSize2bb13in : H'=B, Q'=F, [ 1>=A ], cost: 1 83.33/36.14 83.33/36.14 27: evalbinsearchStepSize2bb10in -> evalbinsearchStepSize2bb13in : H'=B, Q'=F, [ A>=3 ], cost: 1 83.33/36.14 83.33/36.14 28: evalbinsearchStepSize2bb10in -> evalbinsearchStepSize2bb13in : H'=B, Q'=F, [ 0>=1+B ], cost: 1 83.33/36.14 83.33/36.14 29: evalbinsearchStepSize2bb10in -> evalbinsearchStepSize2bb13in : H'=B, Q'=F, [ B>=1 ], cost: 1 83.33/36.14 83.33/36.14 30: evalbinsearchStepSize2bb12in -> evalbinsearchStepSize2bb13in : H'=1, Q'=0, [ F==0 ], cost: 1 83.33/36.14 83.33/36.14 31: evalbinsearchStepSize2bb12in -> evalbinsearchStepSize2bb13in : H'=1, Q'=free_6, [ F>=1 && free_6>=0 && F>=2*free_6 && 1+2*free_6>=F ], cost: 1 83.33/36.14 83.33/36.14 32: evalbinsearchStepSize2bb12in -> evalbinsearchStepSize2bb13in : H'=1, Q'=free_7, [ 0>=1+F && 0>=free_7 && 2*free_7>=F && 1+F>=2*free_7 ], cost: 1 83.33/36.14 83.33/36.14 34: evalbinsearchStepSize2bb13in -> evalbinsearchStepSize2bbin : A'=1, B'=H, C'=Q, D'=-Q+D, [ D>=Q ], cost: 1 83.33/36.14 83.33/36.14 83.33/36.14 83.33/36.14 ### Simplification by acceleration and chaining ### 83.33/36.14 83.33/36.14 83.33/36.14 83.33/36.14 Eliminated locations (on linear paths): 83.33/36.14 83.33/36.14 Start location: evalbinsearchStepSize2start 83.33/36.14 83.33/36.14 36: evalbinsearchStepSize2start -> evalbinsearchStepSize2bbin : A'=0, B'=0, C'=4, D'=A, [], cost: 2 83.33/36.14 83.33/36.14 3: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb1in : E'=free, [ 0>=C ], cost: 1 83.33/36.14 83.33/36.14 4: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb1in : E'=free_1, [ C>=2 ], cost: 1 83.33/36.14 83.33/36.14 5: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb2in : [ 0>=1+B ], cost: 1 83.33/36.14 83.33/36.14 6: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb2in : [ B>=1 ], cost: 1 83.33/36.14 83.33/36.14 7: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb3in : F'=C, [ B==0 ], cost: 1 83.33/36.14 83.33/36.14 8: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb3in : F'=0, [ C==0 ], cost: 1 83.33/36.14 83.33/36.14 9: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb3in : F'=free_2, [ C>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C ], cost: 1 83.33/36.14 83.33/36.14 10: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb3in : F'=free_3, [ 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 ], cost: 1 83.33/36.14 83.33/36.14 11: evalbinsearchStepSize2bb3in -> evalbinsearchStepSize2bb4in : [ E>=1+G ], cost: 1 83.33/36.14 83.33/36.14 37: evalbinsearchStepSize2bb3in -> evalbinsearchStepSize2bb10in : [ G>=1+E ], cost: 2 83.33/36.14 83.33/36.14 13: evalbinsearchStepSize2bb4in -> evalbinsearchStepSize2bb6in : [ A==1 && B==0 ], cost: 1 83.33/36.14 83.33/36.14 14: evalbinsearchStepSize2bb4in -> evalbinsearchStepSize2bb7in : H'=B, Q'=F, [ 0>=A ], cost: 1 83.33/36.14 83.33/36.14 15: evalbinsearchStepSize2bb4in -> evalbinsearchStepSize2bb7in : H'=B, Q'=F, [ A>=2 ], cost: 1 83.33/36.14 83.33/36.14 16: evalbinsearchStepSize2bb4in -> evalbinsearchStepSize2bb7in : H'=B, Q'=F, [ 0>=1+B ], cost: 1 83.33/36.14 83.33/36.14 17: evalbinsearchStepSize2bb4in -> evalbinsearchStepSize2bb7in : H'=B, Q'=F, [ B>=1 ], cost: 1 83.33/36.14 83.33/36.14 18: evalbinsearchStepSize2bb6in -> evalbinsearchStepSize2bb7in : H'=1, Q'=0, [ F==0 ], cost: 1 83.33/36.14 83.33/36.14 19: evalbinsearchStepSize2bb6in -> evalbinsearchStepSize2bb7in : H'=1, Q'=free_4, [ F>=1 && free_4>=0 && F>=2*free_4 && 1+2*free_4>=F ], cost: 1 83.33/36.14 83.33/36.14 20: evalbinsearchStepSize2bb6in -> evalbinsearchStepSize2bb7in : H'=1, Q'=free_5, [ 0>=1+F && 0>=free_5 && 2*free_5>=F && 1+F>=2*free_5 ], cost: 1 83.33/36.14 83.33/36.14 22: evalbinsearchStepSize2bb7in -> evalbinsearchStepSize2bbin : A'=2, B'=H, C'=Q, D'=Q+D, [ 255>=Q+D ], cost: 1 83.33/36.14 83.33/36.14 25: evalbinsearchStepSize2bb10in -> evalbinsearchStepSize2bb12in : [ A==2 && B==0 ], cost: 1 83.33/36.14 83.33/36.14 26: evalbinsearchStepSize2bb10in -> evalbinsearchStepSize2bb13in : H'=B, Q'=F, [ 1>=A ], cost: 1 83.33/36.14 83.33/36.14 27: evalbinsearchStepSize2bb10in -> evalbinsearchStepSize2bb13in : H'=B, Q'=F, [ A>=3 ], cost: 1 83.33/36.14 83.33/36.14 28: evalbinsearchStepSize2bb10in -> evalbinsearchStepSize2bb13in : H'=B, Q'=F, [ 0>=1+B ], cost: 1 83.33/36.14 83.33/36.14 29: evalbinsearchStepSize2bb10in -> evalbinsearchStepSize2bb13in : H'=B, Q'=F, [ B>=1 ], cost: 1 83.33/36.14 83.33/36.14 30: evalbinsearchStepSize2bb12in -> evalbinsearchStepSize2bb13in : H'=1, Q'=0, [ F==0 ], cost: 1 83.33/36.14 83.33/36.14 31: evalbinsearchStepSize2bb12in -> evalbinsearchStepSize2bb13in : H'=1, Q'=free_6, [ F>=1 && free_6>=0 && F>=2*free_6 && 1+2*free_6>=F ], cost: 1 83.33/36.14 83.33/36.14 32: evalbinsearchStepSize2bb12in -> evalbinsearchStepSize2bb13in : H'=1, Q'=free_7, [ 0>=1+F && 0>=free_7 && 2*free_7>=F && 1+F>=2*free_7 ], cost: 1 83.33/36.14 83.33/36.14 34: evalbinsearchStepSize2bb13in -> evalbinsearchStepSize2bbin : A'=1, B'=H, C'=Q, D'=-Q+D, [ D>=Q ], cost: 1 83.33/36.14 83.33/36.14 83.33/36.14 83.33/36.14 Eliminated locations (on tree-shaped paths): 83.33/36.14 83.33/36.14 Start location: evalbinsearchStepSize2start 83.33/36.14 83.33/36.14 36: evalbinsearchStepSize2start -> evalbinsearchStepSize2bbin : A'=0, B'=0, C'=4, D'=A, [], cost: 2 83.33/36.14 83.33/36.14 38: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb2in : E'=free, [ 0>=C && 0>=1+B ], cost: 2 83.33/36.14 83.33/36.14 39: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb2in : E'=free, [ 0>=C && B>=1 ], cost: 2 83.33/36.14 83.33/36.14 40: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb3in : E'=free, F'=C, [ 0>=C && B==0 ], cost: 2 83.33/36.14 83.33/36.14 41: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb2in : E'=free_1, [ C>=2 && 0>=1+B ], cost: 2 83.33/36.14 83.33/36.14 42: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb2in : E'=free_1, [ C>=2 && B>=1 ], cost: 2 83.33/36.14 83.33/36.14 43: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb3in : E'=free_1, F'=C, [ C>=2 && B==0 ], cost: 2 83.33/36.14 83.33/36.14 8: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb3in : F'=0, [ C==0 ], cost: 1 83.33/36.14 83.33/36.14 9: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb3in : F'=free_2, [ C>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C ], cost: 1 83.33/36.14 83.33/36.14 10: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb3in : F'=free_3, [ 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 ], cost: 1 83.33/36.14 83.33/36.14 44: evalbinsearchStepSize2bb3in -> evalbinsearchStepSize2bb6in : [ E>=1+G && A==1 && B==0 ], cost: 2 83.33/36.14 83.33/36.14 45: evalbinsearchStepSize2bb3in -> evalbinsearchStepSize2bb7in : H'=B, Q'=F, [ E>=1+G && 0>=A ], cost: 2 83.33/36.14 83.33/36.14 46: evalbinsearchStepSize2bb3in -> evalbinsearchStepSize2bb7in : H'=B, Q'=F, [ E>=1+G && A>=2 ], cost: 2 83.33/36.14 83.33/36.14 47: evalbinsearchStepSize2bb3in -> evalbinsearchStepSize2bb7in : H'=B, Q'=F, [ E>=1+G && 0>=1+B ], cost: 2 83.33/36.14 83.33/36.14 48: evalbinsearchStepSize2bb3in -> evalbinsearchStepSize2bb7in : H'=B, Q'=F, [ E>=1+G && B>=1 ], cost: 2 83.33/36.14 83.33/36.14 49: evalbinsearchStepSize2bb3in -> evalbinsearchStepSize2bb12in : [ G>=1+E && A==2 && B==0 ], cost: 3 83.33/36.14 83.33/36.14 50: evalbinsearchStepSize2bb3in -> evalbinsearchStepSize2bb13in : H'=B, Q'=F, [ G>=1+E && 1>=A ], cost: 3 83.33/36.14 83.33/36.14 51: evalbinsearchStepSize2bb3in -> evalbinsearchStepSize2bb13in : H'=B, Q'=F, [ G>=1+E && A>=3 ], cost: 3 83.33/36.14 83.33/36.14 52: evalbinsearchStepSize2bb3in -> evalbinsearchStepSize2bb13in : H'=B, Q'=F, [ G>=1+E && 0>=1+B ], cost: 3 83.33/36.14 83.33/36.14 53: evalbinsearchStepSize2bb3in -> evalbinsearchStepSize2bb13in : H'=B, Q'=F, [ G>=1+E && B>=1 ], cost: 3 83.33/36.14 83.33/36.14 18: evalbinsearchStepSize2bb6in -> evalbinsearchStepSize2bb7in : H'=1, Q'=0, [ F==0 ], cost: 1 83.33/36.14 83.33/36.14 19: evalbinsearchStepSize2bb6in -> evalbinsearchStepSize2bb7in : H'=1, Q'=free_4, [ F>=1 && free_4>=0 && F>=2*free_4 && 1+2*free_4>=F ], cost: 1 83.33/36.14 83.33/36.14 20: evalbinsearchStepSize2bb6in -> evalbinsearchStepSize2bb7in : H'=1, Q'=free_5, [ 0>=1+F && 0>=free_5 && 2*free_5>=F && 1+F>=2*free_5 ], cost: 1 83.33/36.14 83.33/36.14 22: evalbinsearchStepSize2bb7in -> evalbinsearchStepSize2bbin : A'=2, B'=H, C'=Q, D'=Q+D, [ 255>=Q+D ], cost: 1 83.33/36.14 83.33/36.14 30: evalbinsearchStepSize2bb12in -> evalbinsearchStepSize2bb13in : H'=1, Q'=0, [ F==0 ], cost: 1 83.33/36.14 83.33/36.14 31: evalbinsearchStepSize2bb12in -> evalbinsearchStepSize2bb13in : H'=1, Q'=free_6, [ F>=1 && free_6>=0 && F>=2*free_6 && 1+2*free_6>=F ], cost: 1 83.33/36.14 83.33/36.14 32: evalbinsearchStepSize2bb12in -> evalbinsearchStepSize2bb13in : H'=1, Q'=free_7, [ 0>=1+F && 0>=free_7 && 2*free_7>=F && 1+F>=2*free_7 ], cost: 1 83.33/36.14 83.33/36.14 34: evalbinsearchStepSize2bb13in -> evalbinsearchStepSize2bbin : A'=1, B'=H, C'=Q, D'=-Q+D, [ D>=Q ], cost: 1 83.33/36.14 83.33/36.14 83.33/36.14 83.33/36.14 Eliminated locations (on tree-shaped paths): 83.33/36.14 83.33/36.14 Start location: evalbinsearchStepSize2start 83.33/36.14 83.33/36.14 36: evalbinsearchStepSize2start -> evalbinsearchStepSize2bbin : A'=0, B'=0, C'=4, D'=A, [], cost: 2 83.33/36.14 83.33/36.14 60: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb6in : E'=free, F'=C, [ 0>=C && B==0 && free>=1+G && A==1 ], cost: 4 83.33/36.14 83.33/36.14 61: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb7in : E'=free, F'=C, H'=B, Q'=C, [ 0>=C && B==0 && free>=1+G && 0>=A ], cost: 4 83.33/36.14 83.33/36.14 62: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb7in : E'=free, F'=C, H'=B, Q'=C, [ 0>=C && B==0 && free>=1+G && A>=2 ], cost: 4 83.33/36.14 83.33/36.14 63: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb12in : E'=free, F'=C, [ 0>=C && B==0 && G>=1+free && A==2 ], cost: 5 83.33/36.14 83.33/36.14 64: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb13in : E'=free, F'=C, H'=B, Q'=C, [ 0>=C && B==0 && G>=1+free && 1>=A ], cost: 5 83.33/36.14 83.33/36.14 65: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb13in : E'=free, F'=C, H'=B, Q'=C, [ 0>=C && B==0 && G>=1+free && A>=3 ], cost: 5 83.33/36.14 83.33/36.14 66: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb6in : E'=free_1, F'=C, [ C>=2 && B==0 && free_1>=1+G && A==1 ], cost: 4 83.33/36.14 83.33/36.14 67: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb7in : E'=free_1, F'=C, H'=B, Q'=C, [ C>=2 && B==0 && free_1>=1+G && 0>=A ], cost: 4 83.33/36.14 83.33/36.14 68: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb7in : E'=free_1, F'=C, H'=B, Q'=C, [ C>=2 && B==0 && free_1>=1+G && A>=2 ], cost: 4 83.33/36.14 83.33/36.14 69: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb12in : E'=free_1, F'=C, [ C>=2 && B==0 && G>=1+free_1 && A==2 ], cost: 5 83.33/36.14 83.33/36.14 70: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb13in : E'=free_1, F'=C, H'=B, Q'=C, [ C>=2 && B==0 && G>=1+free_1 && 1>=A ], cost: 5 83.33/36.14 83.33/36.14 71: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb13in : E'=free_1, F'=C, H'=B, Q'=C, [ C>=2 && B==0 && G>=1+free_1 && A>=3 ], cost: 5 83.33/36.14 83.33/36.14 72: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb7in : E'=free, F'=0, H'=B, Q'=0, [ 0>=1+B && C==0 && free>=1+G && 0>=A ], cost: 5 83.33/36.14 83.33/36.14 73: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb7in : E'=free, F'=0, H'=B, Q'=0, [ 0>=1+B && C==0 && free>=1+G && A>=2 ], cost: 5 83.33/36.14 83.33/36.14 74: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb7in : E'=free, F'=0, H'=B, Q'=0, [ 0>=1+B && C==0 && free>=1+G ], cost: 5 83.33/36.14 83.33/36.14 75: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb13in : E'=free, F'=0, H'=B, Q'=0, [ 0>=1+B && C==0 && G>=1+free && 1>=A ], cost: 6 83.33/36.14 83.33/36.14 76: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb13in : E'=free, F'=0, H'=B, Q'=0, [ 0>=1+B && C==0 && G>=1+free && A>=3 ], cost: 6 83.33/36.14 83.33/36.14 77: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb13in : E'=free, F'=0, H'=B, Q'=0, [ 0>=1+B && C==0 && G>=1+free ], cost: 6 83.33/36.14 83.33/36.14 78: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb7in : E'=free, F'=free_3, H'=B, Q'=free_3, [ 0>=1+B && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && free>=1+G && 0>=A ], cost: 5 83.33/36.14 83.33/36.14 79: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb7in : E'=free, F'=free_3, H'=B, Q'=free_3, [ 0>=1+B && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && free>=1+G && A>=2 ], cost: 5 83.33/36.14 83.33/36.14 80: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb7in : E'=free, F'=free_3, H'=B, Q'=free_3, [ 0>=1+B && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && free>=1+G ], cost: 5 83.33/36.14 83.33/36.14 81: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb13in : E'=free, F'=free_3, H'=B, Q'=free_3, [ 0>=1+B && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && G>=1+free && 1>=A ], cost: 6 83.33/36.14 83.33/36.14 82: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb13in : E'=free, F'=free_3, H'=B, Q'=free_3, [ 0>=1+B && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && G>=1+free && A>=3 ], cost: 6 83.33/36.14 83.33/36.14 83: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb13in : E'=free, F'=free_3, H'=B, Q'=free_3, [ 0>=1+B && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && G>=1+free ], cost: 6 83.33/36.14 83.33/36.14 84: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb7in : E'=free, F'=0, H'=B, Q'=0, [ B>=1 && C==0 && free>=1+G && 0>=A ], cost: 5 83.33/36.14 83.33/36.14 85: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb7in : E'=free, F'=0, H'=B, Q'=0, [ B>=1 && C==0 && free>=1+G && A>=2 ], cost: 5 83.33/36.14 83.33/36.14 86: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb7in : E'=free, F'=0, H'=B, Q'=0, [ B>=1 && C==0 && free>=1+G ], cost: 5 83.33/36.14 83.33/36.14 87: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb13in : E'=free, F'=0, H'=B, Q'=0, [ B>=1 && C==0 && G>=1+free && 1>=A ], cost: 6 83.33/36.14 83.33/36.14 88: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb13in : E'=free, F'=0, H'=B, Q'=0, [ B>=1 && C==0 && G>=1+free && A>=3 ], cost: 6 83.33/36.14 83.33/36.14 89: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb13in : E'=free, F'=0, H'=B, Q'=0, [ B>=1 && C==0 && G>=1+free ], cost: 6 83.33/36.14 83.33/36.14 90: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb7in : E'=free, F'=free_3, H'=B, Q'=free_3, [ B>=1 && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && free>=1+G && 0>=A ], cost: 5 83.33/36.14 83.33/36.14 91: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb7in : E'=free, F'=free_3, H'=B, Q'=free_3, [ B>=1 && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && free>=1+G && A>=2 ], cost: 5 83.33/36.14 83.33/36.14 92: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb7in : E'=free, F'=free_3, H'=B, Q'=free_3, [ B>=1 && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && free>=1+G ], cost: 5 83.33/36.14 83.33/36.14 93: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb13in : E'=free, F'=free_3, H'=B, Q'=free_3, [ B>=1 && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && G>=1+free && 1>=A ], cost: 6 83.33/36.14 83.33/36.14 94: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb13in : E'=free, F'=free_3, H'=B, Q'=free_3, [ B>=1 && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && G>=1+free && A>=3 ], cost: 6 83.33/36.14 83.33/36.14 95: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb13in : E'=free, F'=free_3, H'=B, Q'=free_3, [ B>=1 && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && G>=1+free ], cost: 6 83.33/36.14 83.33/36.14 96: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb7in : E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && 0>=1+B && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && 0>=A ], cost: 5 83.33/36.14 83.33/36.14 97: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb7in : E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && 0>=1+B && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && A>=2 ], cost: 5 83.33/36.14 83.33/36.14 98: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb7in : E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && 0>=1+B && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G ], cost: 5 83.33/36.14 83.33/36.14 99: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb13in : E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && 0>=1+B && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && 1>=A ], cost: 6 83.33/36.14 83.33/36.14 100: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb13in : E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && 0>=1+B && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && A>=3 ], cost: 6 83.33/36.14 83.33/36.14 101: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb13in : E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && 0>=1+B && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 ], cost: 6 83.33/36.14 83.33/36.14 102: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb7in : E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && B>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && 0>=A ], cost: 5 83.33/36.14 83.33/36.14 103: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb7in : E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && B>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && A>=2 ], cost: 5 83.33/36.14 83.33/36.14 104: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb7in : E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && B>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G ], cost: 5 83.33/36.14 83.33/36.14 105: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb13in : E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && B>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && 1>=A ], cost: 6 83.33/36.14 83.33/36.14 106: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb13in : E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && B>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && A>=3 ], cost: 6 83.33/36.14 83.33/36.14 107: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb13in : E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && B>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 ], cost: 6 83.33/36.14 83.33/36.14 18: evalbinsearchStepSize2bb6in -> evalbinsearchStepSize2bb7in : H'=1, Q'=0, [ F==0 ], cost: 1 83.33/36.14 83.33/36.14 19: evalbinsearchStepSize2bb6in -> evalbinsearchStepSize2bb7in : H'=1, Q'=free_4, [ F>=1 && free_4>=0 && F>=2*free_4 && 1+2*free_4>=F ], cost: 1 83.33/36.14 83.33/36.14 20: evalbinsearchStepSize2bb6in -> evalbinsearchStepSize2bb7in : H'=1, Q'=free_5, [ 0>=1+F && 0>=free_5 && 2*free_5>=F && 1+F>=2*free_5 ], cost: 1 83.33/36.14 83.33/36.14 22: evalbinsearchStepSize2bb7in -> evalbinsearchStepSize2bbin : A'=2, B'=H, C'=Q, D'=Q+D, [ 255>=Q+D ], cost: 1 83.33/36.14 83.33/36.14 30: evalbinsearchStepSize2bb12in -> evalbinsearchStepSize2bb13in : H'=1, Q'=0, [ F==0 ], cost: 1 83.33/36.14 83.33/36.14 31: evalbinsearchStepSize2bb12in -> evalbinsearchStepSize2bb13in : H'=1, Q'=free_6, [ F>=1 && free_6>=0 && F>=2*free_6 && 1+2*free_6>=F ], cost: 1 83.33/36.14 83.33/36.14 32: evalbinsearchStepSize2bb12in -> evalbinsearchStepSize2bb13in : H'=1, Q'=free_7, [ 0>=1+F && 0>=free_7 && 2*free_7>=F && 1+F>=2*free_7 ], cost: 1 83.33/36.14 83.33/36.14 34: evalbinsearchStepSize2bb13in -> evalbinsearchStepSize2bbin : A'=1, B'=H, C'=Q, D'=-Q+D, [ D>=Q ], cost: 1 83.33/36.14 83.33/36.14 83.33/36.14 83.33/36.14 Eliminated locations (on tree-shaped paths): 83.33/36.14 83.33/36.14 Start location: evalbinsearchStepSize2start 83.33/36.14 83.33/36.14 36: evalbinsearchStepSize2start -> evalbinsearchStepSize2bbin : A'=0, B'=0, C'=4, D'=A, [], cost: 2 83.33/36.14 83.33/36.14 111: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=B, C'=C, D'=C+D, E'=free, F'=C, H'=B, Q'=C, [ 0>=C && B==0 && free>=1+G && 0>=A && 255>=C+D ], cost: 5 83.33/36.14 83.33/36.14 112: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=B, C'=C, D'=C+D, E'=free, F'=C, H'=B, Q'=C, [ 0>=C && B==0 && free>=1+G && A>=2 && 255>=C+D ], cost: 5 83.33/36.14 83.33/36.14 113: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=B, C'=C, D'=C+D, E'=free_1, F'=C, H'=B, Q'=C, [ C>=2 && B==0 && free_1>=1+G && 0>=A && 255>=C+D ], cost: 5 83.33/36.14 83.33/36.14 114: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=B, C'=C, D'=C+D, E'=free_1, F'=C, H'=B, Q'=C, [ C>=2 && B==0 && free_1>=1+G && A>=2 && 255>=C+D ], cost: 5 83.33/36.14 83.33/36.14 115: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=B, C'=0, D'=D, E'=free, F'=0, H'=B, Q'=0, [ 0>=1+B && C==0 && free>=1+G && 0>=A && 255>=D ], cost: 6 83.33/36.14 83.33/36.14 116: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=B, C'=0, D'=D, E'=free, F'=0, H'=B, Q'=0, [ 0>=1+B && C==0 && free>=1+G && A>=2 && 255>=D ], cost: 6 83.33/36.14 83.33/36.14 117: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=B, C'=0, D'=D, E'=free, F'=0, H'=B, Q'=0, [ 0>=1+B && C==0 && free>=1+G && 255>=D ], cost: 6 83.33/36.14 83.33/36.14 118: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=B, C'=free_3, D'=D+free_3, E'=free, F'=free_3, H'=B, Q'=free_3, [ 0>=1+B && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && free>=1+G && 0>=A && 255>=D+free_3 ], cost: 6 83.33/36.14 83.33/36.14 119: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=B, C'=free_3, D'=D+free_3, E'=free, F'=free_3, H'=B, Q'=free_3, [ 0>=1+B && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && free>=1+G && A>=2 && 255>=D+free_3 ], cost: 6 83.33/36.14 83.33/36.14 120: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=B, C'=free_3, D'=D+free_3, E'=free, F'=free_3, H'=B, Q'=free_3, [ 0>=1+B && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && free>=1+G && 255>=D+free_3 ], cost: 6 83.33/36.14 83.33/36.14 121: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=B, C'=0, D'=D, E'=free, F'=0, H'=B, Q'=0, [ B>=1 && C==0 && free>=1+G && 0>=A && 255>=D ], cost: 6 83.33/36.14 83.33/36.14 122: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=B, C'=0, D'=D, E'=free, F'=0, H'=B, Q'=0, [ B>=1 && C==0 && free>=1+G && A>=2 && 255>=D ], cost: 6 83.33/36.14 83.33/36.14 123: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=B, C'=0, D'=D, E'=free, F'=0, H'=B, Q'=0, [ B>=1 && C==0 && free>=1+G && 255>=D ], cost: 6 83.33/36.14 83.33/36.14 124: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=B, C'=free_3, D'=D+free_3, E'=free, F'=free_3, H'=B, Q'=free_3, [ B>=1 && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && free>=1+G && 0>=A && 255>=D+free_3 ], cost: 6 83.33/36.14 83.33/36.14 125: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=B, C'=free_3, D'=D+free_3, E'=free, F'=free_3, H'=B, Q'=free_3, [ B>=1 && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && free>=1+G && A>=2 && 255>=D+free_3 ], cost: 6 83.33/36.14 83.33/36.14 126: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=B, C'=free_3, D'=D+free_3, E'=free, F'=free_3, H'=B, Q'=free_3, [ B>=1 && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && free>=1+G && 255>=D+free_3 ], cost: 6 83.33/36.14 83.33/36.14 127: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=B, C'=free_2, D'=free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && 0>=1+B && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && 0>=A && 255>=free_2+D ], cost: 6 83.33/36.14 83.33/36.14 128: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=B, C'=free_2, D'=free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && 0>=1+B && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && A>=2 && 255>=free_2+D ], cost: 6 83.33/36.14 83.33/36.14 129: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=B, C'=free_2, D'=free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && 0>=1+B && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && 255>=free_2+D ], cost: 6 83.33/36.14 83.33/36.14 130: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=B, C'=free_2, D'=free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && B>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && 0>=A && 255>=free_2+D ], cost: 6 83.33/36.14 83.33/36.14 131: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=B, C'=free_2, D'=free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && B>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && A>=2 && 255>=free_2+D ], cost: 6 83.33/36.14 83.33/36.14 132: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=B, C'=free_2, D'=free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && B>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && 255>=free_2+D ], cost: 6 83.33/36.14 83.33/36.14 133: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=1, C'=0, D'=D, E'=free, F'=C, H'=1, Q'=0, [ B==0 && free>=1+G && A==1 && C==0 && 255>=D ], cost: 6 83.33/36.14 83.33/36.14 134: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=1, C'=free_5, D'=free_5+D, E'=free, F'=C, H'=1, Q'=free_5, [ B==0 && free>=1+G && A==1 && 0>=1+C && 0>=free_5 && 2*free_5>=C && 1+C>=2*free_5 && 255>=free_5+D ], cost: 6 83.33/36.14 83.33/36.14 135: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=1, C'=free_4, D'=D+free_4, E'=free_1, F'=C, H'=1, Q'=free_4, [ C>=2 && B==0 && free_1>=1+G && A==1 && free_4>=0 && C>=2*free_4 && 1+2*free_4>=C && 255>=D+free_4 ], cost: 6 83.33/36.14 83.33/36.14 139: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=B, C'=C, D'=-C+D, E'=free, F'=C, H'=B, Q'=C, [ 0>=C && B==0 && G>=1+free && 1>=A && D>=C ], cost: 6 83.33/36.14 83.33/36.14 140: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=B, C'=C, D'=-C+D, E'=free, F'=C, H'=B, Q'=C, [ 0>=C && B==0 && G>=1+free && A>=3 && D>=C ], cost: 6 83.33/36.14 83.33/36.14 141: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=B, C'=C, D'=-C+D, E'=free_1, F'=C, H'=B, Q'=C, [ C>=2 && B==0 && G>=1+free_1 && 1>=A && D>=C ], cost: 6 83.33/36.14 83.33/36.14 142: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=B, C'=C, D'=-C+D, E'=free_1, F'=C, H'=B, Q'=C, [ C>=2 && B==0 && G>=1+free_1 && A>=3 && D>=C ], cost: 6 83.33/36.14 83.33/36.14 143: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=B, C'=0, D'=D, E'=free, F'=0, H'=B, Q'=0, [ 0>=1+B && C==0 && G>=1+free && 1>=A && D>=0 ], cost: 7 83.33/36.14 83.33/36.14 144: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=B, C'=0, D'=D, E'=free, F'=0, H'=B, Q'=0, [ 0>=1+B && C==0 && G>=1+free && A>=3 && D>=0 ], cost: 7 83.33/36.14 83.33/36.14 145: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=B, C'=0, D'=D, E'=free, F'=0, H'=B, Q'=0, [ 0>=1+B && C==0 && G>=1+free && D>=0 ], cost: 7 83.33/36.14 83.33/36.14 146: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=B, C'=free_3, D'=D-free_3, E'=free, F'=free_3, H'=B, Q'=free_3, [ 0>=1+B && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && G>=1+free && 1>=A && D>=free_3 ], cost: 7 83.33/36.14 83.33/36.14 147: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=B, C'=free_3, D'=D-free_3, E'=free, F'=free_3, H'=B, Q'=free_3, [ 0>=1+B && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && G>=1+free && A>=3 && D>=free_3 ], cost: 7 83.33/36.14 83.33/36.14 148: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=B, C'=free_3, D'=D-free_3, E'=free, F'=free_3, H'=B, Q'=free_3, [ 0>=1+B && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && G>=1+free && D>=free_3 ], cost: 7 83.33/36.14 83.33/36.14 149: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=B, C'=0, D'=D, E'=free, F'=0, H'=B, Q'=0, [ B>=1 && C==0 && G>=1+free && 1>=A && D>=0 ], cost: 7 83.33/36.14 83.33/36.14 150: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=B, C'=0, D'=D, E'=free, F'=0, H'=B, Q'=0, [ B>=1 && C==0 && G>=1+free && A>=3 && D>=0 ], cost: 7 83.33/36.14 83.33/36.14 151: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=B, C'=0, D'=D, E'=free, F'=0, H'=B, Q'=0, [ B>=1 && C==0 && G>=1+free && D>=0 ], cost: 7 83.33/36.14 83.33/36.14 152: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=B, C'=free_3, D'=D-free_3, E'=free, F'=free_3, H'=B, Q'=free_3, [ B>=1 && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && G>=1+free && 1>=A && D>=free_3 ], cost: 7 83.33/36.14 83.33/36.14 153: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=B, C'=free_3, D'=D-free_3, E'=free, F'=free_3, H'=B, Q'=free_3, [ B>=1 && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && G>=1+free && A>=3 && D>=free_3 ], cost: 7 83.33/36.14 83.33/36.14 154: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=B, C'=free_3, D'=D-free_3, E'=free, F'=free_3, H'=B, Q'=free_3, [ B>=1 && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && G>=1+free && D>=free_3 ], cost: 7 83.33/36.14 83.33/36.14 155: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=B, C'=free_2, D'=-free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && 0>=1+B && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && 1>=A && D>=free_2 ], cost: 7 83.33/36.14 83.33/36.14 156: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=B, C'=free_2, D'=-free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && 0>=1+B && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && A>=3 && D>=free_2 ], cost: 7 83.33/36.14 83.33/36.14 157: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=B, C'=free_2, D'=-free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && 0>=1+B && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && D>=free_2 ], cost: 7 83.33/36.14 83.33/36.14 158: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=B, C'=free_2, D'=-free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && B>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && 1>=A && D>=free_2 ], cost: 7 83.33/36.14 83.33/36.14 159: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=B, C'=free_2, D'=-free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && B>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && A>=3 && D>=free_2 ], cost: 7 83.33/36.14 83.33/36.14 160: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=B, C'=free_2, D'=-free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && B>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && D>=free_2 ], cost: 7 83.33/36.14 83.33/36.14 161: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=1, C'=0, D'=D, E'=free, F'=C, H'=1, Q'=0, [ B==0 && G>=1+free && A==2 && C==0 && D>=0 ], cost: 7 83.33/36.14 83.33/36.14 162: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=1, C'=free_7, D'=D-free_7, E'=free, F'=C, H'=1, Q'=free_7, [ B==0 && G>=1+free && A==2 && 0>=1+C && 0>=free_7 && 2*free_7>=C && 1+C>=2*free_7 && D>=free_7 ], cost: 7 83.33/36.14 83.33/36.14 163: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=1, C'=free_6, D'=D-free_6, E'=free_1, F'=C, H'=1, Q'=free_6, [ C>=2 && B==0 && G>=1+free_1 && A==2 && free_6>=0 && C>=2*free_6 && 1+2*free_6>=C && D>=free_6 ], cost: 7 83.33/36.14 83.33/36.14 83.33/36.14 83.33/36.14 Accelerating simple loops of location 2. 83.33/36.14 83.33/36.14 Simplified some of the simple loops (and removed duplicate rules). 83.33/36.14 83.33/36.14 Accelerating the following rules: 83.33/36.14 83.33/36.14 111: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, D'=C+D, E'=free, F'=C, H'=B, Q'=C, [ 0>=C && B==0 && free>=1+G && 0>=A && 255>=C+D ], cost: 5 83.33/36.14 83.33/36.14 112: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, D'=C+D, E'=free, F'=C, H'=B, Q'=C, [ 0>=C && B==0 && free>=1+G && A>=2 && 255>=C+D ], cost: 5 83.33/36.14 83.33/36.14 113: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, D'=C+D, E'=free_1, F'=C, H'=B, Q'=C, [ C>=2 && B==0 && free_1>=1+G && 0>=A && 255>=C+D ], cost: 5 83.33/36.14 83.33/36.14 114: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, D'=C+D, E'=free_1, F'=C, H'=B, Q'=C, [ C>=2 && B==0 && free_1>=1+G && A>=2 && 255>=C+D ], cost: 5 83.33/36.14 83.33/36.14 115: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=0, E'=free, F'=0, H'=B, Q'=0, [ 0>=1+B && C==0 && free>=1+G && 0>=A && 255>=D ], cost: 6 83.33/36.14 83.33/36.14 116: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=0, E'=free, F'=0, H'=B, Q'=0, [ 0>=1+B && C==0 && free>=1+G && A>=2 && 255>=D ], cost: 6 83.33/36.14 83.33/36.14 117: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=0, E'=free, F'=0, H'=B, Q'=0, [ 0>=1+B && C==0 && free>=1+G && 255>=D ], cost: 6 83.33/36.14 83.33/36.14 118: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=free_3, D'=D+free_3, E'=free, F'=free_3, H'=B, Q'=free_3, [ 0>=1+B && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && free>=1+G && 0>=A && 255>=D+free_3 ], cost: 6 83.33/36.14 83.33/36.14 119: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=free_3, D'=D+free_3, E'=free, F'=free_3, H'=B, Q'=free_3, [ 0>=1+B && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && free>=1+G && A>=2 && 255>=D+free_3 ], cost: 6 83.33/36.14 83.33/36.14 120: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=free_3, D'=D+free_3, E'=free, F'=free_3, H'=B, Q'=free_3, [ 0>=1+B && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && free>=1+G && 255>=D+free_3 ], cost: 6 83.33/36.14 83.33/36.14 121: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=0, E'=free, F'=0, H'=B, Q'=0, [ B>=1 && C==0 && free>=1+G && 0>=A && 255>=D ], cost: 6 83.33/36.14 83.33/36.14 122: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=0, E'=free, F'=0, H'=B, Q'=0, [ B>=1 && C==0 && free>=1+G && A>=2 && 255>=D ], cost: 6 83.33/36.14 83.33/36.14 123: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=0, E'=free, F'=0, H'=B, Q'=0, [ B>=1 && C==0 && free>=1+G && 255>=D ], cost: 6 83.33/36.14 83.33/36.14 124: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=free_3, D'=D+free_3, E'=free, F'=free_3, H'=B, Q'=free_3, [ B>=1 && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && free>=1+G && 0>=A && 255>=D+free_3 ], cost: 6 83.33/36.14 83.33/36.14 125: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=free_3, D'=D+free_3, E'=free, F'=free_3, H'=B, Q'=free_3, [ B>=1 && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && free>=1+G && A>=2 && 255>=D+free_3 ], cost: 6 83.33/36.14 83.33/36.14 126: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=free_3, D'=D+free_3, E'=free, F'=free_3, H'=B, Q'=free_3, [ B>=1 && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && free>=1+G && 255>=D+free_3 ], cost: 6 83.33/36.14 83.33/36.14 127: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=free_2, D'=free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && 0>=1+B && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && 0>=A && 255>=free_2+D ], cost: 6 83.33/36.14 83.33/36.14 128: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=free_2, D'=free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && 0>=1+B && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && A>=2 && 255>=free_2+D ], cost: 6 83.33/36.14 83.33/36.14 129: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=free_2, D'=free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && 0>=1+B && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && 255>=free_2+D ], cost: 6 83.33/36.14 83.33/36.14 130: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=free_2, D'=free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && B>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && 0>=A && 255>=free_2+D ], cost: 6 83.33/36.14 83.33/36.14 131: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=free_2, D'=free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && B>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && A>=2 && 255>=free_2+D ], cost: 6 83.33/36.14 83.33/36.14 132: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=free_2, D'=free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && B>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && 255>=free_2+D ], cost: 6 83.33/36.14 83.33/36.14 133: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=1, C'=0, E'=free, F'=C, H'=1, Q'=0, [ B==0 && free>=1+G && A==1 && C==0 && 255>=D ], cost: 6 83.33/36.14 83.33/36.14 134: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=1, C'=free_5, D'=free_5+D, E'=free, F'=C, H'=1, Q'=free_5, [ B==0 && free>=1+G && A==1 && 0>=1+C && 0>=free_5 && 2*free_5>=C && 1+C>=2*free_5 && 255>=free_5+D ], cost: 6 83.33/36.14 83.33/36.14 135: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=1, C'=free_4, D'=D+free_4, E'=free_1, F'=C, H'=1, Q'=free_4, [ C>=2 && B==0 && free_1>=1+G && A==1 && free_4>=0 && C>=2*free_4 && 1+2*free_4>=C && 255>=D+free_4 ], cost: 6 83.33/36.14 83.33/36.14 139: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, D'=-C+D, E'=free, F'=C, H'=B, Q'=C, [ 0>=C && B==0 && G>=1+free && 1>=A && D>=C ], cost: 6 83.33/36.14 83.33/36.14 140: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, D'=-C+D, E'=free, F'=C, H'=B, Q'=C, [ 0>=C && B==0 && G>=1+free && A>=3 && D>=C ], cost: 6 83.33/36.14 83.33/36.14 141: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, D'=-C+D, E'=free_1, F'=C, H'=B, Q'=C, [ C>=2 && B==0 && G>=1+free_1 && 1>=A && D>=C ], cost: 6 83.33/36.14 83.33/36.14 142: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, D'=-C+D, E'=free_1, F'=C, H'=B, Q'=C, [ C>=2 && B==0 && G>=1+free_1 && A>=3 && D>=C ], cost: 6 83.33/36.14 83.33/36.14 143: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=0, E'=free, F'=0, H'=B, Q'=0, [ 0>=1+B && C==0 && G>=1+free && 1>=A && D>=0 ], cost: 7 83.33/36.14 83.33/36.14 144: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=0, E'=free, F'=0, H'=B, Q'=0, [ 0>=1+B && C==0 && G>=1+free && A>=3 && D>=0 ], cost: 7 83.33/36.14 83.33/36.14 145: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=0, E'=free, F'=0, H'=B, Q'=0, [ 0>=1+B && C==0 && G>=1+free && D>=0 ], cost: 7 83.33/36.14 83.33/36.14 146: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=free_3, D'=D-free_3, E'=free, F'=free_3, H'=B, Q'=free_3, [ 0>=1+B && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && G>=1+free && 1>=A && D>=free_3 ], cost: 7 83.33/36.14 83.33/36.14 147: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=free_3, D'=D-free_3, E'=free, F'=free_3, H'=B, Q'=free_3, [ 0>=1+B && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && G>=1+free && A>=3 && D>=free_3 ], cost: 7 83.33/36.14 83.33/36.14 148: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=free_3, D'=D-free_3, E'=free, F'=free_3, H'=B, Q'=free_3, [ 0>=1+B && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && G>=1+free && D>=free_3 ], cost: 7 83.33/36.14 83.33/36.14 149: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=0, E'=free, F'=0, H'=B, Q'=0, [ B>=1 && C==0 && G>=1+free && 1>=A && D>=0 ], cost: 7 83.33/36.14 83.33/36.14 150: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=0, E'=free, F'=0, H'=B, Q'=0, [ B>=1 && C==0 && G>=1+free && A>=3 && D>=0 ], cost: 7 83.33/36.14 83.33/36.14 151: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=0, E'=free, F'=0, H'=B, Q'=0, [ B>=1 && C==0 && G>=1+free && D>=0 ], cost: 7 83.33/36.14 83.33/36.14 152: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=free_3, D'=D-free_3, E'=free, F'=free_3, H'=B, Q'=free_3, [ B>=1 && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && G>=1+free && 1>=A && D>=free_3 ], cost: 7 83.33/36.14 83.33/36.14 153: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=free_3, D'=D-free_3, E'=free, F'=free_3, H'=B, Q'=free_3, [ B>=1 && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && G>=1+free && A>=3 && D>=free_3 ], cost: 7 83.33/36.14 83.33/36.14 154: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=free_3, D'=D-free_3, E'=free, F'=free_3, H'=B, Q'=free_3, [ B>=1 && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && G>=1+free && D>=free_3 ], cost: 7 83.33/36.14 83.33/36.14 155: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=free_2, D'=-free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && 0>=1+B && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && 1>=A && D>=free_2 ], cost: 7 83.33/36.14 83.33/36.14 156: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=free_2, D'=-free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && 0>=1+B && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && A>=3 && D>=free_2 ], cost: 7 83.33/36.14 83.33/36.14 157: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=free_2, D'=-free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && 0>=1+B && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && D>=free_2 ], cost: 7 83.33/36.14 83.33/36.14 158: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=free_2, D'=-free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && B>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && 1>=A && D>=free_2 ], cost: 7 83.33/36.14 83.33/36.14 159: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=free_2, D'=-free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && B>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && A>=3 && D>=free_2 ], cost: 7 83.33/36.14 83.33/36.14 160: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=free_2, D'=-free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && B>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && D>=free_2 ], cost: 7 83.33/36.14 83.33/36.14 161: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=1, C'=0, E'=free, F'=C, H'=1, Q'=0, [ B==0 && G>=1+free && A==2 && C==0 && D>=0 ], cost: 7 83.33/36.14 83.33/36.14 162: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=1, C'=free_7, D'=D-free_7, E'=free, F'=C, H'=1, Q'=free_7, [ B==0 && G>=1+free && A==2 && 0>=1+C && 0>=free_7 && 2*free_7>=C && 1+C>=2*free_7 && D>=free_7 ], cost: 7 83.33/36.14 83.33/36.14 163: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=1, C'=free_6, D'=D-free_6, E'=free_1, F'=C, H'=1, Q'=free_6, [ C>=2 && B==0 && G>=1+free_1 && A==2 && free_6>=0 && C>=2*free_6 && 1+2*free_6>=C && D>=free_6 ], cost: 7 83.33/36.14 83.33/36.14 83.33/36.14 83.33/36.14 Found no metering function for rule 111. 83.33/36.14 83.33/36.14 Accelerated rule 112 with NONTERM, yielding the new rule 164. 83.33/36.14 83.33/36.14 Found no metering function for rule 113. 83.33/36.14 83.33/36.14 Accelerated rule 114 with backward acceleration, yielding the new rule 165. 83.33/36.14 83.33/36.14 Found no metering function for rule 115. 83.33/36.14 83.33/36.14 Accelerated rule 116 with NONTERM, yielding the new rule 166. 83.33/36.14 83.33/36.14 Accelerated rule 117 with NONTERM, yielding the new rule 167. 83.33/36.14 83.33/36.14 During metering: Instantiating temporary variables by {free_3==0} 83.33/36.14 83.33/36.14 Accelerated rule 118 with metering function -1-C, yielding the new rule 168. 83.33/36.14 83.33/36.14 During metering: Instantiating temporary variables by {free_3==0} 83.33/36.14 83.33/36.14 Accelerated rule 119 with metering function -C, yielding the new rule 169. 83.33/36.14 83.33/36.14 During metering: Instantiating temporary variables by {free_3==0} 83.33/36.14 83.33/36.14 Accelerated rule 120 with metering function -C, yielding the new rule 170. 83.33/36.14 83.33/36.14 Found no metering function for rule 121. 83.33/36.14 83.33/36.14 Accelerated rule 122 with NONTERM, yielding the new rule 171. 83.33/36.14 83.33/36.14 Accelerated rule 123 with NONTERM, yielding the new rule 172. 83.33/36.14 83.33/36.14 During metering: Instantiating temporary variables by {free_3==0} 83.33/36.14 83.33/36.14 Accelerated rule 124 with metering function -1-C, yielding the new rule 173. 83.33/36.14 83.33/36.14 During metering: Instantiating temporary variables by {free_3==0} 83.33/36.14 83.33/36.14 Accelerated rule 125 with metering function -C, yielding the new rule 174. 83.33/36.14 83.33/36.14 During metering: Instantiating temporary variables by {free_3==0} 83.33/36.14 83.33/36.14 Accelerated rule 126 with metering function -C, yielding the new rule 175. 83.33/36.14 83.33/36.14 Accelerated rule 127 with NONTERM (after strengthening guard), yielding the new rule 176. 83.33/36.14 83.33/36.14 Accelerated rule 128 with NONTERM (after strengthening guard), yielding the new rule 177. 83.33/36.14 83.33/36.14 Accelerated rule 129 with NONTERM (after strengthening guard), yielding the new rule 178. 83.33/36.14 83.33/36.14 Accelerated rule 130 with NONTERM (after strengthening guard), yielding the new rule 179. 83.33/36.14 83.33/36.14 Accelerated rule 131 with NONTERM (after strengthening guard), yielding the new rule 180. 83.33/36.14 83.33/36.14 Accelerated rule 132 with NONTERM (after strengthening guard), yielding the new rule 181. 83.33/36.14 83.33/36.14 Accelerated rule 133 with metering function meter (where 2*meter==2-A-B), yielding the new rule 182. 83.33/36.14 83.33/36.14 Accelerated rule 134 with metering function meter_1 (where 2*meter_1==1-A-B), yielding the new rule 183. 83.33/36.14 83.33/36.14 Accelerated rule 135 with metering function meter_2 (where 2*meter_2==1-A-B), yielding the new rule 184. 83.33/36.14 83.33/36.14 Accelerated rule 139 with NONTERM, yielding the new rule 185. 83.33/36.14 83.33/36.14 Found no metering function for rule 140. 83.33/36.14 83.33/36.14 Accelerated rule 141 with backward acceleration, yielding the new rule 186. 83.33/36.14 83.33/36.14 Found no metering function for rule 142. 83.33/36.14 83.33/36.14 Accelerated rule 143 with NONTERM, yielding the new rule 187. 83.33/36.14 83.33/36.14 Found no metering function for rule 144. 83.33/36.14 83.33/36.14 Accelerated rule 145 with NONTERM, yielding the new rule 188. 83.33/36.14 83.33/36.14 During metering: Instantiating temporary variables by {free_3==0} 83.33/36.14 83.33/36.14 Accelerated rule 146 with metering function -C, yielding the new rule 189. 83.33/36.14 83.33/36.14 During metering: Instantiating temporary variables by {free_3==0} 83.33/36.14 83.33/36.14 Accelerated rule 147 with metering function -1-C, yielding the new rule 190. 83.33/36.14 83.33/36.14 During metering: Instantiating temporary variables by {free_3==0} 83.33/36.14 83.33/36.14 Accelerated rule 148 with metering function -C, yielding the new rule 191. 83.33/36.14 83.33/36.14 Accelerated rule 149 with NONTERM, yielding the new rule 192. 83.33/36.14 83.33/36.14 Found no metering function for rule 150. 83.33/36.14 83.33/36.14 Accelerated rule 151 with NONTERM, yielding the new rule 193. 83.33/36.14 83.33/36.14 During metering: Instantiating temporary variables by {free_3==0} 83.33/36.14 83.33/36.14 Accelerated rule 152 with metering function -C, yielding the new rule 194. 83.33/36.14 83.33/36.14 During metering: Instantiating temporary variables by {free_3==0} 83.33/36.14 83.33/36.14 Accelerated rule 153 with metering function -1-C, yielding the new rule 195. 83.33/36.14 83.33/36.14 During metering: Instantiating temporary variables by {free_3==0} 83.33/36.14 83.33/36.14 Accelerated rule 154 with metering function -C, yielding the new rule 196. 83.33/36.14 83.33/36.14 Accelerated rule 155 with NONTERM (after strengthening guard), yielding the new rule 197. 83.33/36.14 83.33/36.14 Accelerated rule 156 with NONTERM (after strengthening guard), yielding the new rule 198. 83.33/36.14 83.33/36.14 Accelerated rule 157 with NONTERM (after strengthening guard), yielding the new rule 199. 83.33/36.14 83.33/36.14 Accelerated rule 158 with NONTERM (after strengthening guard), yielding the new rule 200. 83.33/36.14 83.33/36.14 Accelerated rule 159 with NONTERM (after strengthening guard), yielding the new rule 201. 83.33/36.14 83.33/36.14 Accelerated rule 160 with NONTERM (after strengthening guard), yielding the new rule 202. 83.33/36.14 83.33/36.14 Accelerated rule 161 with metering function meter_3 (where 2*meter_3==-1+A-B), yielding the new rule 203. 83.33/36.14 83.33/36.14 Accelerated rule 162 with metering function meter_4 (where 2*meter_4==-2+A-B), yielding the new rule 204. 83.33/36.14 83.33/36.14 Accelerated rule 163 with metering function meter_5 (where 2*meter_5==-2+A-B), yielding the new rule 205. 83.33/36.14 83.33/36.14 Removing the simple loops: 112 114 116 117 118 119 120 122 123 124 125 126 133 134 135 139 141 143 145 146 147 148 149 151 152 153 154 161 162 163. 83.33/36.14 83.33/36.14 83.33/36.14 83.33/36.14 Accelerated all simple loops using metering functions (where possible): 83.33/36.14 83.33/36.14 Start location: evalbinsearchStepSize2start 83.33/36.14 83.33/36.14 36: evalbinsearchStepSize2start -> evalbinsearchStepSize2bbin : A'=0, B'=0, C'=4, D'=A, [], cost: 2 83.33/36.14 83.33/36.14 111: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, D'=C+D, E'=free, F'=C, H'=B, Q'=C, [ 0>=C && B==0 && free>=1+G && 0>=A && 255>=C+D ], cost: 5 83.33/36.14 83.33/36.14 113: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, D'=C+D, E'=free_1, F'=C, H'=B, Q'=C, [ C>=2 && B==0 && free_1>=1+G && 0>=A && 255>=C+D ], cost: 5 83.33/36.14 83.33/36.14 115: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=0, E'=free, F'=0, H'=B, Q'=0, [ 0>=1+B && C==0 && free>=1+G && 0>=A && 255>=D ], cost: 6 83.33/36.14 83.33/36.14 121: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=0, E'=free, F'=0, H'=B, Q'=0, [ B>=1 && C==0 && free>=1+G && 0>=A && 255>=D ], cost: 6 83.33/36.14 83.33/36.14 127: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=free_2, D'=free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && 0>=1+B && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && 0>=A && 255>=free_2+D ], cost: 6 83.33/36.14 83.33/36.14 128: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=free_2, D'=free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && 0>=1+B && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && A>=2 && 255>=free_2+D ], cost: 6 83.33/36.14 83.33/36.14 129: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=free_2, D'=free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && 0>=1+B && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && 255>=free_2+D ], cost: 6 83.33/36.14 83.33/36.14 130: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=free_2, D'=free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && B>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && 0>=A && 255>=free_2+D ], cost: 6 83.33/36.14 83.33/36.14 131: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=free_2, D'=free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && B>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && A>=2 && 255>=free_2+D ], cost: 6 83.33/36.14 83.33/36.14 132: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=free_2, D'=free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && B>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && 255>=free_2+D ], cost: 6 83.33/36.14 83.33/36.14 140: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, D'=-C+D, E'=free, F'=C, H'=B, Q'=C, [ 0>=C && B==0 && G>=1+free && A>=3 && D>=C ], cost: 6 83.33/36.14 83.33/36.14 142: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, D'=-C+D, E'=free_1, F'=C, H'=B, Q'=C, [ C>=2 && B==0 && G>=1+free_1 && A>=3 && D>=C ], cost: 6 83.33/36.14 83.33/36.14 144: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=0, E'=free, F'=0, H'=B, Q'=0, [ 0>=1+B && C==0 && G>=1+free && A>=3 && D>=0 ], cost: 7 83.33/36.14 83.33/36.14 150: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=0, E'=free, F'=0, H'=B, Q'=0, [ B>=1 && C==0 && G>=1+free && A>=3 && D>=0 ], cost: 7 83.33/36.14 83.33/36.14 155: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=free_2, D'=-free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && 0>=1+B && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && 1>=A && D>=free_2 ], cost: 7 83.33/36.14 83.33/36.14 156: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=free_2, D'=-free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && 0>=1+B && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && A>=3 && D>=free_2 ], cost: 7 83.33/36.14 83.33/36.14 157: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=free_2, D'=-free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && 0>=1+B && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && D>=free_2 ], cost: 7 83.33/36.14 83.33/36.14 158: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=free_2, D'=-free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && B>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && 1>=A && D>=free_2 ], cost: 7 83.33/36.14 83.33/36.14 159: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=free_2, D'=-free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && B>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && A>=3 && D>=free_2 ], cost: 7 83.33/36.14 83.33/36.14 160: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=free_2, D'=-free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && B>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && D>=free_2 ], cost: 7 83.33/36.14 83.33/36.14 164: evalbinsearchStepSize2bbin -> [15] : [ 0>=C && B==0 && free>=1+G && A>=2 && 255>=C+D ], cost: INF 83.33/36.14 83.33/36.14 165: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, D'=D+C*k, E'=free_1, F'=C, H'=B, Q'=C, [ C>=2 && B==0 && free_1>=1+G && A>=2 && 255>=C+D && k>0 && 255>=(-1+k)*C+C+D ], cost: 5*k 83.33/36.14 83.33/36.14 166: evalbinsearchStepSize2bbin -> [15] : [ 0>=1+B && C==0 && free>=1+G && A>=2 && 255>=D ], cost: INF 83.33/36.14 83.33/36.14 167: evalbinsearchStepSize2bbin -> [15] : [ 0>=1+B && C==0 && free>=1+G && 255>=D ], cost: INF 83.33/36.14 83.33/36.14 168: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=0, D'=D, E'=free, F'=0, H'=B, Q'=0, [ 0>=1+B && 1+C>=0 && free>=1+G && 0>=A && 255>=D && -1-C>=1 ], cost: -6-6*C 83.33/36.14 83.33/36.14 169: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=0, D'=D, E'=free, F'=0, H'=B, Q'=0, [ 0>=1+B && 0>=1+C && 1+C>=0 && free>=1+G && A>=2 && 255>=D ], cost: -6*C 83.33/36.14 83.33/36.14 170: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=0, D'=D, E'=free, F'=0, H'=B, Q'=0, [ 0>=1+B && 0>=1+C && 1+C>=0 && free>=1+G && 255>=D ], cost: -6*C 83.33/36.14 83.33/36.14 171: evalbinsearchStepSize2bbin -> [15] : [ B>=1 && C==0 && free>=1+G && A>=2 && 255>=D ], cost: INF 83.33/36.14 83.33/36.14 172: evalbinsearchStepSize2bbin -> [15] : [ B>=1 && C==0 && free>=1+G && 255>=D ], cost: INF 83.33/36.14 83.33/36.14 173: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=0, D'=D, E'=free, F'=0, H'=B, Q'=0, [ B>=1 && 1+C>=0 && free>=1+G && 0>=A && 255>=D && -1-C>=1 ], cost: -6-6*C 83.33/36.14 83.33/36.14 174: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=0, D'=D, E'=free, F'=0, H'=B, Q'=0, [ B>=1 && 0>=1+C && 1+C>=0 && free>=1+G && A>=2 && 255>=D ], cost: -6*C 83.33/36.14 83.33/36.14 175: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=0, D'=D, E'=free, F'=0, H'=B, Q'=0, [ B>=1 && 0>=1+C && 1+C>=0 && free>=1+G && 255>=D ], cost: -6*C 83.33/36.14 83.33/36.14 176: evalbinsearchStepSize2bbin -> [15] : [ C>=2 && 0>=1+B && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && 0>=A && 255>=free_2+D && free_2>=2 && free_2>=2*free_2 ], cost: INF 83.33/36.14 83.33/36.14 177: evalbinsearchStepSize2bbin -> [15] : [ C>=2 && 0>=1+B && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && A>=2 && 255>=free_2+D && free_2>=2 && free_2>=2*free_2 ], cost: INF 83.33/36.14 83.33/36.14 178: evalbinsearchStepSize2bbin -> [15] : [ C>=2 && 0>=1+B && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && 255>=free_2+D && free_2>=2 && free_2>=2*free_2 ], cost: INF 83.33/36.14 83.33/36.14 179: evalbinsearchStepSize2bbin -> [15] : [ C>=2 && B>=1 && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && 0>=A && 255>=free_2+D && free_2>=2 && free_2>=2*free_2 ], cost: INF 83.33/36.14 83.33/36.14 180: evalbinsearchStepSize2bbin -> [15] : [ C>=2 && B>=1 && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && A>=2 && 255>=free_2+D && free_2>=2 && free_2>=2*free_2 ], cost: INF 83.33/36.14 83.33/36.14 181: evalbinsearchStepSize2bbin -> [15] : [ C>=2 && B>=1 && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && 255>=free_2+D && free_2>=2 && free_2>=2*free_2 ], cost: INF 83.33/36.14 83.33/36.14 182: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=1, C'=0, E'=free, F'=0, H'=1, Q'=0, [ B==0 && free>=1+G && A==1 && C==0 && 255>=D && 2*meter==2-A-B && meter>=1 ], cost: 6*meter 83.33/36.14 83.33/36.14 183: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=1, C'=free_5, D'=meter_1*free_5+D, E'=free, F'=free_5, H'=1, Q'=free_5, [ B==0 && free>=1+G && A==1 && 0>=1+C && 0>=free_5 && 2*free_5>=C && 1+C>=2*free_5 && 255>=free_5+D && 2*meter_1==1-A-B && meter_1>=1 ], cost: 6*meter_1 83.33/36.14 83.33/36.14 184: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=1, C'=free_4, D'=meter_2*free_4+D, E'=free_1, F'=free_4, H'=1, Q'=free_4, [ C>=2 && B==0 && free_1>=1+G && A==1 && free_4>=0 && C>=2*free_4 && 1+2*free_4>=C && 255>=D+free_4 && 2*meter_2==1-A-B && meter_2>=1 ], cost: 6*meter_2 83.33/36.14 83.33/36.14 185: evalbinsearchStepSize2bbin -> [15] : [ 0>=C && B==0 && G>=1+free && 1>=A && D>=C ], cost: INF 83.33/36.14 83.33/36.14 186: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, D'=-C*k_1+D, E'=free_1, F'=C, H'=B, Q'=C, [ C>=2 && B==0 && G>=1+free_1 && 1>=A && D>=C && k_1>0 && -C*(-1+k_1)+D>=C ], cost: 6*k_1 83.33/36.14 83.33/36.14 187: evalbinsearchStepSize2bbin -> [15] : [ 0>=1+B && C==0 && G>=1+free && 1>=A && D>=0 ], cost: INF 83.33/36.14 83.33/36.14 188: evalbinsearchStepSize2bbin -> [15] : [ 0>=1+B && C==0 && G>=1+free && D>=0 ], cost: INF 83.33/36.14 83.33/36.14 189: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=0, D'=D, E'=free, F'=0, H'=B, Q'=0, [ 0>=1+B && 0>=1+C && 1+C>=0 && G>=1+free && 1>=A && D>=0 ], cost: -7*C 83.33/36.14 83.33/36.14 190: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=0, D'=D, E'=free, F'=0, H'=B, Q'=0, [ 0>=1+B && 1+C>=0 && G>=1+free && A>=3 && D>=0 && -1-C>=1 ], cost: -7-7*C 83.33/36.14 83.33/36.14 191: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=0, D'=D, E'=free, F'=0, H'=B, Q'=0, [ 0>=1+B && 0>=1+C && 1+C>=0 && G>=1+free && D>=0 ], cost: -7*C 83.33/36.14 83.33/36.14 192: evalbinsearchStepSize2bbin -> [15] : [ B>=1 && C==0 && G>=1+free && 1>=A && D>=0 ], cost: INF 83.33/36.14 83.33/36.14 193: evalbinsearchStepSize2bbin -> [15] : [ B>=1 && C==0 && G>=1+free && D>=0 ], cost: INF 83.33/36.14 83.33/36.14 194: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=0, D'=D, E'=free, F'=0, H'=B, Q'=0, [ B>=1 && 0>=1+C && 1+C>=0 && G>=1+free && 1>=A && D>=0 ], cost: -7*C 83.33/36.14 83.33/36.14 195: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=0, D'=D, E'=free, F'=0, H'=B, Q'=0, [ B>=1 && 1+C>=0 && G>=1+free && A>=3 && D>=0 && -1-C>=1 ], cost: -7-7*C 83.33/36.14 83.33/36.14 196: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=0, D'=D, E'=free, F'=0, H'=B, Q'=0, [ B>=1 && 0>=1+C && 1+C>=0 && G>=1+free && D>=0 ], cost: -7*C 83.33/36.14 83.33/36.14 197: evalbinsearchStepSize2bbin -> [15] : [ C>=2 && 0>=1+B && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && 1>=A && D>=free_2 && free_2>=2 && free_2>=2*free_2 ], cost: INF 83.33/36.14 83.33/36.14 198: evalbinsearchStepSize2bbin -> [15] : [ C>=2 && 0>=1+B && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && A>=3 && D>=free_2 && free_2>=2 && free_2>=2*free_2 ], cost: INF 83.33/36.14 83.33/36.14 199: evalbinsearchStepSize2bbin -> [15] : [ C>=2 && 0>=1+B && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && D>=free_2 && free_2>=2 && free_2>=2*free_2 ], cost: INF 83.33/36.14 83.33/36.14 200: evalbinsearchStepSize2bbin -> [15] : [ C>=2 && B>=1 && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && 1>=A && D>=free_2 && free_2>=2 && free_2>=2*free_2 ], cost: INF 83.33/36.14 83.33/36.14 201: evalbinsearchStepSize2bbin -> [15] : [ C>=2 && B>=1 && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && A>=3 && D>=free_2 && free_2>=2 && free_2>=2*free_2 ], cost: INF 83.33/36.14 83.33/36.14 202: evalbinsearchStepSize2bbin -> [15] : [ C>=2 && B>=1 && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && D>=free_2 && free_2>=2 && free_2>=2*free_2 ], cost: INF 83.33/36.14 83.33/36.14 203: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=1, C'=0, E'=free, F'=0, H'=1, Q'=0, [ B==0 && G>=1+free && A==2 && C==0 && D>=0 && 2*meter_3==-1+A-B && meter_3>=1 ], cost: 7*meter_3 83.33/36.14 83.33/36.14 204: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=1, C'=free_7, D'=D-meter_4*free_7, E'=free, F'=free_7, H'=1, Q'=free_7, [ B==0 && G>=1+free && A==2 && 0>=1+C && 0>=free_7 && 2*free_7>=C && 1+C>=2*free_7 && D>=free_7 && 2*meter_4==-2+A-B && meter_4>=1 ], cost: 7*meter_4 83.33/36.14 83.33/36.14 205: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=1, C'=free_6, D'=-meter_5*free_6+D, E'=free_1, F'=free_6, H'=1, Q'=free_6, [ C>=2 && B==0 && G>=1+free_1 && A==2 && free_6>=0 && C>=2*free_6 && 1+2*free_6>=C && D>=free_6 && 2*meter_5==-2+A-B && meter_5>=1 ], cost: 7*meter_5 83.33/36.14 83.33/36.14 83.33/36.14 83.33/36.14 Chained accelerated rules (with incoming rules): 83.33/36.14 83.33/36.14 Start location: evalbinsearchStepSize2start 83.33/36.14 83.33/36.14 36: evalbinsearchStepSize2start -> evalbinsearchStepSize2bbin : A'=0, B'=0, C'=4, D'=A, [], cost: 2 83.33/36.14 83.33/36.14 206: evalbinsearchStepSize2start -> evalbinsearchStepSize2bbin : A'=2, B'=0, C'=4, D'=4+A, E'=free_1, F'=4, H'=0, Q'=4, [ free_1>=1+G && 255>=4+A ], cost: 7 83.33/36.14 83.33/36.14 207: evalbinsearchStepSize2start -> evalbinsearchStepSize2bbin : A'=1, B'=0, C'=4, D'=A-4*k_1, E'=free_1, F'=4, H'=0, Q'=4, [ G>=1+free_1 && A>=4 && k_1>0 && 4+A-4*k_1>=4 ], cost: 2+6*k_1 83.33/36.14 83.33/36.14 83.33/36.14 83.33/36.14 Removed unreachable locations (and leaf rules with constant cost): 83.33/36.14 83.33/36.14 Start location: evalbinsearchStepSize2start 83.33/36.14 83.33/36.14 207: evalbinsearchStepSize2start -> evalbinsearchStepSize2bbin : A'=1, B'=0, C'=4, D'=A-4*k_1, E'=free_1, F'=4, H'=0, Q'=4, [ G>=1+free_1 && A>=4 && k_1>0 && 4+A-4*k_1>=4 ], cost: 2+6*k_1 83.33/36.14 83.33/36.14 83.33/36.14 83.33/36.14 ### Computing asymptotic complexity ### 83.33/36.14 83.33/36.14 83.33/36.14 83.33/36.14 Fully simplified ITS problem 83.33/36.14 83.33/36.14 Start location: evalbinsearchStepSize2start 83.33/36.14 83.33/36.14 207: evalbinsearchStepSize2start -> evalbinsearchStepSize2bbin : A'=1, B'=0, C'=4, D'=A-4*k_1, E'=free_1, F'=4, H'=0, Q'=4, [ G>=1+free_1 && A>=4 && k_1>0 && 4+A-4*k_1>=4 ], cost: 2+6*k_1 83.33/36.14 83.33/36.14 83.33/36.14 83.33/36.14 Computing asymptotic complexity for rule 207 83.33/36.14 83.33/36.14 Simplified the guard: 83.33/36.14 83.33/36.14 207: evalbinsearchStepSize2start -> evalbinsearchStepSize2bbin : A'=1, B'=0, C'=4, D'=A-4*k_1, E'=free_1, F'=4, H'=0, Q'=4, [ G>=1+free_1 && k_1>0 && 4+A-4*k_1>=4 ], cost: 2+6*k_1 83.33/36.14 83.33/36.14 Solved the limit problem by the following transformations: 83.33/36.14 83.33/36.14 Created initial limit problem: 83.33/36.14 83.33/36.14 1+A-4*k_1 (+/+!), -free_1+G (+/+!), 2+6*k_1 (+), k_1 (+/+!) [not solved] 83.33/36.14 83.33/36.14 83.33/36.14 83.33/36.14 removing all constraints (solved by SMT) 83.33/36.14 83.33/36.14 resulting limit problem: [solved] 83.33/36.14 83.33/36.14 83.33/36.14 83.33/36.14 applying transformation rule (C) using substitution {free_1==0,G==1,A==5*n,k_1==n} 83.33/36.14 83.33/36.14 resulting limit problem: 83.33/36.14 83.33/36.14 [solved] 83.33/36.14 83.33/36.14 83.33/36.14 83.33/36.14 Solved the limit problem by the following transformations: 83.33/36.14 83.33/36.14 Created initial limit problem: 83.33/36.14 83.33/36.14 1+A-4*k_1 (+/+!), -free_1+G (+/+!), 2+6*k_1 (+), k_1 (+/+!) [not solved] 83.33/36.14 83.33/36.14 83.33/36.14 83.33/36.14 applying transformation rule (C) using substitution {G==1+free_1} 83.33/36.14 83.33/36.14 resulting limit problem: 83.33/36.14 83.33/36.14 1 (+/+!), 1+A-4*k_1 (+/+!), 2+6*k_1 (+), k_1 (+/+!) [not solved] 83.33/36.14 83.33/36.14 83.33/36.14 83.33/36.14 applying transformation rule (B), deleting 1 (+/+!) 83.33/36.14 83.33/36.14 resulting limit problem: 83.33/36.14 83.33/36.14 1+A-4*k_1 (+/+!), 2+6*k_1 (+), k_1 (+/+!) [not solved] 83.33/36.14 83.33/36.14 83.33/36.14 83.33/36.14 removing all constraints (solved by SMT) 83.33/36.14 83.33/36.14 resulting limit problem: [solved] 83.33/36.14 83.33/36.14 83.33/36.14 83.33/36.14 applying transformation rule (C) using substitution {A==4*n,k_1==n} 83.33/36.14 83.33/36.14 resulting limit problem: 83.33/36.14 83.33/36.14 [solved] 83.33/36.14 83.33/36.14 83.33/36.14 83.33/36.14 Solution: 83.33/36.14 83.33/36.14 free_1 / 0 83.33/36.14 83.33/36.14 G / 1 83.33/36.14 83.33/36.14 A / 5*n 83.33/36.14 83.33/36.14 k_1 / n 83.33/36.14 83.33/36.14 Resulting cost 2+6*n has complexity: Poly(n^1) 83.33/36.14 83.33/36.14 83.33/36.14 83.33/36.14 Found new complexity Poly(n^1). 83.33/36.14 83.33/36.14 83.33/36.14 83.33/36.14 Obtained the following overall complexity (w.r.t. the length of the input n): 83.33/36.14 83.33/36.14 Complexity: Poly(n^1) 83.33/36.14 83.33/36.14 Cpx degree: 1 83.33/36.14 83.33/36.14 Solved cost: 2+6*n 83.33/36.14 83.33/36.14 Rule cost: 2+6*k_1 83.33/36.14 83.33/36.14 Rule guard: [ G>=1+free_1 && k_1>0 && 4+A-4*k_1>=4 ] 83.33/36.14 83.33/36.14 83.33/36.14 83.33/36.14 WORST_CASE(Omega(n^1),?) 83.33/36.14 83.33/36.14 83.33/36.14 ---------------------------------------- 83.33/36.14 83.33/36.14 (2) 83.33/36.14 BOUNDS(n^1, INF) 83.33/36.15 EOF