warning: Ignored call to loop_cont_f2/3 in equation f0/3 Inferred cost of f2(A,B,C,D,E,F,G): f2(A,B,C,D,E,F,G):[10]: 0 with precondition: [D=1,F=B,G=C,A=E,A>=0] f2(A,B,C,D,E,F,G):[[8,9],10]: inf with precondition: [D=1,B>=F,2*C+3*B>=3*F+2*G+4,B+2*C>=2*G+F] f2(A,B,C,D,E,F,G):[[8,9],11]...: inf with precondition: [1>=D,D>=0] Inferred cost of f0(A,B,C): f0(A,B,C):[12]: 1 with precondition: [A>=0] f0(A,B,C):[13]: inf with precondition: [A>=0] f0(A,B,C):[14]...: inf with precondition: [A>=0] f0(A,B,C):[15]...: inf with precondition: [A>=0] Solved cost expressions of f0(A,B,C): f0(A,B,C):[12]: 1 with precondition: [A>=0] f0(A,B,C):[13]: inf with precondition: [A>=0] f0(A,B,C):[14]...: inf with precondition: [A>=0] f0(A,B,C):[15]...: inf with precondition: [A>=0] Maximum cost of f0(A,B,C): inf Asymptotic class: infinity Time statistics: Partial evaluation computed in 3 ms. Invariants computed in 12 ms. ----Backward Invariants 6 ms. ----Transitive Invariants 2 ms. Refinement performed in 9 ms. Termination proved in 4 ms. Upper bounds computed in 10 ms. ----Phase cost structures 1 ms. --------Equation cost structures 1 ms. --------Inductive compression(1) 0 ms. --------Inductive compression(2) 0 ms. --------Black Cost 0 ms. ----Chain cost structures 6 ms. ----Solving cost expressions 0 ms. Compressed phase information: 1 Compressed Chains: 0 Compressed invariants: 0 Total analysis performed in 47 ms.