0.03/0.26 WORST_CASE(?,O(n^2)) 0.03/0.26 0.03/0.26 Preprocessing Cost Relations 0.03/0.26 ===================================== 0.03/0.26 0.03/0.26 #### Computed strongly connected components 0.03/0.26 0. recursive : [evalfbb1in/4,evalfbb2in/4] 0.03/0.26 1. recursive : [evalfbb2in_loop_cont/7,evalfbb3in/6,evalfbb4in/6] 0.03/0.26 2. non_recursive : [evalfstop/4] 0.03/0.26 3. non_recursive : [evalfreturnin/4] 0.03/0.26 4. non_recursive : [exit_location/1] 0.03/0.26 5. non_recursive : [evalfbb4in_loop_cont/5] 0.03/0.26 6. non_recursive : [evalfentryin/4] 0.03/0.26 7. non_recursive : [evalfstart/4] 0.03/0.26 0.03/0.26 #### Obtained direct recursion through partial evaluation 0.03/0.26 0. SCC is partially evaluated into evalfbb2in/4 0.03/0.26 1. SCC is partially evaluated into evalfbb4in/6 0.03/0.26 2. SCC is completely evaluated into other SCCs 0.03/0.26 3. SCC is completely evaluated into other SCCs 0.03/0.26 4. SCC is completely evaluated into other SCCs 0.03/0.26 5. SCC is partially evaluated into evalfbb4in_loop_cont/5 0.03/0.26 6. SCC is partially evaluated into evalfentryin/4 0.03/0.26 7. SCC is partially evaluated into evalfstart/4 0.03/0.26 0.03/0.26 Control-Flow Refinement of Cost Relations 0.03/0.26 ===================================== 0.03/0.26 0.03/0.26 ### Specialization of cost equations evalfbb2in/4 0.03/0.26 * CE 11 is refined into CE [12] 0.03/0.26 * CE 10 is refined into CE [13] 0.03/0.26 * CE 9 is refined into CE [14] 0.03/0.26 0.03/0.26 0.03/0.26 ### Cost equations --> "Loop" of evalfbb2in/4 0.03/0.26 * CEs [14] --> Loop 12 0.03/0.26 * CEs [12] --> Loop 13 0.03/0.26 * CEs [13] --> Loop 14 0.03/0.26 0.03/0.26 ### Ranking functions of CR evalfbb2in(B,C,D,E) 0.03/0.26 * RF of phase [12]: [B-C+1] 0.03/0.26 0.03/0.26 #### Partial ranking functions of CR evalfbb2in(B,C,D,E) 0.03/0.26 * Partial RF of phase [12]: 0.03/0.26 - RF of loop [12:1]: 0.03/0.26 B-C+1 0.03/0.26 0.03/0.26 0.03/0.26 ### Specialization of cost equations evalfbb4in/6 0.03/0.26 * CE 5 is refined into CE [15] 0.03/0.26 * CE 3 is refined into CE [16,17] 0.03/0.26 * CE 6 is refined into CE [18] 0.03/0.26 * CE 4 is refined into CE [19] 0.03/0.26 0.03/0.26 0.03/0.26 ### Cost equations --> "Loop" of evalfbb4in/6 0.03/0.26 * CEs [19] --> Loop 15 0.03/0.26 * CEs [15] --> Loop 16 0.03/0.26 * CEs [16,17] --> Loop 17 0.03/0.26 * CEs [18] --> Loop 18 0.03/0.26 0.03/0.26 ### Ranking functions of CR evalfbb4in(A,B,C,D,E,F) 0.03/0.26 * RF of phase [15]: [-A+B+1] 0.03/0.26 0.03/0.26 #### Partial ranking functions of CR evalfbb4in(A,B,C,D,E,F) 0.03/0.26 * Partial RF of phase [15]: 0.03/0.26 - RF of loop [15:1]: 0.03/0.26 -A+B+1 0.03/0.26 0.03/0.26 0.03/0.26 ### Specialization of cost equations evalfbb4in_loop_cont/5 0.03/0.26 * CE 7 is refined into CE [20] 0.03/0.26 * CE 8 is refined into CE [21] 0.03/0.26 0.03/0.26 0.03/0.26 ### Cost equations --> "Loop" of evalfbb4in_loop_cont/5 0.03/0.26 * CEs [20] --> Loop 19 0.03/0.26 * CEs [21] --> Loop 20 0.03/0.26 0.03/0.26 ### Ranking functions of CR evalfbb4in_loop_cont(A,B,C,D,E) 0.03/0.26 0.03/0.26 #### Partial ranking functions of CR evalfbb4in_loop_cont(A,B,C,D,E) 0.03/0.26 0.03/0.26 0.03/0.26 ### Specialization of cost equations evalfentryin/4 0.03/0.26 * CE 2 is refined into CE [22,23,24,25,26] 0.03/0.26 0.03/0.26 0.03/0.26 ### Cost equations --> "Loop" of evalfentryin/4 0.03/0.26 * CEs [24] --> Loop 21 0.03/0.26 * CEs [23,26] --> Loop 22 0.03/0.26 * CEs [25] --> Loop 23 0.03/0.26 * CEs [22] --> Loop 24 0.03/0.26 0.03/0.26 ### Ranking functions of CR evalfentryin(A,B,C,D) 0.03/0.26 0.03/0.26 #### Partial ranking functions of CR evalfentryin(A,B,C,D) 0.03/0.26 0.03/0.26 0.03/0.26 ### Specialization of cost equations evalfstart/4 0.03/0.26 * CE 1 is refined into CE [27,28,29,30] 0.03/0.26 0.03/0.26 0.03/0.26 ### Cost equations --> "Loop" of evalfstart/4 0.03/0.26 * CEs [30] --> Loop 25 0.03/0.26 * CEs [29] --> Loop 26 0.03/0.26 * CEs [28] --> Loop 27 0.03/0.26 * CEs [27] --> Loop 28 0.03/0.26 0.03/0.26 ### Ranking functions of CR evalfstart(A,B,C,D) 0.03/0.26 0.03/0.26 #### Partial ranking functions of CR evalfstart(A,B,C,D) 0.03/0.26 0.03/0.26 0.03/0.26 Computing Bounds 0.03/0.26 ===================================== 0.03/0.26 0.03/0.26 #### Cost of chains of evalfbb2in(B,C,D,E): 0.03/0.26 * Chain [[12],14]: 1*it(12)+0 0.03/0.26 Such that:it(12) =< -C+E 0.03/0.26 0.03/0.26 with precondition: [D=2,B+1=E,C>=1,B>=C] 0.03/0.26 0.03/0.26 * Chain [[12],13]: 1*it(12)+0 0.03/0.26 Such that:it(12) =< B-C+1 0.03/0.26 0.03/0.26 with precondition: [D=3,C>=1,B>=C] 0.03/0.26 0.03/0.26 * Chain [13]: 0 0.03/0.26 with precondition: [D=3,B>=1,C>=1,B+1>=C] 0.03/0.26 0.03/0.26 0.03/0.26 #### Cost of chains of evalfbb4in(A,B,C,D,E,F): 0.03/0.26 * Chain [[15],18]: 1*it(15)+1*s(3)+0 0.03/0.26 Such that:aux(1) =< B 0.03/0.26 aux(3) =< -A+B+1 0.03/0.26 it(15) =< aux(3) 0.03/0.26 aux(1) =< aux(3) 0.03/0.26 s(3) =< it(15)*aux(1) 0.03/0.26 0.03/0.26 with precondition: [D=3,A>=1,B>=A] 0.03/0.26 0.03/0.26 * Chain [[15],17]: 2*it(15)+1*s(3)+0 0.03/0.26 Such that:aux(1) =< B 0.03/0.26 aux(4) =< -A+B 0.03/0.26 aux(5) =< -A+B+1 0.03/0.26 it(15) =< aux(4) 0.03/0.26 it(15) =< aux(5) 0.03/0.26 aux(1) =< aux(5) 0.03/0.26 s(3) =< it(15)*aux(1) 0.03/0.26 0.03/0.26 with precondition: [D=3,A>=1,B>=A+1] 0.03/0.26 0.03/0.26 * Chain [[15],16]: 1*it(15)+1*s(3)+0 0.03/0.26 Such that:aux(1) =< E 0.03/0.26 aux(6) =< -A+E 0.03/0.26 it(15) =< aux(6) 0.03/0.26 aux(1) =< aux(6) 0.03/0.26 s(3) =< it(15)*aux(1) 0.03/0.26 0.03/0.26 with precondition: [D=4,B+1=E,B+1=F,A>=1,B>=A] 0.03/0.26 0.03/0.26 * Chain [18]: 0 0.03/0.26 with precondition: [D=3,A>=1] 0.03/0.26 0.03/0.26 * Chain [17]: 1*s(4)+0 0.03/0.26 Such that:s(4) =< -A+B+1 0.03/0.26 0.03/0.26 with precondition: [D=3,A>=1,B>=A] 0.03/0.26 0.03/0.26 * Chain [16]: 0 0.03/0.26 with precondition: [D=4,F=C,A=E,A>=1,A>=B+1] 0.03/0.26 0.03/0.26 0.03/0.26 #### Cost of chains of evalfbb4in_loop_cont(A,B,C,D,E): 0.03/0.26 * Chain [20]: 0 0.03/0.26 with precondition: [A=3] 0.03/0.26 0.03/0.26 * Chain [19]: 0 0.03/0.26 with precondition: [A=4] 0.03/0.26 0.03/0.26 0.03/0.26 #### Cost of chains of evalfentryin(A,B,C,D): 0.03/0.26 * Chain [24]: 0 0.03/0.26 with precondition: [] 0.03/0.26 0.03/0.26 * Chain [23]: 0 0.03/0.26 with precondition: [0>=B] 0.03/0.26 0.03/0.26 * Chain [22]: 3*s(12)+1*s(13)+1*s(17)+0 0.03/0.26 Such that:s(14) =< B+1 0.03/0.26 aux(9) =< B 0.03/0.26 s(12) =< aux(9) 0.03/0.26 s(13) =< s(12)*aux(9) 0.03/0.26 s(14) =< aux(9) 0.03/0.26 s(17) =< s(12)*s(14) 0.03/0.26 0.03/0.26 with precondition: [B>=1] 0.03/0.26 0.03/0.26 * Chain [21]: 2*s(21)+1*s(22)+0 0.03/0.26 Such that:aux(10) =< B 0.03/0.26 s(21) =< aux(10) 0.03/0.26 s(22) =< s(21)*aux(10) 0.03/0.26 0.03/0.26 with precondition: [B>=2] 0.03/0.26 0.03/0.26 0.03/0.26 #### Cost of chains of evalfstart(A,B,C,D): 0.03/0.26 * Chain [28]: 0 0.03/0.26 with precondition: [] 0.03/0.26 0.03/0.26 * Chain [27]: 0 0.03/0.26 with precondition: [0>=B] 0.03/0.26 0.03/0.26 * Chain [26]: 3*s(25)+1*s(26)+1*s(27)+0 0.03/0.26 Such that:s(24) =< B 0.03/0.26 s(23) =< B+1 0.03/0.26 s(25) =< s(24) 0.03/0.26 s(26) =< s(25)*s(24) 0.03/0.26 s(23) =< s(24) 0.03/0.26 s(27) =< s(25)*s(23) 0.03/0.26 0.03/0.26 with precondition: [B>=1] 0.03/0.26 0.03/0.26 * Chain [25]: 2*s(29)+1*s(30)+0 0.03/0.26 Such that:s(28) =< B 0.03/0.26 s(29) =< s(28) 0.03/0.26 s(30) =< s(29)*s(28) 0.03/0.26 0.03/0.26 with precondition: [B>=2] 0.03/0.26 0.03/0.26 0.03/0.26 Closed-form bounds of evalfstart(A,B,C,D): 0.03/0.26 ------------------------------------- 0.03/0.26 * Chain [28] with precondition: [] 0.03/0.26 - Upper bound: 0 0.03/0.26 - Complexity: constant 0.03/0.26 * Chain [27] with precondition: [0>=B] 0.03/0.26 - Upper bound: 0 0.03/0.26 - Complexity: constant 0.03/0.26 * Chain [26] with precondition: [B>=1] 0.03/0.26 - Upper bound: 3*B+B*B+(B+1)*B 0.03/0.26 - Complexity: n^2 0.03/0.26 * Chain [25] with precondition: [B>=2] 0.03/0.26 - Upper bound: 2*B+B*B 0.03/0.26 - Complexity: n^2 0.03/0.26 0.03/0.26 ### Maximum cost of evalfstart(A,B,C,D): nat(B+1)*nat(B)+nat(B)+(nat(B)*nat(B)+nat(B)*2) 0.03/0.26 Asymptotic class: n^2 0.03/0.26 * Total analysis performed in 191 ms. 0.03/0.26 0.03/0.36 EOF