/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/3,eval_foo_bb2_in/3,eval_foo_bb3_in/3]
1. non_recursive  : [eval_foo_stop/1]
2. non_recursive  : [eval_foo_bb4_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/3]

#### 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/2
5. SCC is partially evaluated into eval_foo_start/3

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

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


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

### Ranking functions of CR eval_foo_bb1_in(V__01,V__0,B) 
* RF of phase [8,9]: [21*V__01-V__0-19]

#### Partial ranking functions of CR eval_foo_bb1_in(V__01,V__0,B) 
* Partial RF of phase [8,9]:
  - RF of loop [8:1]:
    -V__0+20 depends on loops [9:1] 
    V__01-V__0 depends on loops [9:1] 
  - RF of loop [9:1]:
    V__0 depends on loops [8:1] 
    V__01


### Specialization of cost equations eval_foo_bb0_in/2 
* CE 2 is refined into CE [13,14,15] 


### Cost equations --> "Loop" of eval_foo_bb0_in/2 
* CEs [15] --> Loop 13 
* CEs [14] --> Loop 14 
* CEs [13] --> Loop 15 

### 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/3 
* CE 1 is refined into CE [16,17,18] 


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

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

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


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

#### Cost of chains of eval_foo_bb1_in(V__01,V__0,B):
* Chain [[8,9],[10]]...: 1*it(8)+1*it(9)+1*it(10)+0
  Such that:it(9) =< V__01
aux(9) =< 21*V__01-V__0
it(8) =< aux(9)
it(9) =< aux(9)

  with precondition: [B=2,20>=V__01,V__01>=1,V__0>=0,V__01>=V__0] 

* Chain [12]: 0
  with precondition: [V__01=20,B=2,0>=V__0+1] 

* Chain [11]: 0
  with precondition: [V__01=20,B=2,V__0>=21] 


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

* Chain [14]: 0
  with precondition: [V_i>=21] 

* Chain [13]...: 1*s(1)+1*s(3)+1*s(4)+0
  Such that:s(1) =< 20
s(2) =< -V_i+420
s(3) =< s(2)
s(1) =< s(2)

  with precondition: [20>=V_i,V_i>=0] 


#### Cost of chains of eval_foo_start(V_i,V_range,B):
* Chain [18]: 0
  with precondition: [0>=V_i+1] 

* Chain [17]: 0
  with precondition: [V_i>=21] 

* Chain [16]...: 1*s(5)+1*s(7)+1*s(8)+0
  Such that:s(5) =< 20
s(6) =< -V_i+420
s(7) =< s(6)
s(5) =< s(6)

  with precondition: [20>=V_i,V_i>=0] 


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

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