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


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


WORST_CASE(?,O(1))  

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

#### Computed strongly connected components 
0. recursive  : [eval_foo_bb2_in/3,eval_foo_bb3_in/3]
1. recursive  : [eval_foo_bb1_in/3,eval_foo_bb2_in_loop_cont/5,eval_foo_bb4_in/4]
2. non_recursive  : [eval_foo_stop/1]
3. non_recursive  : [eval_foo_bb5_in/1]
4. non_recursive  : [eval_foo_bb1_in_loop_cont/2]
5. non_recursive  : [eval_foo_bb0_in/1]
6. non_recursive  : [eval_foo_start/3]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into eval_foo_bb2_in/3
1. SCC is partially evaluated into eval_foo_bb1_in/3
2. SCC is completely evaluated into other SCCs
3. SCC is completely evaluated into other SCCs
4. SCC is completely evaluated into other SCCs
5. SCC is partially evaluated into eval_foo_bb0_in/1
6. SCC is partially evaluated into eval_foo_start/3

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

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


### Cost equations --> "Loop" of eval_foo_bb2_in/3 
* CEs [8] --> Loop 7 
* CEs [7] --> Loop 8 

### Ranking functions of CR eval_foo_bb2_in(V__1,B,C) 
* RF of phase [7]: [-V__1+12]

#### Partial ranking functions of CR eval_foo_bb2_in(V__1,B,C) 
* Partial RF of phase [7]:
  - RF of loop [7:1]:
    -V__1+12


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


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

### Ranking functions of CR eval_foo_bb1_in(V__01,V__0,B) 
* RF of phase [9]: [-V__0+10]

#### Partial ranking functions of CR eval_foo_bb1_in(V__01,V__0,B) 
* Partial RF of phase [9]:
  - RF of loop [9:1]:
    -V__0+10


### Specialization of cost equations eval_foo_bb0_in/1 
* CE 2 is refined into CE [12] 


### Cost equations --> "Loop" of eval_foo_bb0_in/1 
* CEs [12] --> Loop 12 

### Ranking functions of CR eval_foo_bb0_in(B) 

#### Partial ranking functions of CR eval_foo_bb0_in(B) 


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


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

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

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


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

#### Cost of chains of eval_foo_bb2_in(V__1,B,C):
* Chain [[7],8]: 1*it(7)+0
  Such that:it(7) =< -V__1+12

  with precondition: [B=2,C=12,11>=V__1] 

* Chain [8]: 0
  with precondition: [B=2,V__1=C,V__1>=12] 


#### Cost of chains of eval_foo_bb1_in(V__01,V__0,B):
* Chain [10,[9],11]: 2*it(9)+1
  Such that:aux(1) =< 9
it(9) =< aux(1)

  with precondition: [V__01=3,V__0=0,B=3] 


#### Cost of chains of eval_foo_bb0_in(B):
* Chain [12]: 2*s(3)+1
  Such that:s(2) =< 9
s(3) =< s(2)

  with precondition: [] 


#### Cost of chains of eval_foo_start(V_i,V_j,B):
* Chain [13]: 2*s(5)+1
  Such that:s(4) =< 9
s(5) =< s(4)

  with precondition: [] 


Closed-form bounds of eval_foo_start(V_i,V_j,B): 
-------------------------------------
* Chain [13] with precondition: [] 
    - Upper bound: 19 
    - Complexity: constant 

### Maximum cost of eval_foo_start(V_i,V_j,B): 19 
Asymptotic class: constant 
* Total analysis performed in 75 ms.