0.03/0.21 WORST_CASE(?,O(1)) 0.03/0.21 0.03/0.21 Preprocessing Cost Relations 0.03/0.21 ===================================== 0.03/0.21 0.03/0.21 #### Computed strongly connected components 0.03/0.21 0. recursive : [f4/9] 0.03/0.21 1. non_recursive : [exit_location/1] 0.03/0.21 2. recursive : [f20/5] 0.03/0.21 3. non_recursive : [f31/6] 0.03/0.21 4. non_recursive : [f20_loop_cont/7] 0.03/0.21 5. non_recursive : [f4_loop_cont/7] 0.03/0.21 6. non_recursive : [f0/6] 0.03/0.21 0.03/0.21 #### Obtained direct recursion through partial evaluation 0.03/0.21 0. SCC is partially evaluated into f4/9 0.03/0.21 1. SCC is completely evaluated into other SCCs 0.03/0.21 2. SCC is partially evaluated into f20/5 0.03/0.21 3. SCC is completely evaluated into other SCCs 0.03/0.21 4. SCC is partially evaluated into f20_loop_cont/7 0.03/0.21 5. SCC is partially evaluated into f4_loop_cont/7 0.03/0.21 6. SCC is partially evaluated into f0/6 0.03/0.21 0.03/0.21 Control-Flow Refinement of Cost Relations 0.03/0.21 ===================================== 0.03/0.21 0.03/0.21 ### Specialization of cost equations f4/9 0.03/0.21 * CE 3 is refined into CE [12] 0.03/0.21 * CE 4 is refined into CE [13] 0.03/0.21 * CE 2 is refined into CE [14] 0.03/0.21 0.03/0.21 0.03/0.21 ### Cost equations --> "Loop" of f4/9 0.03/0.21 * CEs [14] --> Loop 12 0.03/0.21 * CEs [12] --> Loop 13 0.03/0.21 * CEs [13] --> Loop 14 0.03/0.21 0.03/0.21 ### Ranking functions of CR f4(A,B,D,E,F,G,H,I,J) 0.03/0.21 * RF of phase [12]: [-A+100] 0.03/0.21 0.03/0.21 #### Partial ranking functions of CR f4(A,B,D,E,F,G,H,I,J) 0.03/0.21 * Partial RF of phase [12]: 0.03/0.21 - RF of loop [12:1]: 0.03/0.21 -A+100 0.03/0.21 0.03/0.21 0.03/0.21 ### Specialization of cost equations f20/5 0.03/0.21 * CE 9 is refined into CE [15] 0.03/0.21 * CE 8 is refined into CE [16] 0.03/0.21 * CE 7 is refined into CE [17] 0.03/0.21 0.03/0.21 0.03/0.21 ### Cost equations --> "Loop" of f20/5 0.03/0.21 * CEs [17] --> Loop 15 0.03/0.21 * CEs [15] --> Loop 16 0.03/0.21 * CEs [16] --> Loop 17 0.03/0.21 0.03/0.21 ### Ranking functions of CR f20(B,C,F,G,H) 0.03/0.21 * RF of phase [15]: [-B+200] 0.03/0.21 0.03/0.21 #### Partial ranking functions of CR f20(B,C,F,G,H) 0.03/0.21 * Partial RF of phase [15]: 0.03/0.21 - RF of loop [15:1]: 0.03/0.21 -B+200 0.03/0.21 0.03/0.21 0.03/0.21 ### Specialization of cost equations f20_loop_cont/7 0.03/0.21 * CE 11 is refined into CE [18] 0.03/0.21 * CE 10 is refined into CE [19] 0.03/0.21 0.03/0.21 0.03/0.21 ### Cost equations --> "Loop" of f20_loop_cont/7 0.03/0.21 * CEs [18] --> Loop 18 0.03/0.21 * CEs [19] --> Loop 19 0.03/0.21 0.03/0.21 ### Ranking functions of CR f20_loop_cont(A,B,C,D,E,F,G) 0.03/0.21 0.03/0.21 #### Partial ranking functions of CR f20_loop_cont(A,B,C,D,E,F,G) 0.03/0.21 0.03/0.21 0.03/0.21 ### Specialization of cost equations f4_loop_cont/7 0.03/0.21 * CE 6 is refined into CE [20,21,22,23] 0.03/0.21 * CE 5 is refined into CE [24] 0.03/0.21 0.03/0.21 0.03/0.21 ### Cost equations --> "Loop" of f4_loop_cont/7 0.03/0.21 * CEs [21] --> Loop 20 0.03/0.21 * CEs [20,23] --> Loop 21 0.03/0.21 * CEs [22] --> Loop 22 0.03/0.21 * CEs [24] --> Loop 23 0.03/0.21 0.03/0.21 ### Ranking functions of CR f4_loop_cont(A,B,C,D,E,F,G) 0.03/0.21 0.03/0.21 #### Partial ranking functions of CR f4_loop_cont(A,B,C,D,E,F,G) 0.03/0.21 0.03/0.21 0.03/0.21 ### Specialization of cost equations f0/6 0.03/0.21 * CE 1 is refined into CE [25,26,27,28] 0.03/0.21 0.03/0.21 0.03/0.21 ### Cost equations --> "Loop" of f0/6 0.03/0.21 * CEs [25,26,27,28] --> Loop 24 0.03/0.21 0.03/0.21 ### Ranking functions of CR f0(A,B,C,D,E,F) 0.03/0.21 0.03/0.21 #### Partial ranking functions of CR f0(A,B,C,D,E,F) 0.03/0.21 0.03/0.21 0.03/0.21 Computing Bounds 0.03/0.21 ===================================== 0.03/0.21 0.03/0.21 #### Cost of chains of f4(A,B,D,E,F,G,H,I,J): 0.03/0.21 * Chain [[12],14]: 1*it(12)+0 0.03/0.21 Such that:it(12) =< -A+100 0.03/0.21 0.03/0.21 with precondition: [F=3,99>=A,A>=0] 0.03/0.21 0.03/0.21 * Chain [[12],13]: 1*it(12)+0 0.03/0.21 Such that:it(12) =< -A+100 0.03/0.21 0.03/0.21 with precondition: [F=4,G=100,H=100,I=99,J=99,99>=A,A>=0] 0.03/0.21 0.03/0.21 * Chain [14]: 0 0.03/0.21 with precondition: [F=3,A>=0] 0.03/0.21 0.03/0.21 0.03/0.21 #### Cost of chains of f20(B,C,F,G,H): 0.03/0.21 * Chain [[15],17]: 1*it(15)+0 0.03/0.21 Such that:it(15) =< -B+200 0.03/0.21 0.03/0.21 with precondition: [F=2,G=200,H=199,199>=B] 0.03/0.21 0.03/0.21 * Chain [[15],16]: 1*it(15)+0 0.03/0.21 Such that:it(15) =< -B+200 0.03/0.21 0.03/0.21 with precondition: [F=3,199>=B] 0.03/0.21 0.03/0.21 * Chain [17]: 0 0.03/0.21 with precondition: [F=2,H=C,B=G,B>=200] 0.03/0.21 0.03/0.21 * Chain [16]: 0 0.03/0.21 with precondition: [F=3] 0.03/0.21 0.03/0.21 0.03/0.21 #### Cost of chains of f20_loop_cont(A,B,C,D,E,F,G): 0.03/0.21 * Chain [19]: 0 0.03/0.21 with precondition: [A=2] 0.03/0.21 0.03/0.21 * Chain [18]: 0 0.03/0.21 with precondition: [A=3] 0.03/0.21 0.03/0.21 0.03/0.21 #### Cost of chains of f4_loop_cont(A,B,C,D,E,F,G): 0.03/0.21 * Chain [23]: 0 0.03/0.21 with precondition: [A=3] 0.03/0.21 0.03/0.21 * Chain [22]: 0 0.03/0.21 with precondition: [A=4] 0.03/0.21 0.03/0.21 * Chain [21]: 2*s(1)+0 0.03/0.21 Such that:aux(1) =< -C+200 0.03/0.21 s(1) =< aux(1) 0.03/0.21 0.03/0.21 with precondition: [A=4,199>=C] 0.03/0.21 0.03/0.21 * Chain [20]: 0 0.03/0.21 with precondition: [A=4,C>=200] 0.03/0.21 0.03/0.21 0.03/0.21 #### Cost of chains of f0(A,B,C,D,E,F): 0.03/0.21 * Chain [24]: 500 0.03/0.21 with precondition: [] 0.03/0.21 0.03/0.21 0.03/0.21 Closed-form bounds of f0(A,B,C,D,E,F): 0.03/0.21 ------------------------------------- 0.03/0.21 * Chain [24] with precondition: [] 0.03/0.21 - Upper bound: 500 0.03/0.21 - Complexity: constant 0.03/0.21 0.03/0.21 ### Maximum cost of f0(A,B,C,D,E,F): 500 0.03/0.21 Asymptotic class: constant 0.03/0.21 * Total analysis performed in 149 ms. 0.03/0.21 0.03/0.31 EOF