warning: Ignored call to loop_cont_eval1/2 in equation start/2 Inferred cost of eval2(A,B,C,D,E): eval2(A,B,C,D,E):[13]: 1 with precondition: [C=0,A=D+1,B=E,0>=B,A>=1] eval2(A,B,C,D,E):[14]: 0 with precondition: [C=1,E=B,A=D,A>=1] eval2(A,B,C,D,E):[[12],13]: 1+it1*(1) Such that:it1=<1*B with precondition: [C=0,E=0,A=D+1,A>=1,B>=1] eval2(A,B,C,D,E):[[12],14]: 0+it1*(1) Such that:it1=<1*B,it1=<1*B+ -1*E with precondition: [C=1,A=D,A>=1,E>=0,B>=E+1] Inferred cost of eval1(A,B,C,D,E): eval1(A,B,C,D,E):[18]: 1 with precondition: [C=1,A>=1] eval1(A,B,C,D,E):[19]: 1+it1*(1) Such that:it1=<1*B with precondition: [C=1,A>=1,B>=1] eval1(A,B,C,D,E):[20]: 0 with precondition: [C=1,D=A,E=B] eval1(A,B,C,D,E):[[16],18]: 1+it1*(2) Such that:it1=<1*A,it1=<1*A+ -1 with precondition: [C=1,0>=B,A>=2] eval1(A,B,C,D,E):[[16],20]: 0+it1*(2) Such that:it1=<1*A,it1=<1*A+ -1*D with precondition: [C=1,B=E,0>=B,D>=0,A>=D+1] eval1(A,B,C,D,E):[17,[16],18]: 3+it1*(2)+it2*(1) Such that:it1=<1*A+ -2,it1=<1*A+ -1,it2=<1*B with precondition: [C=1,A>=3,B>=1] eval1(A,B,C,D,E):[17,[16],20]: 2+it1*(2)+it2*(1) Such that:it1=<1*A+ -1,it1=<1*A+ -1*D+ -1,it2=<1*B with precondition: [C=1,E=0,B>=1,D>=0,A>=D+2] eval1(A,B,C,D,E):[17,18]: 3+it1*(1) Such that:it1=<1*B with precondition: [C=1,A>=2,B>=1] eval1(A,B,C,D,E):[17,20]: 2+it1*(1) Such that:it1=<1*B with precondition: [C=1,E=0,D+1=A,B>=1,D>=0] Inferred cost of start(A,B): start(A,B):[22]: 2 with precondition: [A>=1] start(A,B):[23]: 2+it1*(1) Such that:it1=<1*B with precondition: [A>=1,B>=1] start(A,B):[24]: 1 with precondition: [] start(A,B):[25]: 2+it1*(2) Such that:it1=<1*A,it1=<1*A+ -1 with precondition: [0>=B,A>=2] start(A,B):[26]: 1+it1*(2) Such that:it1=<1*A with precondition: [0>=B,A>=1] start(A,B):[27]: 4+it1*(2)+it2*(1) Such that:it1=<1*A+ -2,it1=<1*A+ -1,it2=<1*B with precondition: [A>=3,B>=1] start(A,B):[28]: 3+it1*(2)+it2*(1) Such that:it1=<1*A+ -1,it2=<1*B with precondition: [A>=2,B>=1] start(A,B):[29]: 4+it1*(1) Such that:it1=<1*B with precondition: [A>=2,B>=1] start(A,B):[30]: 3+it1*(1) Such that:it1=<1*B with precondition: [A>=1,B>=1] Solved cost expressions of start(A,B): start(A,B):[22]: 2 with precondition: [A>=1] start(A,B):[23]: 1*B+2 with precondition: [A>=1,B>=1] start(A,B):[24]: 1 with precondition: [] start(A,B):[25]: 2*A with precondition: [0>=B,A>=2] start(A,B):[26]: 2*A+1 with precondition: [0>=B,A>=1] start(A,B):[27]: 2*A+1*B with precondition: [A>=3,B>=1] start(A,B):[28]: 2*A+1*B+1 with precondition: [A>=2,B>=1] start(A,B):[29]: 1*B+4 with precondition: [A>=2,B>=1] start(A,B):[30]: 1*B+3 with precondition: [A>=1,B>=1] Maximum cost of start(A,B): max([2*A+1*B+1,2*A+1,2,1*B+4]) Asymptotic class: n Time statistics: Partial evaluation computed in 4 ms. Invariants computed in 38 ms. ----Backward Invariants 21 ms. ----Transitive Invariants 2 ms. Refinement performed in 21 ms. Termination proved in 4 ms. Upper bounds computed in 53 ms. ----Phase cost structures 14 ms. --------Equation cost structures 14 ms. --------Inductive compression(1) 0 ms. --------Inductive compression(2) 0 ms. --------Black Cost 0 ms. ----Chain cost structures 30 ms. ----Solving cost expressions 2 ms. Compressed phase information: 10 Compressed Chains: 0 Compressed invariants: 0 Total analysis performed in 133 ms.