0.04/0.24 MAYBE 0.04/0.24 0.04/0.24 Preprocessing Cost Relations 0.04/0.24 ===================================== 0.04/0.24 0.04/0.24 #### Computed strongly connected components 0.04/0.24 0. recursive : [f12/9] 0.04/0.24 1. non_recursive : [exit_location/1] 0.04/0.24 2. recursive : [f25/4] 0.04/0.24 3. non_recursive : [f34/8] 0.04/0.24 4. non_recursive : [f25_loop_cont/9] 0.04/0.24 5. non_recursive : [f12_loop_cont/9] 0.04/0.24 6. non_recursive : [f0/8] 0.04/0.24 0.04/0.24 #### Obtained direct recursion through partial evaluation 0.04/0.24 0. SCC is partially evaluated into f12/9 0.04/0.24 1. SCC is completely evaluated into other SCCs 0.04/0.24 2. SCC is partially evaluated into f25/4 0.04/0.24 3. SCC is completely evaluated into other SCCs 0.04/0.24 4. SCC is partially evaluated into f25_loop_cont/9 0.04/0.24 5. SCC is partially evaluated into f12_loop_cont/9 0.04/0.24 6. SCC is partially evaluated into f0/8 0.04/0.24 0.04/0.24 Control-Flow Refinement of Cost Relations 0.04/0.24 ===================================== 0.04/0.24 0.04/0.24 ### Specialization of cost equations f12/9 0.04/0.24 * CE 3 is refined into CE [12] 0.04/0.24 * CE 4 is refined into CE [13] 0.04/0.24 * CE 2 is refined into CE [14] 0.04/0.24 0.04/0.24 0.04/0.24 ### Cost equations --> "Loop" of f12/9 0.04/0.24 * CEs [14] --> Loop 12 0.04/0.24 * CEs [12] --> Loop 13 0.04/0.24 * CEs [13] --> Loop 14 0.04/0.24 0.04/0.24 ### Ranking functions of CR f12(C,D,E,F,G,K,L,M,N) 0.04/0.24 * RF of phase [12]: [C-D] 0.04/0.24 0.04/0.24 #### Partial ranking functions of CR f12(C,D,E,F,G,K,L,M,N) 0.04/0.24 * Partial RF of phase [12]: 0.04/0.24 - RF of loop [12:1]: 0.04/0.24 C-D 0.04/0.24 0.04/0.24 0.04/0.24 ### Specialization of cost equations f25/4 0.04/0.24 * CE 9 is refined into CE [15] 0.04/0.24 * CE 8 is refined into CE [16] 0.04/0.24 * CE 7 is refined into CE [17] 0.04/0.24 0.04/0.24 0.04/0.24 ### Cost equations --> "Loop" of f25/4 0.04/0.24 * CEs [17] --> Loop 15 0.04/0.24 * CEs [15] --> Loop 16 0.04/0.24 * CEs [16] --> Loop 17 0.04/0.24 0.04/0.24 ### Ranking functions of CR f25(E,F,K,L) 0.04/0.24 * RF of phase [15]: [E-F] 0.04/0.24 0.04/0.24 #### Partial ranking functions of CR f25(E,F,K,L) 0.04/0.24 * Partial RF of phase [15]: 0.04/0.24 - RF of loop [15:1]: 0.04/0.24 E-F 0.04/0.24 0.04/0.24 0.04/0.24 ### Specialization of cost equations f25_loop_cont/9 0.04/0.24 * CE 11 is refined into CE [18] 0.04/0.24 * CE 10 is refined into CE [19] 0.04/0.24 0.04/0.24 0.04/0.24 ### Cost equations --> "Loop" of f25_loop_cont/9 0.04/0.24 * CEs [18] --> Loop 18 0.04/0.24 * CEs [19] --> Loop 19 0.04/0.24 0.04/0.24 ### Ranking functions of CR f25_loop_cont(A,B,C,D,E,F,G,H,I) 0.04/0.24 0.04/0.24 #### Partial ranking functions of CR f25_loop_cont(A,B,C,D,E,F,G,H,I) 0.04/0.24 0.04/0.24 0.04/0.24 ### Specialization of cost equations f12_loop_cont/9 0.04/0.24 * CE 6 is refined into CE [20,21,22,23] 0.04/0.24 * CE 5 is refined into CE [24] 0.04/0.24 0.04/0.24 0.04/0.24 ### Cost equations --> "Loop" of f12_loop_cont/9 0.04/0.24 * CEs [20,23] --> Loop 20 0.04/0.24 * CEs [21] --> Loop 21 0.04/0.24 * CEs [22] --> Loop 22 0.04/0.24 * CEs [24] --> Loop 23 0.04/0.24 0.04/0.24 ### Ranking functions of CR f12_loop_cont(A,B,C,D,E,F,G,H,I) 0.04/0.24 0.04/0.24 #### Partial ranking functions of CR f12_loop_cont(A,B,C,D,E,F,G,H,I) 0.04/0.24 0.04/0.24 0.04/0.24 ### Specialization of cost equations f0/8 0.04/0.24 * CE 1 is refined into CE [25,26,27,28,29,30,31,32] 0.04/0.24 0.04/0.24 0.04/0.24 ### Cost equations --> "Loop" of f0/8 0.04/0.24 * CEs [25,26,27,28,29,30,31,32] --> Loop 24 0.04/0.24 0.04/0.24 ### Ranking functions of CR f0(A,B,C,D,E,F,G,K) 0.04/0.24 0.04/0.24 #### Partial ranking functions of CR f0(A,B,C,D,E,F,G,K) 0.04/0.24 0.04/0.24 0.04/0.24 Computing Bounds 0.04/0.24 ===================================== 0.04/0.24 0.04/0.24 #### Cost of chains of f12(C,D,E,F,G,K,L,M,N): 0.04/0.24 * Chain [[12],14]: 1*it(12)+0 0.04/0.24 Such that:it(12) =< C-D 0.04/0.24 0.04/0.24 with precondition: [K=3,D>=0,C>=D+1] 0.04/0.24 0.04/0.24 * Chain [[12],13]: 1*it(12)+0 0.04/0.24 Such that:it(12) =< C-D 0.04/0.24 0.04/0.24 with precondition: [K=4,M=0,C=L,D>=0,C>=D+1] 0.04/0.24 0.04/0.24 * Chain [14]: 0 0.04/0.24 with precondition: [K=3,D>=0] 0.04/0.24 0.04/0.24 * Chain [13]: 0 0.04/0.24 with precondition: [K=4,M=0,D=L,D>=0,D>=C] 0.04/0.24 0.04/0.24 0.04/0.24 #### Cost of chains of f25(E,F,K,L): 0.04/0.24 * Chain [[15],17]: 1*it(15)+0 0.04/0.24 Such that:it(15) =< E-F 0.04/0.24 0.04/0.24 with precondition: [K=2,E=L,E>=F+1] 0.04/0.24 0.04/0.24 * Chain [[15],16]: 1*it(15)+0 0.04/0.24 Such that:it(15) =< E-F 0.04/0.24 0.04/0.24 with precondition: [K=3,E>=F+1] 0.04/0.24 0.04/0.24 * Chain [17]: 0 0.04/0.24 with precondition: [K=2,F=L,F>=E] 0.04/0.24 0.04/0.24 * Chain [16]: 0 0.04/0.24 with precondition: [K=3] 0.04/0.24 0.04/0.24 0.04/0.24 #### Cost of chains of f25_loop_cont(A,B,C,D,E,F,G,H,I): 0.04/0.24 * Chain [19]: 0 0.04/0.24 with precondition: [A=2,F=B] 0.04/0.24 0.04/0.24 * Chain [18]: 0 0.04/0.24 with precondition: [A=3,F=B] 0.04/0.24 0.04/0.24 0.04/0.24 #### Cost of chains of f12_loop_cont(A,B,C,D,E,F,G,H,I): 0.04/0.24 * Chain [23]: 0 0.04/0.24 with precondition: [A=3,F=B] 0.04/0.24 0.04/0.24 * Chain [22]: 0 0.04/0.24 with precondition: [A=4,F=B] 0.04/0.24 0.04/0.24 * Chain [21]: 0 0.04/0.24 with precondition: [A=4,F=B,G>=F] 0.04/0.24 0.04/0.24 * Chain [20]: 2*s(1)+0 0.04/0.24 Such that:aux(1) =< B-G 0.04/0.24 s(1) =< aux(1) 0.04/0.24 0.04/0.24 with precondition: [A=4,F=B,F>=G+1] 0.04/0.24 0.04/0.24 0.04/0.24 #### Cost of chains of f0(A,B,C,D,E,F,G,K): 0.04/0.24 * Chain [24]: 1*aux(2)+0 0.04/0.24 with precondition: [] 0.04/0.24 0.04/0.24 0.04/0.24 Closed-form bounds of f0(A,B,C,D,E,F,G,K): 0.04/0.24 ------------------------------------- 0.04/0.24 * Chain [24] with precondition: [] 0.04/0.24 - Upper bound: inf 0.04/0.24 - Complexity: infinity 0.04/0.24 0.04/0.24 ### Maximum cost of f0(A,B,C,D,E,F,G,K): inf 0.04/0.24 Asymptotic class: infinity 0.04/0.24 * Total analysis performed in 178 ms. 0.04/0.24 0.04/0.35 EOF