warning: Ignored call to loop_cont_f1/2 in equation f999/2 Inferred cost of f2(A,B,C,D,E): f2(A,B,C,D,E):[14]: 1 with precondition: [C=0,A+1=D,B=E+1,A>=0,B>=1] f2(A,B,C,D,E):[15]: 0 with precondition: [C=1,A=D,B=E,0>=B,A>=0] f2(A,B,C,D,E):[[13],14]: 1+it1*(1) Such that:it1=<1*A,it1=<1*A+ -1*D+1 with precondition: [C=0,A+B=D+E,D>=1,A>=D,A+B>=D] f2(A,B,C,D,E):[[13],15]: 0+it1*(1) Such that:it1=<1*A,it1=<1*A+ -1*D with precondition: [C=1,A+B=D+E,D>=0,A>=D+1,D>=A+B] Inferred cost of f1(A,B,C,D,E): f1(A,B,C,D,E):[20]: 1 with precondition: [A=1,B=0,C=1] f1(A,B,C,D,E):[22]: 0 with precondition: [A=1,C=1,D=1,B=E,B>=0] f1(A,B,C,D,E):[[17,18,19],20]: 1+it1*(1)+it2*(2)+it3*(2)+it4*(1) Such that:it1+it2=<(1*A+1*B+ -1)* (1*A+1*B+ -2)+1*B,it3=<1*A+1*B+ -1,it3=<(1*A+1*B+ -1)* (1*A+1*B+ -2)+1*B+ (1*A+ -1),it4=<(1*A+1*B+ -1)* (1*A+1*B+ -2)+1*B+ (1*A+ -1) with precondition: [C=1,A>=1,B>=0,A+B>=2] f1(A,B,C,D,E):[[17,18,19],22]: 0+it1*(1)+it2*(2)+it3*(2)+it4*(1) Such that:it1+it2=<(1*A+1*B+ -1)* (1*A+1*B+ -2)+1*B,it3=<1*A+1*B+ -1,it3=<(1*A+1*B+ -1)* (1*A+1*B+ -2)+1*B+ (1*A+ -1),it3=<1*A+1*B+ -1*D+ -1*E,it4=<(1*A+1*B+ -1)* (1*A+1*B+ -2)+1*B+ (1*A+ -1),it4=<(1*A+1*B+ -1)* (1*A+1*B+ -2)+1*B+ (1*A+ -1*D) with precondition: [C=1,A>=1,B>=0,D>=1,E>=0,A+B>=E+2,A+B>=D+E,A+2*B>=D+E+1] Inferred cost of f999(A,B): f999(A,B):[24]: 2 with precondition: [A=0,B=1] f999(A,B):[25]: 1 with precondition: [A=0,B>=1] f999(A,B):[26]: 2+it1*(1)+it2*(2)+it3*(2)+it4*(1) Such that:it1+it2=<1*B+ -1+ (1*B+ -1)* (1*B+ -2),it3=<1*B+ -1,it3=<1*B+ -1+ (1*B+ -1)* (1*B+ -2),it4=<1*B+ -1+ (1*B+ -1)* (1*B+ -2) with precondition: [A=0,B>=2] f999(A,B):[27]: 1+it1*(1)+it2*(2)+it3*(2)+it4*(1) Such that:it1+it2=<1*B+ -1+ (1*B+ -1)* (1*B+ -2),it3=<1*B+ -1,it3=<1*B+ -1+ (1*B+ -1)* (1*B+ -2),it4=<1*B+ -1+ (1*B+ -1)* (1*B+ -2) with precondition: [A=0,B>=2] Solved cost expressions of f999(A,B): f999(A,B):[24]: 2 with precondition: [A=0,B=1] f999(A,B):[25]: 1 with precondition: [A=0,B>=1] f999(A,B):[26]: nat(min([1*B+ -1,1*B+ -1+ (1*B+ -1)* (1*B+ -2)]))*2+max([nat(1*B+ -1+ (1*B+ -1)* (1*B+ -2)),nat(1*B+ -1+ (1*B+ -1)* (1*B+ -2))*2])+nat(1*B+ -1+ (1*B+ -1)* (1*B+ -2))+2 with precondition: [A=0,B>=2] f999(A,B):[27]: nat(min([1*B+ -1,1*B+ -1+ (1*B+ -1)* (1*B+ -2)]))*2+max([nat(1*B+ -1+ (1*B+ -1)* (1*B+ -2)),nat(1*B+ -1+ (1*B+ -1)* (1*B+ -2))*2])+nat(1*B+ -1+ (1*B+ -1)* (1*B+ -2))+1 with precondition: [A=0,B>=2] Maximum cost of f999(A,B): max([2,nat(min([1*B+ -1,1*B+ -1+ (1*B+ -1)* (1*B+ -2)]))*2+max([nat(1*B+ -1+ (1*B+ -1)* (1*B+ -2)),nat(1*B+ -1+ (1*B+ -1)* (1*B+ -2))*2])+nat(1*B+ -1+ (1*B+ -1)* (1*B+ -2))+1,nat(min([1*B+ -1,1*B+ -1+ (1*B+ -1)* (1*B+ -2)]))*2+max([nat(1*B+ -1+ (1*B+ -1)* (1*B+ -2)),nat(1*B+ -1+ (1*B+ -1)* (1*B+ -2))*2])+nat(1*B+ -1+ (1*B+ -1)* (1*B+ -2))+2]) Asymptotic class: n^2 Time statistics: Partial evaluation computed in 5 ms. Invariants computed in 29 ms. ----Backward Invariants 17 ms. ----Transitive Invariants 3 ms. Refinement performed in 23 ms. Termination proved in 7 ms. Upper bounds computed in 66 ms. ----Phase cost structures 20 ms. --------Equation cost structures 15 ms. --------Inductive compression(1) 4 ms. --------Inductive compression(2) 0 ms. --------Black Cost 0 ms. ----Chain cost structures 39 ms. ----Solving cost expressions 2 ms. Compressed phase information: 4 Compressed Chains: 0 Compressed invariants: 0 Total analysis performed in 144 ms.