/export/starexec/sandbox2/solver/bin/starexec_run_its /export/starexec/sandbox2/benchmark/theBenchmark.koat /export/starexec/sandbox2/output/output_files


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


WORST_CASE(?,O(1))  

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

#### Computed strongly connected components 
0. recursive  : [eval_easy1_bb1_in/4,eval_easy1_bb2_in/4]
1. non_recursive  : [eval_easy1_stop/3]
2. non_recursive  : [eval_easy1_bb3_in/3]
3. non_recursive  : [exit_location/1]
4. non_recursive  : [eval_easy1_bb1_in_loop_cont/4]
5. non_recursive  : [eval_easy1_6/3]
6. non_recursive  : [eval_easy1_5/3]
7. non_recursive  : [eval_easy1_4/3]
8. non_recursive  : [eval_easy1_3/3]
9. non_recursive  : [eval_easy1_2/3]
10. non_recursive  : [eval_easy1_1/3]
11. non_recursive  : [eval_easy1_bb0_in/3]
12. non_recursive  : [eval_easy1_start/3]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into eval_easy1_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_easy1_bb1_in_loop_cont/4
5. SCC is partially evaluated into eval_easy1_6/3
6. SCC is completely evaluated into other SCCs
7. SCC is completely evaluated into other SCCs
8. SCC is completely evaluated into other SCCs
9. SCC is completely evaluated into other SCCs
10. SCC is completely evaluated into other SCCs
11. SCC is completely evaluated into other SCCs
12. SCC is partially evaluated into eval_easy1_start/3

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

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


### Cost equations --> "Loop" of eval_easy1_bb1_in/4 
* CEs [12] --> Loop 10 
* CEs [13] --> Loop 11 
* CEs [14] --> Loop 12 
* CEs [10] --> Loop 13 
* CEs [11] --> Loop 14 

### Ranking functions of CR eval_easy1_bb1_in(V_0,V_x_0,B,C) 
* RF of phase [10]: [-V_x_0/2+20]
* RF of phase [11]: [-V_x_0/2+20]
* RF of phase [12]: [-V_x_0+40]

#### Partial ranking functions of CR eval_easy1_bb1_in(V_0,V_x_0,B,C) 
* Partial RF of phase [10]:
  - RF of loop [10:1]:
    -V_x_0/2+20
* Partial RF of phase [11]:
  - RF of loop [11:1]:
    -V_x_0/2+20
* Partial RF of phase [12]:
  - RF of loop [12:1]:
    -V_x_0+40


### Specialization of cost equations eval_easy1_bb1_in_loop_cont/4 
* CE 9 is refined into CE [15] 
* CE 8 is refined into CE [16] 


### Cost equations --> "Loop" of eval_easy1_bb1_in_loop_cont/4 
* CEs [15] --> Loop 15 
* CEs [16] --> Loop 16 

### Ranking functions of CR eval_easy1_bb1_in_loop_cont(A,B,C,D) 

#### Partial ranking functions of CR eval_easy1_bb1_in_loop_cont(A,B,C,D) 


### Specialization of cost equations eval_easy1_6/3 
* CE 2 is refined into CE [17,18,19,20,21,22,23] 


### Cost equations --> "Loop" of eval_easy1_6/3 
* CEs [20,22] --> Loop 17 
* CEs [19,21] --> Loop 18 
* CEs [17,18] --> Loop 19 
* CEs [23] --> Loop 20 

### Ranking functions of CR eval_easy1_6(V_0,V_x_0,B) 

#### Partial ranking functions of CR eval_easy1_6(V_0,V_x_0,B) 


### Specialization of cost equations eval_easy1_start/3 
* CE 1 is refined into CE [24,25,26,27] 


### Cost equations --> "Loop" of eval_easy1_start/3 
* CEs [24,25,26,27] --> Loop 21 

### Ranking functions of CR eval_easy1_start(V_0,V_x_0,B) 

#### Partial ranking functions of CR eval_easy1_start(V_0,V_x_0,B) 


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

#### Cost of chains of eval_easy1_bb1_in(V_0,V_x_0,B,C):
* Chain [[12],14]: 1*it(12)+0
  Such that:it(12) =< -V_x_0+40

  with precondition: [V_0=0,B=2,C=40,39>=V_x_0,V_x_0>=0] 

* Chain [[12],13]: 1*it(12)+0
  Such that:it(12) =< -V_x_0+40

  with precondition: [V_0=0,B=3,39>=V_x_0,V_x_0>=0] 

* Chain [[11],14]: 1*it(11)+0
  Such that:it(11) =< -V_x_0/2+20

  with precondition: [B=2,0>=V_0+1,41>=C,V_x_0>=0,C>=40,C>=V_x_0+2] 

* Chain [[11],13]: 1*it(11)+0
  Such that:it(11) =< -V_x_0/2+20

  with precondition: [B=3,0>=V_0+1,39>=V_x_0,V_x_0>=0] 

* Chain [[10],14]: 1*it(10)+0
  Such that:it(10) =< -V_x_0/2+20

  with precondition: [B=2,41>=C,V_0>=1,V_x_0>=0,C>=40,C>=V_x_0+2] 

* Chain [[10],13]: 1*it(10)+0
  Such that:it(10) =< -V_x_0/2+20

  with precondition: [B=3,39>=V_x_0,V_0>=1,V_x_0>=0] 

* Chain [13]: 0
  with precondition: [B=3,V_x_0>=0] 


#### Cost of chains of eval_easy1_bb1_in_loop_cont(A,B,C,D):
* Chain [16]: 0
  with precondition: [A=2] 

* Chain [15]: 0
  with precondition: [A=3] 


#### Cost of chains of eval_easy1_6(V_0,V_x_0,B):
* Chain [20]: 0
  with precondition: [] 

* Chain [19]: 80
  with precondition: [V_0=0] 

* Chain [18]: 40
  with precondition: [0>=V_0+1] 

* Chain [17]: 40
  with precondition: [V_0>=1] 


#### Cost of chains of eval_easy1_start(V_0,V_x_0,B):
* Chain [21]: 80
  with precondition: [] 


Closed-form bounds of eval_easy1_start(V_0,V_x_0,B): 
-------------------------------------
* Chain [21] with precondition: [] 
    - Upper bound: 80 
    - Complexity: constant 

### Maximum cost of eval_easy1_start(V_0,V_x_0,B): 80 
Asymptotic class: constant 
* Total analysis performed in 150 ms.