/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/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_1/4]
5. non_recursive  : [eval_foo_0/3]
6. non_recursive  : [eval_foo_bb0_in/3]
7. non_recursive  : [eval_foo_start/4]

#### 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_1/4
5. SCC is completely evaluated into other SCCs
6. SCC is completely evaluated into other SCCs
7. SCC is partially evaluated into eval_foo_start/4

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

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


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

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

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


### Specialization of cost equations eval_foo_1/4 
* CE 3 is refined into CE [11,12,13,14] 
* CE 2 is refined into CE [15,16,17,18] 
* CE 4 is refined into CE [19,20,21,22] 


### Cost equations --> "Loop" of eval_foo_1/4 
* CEs [14] --> Loop 11 
* CEs [18] --> Loop 12 
* CEs [22] --> Loop 13 
* CEs [12] --> Loop 14 
* CEs [13] --> Loop 15 
* CEs [16] --> Loop 16 
* CEs [17] --> Loop 17 
* CEs [11] --> Loop 18 
* CEs [15] --> Loop 19 
* CEs [20] --> Loop 20 
* CEs [21] --> Loop 21 
* CEs [19] --> Loop 22 

### Ranking functions of CR eval_foo_1(V_y,V_z,V_0,B) 

#### Partial ranking functions of CR eval_foo_1(V_y,V_z,V_0,B) 


### Specialization of cost equations eval_foo_start/4 
* CE 1 is refined into CE [23,24,25,26,27,28,29,30,31,32,33,34] 


### Cost equations --> "Loop" of eval_foo_start/4 
* CEs [32,33,34] --> Loop 23 
* CEs [25,29,31] --> Loop 24 
* CEs [24,28,30] --> Loop 25 
* CEs [23,26,27] --> Loop 26 

### Ranking functions of CR eval_foo_start(V_x,V_y,V_z,B) 

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


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

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

* Chain [[8],10]: 1*it(8)+0
  with precondition: [V__+1=0,B=2,99>=V__02,99>=V__01] 

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

* Chain [10]: 0
  with precondition: [B=2,1>=V__,V__+1>=0,V__02>=100] 

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


#### Cost of chains of eval_foo_1(V_y,V_z,V_0,B):
* Chain [22]: 1*s(1)+0
  with precondition: [V_0=0,99>=V_y,99>=V_z] 

* Chain [21]: 0
  with precondition: [V_0=0,V_y>=100] 

* Chain [20]: 0
  with precondition: [V_0=0,V_z>=100] 

* Chain [19]: 1*s(2)+0
  with precondition: [99>=V_y,99>=V_z,0>=V_0+1] 

* Chain [18]: 1*s(3)+0
  with precondition: [99>=V_y,99>=V_z,V_0>=1] 

* Chain [17]: 0
  with precondition: [0>=V_0+1,V_y>=100] 

* Chain [16]: 0
  with precondition: [0>=V_0+1,V_z>=100] 

* Chain [15]: 0
  with precondition: [V_y>=100,V_0>=1] 

* Chain [14]: 0
  with precondition: [V_z>=100,V_0>=1] 

* Chain [13]...: 1*s(4)+0
  with precondition: [V_0=0,99>=V_y,99>=V_z] 

* Chain [12]...: 1*s(5)+0
  with precondition: [99>=V_y,99>=V_z,0>=V_0+1] 

* Chain [11]...: 1*s(6)+0
  with precondition: [99>=V_y,99>=V_z,V_0>=1] 


#### Cost of chains of eval_foo_start(V_x,V_y,V_z,B):
* Chain [26]: 1*aux(1)+0
  with precondition: [99>=V_y,99>=V_z] 

* Chain [25]: 0
  with precondition: [V_y>=100] 

* Chain [24]: 0
  with precondition: [V_z>=100] 

* Chain [23]...: 1*aux(2)+0
  with precondition: [99>=V_y,99>=V_z] 


Closed-form bounds of eval_foo_start(V_x,V_y,V_z,B): 
-------------------------------------
* Chain [26] with precondition: [99>=V_y,99>=V_z] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [25] with precondition: [V_y>=100] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [24] with precondition: [V_z>=100] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [23]... with precondition: [99>=V_y,99>=V_z] 
    - Upper bound: inf 
    - Complexity: infinity 

### Maximum cost of eval_foo_start(V_x,V_y,V_z,B): inf 
Asymptotic class: infinity 
* Total analysis performed in 125 ms.