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