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


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


MAYBE
WARNING: Excluded non-linear constraints:[F=A*C]
WARNING: Excluded non-linear constraints:[F= -A*C]

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

#### Computed strongly connected components 
0. recursive  : [eval_foo_bb1_in/5,eval_foo_bb2_in/5,eval_foo_bb3_in/5,eval_foo_bb4_in/5,eval_foo_bb5_in/5,eval_foo_bb6_in/7]
1. non_recursive  : [eval_foo_stop/1]
2. non_recursive  : [eval_foo_bb7_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 7 is refined into CE [9] 
* CE 8 is refined into CE [10] 
* CE 6 is refined into CE [11] 
* CE 5 is refined into CE [12] 
* CE 3 is refined into CE [13] 
* CE 4 is refined into CE [14] 


### Cost equations --> "Loop" of eval_foo_bb1_in/5 
* CEs [11] --> Loop 9 
* CEs [12] --> Loop 10 
* CEs [13] --> Loop 11 
* CEs [14] --> Loop 12 
* CEs [9] --> Loop 13 
* CEs [10] --> Loop 14 

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

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


### Specialization of cost equations eval_foo_bb0_in/4 
* CE 2 is refined into CE [15,16,17,18,19,20,21] 


### Cost equations --> "Loop" of eval_foo_bb0_in/4 
* CEs [21] --> Loop 15 
* CEs [20] --> Loop 16 
* CEs [19] --> Loop 17 
* CEs [18] --> Loop 18 
* CEs [17] --> Loop 19 
* CEs [16] --> Loop 20 
* CEs [15] --> Loop 21 

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

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


### Specialization of cost equations eval_foo_start/6 
* CE 1 is refined into CE [22,23,24,25,26,27,28] 


### Cost equations --> "Loop" of eval_foo_start/6 
* CEs [28] --> Loop 22 
* CEs [27] --> Loop 23 
* CEs [26] --> Loop 24 
* CEs [25] --> Loop 25 
* CEs [24] --> Loop 26 
* CEs [23] --> Loop 27 
* CEs [22] --> Loop 28 

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

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


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

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

* Chain [[10],13]: 1*it(10)+0
  with precondition: [V__01=1,B=2,0>=V_x+2,V__02>=1,V_z>=V__02+1] 

* Chain [[10],11,14]: 1*it(10)+1
  with precondition: [V__01=1,B=2,0>=V_x+2,V__02>=1,V_z>=V__02+1] 

* Chain [[9]]...: 1*it(9)+0
  with precondition: [V_x>=2,V_z>=V__02+1,V__02>=1,V__01=1,B=2] 

* Chain [[9],13]: 1*it(9)+0
  with precondition: [V__01=1,B=2,V_x>=2,V__02>=1,V_z>=V__02+1] 

* Chain [[9],11,14]: 1*it(9)+1
  with precondition: [V__01=1,B=2,V_x>=2,V__02>=1,V_z>=V__02+1] 

* Chain [13]: 0
  with precondition: [V__01=1,B=2,V__02>=V_z] 

* Chain [12,14]: 1
  with precondition: [V__01=1,B=2,1>=V_x,V_x+1>=0,V_z>=V__02+1] 

* Chain [11,14]: 1
  with precondition: [V__01=1,B=2,0>=V__02,V_z>=V__02+1] 


#### Cost of chains of eval_foo_bb0_in(V_x,V_y,V_z,B):
* Chain [21]: 1
  with precondition: [1>=V_x,V_x+1>=0,V_z>=V_y+1] 

* Chain [20]: 1*s(5)+0
  with precondition: [0>=V_x+2,V_y>=1,V_z>=V_y+1] 

* Chain [19]: 1
  with precondition: [0>=V_y,V_z>=V_y+1] 

* Chain [18]: 1*s(6)+0
  with precondition: [V_x>=2,V_y>=1,V_z>=V_y+1] 

* Chain [17]: 0
  with precondition: [V_y>=V_z] 

* Chain [16]...: 1*s(7)+0
  with precondition: [0>=V_x+2,V_y>=1,V_z>=V_y+1] 

* Chain [15]...: 1*s(8)+0
  with precondition: [V_x>=2,V_y>=1,V_z>=V_y+1] 


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

* Chain [27]: 1*s(9)+0
  with precondition: [0>=V_x+2,V_y>=1,V_z>=V_y+1] 

* Chain [26]: 1
  with precondition: [0>=V_y,V_z>=V_y+1] 

* Chain [25]: 1*s(10)+0
  with precondition: [V_x>=2,V_y>=1,V_z>=V_y+1] 

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

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

* Chain [22]...: 1*s(12)+0
  with precondition: [V_x>=2,V_y>=1,V_z>=V_y+1] 


Closed-form bounds of eval_foo_start(V_c,V_flag,V_x,V_y,V_z,B): 
-------------------------------------
* Chain [28] with precondition: [1>=V_x,V_x+1>=0,V_z>=V_y+1] 
    - Upper bound: 1 
    - Complexity: constant 
* Chain [27] with precondition: [0>=V_x+2,V_y>=1,V_z>=V_y+1] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [26] with precondition: [0>=V_y,V_z>=V_y+1] 
    - Upper bound: 1 
    - Complexity: constant 
* Chain [25] with precondition: [V_x>=2,V_y>=1,V_z>=V_y+1] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [24] with precondition: [V_y>=V_z] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [23]... with precondition: [0>=V_x+2,V_y>=1,V_z>=V_y+1] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [22]... with precondition: [V_x>=2,V_y>=1,V_z>=V_y+1] 
    - Upper bound: inf 
    - Complexity: infinity 

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