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


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


MAYBE

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

#### Computed strongly connected components 
0. recursive  : [eval_foo_bb1_in/5,eval_foo_bb2_in/5]
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/6]

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

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

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


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

### Ranking functions of CR eval_foo_bb1_in(V_n,V_b,V__,V__01,B) 

#### Partial ranking functions of CR eval_foo_bb1_in(V_n,V_b,V__,V__01,B) 


### Specialization of cost equations eval_foo_bb0_in/4 
* CE 2 is refined into CE [10,11,12] 
* CE 3 is refined into CE [13,14,15] 


### Cost equations --> "Loop" of eval_foo_bb0_in/4 
* CEs [12] --> Loop 10 
* CEs [15] --> Loop 11 
* CEs [11] --> Loop 12 
* CEs [10] --> Loop 13 
* CEs [14] --> Loop 14 
* CEs [13] --> Loop 15 

### Ranking functions of CR eval_foo_bb0_in(V_x,V_n,V_b,B) 

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


### Specialization of cost equations eval_foo_start/6 
* CE 1 is refined into CE [16,17,18,19,20,21] 


### Cost equations --> "Loop" of eval_foo_start/6 
* CEs [21] --> Loop 16 
* CEs [20] --> Loop 17 
* CEs [19] --> Loop 18 
* CEs [18] --> Loop 19 
* CEs [17] --> Loop 20 
* CEs [16] --> Loop 21 

### Ranking functions of CR eval_foo_start(V_i,V_x,V_n,V_b,V_t,B) 

#### Partial ranking functions of CR eval_foo_start(V_i,V_x,V_n,V_b,V_t,B) 


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

#### Cost of chains of eval_foo_bb1_in(V_n,V_b,V__,V__01,B):
* Chain [[8]]...: 1*it(8)+0
  with precondition: [1>=V__,V_n>=V__01,V__+1>=0,0>=V_b,B=2] 

* Chain [[8],9]: 1*it(8)+0
  with precondition: [V__+1=0,B=2,0>=V_b,V_n>=V__01] 

* Chain [[7]]...: 1*it(7)+0
  with precondition: [1>=V__,V_n>=V__01,V__+1>=0,V_b>=1,B=2] 

* Chain [[7],9]: 1*it(7)+0
  with precondition: [V__=1,B=2,V_b>=1,V_n>=V__01] 

* Chain [9]: 0
  with precondition: [B=2,1>=V__,V__+1>=0,V__01>=V_n+1] 


#### Cost of chains of eval_foo_bb0_in(V_x,V_n,V_b,B):
* Chain [15]: 1*s(1)+0
  with precondition: [0>=V_b,V_n>=V_x] 

* Chain [14]: 0
  with precondition: [0>=V_b,V_x>=V_n+1] 

* Chain [13]: 1*s(2)+0
  with precondition: [V_b>=1,V_n>=V_x] 

* Chain [12]: 0
  with precondition: [V_b>=1,V_x>=V_n+1] 

* Chain [11]...: 1*s(3)+0
  with precondition: [0>=V_b,V_n>=V_x] 

* Chain [10]...: 1*s(4)+0
  with precondition: [V_b>=1,V_n>=V_x] 


#### Cost of chains of eval_foo_start(V_i,V_x,V_n,V_b,V_t,B):
* Chain [21]: 1*s(5)+0
  with precondition: [0>=V_b,V_n>=V_x] 

* Chain [20]: 0
  with precondition: [0>=V_b,V_x>=V_n+1] 

* Chain [19]: 1*s(6)+0
  with precondition: [V_b>=1,V_n>=V_x] 

* Chain [18]: 0
  with precondition: [V_b>=1,V_x>=V_n+1] 

* Chain [17]...: 1*s(7)+0
  with precondition: [0>=V_b,V_n>=V_x] 

* Chain [16]...: 1*s(8)+0
  with precondition: [V_b>=1,V_n>=V_x] 


Closed-form bounds of eval_foo_start(V_i,V_x,V_n,V_b,V_t,B): 
-------------------------------------
* Chain [21] with precondition: [0>=V_b,V_n>=V_x] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [20] with precondition: [0>=V_b,V_x>=V_n+1] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [19] with precondition: [V_b>=1,V_n>=V_x] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [18] with precondition: [V_b>=1,V_x>=V_n+1] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [17]... with precondition: [0>=V_b,V_n>=V_x] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [16]... with precondition: [V_b>=1,V_n>=V_x] 
    - Upper bound: inf 
    - Complexity: infinity 

### Maximum cost of eval_foo_start(V_i,V_x,V_n,V_b,V_t,B): inf 
Asymptotic class: infinity 
* Total analysis performed in 128 ms.