0.05/0.18 WORST_CASE(?,O(n^2)) 0.05/0.18 0.05/0.18 Preprocessing Cost Relations 0.05/0.18 ===================================== 0.05/0.18 0.05/0.18 #### Computed strongly connected components 0.05/0.18 0. recursive : [eval_foo_bb1_in/3,eval_foo_bb2_in/3] 0.05/0.18 1. non_recursive : [eval_foo_stop/1] 0.05/0.18 2. non_recursive : [eval_foo_bb3_in/1] 0.05/0.18 3. non_recursive : [eval_foo_bb1_in_loop_cont/2] 0.05/0.18 4. non_recursive : [eval_foo_bb0_in/3] 0.05/0.18 5. non_recursive : [eval_foo_start/3] 0.05/0.18 0.05/0.18 #### Obtained direct recursion through partial evaluation 0.05/0.18 0. SCC is partially evaluated into eval_foo_bb1_in/3 0.05/0.18 1. SCC is completely evaluated into other SCCs 0.05/0.18 2. SCC is completely evaluated into other SCCs 0.05/0.18 3. SCC is completely evaluated into other SCCs 0.05/0.18 4. SCC is partially evaluated into eval_foo_bb0_in/3 0.05/0.18 5. SCC is partially evaluated into eval_foo_start/3 0.05/0.18 0.05/0.18 Control-Flow Refinement of Cost Relations 0.05/0.18 ===================================== 0.05/0.18 0.05/0.18 ### Specialization of cost equations eval_foo_bb1_in/3 0.05/0.18 * CE 5 is refined into CE [6] 0.05/0.18 * CE 4 is refined into CE [7] 0.05/0.18 * CE 3 is refined into CE [8] 0.05/0.18 0.05/0.18 0.05/0.18 ### Cost equations --> "Loop" of eval_foo_bb1_in/3 0.05/0.18 * CEs [7] --> Loop 6 0.05/0.18 * CEs [8] --> Loop 7 0.05/0.18 * CEs [6] --> Loop 8 0.05/0.18 0.05/0.18 ### Ranking functions of CR eval_foo_bb1_in(V__01,V__0,B) 0.05/0.18 * RF of phase [6]: [V__01+1] 0.05/0.18 * RF of phase [7]: [V__0+1] 0.05/0.18 0.05/0.18 #### Partial ranking functions of CR eval_foo_bb1_in(V__01,V__0,B) 0.05/0.18 * Partial RF of phase [6]: 0.05/0.18 - RF of loop [6:1]: 0.05/0.18 V__01+1 0.05/0.18 * Partial RF of phase [7]: 0.05/0.18 - RF of loop [7:1]: 0.05/0.18 V__0+1 0.05/0.18 0.05/0.18 0.05/0.18 ### Specialization of cost equations eval_foo_bb0_in/3 0.05/0.18 * CE 2 is refined into CE [9,10,11] 0.05/0.18 0.05/0.18 0.05/0.18 ### Cost equations --> "Loop" of eval_foo_bb0_in/3 0.05/0.18 * CEs [11] --> Loop 9 0.05/0.18 * CEs [9] --> Loop 10 0.05/0.18 * CEs [10] --> Loop 11 0.05/0.18 0.05/0.18 ### Ranking functions of CR eval_foo_bb0_in(V_x,V_y,B) 0.05/0.18 0.05/0.18 #### Partial ranking functions of CR eval_foo_bb0_in(V_x,V_y,B) 0.05/0.18 0.05/0.18 0.05/0.18 ### Specialization of cost equations eval_foo_start/3 0.05/0.18 * CE 1 is refined into CE [12,13,14] 0.05/0.18 0.05/0.18 0.05/0.18 ### Cost equations --> "Loop" of eval_foo_start/3 0.05/0.18 * CEs [14] --> Loop 12 0.05/0.18 * CEs [13] --> Loop 13 0.05/0.18 * CEs [12] --> Loop 14 0.05/0.18 0.05/0.18 ### Ranking functions of CR eval_foo_start(V_x,V_y,B) 0.05/0.18 0.05/0.18 #### Partial ranking functions of CR eval_foo_start(V_x,V_y,B) 0.05/0.18 0.05/0.18 0.05/0.18 Computing Bounds 0.05/0.18 ===================================== 0.05/0.18 0.05/0.18 #### Cost of chains of eval_foo_bb1_in(V__01,V__0,B): 0.05/0.18 * Chain [[7],8]: 1*it(7)+0 0.05/0.18 Such that:it(7) =< V__0+1 0.05/0.18 0.05/0.18 with precondition: [B=2,0>=V__01+1,V__0>=0] 0.05/0.18 0.05/0.18 * Chain [[6],[7],8]: 1*it(6)+1*s(1)+0 0.05/0.18 Such that:it([[7],8]) =< 1 0.05/0.18 aux(8) =< V__01 0.05/0.18 it(6) =< V__01+1 0.05/0.18 aux(14) =< V__0+1 0.05/0.18 aux(10) =< aux(8) 0.05/0.18 aux(9) =< it(6)*aux(8) 0.05/0.18 aux(1) =< it(6)*aux(8) 0.05/0.18 aux(11) =< it(6)*aux(10) 0.05/0.18 aux(3) =< aux(9) 0.05/0.18 aux(1) =< it(6)*aux(10) 0.05/0.18 aux(3) =< aux(11) 0.05/0.18 s(1) =< aux(1)+aux(14) 0.05/0.18 aux(5) =< aux(14)+aux(3) 0.05/0.18 s(1) =< aux(3)+aux(14) 0.05/0.18 s(1) =< it([[7],8])*aux(5) 0.05/0.18 0.05/0.18 with precondition: [B=2,V__01>=0,V__0>=0] 0.05/0.18 0.05/0.18 * Chain [8]: 0 0.05/0.18 with precondition: [B=2,0>=V__0+1] 0.05/0.18 0.05/0.18 0.05/0.18 #### Cost of chains of eval_foo_bb0_in(V_x,V_y,B): 0.05/0.18 * Chain [11]: 0 0.05/0.18 with precondition: [0>=V_x+1] 0.05/0.18 0.05/0.18 * Chain [10]: 1*s(2)+0 0.05/0.18 Such that:s(2) =< V_x+1 0.05/0.18 0.05/0.18 with precondition: [0>=V_y+1,V_x>=0] 0.05/0.18 0.05/0.18 * Chain [9]: 1*s(5)+1*s(12)+0 0.05/0.18 Such that:s(3) =< 1 0.05/0.18 s(6) =< V_x+1 0.05/0.18 s(4) =< V_y 0.05/0.18 s(5) =< V_y+1 0.05/0.18 s(7) =< s(4) 0.05/0.18 s(8) =< s(5)*s(4) 0.05/0.18 s(9) =< s(5)*s(4) 0.05/0.18 s(10) =< s(5)*s(7) 0.05/0.18 s(11) =< s(8) 0.05/0.18 s(9) =< s(5)*s(7) 0.05/0.18 s(11) =< s(10) 0.05/0.18 s(12) =< s(9)+s(6) 0.05/0.18 s(13) =< s(6)+s(11) 0.05/0.18 s(12) =< s(11)+s(6) 0.05/0.18 s(12) =< s(3)*s(13) 0.05/0.18 0.05/0.18 with precondition: [V_x>=0,V_y>=0] 0.05/0.18 0.05/0.18 0.05/0.18 #### Cost of chains of eval_foo_start(V_x,V_y,B): 0.05/0.18 * Chain [14]: 0 0.05/0.18 with precondition: [0>=V_x+1] 0.05/0.18 0.05/0.18 * Chain [13]: 1*s(14)+0 0.05/0.18 Such that:s(14) =< V_x+1 0.05/0.18 0.05/0.18 with precondition: [0>=V_y+1,V_x>=0] 0.05/0.18 0.05/0.18 * Chain [12]: 1*s(18)+1*s(24)+0 0.05/0.18 Such that:s(15) =< 1 0.05/0.18 s(16) =< V_x+1 0.05/0.18 s(17) =< V_y 0.05/0.18 s(18) =< V_y+1 0.05/0.18 s(19) =< s(17) 0.05/0.18 s(20) =< s(18)*s(17) 0.05/0.18 s(21) =< s(18)*s(17) 0.05/0.18 s(22) =< s(18)*s(19) 0.05/0.18 s(23) =< s(20) 0.05/0.18 s(21) =< s(18)*s(19) 0.05/0.18 s(23) =< s(22) 0.05/0.18 s(24) =< s(21)+s(16) 0.05/0.18 s(25) =< s(16)+s(23) 0.05/0.18 s(24) =< s(23)+s(16) 0.05/0.18 s(24) =< s(15)*s(25) 0.05/0.18 0.05/0.18 with precondition: [V_x>=0,V_y>=0] 0.05/0.18 0.05/0.18 0.05/0.18 Closed-form bounds of eval_foo_start(V_x,V_y,B): 0.05/0.18 ------------------------------------- 0.05/0.18 * Chain [14] with precondition: [0>=V_x+1] 0.05/0.18 - Upper bound: 0 0.05/0.18 - Complexity: constant 0.05/0.18 * Chain [13] with precondition: [0>=V_y+1,V_x>=0] 0.05/0.18 - Upper bound: V_x+1 0.05/0.18 - Complexity: n 0.05/0.18 * Chain [12] with precondition: [V_x>=0,V_y>=0] 0.05/0.18 - Upper bound: V_x+1+(V_y+1)*V_y+(V_y+1) 0.05/0.18 - Complexity: n^2 0.05/0.18 0.05/0.18 ### Maximum cost of eval_foo_start(V_x,V_y,B): nat(V_y+1)*nat(V_y)+nat(V_y+1)+nat(V_x+1) 0.05/0.18 Asymptotic class: n^2 0.05/0.18 * Total analysis performed in 104 ms. 0.05/0.18 0.05/0.28 EOF