3.65/3.69 MAYBE 3.65/3.69 3.65/3.69 Preprocessing Cost Relations 3.65/3.69 ===================================== 3.65/3.69 3.65/3.69 #### Computed strongly connected components 3.65/3.69 0. recursive : [eval_foo_1/4,eval_foo_2/5,eval_foo_bb1_in/3,eval_foo_bb2_in/3] 3.65/3.69 1. non_recursive : [eval_foo_stop/1] 3.65/3.69 2. non_recursive : [eval_foo_bb3_in/1] 3.65/3.69 3. non_recursive : [eval_foo_bb1_in_loop_cont/2] 3.65/3.69 4. non_recursive : [eval_foo_bb0_in/3] 3.65/3.69 5. non_recursive : [eval_foo_start/4] 3.65/3.69 3.65/3.69 #### Obtained direct recursion through partial evaluation 3.65/3.69 0. SCC is partially evaluated into eval_foo_bb1_in/3 3.65/3.69 1. SCC is completely evaluated into other SCCs 3.65/3.69 2. SCC is completely evaluated into other SCCs 3.65/3.69 3. SCC is completely evaluated into other SCCs 3.65/3.69 4. SCC is partially evaluated into eval_foo_bb0_in/3 3.65/3.69 5. SCC is partially evaluated into eval_foo_start/4 3.65/3.69 3.65/3.69 Control-Flow Refinement of Cost Relations 3.65/3.69 ===================================== 3.65/3.69 3.65/3.69 ### Specialization of cost equations eval_foo_bb1_in/3 3.65/3.69 * CE 8 is refined into CE [9] 3.65/3.69 * CE 7 is refined into CE [10] 3.65/3.69 * CE 6 is refined into CE [11] 3.65/3.69 * CE 5 is refined into CE [12] 3.65/3.69 * CE 4 is refined into CE [13] 3.65/3.69 * CE 3 is refined into CE [14] 3.65/3.69 3.65/3.69 3.65/3.69 ### Cost equations --> "Loop" of eval_foo_bb1_in/3 3.65/3.69 * CEs [11] --> Loop 9 3.65/3.69 * CEs [12] --> Loop 10 3.65/3.69 * CEs [13] --> Loop 11 3.65/3.69 * CEs [14] --> Loop 12 3.65/3.69 * CEs [9] --> Loop 13 3.65/3.69 * CEs [10] --> Loop 14 3.65/3.69 3.65/3.69 ### Ranking functions of CR eval_foo_bb1_in(V__01,V__0,B) 3.65/3.69 3.65/3.69 #### Partial ranking functions of CR eval_foo_bb1_in(V__01,V__0,B) 3.65/3.69 * Partial RF of phase [9,10,11,12]: 3.65/3.69 - RF of loop [9:1]: 3.65/3.69 V__0 depends on loops [11:1,12:1] 3.65/3.69 - RF of loop [10:1]: 3.65/3.69 V__0/2-1/2 depends on loops [11:1,12:1] 3.65/3.69 -V__01/4+V__0/4 depends on loops [11:1,12:1] 3.65/3.69 - RF of loop [11:1]: 3.65/3.69 V__01/2-V__0/2+1/2 depends on loops [9:1,10:1] 3.65/3.69 - RF of loop [11:1,12:1]: 3.65/3.69 V__01 depends on loops [9:1,10:1] 3.65/3.69 3.65/3.69 3.65/3.69 ### Specialization of cost equations eval_foo_bb0_in/3 3.65/3.69 * CE 2 is refined into CE [15,16,17,18] 3.65/3.69 3.65/3.69 3.65/3.69 ### Cost equations --> "Loop" of eval_foo_bb0_in/3 3.65/3.69 * CEs [18] --> Loop 15 3.65/3.69 * CEs [17] --> Loop 16 3.65/3.69 * CEs [15] --> Loop 17 3.65/3.69 * CEs [16] --> Loop 18 3.65/3.69 3.65/3.69 ### Ranking functions of CR eval_foo_bb0_in(V_x,V_y,B) 3.65/3.69 3.65/3.69 #### Partial ranking functions of CR eval_foo_bb0_in(V_x,V_y,B) 3.65/3.69 3.65/3.69 3.65/3.69 ### Specialization of cost equations eval_foo_start/4 3.65/3.69 * CE 1 is refined into CE [19,20,21,22] 3.65/3.69 3.65/3.69 3.65/3.69 ### Cost equations --> "Loop" of eval_foo_start/4 3.65/3.69 * CEs [22] --> Loop 19 3.65/3.69 * CEs [21] --> Loop 20 3.65/3.69 * CEs [20] --> Loop 21 3.65/3.69 * CEs [19] --> Loop 22 3.65/3.69 3.65/3.69 ### Ranking functions of CR eval_foo_start(V_x,V_y,V_z,B) 3.65/3.69 3.65/3.69 #### Partial ranking functions of CR eval_foo_start(V_x,V_y,V_z,B) 3.65/3.69 3.65/3.69 3.65/3.69 Computing Bounds 3.65/3.69 ===================================== 3.65/3.69 3.65/3.69 #### Cost of chains of eval_foo_bb1_in(V__01,V__0,B): 3.65/3.69 * Chain [[9,10,11,12]]...: 4*it(9)+0 3.65/3.69 with precondition: [V__0>=1,V__01>=1,B=2] 3.65/3.69 3.65/3.69 * Chain [[9,10,11,12],14]: 4*it(9)+0 3.65/3.69 with precondition: [B=2,V__01>=1,V__0>=1] 3.65/3.69 3.65/3.69 * Chain [[9,10,11,12],13]: 4*it(9)+0 3.65/3.69 with precondition: [B=2,V__01>=1,V__0>=1] 3.65/3.69 3.65/3.69 * Chain [14]: 0 3.65/3.69 with precondition: [B=2,0>=V__01] 3.65/3.69 3.65/3.69 * Chain [13]: 0 3.65/3.69 with precondition: [B=2,0>=V__0] 3.65/3.69 3.65/3.69 3.65/3.69 #### Cost of chains of eval_foo_bb0_in(V_x,V_y,B): 3.65/3.69 * Chain [18]: 0 3.65/3.69 with precondition: [0>=V_x] 3.65/3.69 3.65/3.69 * Chain [17]: 0 3.65/3.69 with precondition: [0>=V_y] 3.65/3.69 3.65/3.69 * Chain [16]: 1*s(3)+0 3.65/3.69 with precondition: [V_x>=1,V_y>=1] 3.65/3.69 3.65/3.69 * Chain [15]...: 4*s(4)+0 3.65/3.69 with precondition: [V_x>=1,V_y>=1] 3.65/3.69 3.65/3.69 3.65/3.69 #### Cost of chains of eval_foo_start(V_x,V_y,V_z,B): 3.65/3.69 * Chain [22]: 0 3.65/3.69 with precondition: [0>=V_x] 3.65/3.69 3.65/3.69 * Chain [21]: 0 3.65/3.69 with precondition: [0>=V_y] 3.65/3.69 3.65/3.69 * Chain [20]: 1*s(5)+0 3.65/3.69 with precondition: [V_x>=1,V_y>=1] 3.65/3.69 3.65/3.69 * Chain [19]...: 4*s(6)+0 3.65/3.69 with precondition: [V_x>=1,V_y>=1] 3.65/3.69 3.65/3.69 3.65/3.69 Closed-form bounds of eval_foo_start(V_x,V_y,V_z,B): 3.65/3.69 ------------------------------------- 3.65/3.69 * Chain [22] with precondition: [0>=V_x] 3.65/3.69 - Upper bound: 0 3.65/3.69 - Complexity: constant 3.65/3.69 * Chain [21] with precondition: [0>=V_y] 3.65/3.69 - Upper bound: 0 3.65/3.69 - Complexity: constant 3.65/3.69 * Chain [20] with precondition: [V_x>=1,V_y>=1] 3.65/3.69 - Upper bound: inf 3.65/3.69 - Complexity: infinity 3.65/3.69 * Chain [19]... with precondition: [V_x>=1,V_y>=1] 3.65/3.69 - Upper bound: inf 3.65/3.69 - Complexity: infinity 3.65/3.69 3.65/3.69 ### Maximum cost of eval_foo_start(V_x,V_y,V_z,B): inf 3.65/3.69 Asymptotic class: infinity 3.65/3.69 * Total analysis performed in 3216 ms. 3.65/3.69 3.71/3.80 EOF