/export/starexec/sandbox/solver/bin/starexec_run_C /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?,O(n^1)) Preprocessing Cost Relations ===================================== #### Computed strongly connected components 0. recursive : [eval_foo_bb1_in/4,eval_foo_bb2_in/4] 1. non_recursive : [eval_foo_stop/1] 2. non_recursive : [eval_foo__critedge_in/1] 3. non_recursive : [eval_foo_bb1_in_loop_cont/2] 4. non_recursive : [eval_foo_bb0_in/4] 5. non_recursive : [eval_foo_start/4] #### Obtained direct recursion through partial evaluation 0. SCC is partially evaluated into eval_foo_bb1_in/4 1. SCC is completely evaluated into other SCCs 2. SCC is completely evaluated into other SCCs 3. SCC is completely evaluated into other SCCs 4. SCC is partially evaluated into eval_foo_bb0_in/4 5. SCC is partially evaluated into eval_foo_start/4 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations eval_foo_bb1_in/4 * CE 5 is refined into CE [6] * CE 4 is refined into CE [7] * CE 3 is refined into CE [8] ### Cost equations --> "Loop" of eval_foo_bb1_in/4 * CEs [8] --> Loop 6 * CEs [6] --> Loop 7 * CEs [7] --> Loop 8 ### Ranking functions of CR eval_foo_bb1_in(V_z,V__01,V__0,B) * RF of phase [6]: [V__01+V__0+1] #### Partial ranking functions of CR eval_foo_bb1_in(V_z,V__01,V__0,B) * Partial RF of phase [6]: - RF of loop [6:1]: V__01+V__0+1 ### Specialization of cost equations eval_foo_bb0_in/4 * CE 2 is refined into CE [9,10,11,12] ### Cost equations --> "Loop" of eval_foo_bb0_in/4 * CEs [12] --> Loop 9 * CEs [11] --> Loop 10 * CEs [9] --> Loop 11 * CEs [10] --> Loop 12 ### Ranking functions of CR eval_foo_bb0_in(V_x,V_y,V_z,B) #### Partial ranking functions of CR eval_foo_bb0_in(V_x,V_y,V_z,B) ### Specialization of cost equations eval_foo_start/4 * CE 1 is refined into CE [13,14,15,16] ### Cost equations --> "Loop" of eval_foo_start/4 * CEs [16] --> Loop 13 * CEs [15] --> Loop 14 * CEs [14] --> Loop 15 * CEs [13] --> Loop 16 ### Ranking functions of CR eval_foo_start(V_x,V_y,V_z,B) #### Partial ranking functions of CR eval_foo_start(V_x,V_y,V_z,B) Computing Bounds ===================================== #### Cost of chains of eval_foo_bb1_in(V_z,V__01,V__0,B): * Chain [[6],8]: 1*it(6)+0 Such that:it(6) =< V__01+V__0+1 with precondition: [B=2,0>=V_z+1,V__0>=0,V__0+V__01>=0] * Chain [[6],7]: 1*it(6)+0 Such that:it(6) =< V__01+V__0+1 with precondition: [B=2,V__0>=0,V__0+V__01>=0] * Chain [8]: 0 with precondition: [B=2,0>=V__0+1] * Chain [7]: 0 with precondition: [B=2,0>=V__0+V__01+1] #### Cost of chains of eval_foo_bb0_in(V_x,V_y,V_z,B): * Chain [12]: 0 with precondition: [0>=V_x+1] * Chain [11]: 1*s(1)+0 Such that:s(1) =< V_x+V_y+1 with precondition: [0>=V_z+1,V_x>=0,V_x+V_y>=0] * Chain [10]: 1*s(2)+0 Such that:s(2) =< V_x+V_y+1 with precondition: [V_x>=0,V_x+V_y>=0] * Chain [9]: 0 with precondition: [0>=V_x+V_y+1] #### Cost of chains of eval_foo_start(V_x,V_y,V_z,B): * Chain [16]: 0 with precondition: [0>=V_x+1] * Chain [15]: 1*s(3)+0 Such that:s(3) =< V_x+V_y+1 with precondition: [0>=V_z+1,V_x>=0,V_x+V_y>=0] * Chain [14]: 1*s(4)+0 Such that:s(4) =< V_x+V_y+1 with precondition: [V_x>=0,V_x+V_y>=0] * Chain [13]: 0 with precondition: [0>=V_x+V_y+1] Closed-form bounds of eval_foo_start(V_x,V_y,V_z,B): ------------------------------------- * Chain [16] with precondition: [0>=V_x+1] - Upper bound: 0 - Complexity: constant * Chain [15] with precondition: [0>=V_z+1,V_x>=0,V_x+V_y>=0] - Upper bound: V_x+V_y+1 - Complexity: n * Chain [14] with precondition: [V_x>=0,V_x+V_y>=0] - Upper bound: V_x+V_y+1 - Complexity: n * Chain [13] with precondition: [0>=V_x+V_y+1] - Upper bound: 0 - Complexity: constant ### Maximum cost of eval_foo_start(V_x,V_y,V_z,B): nat(V_x+V_y+1) Asymptotic class: n * Total analysis performed in 73 ms.