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


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


MAYBE

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

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

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

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

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


### Cost equations --> "Loop" of eval_foo_bb1_in/3 
* 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__01,V__0,B) 

#### Partial ranking functions of CR eval_foo_bb1_in(V__01,V__0,B) 
* Partial RF of phase [10,11]:
  - RF of loop [10:1]:
    -V__0/2 depends on loops [11:1] 
    V__01/2 depends on loops [11:1] 
  - RF of loop [11:1]:
    V__0/2 depends on loops [10:1] 
    -V__01/2 depends on loops [10:1] 


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


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

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

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


### Specialization of cost equations eval_foo_start/4 
* CE 1 is refined into CE [20,21,22,23,24] 


### Cost equations --> "Loop" of eval_foo_start/4 
* CEs [24] --> Loop 20 
* CEs [23] --> Loop 21 
* CEs [22] --> Loop 22 
* CEs [21] --> Loop 23 
* CEs [20] --> Loop 24 

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

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


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

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

* Chain [[10,11]]...: 2*it(10)+0
  with precondition: [B=2] 

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

* Chain [14]: 0
  with precondition: [V__01=0,B=2] 

* Chain [13]: 0
  with precondition: [V__0=0,B=2] 


#### Cost of chains of eval_foo_bb0_in(V_i,V_j,B):
* Chain [19]: 0
  with precondition: [V_i=0] 

* Chain [18]: 0
  with precondition: [V_j=0] 

* Chain [17]...: 2*s(1)+0
  with precondition: [] 

* Chain [16]...: 1*s(2)+0
  with precondition: [0>=V_i+1,0>=V_j+1] 

* Chain [15]...: 1*s(3)+0
  with precondition: [V_i>=1,V_j>=1] 


#### Cost of chains of eval_foo_start(V_i,V_j,V_t,B):
* Chain [24]: 0
  with precondition: [V_i=0] 

* Chain [23]: 0
  with precondition: [V_j=0] 

* Chain [22]...: 2*s(4)+0
  with precondition: [] 

* Chain [21]...: 1*s(5)+0
  with precondition: [0>=V_i+1,0>=V_j+1] 

* Chain [20]...: 1*s(6)+0
  with precondition: [V_i>=1,V_j>=1] 


Closed-form bounds of eval_foo_start(V_i,V_j,V_t,B): 
-------------------------------------
* Chain [24] with precondition: [V_i=0] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [23] with precondition: [V_j=0] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [22]... with precondition: [] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [21]... with precondition: [0>=V_i+1,0>=V_j+1] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [20]... with precondition: [V_i>=1,V_j>=1] 
    - Upper bound: inf 
    - Complexity: infinity 

### Maximum cost of eval_foo_start(V_i,V_j,V_t,B): inf 
Asymptotic class: infinity 
* Total analysis performed in 183 ms.