0.03/0.10 WORST_CASE(?,O(n^1)) 0.03/0.10 0.03/0.10 Preprocessing Cost Relations 0.03/0.10 ===================================== 0.03/0.10 0.03/0.10 #### Computed strongly connected components 0.03/0.10 0. recursive : [eval_foo_bb1_in/2,eval_foo_bb2_in/2] 0.03/0.10 1. non_recursive : [eval_foo_stop/1] 0.03/0.10 2. non_recursive : [eval_foo_bb3_in/1] 0.03/0.10 3. non_recursive : [eval_foo_bb1_in_loop_cont/2] 0.03/0.10 4. non_recursive : [eval_foo_bb0_in/2] 0.03/0.10 5. non_recursive : [eval_foo_start/2] 0.03/0.10 0.03/0.10 #### Obtained direct recursion through partial evaluation 0.03/0.10 0. SCC is partially evaluated into eval_foo_bb1_in/2 0.03/0.10 1. SCC is completely evaluated into other SCCs 0.03/0.10 2. SCC is completely evaluated into other SCCs 0.03/0.10 3. SCC is completely evaluated into other SCCs 0.03/0.10 4. SCC is partially evaluated into eval_foo_bb0_in/2 0.03/0.10 5. SCC is partially evaluated into eval_foo_start/2 0.03/0.10 0.03/0.10 Control-Flow Refinement of Cost Relations 0.03/0.10 ===================================== 0.03/0.10 0.03/0.10 ### Specialization of cost equations eval_foo_bb1_in/2 0.03/0.10 * CE 4 is refined into CE [5] 0.03/0.10 * CE 3 is refined into CE [6] 0.03/0.10 0.03/0.10 0.03/0.10 ### Cost equations --> "Loop" of eval_foo_bb1_in/2 0.03/0.10 * CEs [6] --> Loop 5 0.03/0.10 * CEs [5] --> Loop 6 0.03/0.10 0.03/0.10 ### Ranking functions of CR eval_foo_bb1_in(V__0,B) 0.03/0.10 * RF of phase [5]: [-V__0+2147483648] 0.03/0.10 0.03/0.10 #### Partial ranking functions of CR eval_foo_bb1_in(V__0,B) 0.03/0.10 * Partial RF of phase [5]: 0.03/0.10 - RF of loop [5:1]: 0.03/0.10 -V__0+2147483648 0.03/0.10 0.03/0.10 0.03/0.10 ### Specialization of cost equations eval_foo_bb0_in/2 0.03/0.10 * CE 2 is refined into CE [7,8] 0.03/0.10 0.03/0.10 0.03/0.10 ### Cost equations --> "Loop" of eval_foo_bb0_in/2 0.03/0.10 * CEs [8] --> Loop 7 0.03/0.10 * CEs [7] --> Loop 8 0.03/0.10 0.03/0.10 ### Ranking functions of CR eval_foo_bb0_in(V_i,B) 0.03/0.10 0.03/0.10 #### Partial ranking functions of CR eval_foo_bb0_in(V_i,B) 0.03/0.10 0.03/0.10 0.03/0.10 ### Specialization of cost equations eval_foo_start/2 0.03/0.10 * CE 1 is refined into CE [9,10] 0.03/0.10 0.03/0.10 0.03/0.10 ### Cost equations --> "Loop" of eval_foo_start/2 0.03/0.10 * CEs [10] --> Loop 9 0.03/0.10 * CEs [9] --> Loop 10 0.03/0.10 0.03/0.10 ### Ranking functions of CR eval_foo_start(V_i,B) 0.03/0.10 0.03/0.10 #### Partial ranking functions of CR eval_foo_start(V_i,B) 0.03/0.10 0.03/0.10 0.03/0.10 Computing Bounds 0.03/0.10 ===================================== 0.03/0.10 0.03/0.10 #### Cost of chains of eval_foo_bb1_in(V__0,B): 0.03/0.10 * Chain [[5],6]: 1*it(5)+0 0.03/0.10 Such that:it(5) =< -V__0+2147483648 0.03/0.10 0.03/0.10 with precondition: [B=2,2147483647>=V__0] 0.03/0.10 0.03/0.10 * Chain [6]: 0 0.03/0.10 with precondition: [B=2,V__0>=2147483648] 0.03/0.10 0.03/0.10 0.03/0.10 #### Cost of chains of eval_foo_bb0_in(V_i,B): 0.03/0.10 * Chain [8]: 1*s(1)+0 0.03/0.10 Such that:s(1) =< -V_i+2147483648 0.03/0.10 0.03/0.10 with precondition: [2147483647>=V_i] 0.03/0.10 0.03/0.10 * Chain [7]: 0 0.03/0.10 with precondition: [V_i>=2147483648] 0.03/0.10 0.03/0.10 0.03/0.10 #### Cost of chains of eval_foo_start(V_i,B): 0.03/0.10 * Chain [10]: 1*s(2)+0 0.03/0.10 Such that:s(2) =< -V_i+2147483648 0.03/0.10 0.03/0.10 with precondition: [2147483647>=V_i] 0.03/0.10 0.03/0.10 * Chain [9]: 0 0.03/0.10 with precondition: [V_i>=2147483648] 0.03/0.10 0.03/0.10 0.03/0.10 Closed-form bounds of eval_foo_start(V_i,B): 0.03/0.10 ------------------------------------- 0.03/0.10 * Chain [10] with precondition: [2147483647>=V_i] 0.03/0.10 - Upper bound: -V_i+2147483648 0.03/0.10 - Complexity: n 0.03/0.10 * Chain [9] with precondition: [V_i>=2147483648] 0.03/0.10 - Upper bound: 0 0.03/0.10 - Complexity: constant 0.03/0.10 0.03/0.10 ### Maximum cost of eval_foo_start(V_i,B): nat(-V_i+2147483648) 0.03/0.10 Asymptotic class: n 0.03/0.10 * Total analysis performed in 32 ms. 0.03/0.10 0.05/0.20 EOF