/export/starexec/sandbox2/solver/bin/starexec_run_C /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/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_bb3_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/5]

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

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__02,V__01,V__0,B) 
* RF of phase [6]: [-V__02/2-V__01/2+V__0/2+101/2]

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


### 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 [10] --> Loop 11 
* CEs [9] --> Loop 12 

### Ranking functions of CR eval_foo_bb0_in(V_k,V_i,V_j,B) 

#### Partial ranking functions of CR eval_foo_bb0_in(V_k,V_i,V_j,B) 


### Specialization of cost equations eval_foo_start/5 
* CE 1 is refined into CE [13,14,15,16] 


### Cost equations --> "Loop" of eval_foo_start/5 
* CEs [16] --> Loop 13 
* CEs [15] --> Loop 14 
* CEs [14] --> Loop 15 
* CEs [13] --> Loop 16 

### Ranking functions of CR eval_foo_start(V_k,V_i,V_j,V_tmp,B) 

#### Partial ranking functions of CR eval_foo_start(V_k,V_i,V_j,V_tmp,B) 


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

#### Cost of chains of eval_foo_bb1_in(V__02,V__01,V__0,B):
* Chain [[6],8]: 1*it(6)+0
  Such that:it(6) =< -V__02/2-V__01/2+V__0/2+101/2
it(6) =< V__0

  with precondition: [B=2,100>=V__01,V__0>=101,V__0>=V__02] 

* Chain [[6],7]: 1*it(6)+0
  Such that:it(6) =< -V__02/2-V__01/2+V__0/2+101/2

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

* Chain [8]: 0
  with precondition: [B=2,V__01>=101] 

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


#### Cost of chains of eval_foo_bb0_in(V_k,V_i,V_j,B):
* Chain [12]: 1*s(1)+0
  Such that:s(1) =< V_k
s(1) =< V_k/2-V_i/2-V_j/2+101/2

  with precondition: [100>=V_i,V_k>=101,V_k>=V_j] 

* Chain [11]: 1*s(2)+0
  Such that:s(2) =< V_k/2-V_i/2-V_j/2+101/2

  with precondition: [100>=V_i,V_k>=V_j] 

* Chain [10]: 0
  with precondition: [V_i>=101] 

* Chain [9]: 0
  with precondition: [V_j>=V_k+1] 


#### Cost of chains of eval_foo_start(V_k,V_i,V_j,V_tmp,B):
* Chain [16]: 1*s(3)+0
  Such that:s(3) =< V_k
s(3) =< V_k/2-V_i/2-V_j/2+101/2

  with precondition: [100>=V_i,V_k>=101,V_k>=V_j] 

* Chain [15]: 1*s(4)+0
  Such that:s(4) =< V_k/2-V_i/2-V_j/2+101/2

  with precondition: [100>=V_i,V_k>=V_j] 

* Chain [14]: 0
  with precondition: [V_i>=101] 

* Chain [13]: 0
  with precondition: [V_j>=V_k+1] 


Closed-form bounds of eval_foo_start(V_k,V_i,V_j,V_tmp,B): 
-------------------------------------
* Chain [16] with precondition: [100>=V_i,V_k>=101,V_k>=V_j] 
    - Upper bound: V_k 
    - Complexity: n 
* Chain [15] with precondition: [100>=V_i,V_k>=V_j] 
    - Upper bound: V_k/2-V_i/2-V_j/2+101/2 
    - Complexity: n 
* Chain [14] with precondition: [V_i>=101] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [13] with precondition: [V_j>=V_k+1] 
    - Upper bound: 0 
    - Complexity: constant 

### Maximum cost of eval_foo_start(V_k,V_i,V_j,V_tmp,B): max([nat(V_k),nat(V_k/2-V_i/2-V_j/2+101/2)]) 
Asymptotic class: n 
* Total analysis performed in 79 ms.