warning: Ignored call to evalfstop/3 in equation evalfreturnin/3 Inferred cost of evalfbb2in(A,B,C,D,E,F,G): evalfbb2in(A,B,C,D,E,F,G):[[17],18]: 1+it1*(2) Such that:it1=<-1*A+1*G,it1=<-1*E+1*G,it1=<1*G+ -1*C,it1=<-1*E+1*B+1 with precondition: [D=0,F=B,A=E,F+1=G,C>=A,F>=C] Inferred cost of evalfbb4in(A,B,C,D,E,F,G): evalfbb4in(A,B,C,D,E,F,G):[21]: 1 with precondition: [A=1,D=0,E=1,G=C,B=F,0>=B] evalfbb4in(A,B,C,D,E,F,G):[[20],21]: 1+it1*(3+it2*(2)) Such that:it1=<1*B,it1=<1*F,it1=<1*E+ -1,it1=<1*G+ -1,it1=<1*B+ -1*A+1 it2=<-1*A+1*B+1,it2=<1*B with precondition: [D=0,E=B+1,E=F+1,E=G,A>=1,E>=A+1] Inferred cost of evalfreturnin(A,B,C): evalfreturnin(A,B,C):[23]: 1 with precondition: [] Inferred cost of loop_cont_evalfbb4in(A,B,C): loop_cont_evalfbb4in(A,B,C):[25]: 1 with precondition: [] Inferred cost of evalfentryin(A,B,C): evalfentryin(A,B,C):[27]: 3 with precondition: [0>=B] evalfentryin(A,B,C):[28]: 3+it1*(3+it2*(2)) Such that:it1=<1*B it2=<1*B with precondition: [B>=1] Inferred cost of evalfstart(A,B,C): evalfstart(A,B,C):[30]: 4 with precondition: [0>=B] evalfstart(A,B,C):[31]: 4+it1*(3+it2*(2)) Such that:it1=<1*B it2=<1*B with precondition: [B>=1] Solved cost expressions of evalfstart(A,B,C): evalfstart(A,B,C):[30]: 4 with precondition: [0>=B] evalfstart(A,B,C):[31]: (2*B+3)* (1*B)+4 with precondition: [B>=1] Maximum cost of evalfstart(A,B,C): max([4, (2*B+3)* (1*B)+4]) Asymptotic class: n^2 Time statistics: Partial evaluation computed in 8 ms. Invariants computed in 19 ms. ----Backward Invariants 7 ms. ----Transitive Invariants 3 ms. Refinement performed in 14 ms. Termination proved in 6 ms. Upper bounds computed in 37 ms. ----Phase cost structures 20 ms. --------Equation cost structures 15 ms. --------Inductive compression(1) 1 ms. --------Inductive compression(2) 0 ms. --------Black Cost 0 ms. ----Chain cost structures 14 ms. ----Solving cost expressions 1 ms. Compressed phase information: 0 Compressed Chains: 0 Compressed invariants: 0 Total analysis performed in 101 ms.