0.03/0.24 MAYBE 0.03/0.24 0.03/0.24 Preprocessing Cost Relations 0.03/0.24 ===================================== 0.03/0.24 0.03/0.24 #### Computed strongly connected components 0.03/0.24 0. recursive : [f2/5] 0.03/0.24 1. recursive : [f1/3,f2_loop_cont/4] 0.03/0.24 2. non_recursive : [exit_location/1] 0.03/0.24 3. non_recursive : [f1_loop_cont/2] 0.03/0.24 4. non_recursive : [f999/3] 0.03/0.24 0.03/0.24 #### Obtained direct recursion through partial evaluation 0.03/0.24 0. SCC is partially evaluated into f2/5 0.03/0.24 1. SCC is partially evaluated into f1/3 0.03/0.24 2. SCC is completely evaluated into other SCCs 0.03/0.24 3. SCC is completely evaluated into other SCCs 0.03/0.24 4. SCC is partially evaluated into f999/3 0.03/0.24 0.03/0.24 Control-Flow Refinement of Cost Relations 0.03/0.24 ===================================== 0.03/0.24 0.03/0.24 ### Specialization of cost equations f2/5 0.03/0.24 * CE 8 is refined into CE [9] 0.03/0.24 * CE 7 is refined into CE [10] 0.03/0.24 * CE 6 is refined into CE [11] 0.03/0.24 0.03/0.24 0.03/0.24 ### Cost equations --> "Loop" of f2/5 0.03/0.24 * CEs [11] --> Loop 9 0.03/0.24 * CEs [9] --> Loop 10 0.03/0.24 * CEs [10] --> Loop 11 0.03/0.24 0.03/0.24 ### Ranking functions of CR f2(A,B,C,D,E) 0.03/0.24 * RF of phase [9]: [A] 0.03/0.24 0.03/0.24 #### Partial ranking functions of CR f2(A,B,C,D,E) 0.03/0.24 * Partial RF of phase [9]: 0.03/0.24 - RF of loop [9:1]: 0.03/0.24 A 0.03/0.24 0.03/0.24 0.03/0.24 ### Specialization of cost equations f1/3 0.03/0.24 * CE 2 is refined into CE [12,13] 0.03/0.24 * CE 5 is refined into CE [14] 0.03/0.24 * CE 3 is refined into CE [15,16] 0.03/0.24 * CE 4 is refined into CE [17] 0.03/0.24 0.03/0.24 0.03/0.24 ### Cost equations --> "Loop" of f1/3 0.03/0.24 * CEs [16] --> Loop 12 0.03/0.24 * CEs [17] --> Loop 13 0.03/0.24 * CEs [15] --> Loop 14 0.03/0.24 * CEs [13] --> Loop 15 0.03/0.24 * CEs [12] --> Loop 16 0.03/0.24 * CEs [14] --> Loop 17 0.03/0.24 0.03/0.24 ### Ranking functions of CR f1(A,B,C) 0.03/0.24 0.03/0.24 #### Partial ranking functions of CR f1(A,B,C) 0.03/0.24 * Partial RF of phase [12,13,14]: 0.03/0.24 - RF of loop [12:1]: 0.03/0.24 A-1 depends on loops [13:1] 0.03/0.24 A+B-1 0.03/0.24 - RF of loop [13:1,14:1]: 0.03/0.24 B depends on loops [12:1] 0.03/0.24 0.03/0.24 0.03/0.24 ### Specialization of cost equations f999/3 0.03/0.24 * CE 1 is refined into CE [18,19,20] 0.03/0.24 0.03/0.24 0.03/0.24 ### Cost equations --> "Loop" of f999/3 0.03/0.24 * CEs [19,20] --> Loop 18 0.03/0.24 * CEs [18] --> Loop 19 0.03/0.24 0.03/0.24 ### Ranking functions of CR f999(A,B,C) 0.03/0.24 0.03/0.24 #### Partial ranking functions of CR f999(A,B,C) 0.03/0.24 0.03/0.24 0.03/0.24 Computing Bounds 0.03/0.24 ===================================== 0.03/0.24 0.03/0.24 #### Cost of chains of f2(A,B,C,D,E): 0.03/0.24 * Chain [[9],11]: 1*it(9)+0 0.03/0.24 Such that:it(9) =< A-D+1 0.03/0.24 0.03/0.24 with precondition: [C=2,A+B=D+E,D>=1,A>=D,A+B>=D] 0.03/0.24 0.03/0.24 * Chain [[9],10]: 1*it(9)+0 0.03/0.24 Such that:it(9) =< A 0.03/0.24 0.03/0.24 with precondition: [C=3,A>=1] 0.03/0.24 0.03/0.24 * Chain [11]: 0 0.03/0.24 with precondition: [C=2,A+1=D,B=E+1,A>=0,B>=1] 0.03/0.24 0.03/0.24 * Chain [10]: 0 0.03/0.24 with precondition: [C=3,A>=0] 0.03/0.24 0.03/0.24 0.03/0.24 #### Cost of chains of f1(A,B,C): 0.03/0.24 * Chain [[12,13,14],17]: 2*it(12)+2*it(13)+0 0.03/0.24 Such that:aux(23) =< A+B 0.03/0.24 it(12) =< aux(23) 0.03/0.24 0.03/0.24 with precondition: [C=3,A>=1,B>=0,A+B>=2] 0.03/0.24 0.03/0.24 * Chain [[12,13,14],16]: 2*it(12)+2*it(13)+0 0.03/0.24 Such that:aux(24) =< A+B 0.03/0.24 it(12) =< aux(24) 0.03/0.24 0.03/0.24 with precondition: [C=3,A>=1,B>=0,A+B>=2] 0.03/0.24 0.03/0.24 * Chain [[12,13,14],15]: 3*it(12)+2*it(13)+0 0.03/0.24 Such that:aux(25) =< A+B 0.03/0.24 it(12) =< aux(25) 0.03/0.24 0.03/0.24 with precondition: [C=3,A>=1,B>=0,A+2*B>=3] 0.03/0.24 0.03/0.24 * Chain [17]: 0 0.03/0.24 with precondition: [C=3,A>=1,B>=0] 0.03/0.24 0.03/0.24 * Chain [16]: 0 0.03/0.24 with precondition: [C=3,A>=1,B>=0] 0.03/0.24 0.03/0.24 0.03/0.24 #### Cost of chains of f999(A,B,C): 0.03/0.24 * Chain [19]: 0 0.03/0.24 with precondition: [A=0,B>=1] 0.03/0.24 0.03/0.24 * Chain [18]: 7*s(12)+6*s(13)+0 0.03/0.24 Such that:aux(27) =< B 0.03/0.24 s(12) =< aux(27) 0.03/0.24 0.03/0.24 with precondition: [A=0,B>=2] 0.03/0.24 0.03/0.24 0.03/0.24 Closed-form bounds of f999(A,B,C): 0.03/0.24 ------------------------------------- 0.03/0.24 * Chain [19] with precondition: [A=0,B>=1] 0.03/0.24 - Upper bound: 0 0.03/0.24 - Complexity: constant 0.03/0.24 * Chain [18] with precondition: [A=0,B>=2] 0.03/0.24 - Upper bound: inf 0.03/0.24 - Complexity: infinity 0.03/0.24 0.03/0.24 ### Maximum cost of f999(A,B,C): inf 0.03/0.24 Asymptotic class: infinity 0.03/0.24 * Total analysis performed in 171 ms. 0.03/0.24 0.03/0.34 EOF