0.04/0.35 WORST_CASE(?,O(n^1)) 0.04/0.35 0.04/0.35 Preprocessing Cost Relations 0.04/0.35 ===================================== 0.04/0.35 0.04/0.35 #### Computed strongly connected components 0.04/0.35 0. recursive : [evalNestedSinglebb1in/4,evalNestedSinglebb2in/4,evalNestedSinglebb3in/4] 0.04/0.35 1. recursive : [evalNestedSinglebb2in_loop_cont/7,evalNestedSinglebb4in/6,evalNestedSinglebb5in/6] 0.04/0.35 2. non_recursive : [evalNestedSinglestop/4] 0.04/0.35 3. non_recursive : [evalNestedSinglereturnin/4] 0.04/0.35 4. non_recursive : [exit_location/1] 0.04/0.35 5. non_recursive : [evalNestedSinglebb5in_loop_cont/5] 0.04/0.35 6. non_recursive : [evalNestedSingleentryin/4] 0.04/0.35 7. non_recursive : [evalNestedSinglestart/4] 0.04/0.35 0.04/0.35 #### Obtained direct recursion through partial evaluation 0.04/0.35 0. SCC is partially evaluated into evalNestedSinglebb2in/4 0.04/0.35 1. SCC is partially evaluated into evalNestedSinglebb5in/6 0.04/0.35 2. SCC is completely evaluated into other SCCs 0.04/0.35 3. SCC is completely evaluated into other SCCs 0.04/0.35 4. SCC is completely evaluated into other SCCs 0.04/0.35 5. SCC is partially evaluated into evalNestedSinglebb5in_loop_cont/5 0.04/0.35 6. SCC is partially evaluated into evalNestedSingleentryin/4 0.04/0.35 7. SCC is partially evaluated into evalNestedSinglestart/4 0.04/0.35 0.04/0.35 Control-Flow Refinement of Cost Relations 0.04/0.35 ===================================== 0.04/0.35 0.04/0.35 ### Specialization of cost equations evalNestedSinglebb2in/4 0.04/0.35 * CE 12 is refined into CE [13] 0.04/0.35 * CE 9 is refined into CE [14] 0.04/0.35 * CE 11 is refined into CE [15] 0.04/0.35 * CE 10 is refined into CE [16] 0.04/0.35 0.04/0.35 0.04/0.35 ### Cost equations --> "Loop" of evalNestedSinglebb2in/4 0.04/0.35 * CEs [16] --> Loop 13 0.04/0.35 * CEs [13] --> Loop 14 0.04/0.35 * CEs [14] --> Loop 15 0.04/0.35 * CEs [15] --> Loop 16 0.04/0.35 0.04/0.35 ### Ranking functions of CR evalNestedSinglebb2in(B,C,E,F) 0.04/0.35 * RF of phase [13]: [B-C] 0.04/0.35 0.04/0.35 #### Partial ranking functions of CR evalNestedSinglebb2in(B,C,E,F) 0.04/0.35 * Partial RF of phase [13]: 0.04/0.35 - RF of loop [13:1]: 0.04/0.35 B-C 0.04/0.35 0.04/0.35 0.04/0.35 ### Specialization of cost equations evalNestedSinglebb5in/6 0.04/0.35 * CE 5 is refined into CE [17] 0.04/0.35 * CE 3 is refined into CE [18,19] 0.04/0.35 * CE 6 is refined into CE [20] 0.04/0.35 * CE 4 is refined into CE [21,22,23] 0.04/0.35 0.04/0.35 0.04/0.35 ### Cost equations --> "Loop" of evalNestedSinglebb5in/6 0.04/0.35 * CEs [23] --> Loop 17 0.04/0.35 * CEs [21] --> Loop 18 0.04/0.35 * CEs [22] --> Loop 19 0.04/0.35 * CEs [17] --> Loop 20 0.04/0.35 * CEs [18,19] --> Loop 21 0.04/0.35 * CEs [20] --> Loop 22 0.04/0.35 0.04/0.35 ### Ranking functions of CR evalNestedSinglebb5in(A,B,C,E,F,G) 0.04/0.35 * RF of phase [17,19]: [-A+B] 0.04/0.35 0.04/0.35 #### Partial ranking functions of CR evalNestedSinglebb5in(A,B,C,E,F,G) 0.04/0.35 * Partial RF of phase [17,19]: 0.04/0.35 - RF of loop [17:1]: 0.04/0.35 -A/2+B/2-1/2 0.04/0.35 - RF of loop [19:1]: 0.04/0.35 -A+B 0.04/0.35 0.04/0.35 0.04/0.35 ### Specialization of cost equations evalNestedSinglebb5in_loop_cont/5 0.04/0.35 * CE 7 is refined into CE [24] 0.04/0.35 * CE 8 is refined into CE [25] 0.04/0.35 0.04/0.35 0.04/0.35 ### Cost equations --> "Loop" of evalNestedSinglebb5in_loop_cont/5 0.04/0.35 * CEs [24] --> Loop 23 0.04/0.35 * CEs [25] --> Loop 24 0.04/0.35 0.04/0.35 ### Ranking functions of CR evalNestedSinglebb5in_loop_cont(A,B,C,D,E) 0.04/0.35 0.04/0.35 #### Partial ranking functions of CR evalNestedSinglebb5in_loop_cont(A,B,C,D,E) 0.04/0.35 0.04/0.35 0.04/0.35 ### Specialization of cost equations evalNestedSingleentryin/4 0.04/0.35 * CE 2 is refined into CE [26,27,28,29,30,31,32] 0.04/0.35 0.04/0.35 0.04/0.35 ### Cost equations --> "Loop" of evalNestedSingleentryin/4 0.04/0.35 * CEs [28,31] --> Loop 25 0.04/0.35 * CEs [27,30,32] --> Loop 26 0.04/0.35 * CEs [29] --> Loop 27 0.04/0.35 * CEs [26] --> Loop 28 0.04/0.35 0.04/0.35 ### Ranking functions of CR evalNestedSingleentryin(A,B,C,E) 0.04/0.35 0.04/0.35 #### Partial ranking functions of CR evalNestedSingleentryin(A,B,C,E) 0.04/0.35 0.04/0.35 0.04/0.35 ### Specialization of cost equations evalNestedSinglestart/4 0.04/0.35 * CE 1 is refined into CE [33,34,35,36] 0.04/0.35 0.04/0.35 0.04/0.35 ### Cost equations --> "Loop" of evalNestedSinglestart/4 0.04/0.35 * CEs [36] --> Loop 29 0.04/0.35 * CEs [35] --> Loop 30 0.04/0.35 * CEs [34] --> Loop 31 0.04/0.35 * CEs [33] --> Loop 32 0.04/0.35 0.04/0.35 ### Ranking functions of CR evalNestedSinglestart(A,B,C,E) 0.04/0.35 0.04/0.35 #### Partial ranking functions of CR evalNestedSinglestart(A,B,C,E) 0.04/0.35 0.04/0.35 0.04/0.35 Computing Bounds 0.04/0.35 ===================================== 0.04/0.35 0.04/0.35 #### Cost of chains of evalNestedSinglebb2in(B,C,E,F): 0.04/0.35 * Chain [[13],16]: 1*it(13)+0 0.04/0.35 Such that:it(13) =< B-C 0.04/0.35 0.04/0.35 with precondition: [E=2,B=F,B>=C+1] 0.04/0.35 0.04/0.35 * Chain [[13],15]: 1*it(13)+0 0.04/0.35 Such that:it(13) =< -C+F 0.04/0.35 0.04/0.35 with precondition: [E=2,F>=C+1,B>=F+1] 0.04/0.35 0.04/0.35 * Chain [[13],14]: 1*it(13)+0 0.04/0.35 Such that:it(13) =< B-C 0.04/0.35 0.04/0.35 with precondition: [E=3,B>=C+1] 0.04/0.35 0.04/0.35 * Chain [15]: 0 0.04/0.35 with precondition: [E=2,C=F,B>=C+1] 0.04/0.35 0.04/0.35 * Chain [14]: 0 0.04/0.35 with precondition: [E=3,B>=C] 0.04/0.35 0.04/0.35 0.04/0.35 #### Cost of chains of evalNestedSinglebb5in(A,B,C,E,F,G): 0.04/0.35 * Chain [[17,19],22]: 1*it(17)+2*it(19)+0 0.04/0.35 Such that:it(17) =< -A/2+B/2 0.04/0.35 aux(3) =< -A+B 0.04/0.35 it(17) =< aux(3) 0.04/0.35 it(19) =< aux(3) 0.04/0.35 0.04/0.35 with precondition: [E=3,A>=0,B>=A+1] 0.04/0.35 0.04/0.35 * Chain [[17,19],21]: 1*it(17)+3*it(19)+0 0.04/0.35 Such that:it(17) =< -A/2+B/2 0.04/0.35 aux(4) =< -A+B 0.04/0.35 it(17) =< aux(4) 0.04/0.35 it(19) =< aux(4) 0.04/0.35 0.04/0.35 with precondition: [E=3,A>=0,B>=A+2] 0.04/0.35 0.04/0.35 * Chain [[17,19],20]: 1*it(17)+2*it(19)+0 0.04/0.35 Such that:it(17) =< -A/2+F/2 0.04/0.35 aux(5) =< -A+F 0.04/0.35 it(17) =< aux(5) 0.04/0.35 it(19) =< aux(5) 0.04/0.35 0.04/0.35 with precondition: [E=4,B=F,B=G+1,A>=0,B>=A+1] 0.04/0.35 0.04/0.35 * Chain [[17,19],18,22]: 1*it(17)+3*it(19)+1 0.04/0.35 Such that:it(17) =< -A/2+B/2 0.04/0.35 aux(6) =< -A+B 0.04/0.35 it(17) =< aux(6) 0.04/0.35 it(19) =< aux(6) 0.04/0.35 0.04/0.35 with precondition: [E=3,A>=0,B>=A+2] 0.04/0.35 0.04/0.35 * Chain [[17,19],18,20]: 1*it(17)+3*it(19)+1 0.04/0.35 Such that:it(17) =< -A/2+F/2 0.04/0.35 aux(7) =< -A+F 0.04/0.35 it(17) =< aux(7) 0.04/0.35 it(19) =< aux(7) 0.04/0.35 0.04/0.35 with precondition: [E=4,B+1=F,B=G,A>=0,B>=A+2] 0.04/0.35 0.04/0.35 * Chain [22]: 0 0.04/0.35 with precondition: [E=3,A>=0] 0.04/0.35 0.04/0.35 * Chain [21]: 1*s(4)+0 0.04/0.35 Such that:s(4) =< -A+B 0.04/0.35 0.04/0.35 with precondition: [E=3,A>=0,B>=A+1] 0.04/0.35 0.04/0.35 * Chain [20]: 0 0.04/0.35 with precondition: [E=4,G=C,A=F,A>=0,A>=B] 0.04/0.35 0.04/0.35 * Chain [18,22]: 1*s(5)+1 0.04/0.35 Such that:s(5) =< -A+B 0.04/0.35 0.04/0.35 with precondition: [E=3,A>=0,B>=A+1] 0.04/0.35 0.04/0.35 * Chain [18,20]: 1*s(5)+1 0.04/0.35 Such that:s(5) =< -A+F 0.04/0.35 0.04/0.35 with precondition: [E=4,B+1=F,B=G,A>=0,B>=A+1] 0.04/0.35 0.04/0.35 0.04/0.35 #### Cost of chains of evalNestedSinglebb5in_loop_cont(A,B,C,D,E): 0.04/0.35 * Chain [24]: 0 0.04/0.35 with precondition: [A=3] 0.04/0.35 0.04/0.35 * Chain [23]: 0 0.04/0.35 with precondition: [A=4] 0.04/0.35 0.04/0.35 0.04/0.35 #### Cost of chains of evalNestedSingleentryin(A,B,C,E): 0.04/0.35 * Chain [28]: 0 0.04/0.35 with precondition: [] 0.04/0.35 0.04/0.35 * Chain [27]: 0 0.04/0.35 with precondition: [0>=B] 0.04/0.35 0.04/0.35 * Chain [26]: 2*s(17)+6*s(19)+1*s(20)+1 0.04/0.35 Such that:s(20) =< B+1 0.04/0.35 aux(11) =< B 0.04/0.35 aux(12) =< B/2 0.04/0.35 s(17) =< aux(12) 0.04/0.35 s(19) =< aux(11) 0.04/0.35 s(17) =< aux(11) 0.04/0.35 0.04/0.35 with precondition: [B>=1] 0.04/0.35 0.04/0.35 * Chain [25]: 2*s(26)+6*s(27)+1*s(28)+3*s(30)+1 0.04/0.35 Such that:s(24) =< B 0.04/0.35 s(29) =< B+1 0.04/0.35 s(25) =< B/2 0.04/0.35 s(28) =< B/2+1/2 0.04/0.35 s(26) =< s(25) 0.04/0.35 s(26) =< s(24) 0.04/0.35 s(27) =< s(24) 0.04/0.35 s(28) =< s(29) 0.04/0.35 s(30) =< s(29) 0.04/0.35 0.04/0.35 with precondition: [B>=2] 0.04/0.35 0.04/0.35 0.04/0.35 #### Cost of chains of evalNestedSinglestart(A,B,C,E): 0.04/0.35 * Chain [32]: 0 0.04/0.35 with precondition: [] 0.04/0.35 0.04/0.35 * Chain [31]: 0 0.04/0.35 with precondition: [0>=B] 0.04/0.35 0.04/0.35 * Chain [30]: 1*s(31)+2*s(34)+6*s(35)+1 0.04/0.35 Such that:s(32) =< B 0.04/0.35 s(31) =< B+1 0.04/0.35 s(33) =< B/2 0.04/0.35 s(34) =< s(33) 0.04/0.35 s(35) =< s(32) 0.04/0.35 s(34) =< s(32) 0.04/0.35 0.04/0.35 with precondition: [B>=1] 0.04/0.35 0.04/0.35 * Chain [29]: 1*s(39)+2*s(40)+6*s(41)+3*s(42)+1 0.04/0.35 Such that:s(36) =< B 0.04/0.35 s(37) =< B+1 0.04/0.35 s(38) =< B/2 0.04/0.35 s(39) =< B/2+1/2 0.04/0.35 s(40) =< s(38) 0.04/0.35 s(40) =< s(36) 0.04/0.35 s(41) =< s(36) 0.04/0.35 s(39) =< s(37) 0.04/0.35 s(42) =< s(37) 0.04/0.35 0.04/0.35 with precondition: [B>=2] 0.04/0.35 0.04/0.35 0.04/0.35 Closed-form bounds of evalNestedSinglestart(A,B,C,E): 0.04/0.35 ------------------------------------- 0.04/0.35 * Chain [32] with precondition: [] 0.04/0.35 - Upper bound: 0 0.04/0.35 - Complexity: constant 0.04/0.35 * Chain [31] with precondition: [0>=B] 0.04/0.35 - Upper bound: 0 0.04/0.35 - Complexity: constant 0.04/0.35 * Chain [30] with precondition: [B>=1] 0.04/0.35 - Upper bound: 8*B+2 0.04/0.35 - Complexity: n 0.04/0.35 * Chain [29] with precondition: [B>=2] 0.04/0.35 - Upper bound: 21/2*B+9/2 0.04/0.35 - Complexity: n 0.04/0.35 0.04/0.35 ### Maximum cost of evalNestedSinglestart(A,B,C,E): nat(B)*6+1+nat(B+1)+nat(B/2)*2+(nat(B+1)*2+nat(B/2+1/2)) 0.04/0.35 Asymptotic class: n 0.04/0.35 * Total analysis performed in 276 ms. 0.04/0.35 0.04/0.45 EOF