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


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


WORST_CASE(?,O(n^1))  

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

#### Computed strongly connected components 
0. recursive  : [eval_t19_bb1_in/3,eval_t19_bb2_in/3]
1. recursive  : [eval_t19_bb4_in/2,eval_t19_bb5_in/2]
2. non_recursive  : [eval_t19_stop/1]
3. non_recursive  : [eval_t19_bb6_in/1]
4. non_recursive  : [eval_t19_bb4_in_loop_cont/2]
5. non_recursive  : [eval_t19_bb3_in/3]
6. non_recursive  : [eval_t19_bb1_in_loop_cont/4]
7. non_recursive  : [eval_t19_bb0_in/3]
8. non_recursive  : [eval_t19_start/3]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into eval_t19_bb1_in/3
1. SCC is partially evaluated into eval_t19_bb4_in/2
2. SCC is completely evaluated into other SCCs
3. SCC is completely evaluated into other SCCs
4. SCC is completely evaluated into other SCCs
5. SCC is partially evaluated into eval_t19_bb3_in/3
6. SCC is completely evaluated into other SCCs
7. SCC is partially evaluated into eval_t19_bb0_in/3
8. SCC is partially evaluated into eval_t19_start/3

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

### Specialization of cost equations eval_t19_bb1_in/3 
* CE 4 is refined into CE [8] 
* CE 3 is refined into CE [9] 


### Cost equations --> "Loop" of eval_t19_bb1_in/3 
* CEs [9] --> Loop 8 
* CEs [8] --> Loop 9 

### Ranking functions of CR eval_t19_bb1_in(V__0,B,C) 
* RF of phase [8]: [V__0-100]

#### Partial ranking functions of CR eval_t19_bb1_in(V__0,B,C) 
* Partial RF of phase [8]:
  - RF of loop [8:1]:
    V__0-100


### Specialization of cost equations eval_t19_bb4_in/2 
* CE 7 is refined into CE [10] 
* CE 6 is refined into CE [11] 


### Cost equations --> "Loop" of eval_t19_bb4_in/2 
* CEs [11] --> Loop 10 
* CEs [10] --> Loop 11 

### Ranking functions of CR eval_t19_bb4_in(V__1,B) 
* RF of phase [10]: [V__1+1]

#### Partial ranking functions of CR eval_t19_bb4_in(V__1,B) 
* Partial RF of phase [10]:
  - RF of loop [10:1]:
    V__1+1


### Specialization of cost equations eval_t19_bb3_in/3 
* CE 5 is refined into CE [12,13] 


### Cost equations --> "Loop" of eval_t19_bb3_in/3 
* CEs [13] --> Loop 12 
* CEs [12] --> Loop 13 

### Ranking functions of CR eval_t19_bb3_in(V_k,V__0,B) 

#### Partial ranking functions of CR eval_t19_bb3_in(V_k,V__0,B) 


### Specialization of cost equations eval_t19_bb0_in/3 
* CE 2 is refined into CE [14,15,16,17] 


### Cost equations --> "Loop" of eval_t19_bb0_in/3 
* CEs [15] --> Loop 14 
* CEs [14] --> Loop 15 
* CEs [17] --> Loop 16 
* CEs [16] --> Loop 17 

### Ranking functions of CR eval_t19_bb0_in(V_i,V_k,B) 

#### Partial ranking functions of CR eval_t19_bb0_in(V_i,V_k,B) 


### Specialization of cost equations eval_t19_start/3 
* CE 1 is refined into CE [18,19,20,21] 


### Cost equations --> "Loop" of eval_t19_start/3 
* CEs [21] --> Loop 18 
* CEs [20] --> Loop 19 
* CEs [19] --> Loop 20 
* CEs [18] --> Loop 21 

### Ranking functions of CR eval_t19_start(V_i,V_k,B) 

#### Partial ranking functions of CR eval_t19_start(V_i,V_k,B) 


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

#### Cost of chains of eval_t19_bb1_in(V__0,B,C):
* Chain [[8],9]: 1*it(8)+0
  Such that:it(8) =< V__0

  with precondition: [B=2,C=100,V__0>=101] 

* Chain [9]: 0
  with precondition: [B=2,V__0=C,100>=V__0] 


#### Cost of chains of eval_t19_bb4_in(V__1,B):
* Chain [[10],11]: 1*it(10)+0
  Such that:it(10) =< V__1+1

  with precondition: [B=3,V__1>=0] 

* Chain [11]: 0
  with precondition: [B=3,0>=V__1+1] 


#### Cost of chains of eval_t19_bb3_in(V_k,V__0,B):
* Chain [13]: 0
  with precondition: [0>=V__0+V_k+51] 

* Chain [12]: 1*s(1)+0
  Such that:s(1) =< V_k+V__0+51

  with precondition: [V__0+V_k+50>=0] 


#### Cost of chains of eval_t19_bb0_in(V_i,V_k,B):
* Chain [17]: 0
  with precondition: [100>=V_i,0>=V_i+V_k+51] 

* Chain [16]: 1*s(2)+0
  Such that:s(2) =< V_i+V_k+51

  with precondition: [100>=V_i,V_i+V_k+50>=0] 

* Chain [15]: 1*s(3)+0
  Such that:s(3) =< V_i

  with precondition: [0>=V_k+151,V_i>=101] 

* Chain [14]: 1*s(4)+1*s(5)+0
  Such that:s(4) =< V_i
s(5) =< V_k+151

  with precondition: [V_i>=101,V_k+150>=0] 


#### Cost of chains of eval_t19_start(V_i,V_k,B):
* Chain [21]: 0
  with precondition: [100>=V_i,0>=V_i+V_k+51] 

* Chain [20]: 1*s(6)+0
  Such that:s(6) =< V_i+V_k+51

  with precondition: [100>=V_i,V_i+V_k+50>=0] 

* Chain [19]: 1*s(7)+0
  Such that:s(7) =< V_i

  with precondition: [0>=V_k+151,V_i>=101] 

* Chain [18]: 1*s(8)+1*s(9)+0
  Such that:s(8) =< V_i
s(9) =< V_k+151

  with precondition: [V_i>=101,V_k+150>=0] 


Closed-form bounds of eval_t19_start(V_i,V_k,B): 
-------------------------------------
* Chain [21] with precondition: [100>=V_i,0>=V_i+V_k+51] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [20] with precondition: [100>=V_i,V_i+V_k+50>=0] 
    - Upper bound: V_i+V_k+51 
    - Complexity: n 
* Chain [19] with precondition: [0>=V_k+151,V_i>=101] 
    - Upper bound: V_i 
    - Complexity: n 
* Chain [18] with precondition: [V_i>=101,V_k+150>=0] 
    - Upper bound: V_i+V_k+151 
    - Complexity: n 

### Maximum cost of eval_t19_start(V_i,V_k,B): max([nat(V_i+V_k+51),nat(V_k+151)+nat(V_i)]) 
Asymptotic class: n 
* Total analysis performed in 84 ms.