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

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

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

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


### Cost equations --> "Loop" of eval_foo_bb1_in/2 
* CEs [6] --> Loop 5 
* CEs [5] --> Loop 6 

### Ranking functions of CR eval_foo_bb1_in(V__0,B) 
* RF of phase [5]: [-V__0+2147483648]

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


### Specialization of cost equations eval_foo_bb0_in/2 
* CE 2 is refined into CE [7,8] 


### Cost equations --> "Loop" of eval_foo_bb0_in/2 
* CEs [8] --> Loop 7 
* CEs [7] --> Loop 8 

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

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


### Specialization of cost equations eval_foo_start/2 
* CE 1 is refined into CE [9,10] 


### Cost equations --> "Loop" of eval_foo_start/2 
* CEs [10] --> Loop 9 
* CEs [9] --> Loop 10 

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

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


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

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

  with precondition: [B=2,2147483647>=V__0] 

* Chain [6]: 0
  with precondition: [B=2,V__0>=2147483648] 


#### Cost of chains of eval_foo_bb0_in(V_i,B):
* Chain [8]: 1*s(1)+0
  Such that:s(1) =< -V_i+2147483648

  with precondition: [2147483647>=V_i] 

* Chain [7]: 0
  with precondition: [V_i>=2147483648] 


#### Cost of chains of eval_foo_start(V_i,B):
* Chain [10]: 1*s(2)+0
  Such that:s(2) =< -V_i+2147483648

  with precondition: [2147483647>=V_i] 

* Chain [9]: 0
  with precondition: [V_i>=2147483648] 


Closed-form bounds of eval_foo_start(V_i,B): 
-------------------------------------
* Chain [10] with precondition: [2147483647>=V_i] 
    - Upper bound: -V_i+2147483648 
    - Complexity: n 
* Chain [9] with precondition: [V_i>=2147483648] 
    - Upper bound: 0 
    - Complexity: constant 

### Maximum cost of eval_foo_start(V_i,B): nat(-V_i+2147483648) 
Asymptotic class: n 
* Total analysis performed in 31 ms.