0.03/0.15 WORST_CASE(?,O(n^1)) 0.03/0.15 0.03/0.15 Preprocessing Cost Relations 0.03/0.15 ===================================== 0.03/0.15 0.03/0.15 #### Computed strongly connected components 0.03/0.15 0. recursive : [eval2/5] 0.03/0.15 1. recursive : [eval1/3,eval2_loop_cont/4] 0.03/0.15 2. non_recursive : [exit_location/1] 0.03/0.15 3. non_recursive : [eval1_loop_cont/2] 0.03/0.15 4. non_recursive : [start/3] 0.03/0.15 0.03/0.15 #### Obtained direct recursion through partial evaluation 0.03/0.15 0. SCC is partially evaluated into eval2/5 0.03/0.15 1. SCC is partially evaluated into eval1/3 0.03/0.15 2. SCC is completely evaluated into other SCCs 0.03/0.15 3. SCC is completely evaluated into other SCCs 0.03/0.15 4. SCC is partially evaluated into start/3 0.03/0.15 0.03/0.15 Control-Flow Refinement of Cost Relations 0.03/0.15 ===================================== 0.03/0.15 0.03/0.15 ### Specialization of cost equations eval2/5 0.03/0.15 * CE 7 is refined into CE [8] 0.03/0.15 * CE 6 is refined into CE [9] 0.03/0.15 * CE 5 is refined into CE [10] 0.03/0.15 0.03/0.15 0.03/0.15 ### Cost equations --> "Loop" of eval2/5 0.03/0.15 * CEs [10] --> Loop 8 0.03/0.15 * CEs [8] --> Loop 9 0.03/0.15 * CEs [9] --> Loop 10 0.03/0.15 0.03/0.15 ### Ranking functions of CR eval2(A,B,C,D,E) 0.03/0.15 * RF of phase [8]: [A,B] 0.03/0.15 0.03/0.15 #### Partial ranking functions of CR eval2(A,B,C,D,E) 0.03/0.15 * Partial RF of phase [8]: 0.03/0.15 - RF of loop [8:1]: 0.03/0.15 A 0.03/0.15 B 0.03/0.15 0.03/0.15 0.03/0.15 ### Specialization of cost equations eval1/3 0.03/0.15 * CE 2 is refined into CE [11,12] 0.03/0.15 * CE 4 is refined into CE [13] 0.03/0.15 * CE 3 is refined into CE [14] 0.03/0.15 0.03/0.15 0.03/0.15 ### Cost equations --> "Loop" of eval1/3 0.03/0.15 * CEs [14] --> Loop 11 0.03/0.15 * CEs [11,12] --> Loop 12 0.03/0.15 * CEs [13] --> Loop 13 0.03/0.15 0.03/0.15 ### Ranking functions of CR eval1(A,B,C) 0.03/0.15 0.03/0.15 #### Partial ranking functions of CR eval1(A,B,C) 0.03/0.15 0.03/0.15 0.03/0.15 ### Specialization of cost equations start/3 0.03/0.15 * CE 1 is refined into CE [15,16] 0.03/0.15 0.03/0.15 0.03/0.15 ### Cost equations --> "Loop" of start/3 0.03/0.15 * CEs [16] --> Loop 14 0.03/0.15 * CEs [15] --> Loop 15 0.03/0.15 0.03/0.15 ### Ranking functions of CR start(A,B,C) 0.03/0.15 0.03/0.15 #### Partial ranking functions of CR start(A,B,C) 0.03/0.15 0.03/0.15 0.03/0.15 Computing Bounds 0.03/0.15 ===================================== 0.03/0.15 0.03/0.15 #### Cost of chains of eval2(A,B,C,D,E): 0.03/0.15 * Chain [[8],10]: 1*it(8)+0 0.03/0.15 Such that:it(8) =< A 0.03/0.15 0.03/0.15 with precondition: [C=2,D=0,E=0,A=B,A>=1] 0.03/0.15 0.03/0.15 * Chain [[8],9]: 1*it(8)+0 0.03/0.15 Such that:it(8) =< A 0.03/0.15 0.03/0.15 with precondition: [C=3,A=B,A>=1] 0.03/0.15 0.03/0.15 * Chain [9]: 0 0.03/0.15 with precondition: [C=3,B=A,B>=0] 0.03/0.15 0.03/0.15 0.03/0.15 #### Cost of chains of eval1(A,B,C): 0.03/0.15 * Chain [13]: 0 0.03/0.15 with precondition: [C=3] 0.03/0.15 0.03/0.15 * Chain [12]: 1*s(1)+0 0.03/0.15 Such that:s(1) =< B 0.03/0.15 0.03/0.15 with precondition: [C=3,A=B,A>=1] 0.03/0.15 0.03/0.15 * Chain [11,13]: 1*s(2)+1 0.03/0.15 Such that:s(2) =< A 0.03/0.15 0.03/0.15 with precondition: [C=3,A=B,A>=1] 0.03/0.15 0.03/0.15 0.03/0.15 #### Cost of chains of start(A,B,C): 0.03/0.15 * Chain [15]: 0 0.03/0.15 with precondition: [] 0.03/0.15 0.03/0.15 * Chain [14]: 2*s(5)+1 0.03/0.15 Such that:aux(1) =< B 0.03/0.15 s(5) =< aux(1) 0.03/0.15 0.03/0.15 with precondition: [A=B,A>=1] 0.03/0.15 0.03/0.15 0.03/0.15 Closed-form bounds of start(A,B,C): 0.03/0.15 ------------------------------------- 0.03/0.15 * Chain [15] with precondition: [] 0.03/0.15 - Upper bound: 0 0.03/0.15 - Complexity: constant 0.03/0.15 * Chain [14] with precondition: [A=B,A>=1] 0.03/0.15 - Upper bound: 2*B+1 0.03/0.15 - Complexity: n 0.03/0.15 0.03/0.15 ### Maximum cost of start(A,B,C): nat(B)*2+1 0.03/0.15 Asymptotic class: n 0.03/0.15 * Total analysis performed in 89 ms. 0.03/0.15 0.03/0.25 EOF