/export/starexec/sandbox2/solver/bin/starexec_run_C /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


WORST_CASE(?,O(n^2))  

Preprocessing Cost Relations
=====================================

#### Computed strongly connected components 
0. recursive  : [eval_foo_bb1_in/4,eval_foo_bb2_in/4,eval_foo_bb3_in/4,eval_foo_bb4_in/4]
1. non_recursive  : [eval_foo_stop/1]
2. non_recursive  : [eval_foo_bb5_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/8]

#### 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/8

Control-Flow Refinement of Cost Relations
=====================================

### Specialization of cost equations eval_foo_bb1_in/4 
* CE 5 is refined into CE [6] 
* CE 3 is refined into CE [7] 
* CE 4 is refined into CE [8] 


### Cost equations --> "Loop" of eval_foo_bb1_in/4 
* CEs [7] --> Loop 6 
* CEs [8] --> Loop 7 
* CEs [6] --> Loop 8 

### Ranking functions of CR eval_foo_bb1_in(V__04,V__02,V__01,B) 
* RF of phase [6]: [V__01-1]
* RF of phase [7]: [V__04-V__02+1]

#### Partial ranking functions of CR eval_foo_bb1_in(V__04,V__02,V__01,B) 
* Partial RF of phase [6]:
  - RF of loop [6:1]:
    V__01-1
* Partial RF of phase [7]:
  - RF of loop [7:1]:
    V__04-V__02+1


### Specialization of cost equations eval_foo_bb0_in/4 
* CE 2 is refined into CE [9,10,11] 


### Cost equations --> "Loop" of eval_foo_bb0_in/4 
* CEs [11] --> Loop 9 
* CEs [10] --> Loop 10 
* CEs [9] --> Loop 11 

### 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/8 
* CE 1 is refined into CE [12,13,14] 


### Cost equations --> "Loop" of eval_foo_start/8 
* CEs [14] --> Loop 12 
* CEs [13] --> Loop 13 
* CEs [12] --> Loop 14 

### Ranking functions of CR eval_foo_start(V_c,V_u,V_v,V_w,V_x,V_y,V_z,B) 

#### Partial ranking functions of CR eval_foo_start(V_c,V_u,V_v,V_w,V_x,V_y,V_z,B) 


Computing Bounds
=====================================

#### Cost of chains of eval_foo_bb1_in(V__04,V__02,V__01,B):
* Chain [[7],8]: 1*it(7)+0
  Such that:it(7) =< V__04-V__02+1

  with precondition: [B=2,1>=V__01,V__04>=V__02] 

* Chain [[6],[7],8]: 1*it(6)+1*s(1)+0
  Such that:it([[7],8]) =< 1
aux(14) =< V__04-V__02+1
aux(15) =< V__01
it(6) =< aux(15)
aux(10) =< aux(15)
aux(9) =< it(6)*aux(15)
aux(1) =< it(6)*aux(15)
aux(11) =< it(6)*aux(10)
aux(3) =< aux(9)
aux(1) =< it(6)*aux(10)
aux(3) =< aux(11)
s(1) =< aux(1)+aux(14)
aux(5) =< aux(14)+aux(3)
s(1) =< aux(3)+aux(14)
s(1) =< it([[7],8])*aux(5)

  with precondition: [B=2,V__01>=2,V__04>=V__02] 

* Chain [8]: 0
  with precondition: [B=2,V__02>=V__04+1] 


#### Cost of chains of eval_foo_bb0_in(V_x,V_y,V_z,B):
* Chain [11]: 1*s(2)+0
  Such that:s(2) =< V_x-V_y+1

  with precondition: [1>=V_z,V_x>=V_y] 

* Chain [10]: 1*s(6)+1*s(12)+0
  Such that:s(3) =< 1
s(4) =< V_x-V_y+1
s(5) =< V_z
s(6) =< s(5)
s(7) =< s(5)
s(8) =< s(6)*s(5)
s(9) =< s(6)*s(5)
s(10) =< s(6)*s(7)
s(11) =< s(8)
s(9) =< s(6)*s(7)
s(11) =< s(10)
s(12) =< s(9)+s(4)
s(13) =< s(4)+s(11)
s(12) =< s(11)+s(4)
s(12) =< s(3)*s(13)

  with precondition: [V_z>=2,V_x>=V_y] 

* Chain [9]: 0
  with precondition: [V_y>=V_x+1] 


#### Cost of chains of eval_foo_start(V_c,V_u,V_v,V_w,V_x,V_y,V_z,B):
* Chain [14]: 1*s(14)+0
  Such that:s(14) =< V_x-V_y+1

  with precondition: [1>=V_z,V_x>=V_y] 

* Chain [13]: 1*s(18)+1*s(24)+0
  Such that:s(15) =< 1
s(16) =< V_x-V_y+1
s(17) =< V_z
s(18) =< s(17)
s(19) =< s(17)
s(20) =< s(18)*s(17)
s(21) =< s(18)*s(17)
s(22) =< s(18)*s(19)
s(23) =< s(20)
s(21) =< s(18)*s(19)
s(23) =< s(22)
s(24) =< s(21)+s(16)
s(25) =< s(16)+s(23)
s(24) =< s(23)+s(16)
s(24) =< s(15)*s(25)

  with precondition: [V_z>=2,V_x>=V_y] 

* Chain [12]: 0
  with precondition: [V_y>=V_x+1] 


Closed-form bounds of eval_foo_start(V_c,V_u,V_v,V_w,V_x,V_y,V_z,B): 
-------------------------------------
* Chain [14] with precondition: [1>=V_z,V_x>=V_y] 
    - Upper bound: V_x-V_y+1 
    - Complexity: n 
* Chain [13] with precondition: [V_z>=2,V_x>=V_y] 
    - Upper bound: V_x-V_y+1+(V_z*V_z+V_z) 
    - Complexity: n^2 
* Chain [12] with precondition: [V_y>=V_x+1] 
    - Upper bound: 0 
    - Complexity: constant 

### Maximum cost of eval_foo_start(V_c,V_u,V_v,V_w,V_x,V_y,V_z,B): nat(V_z)*nat(V_z)+nat(V_z)+nat(V_x-V_y+1) 
Asymptotic class: n^2 
* Total analysis performed in 129 ms.