/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/3,eval_foo_bb2_in/3]
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/3]
5. non_recursive  : [eval_foo_start/3]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into eval_foo_bb1_in/3
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/3
5. SCC is partially evaluated into eval_foo_start/3

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

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


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

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

#### Partial ranking functions of CR eval_foo_bb1_in(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/3 
* CE 3 is refined into CE [8,9] 
* CE 2 is refined into CE [10] 


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

### Ranking functions of CR eval_foo_bb0_in(V_c,V_x,B) 

#### Partial ranking functions of CR eval_foo_bb0_in(V_c,V_x,B) 


### Specialization of cost equations eval_foo_start/3 
* CE 1 is refined into CE [11,12,13] 


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

### Ranking functions of CR eval_foo_start(V_c,V_x,B) 

#### Partial ranking functions of CR eval_foo_start(V_c,V_x,B) 


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

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

  with precondition: [B=2,V__0>=2,V__0+V__01>=0] 

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


#### Cost of chains of eval_foo_bb0_in(V_c,V_x,B):
* Chain [10]: 0
  with precondition: [1>=V_c] 

* Chain [9]: 0
  with precondition: [V_c>=2,0>=V_c+V_x+1] 

* Chain [8]: 1*s(1)+0
  Such that:s(1) =< V_c+V_x+1

  with precondition: [V_c>=2,V_c+V_x>=0] 


#### Cost of chains of eval_foo_start(V_c,V_x,B):
* Chain [13]: 0
  with precondition: [1>=V_c] 

* Chain [12]: 0
  with precondition: [V_c>=2,0>=V_c+V_x+1] 

* Chain [11]: 1*s(2)+0
  Such that:s(2) =< V_c+V_x+1

  with precondition: [V_c>=2,V_c+V_x>=0] 


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

### Maximum cost of eval_foo_start(V_c,V_x,B): nat(V_c+V_x+1) 
Asymptotic class: n 
* Total analysis performed in 52 ms.