/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  : [f5/5]
1. non_recursive  : [exit_location/1]
2. non_recursive  : [f8/3]
3. non_recursive  : [f5_loop_cont/4]
4. non_recursive  : [f0/3]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into f5/5
1. SCC is completely evaluated into other SCCs
2. SCC is completely evaluated into other SCCs
3. SCC is partially evaluated into f5_loop_cont/4
4. SCC is partially evaluated into f0/3

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

### Specialization of cost equations f5/5 
* CE 4 is refined into CE [7] 
* CE 3 is refined into CE [8] 
* CE 2 is refined into CE [9] 


### Cost equations --> "Loop" of f5/5 
* CEs [9] --> Loop 7 
* CEs [7] --> Loop 8 
* CEs [8] --> Loop 9 

### Ranking functions of CR f5(A,B,C,D,E) 
* RF of phase [7]: [-A/2+10,-B/2+11]

#### Partial ranking functions of CR f5(A,B,C,D,E) 
* Partial RF of phase [7]:
  - RF of loop [7:1]:
    -A/2+10
    -B/2+11


### Specialization of cost equations f5_loop_cont/4 
* CE 6 is refined into CE [10] 
* CE 5 is refined into CE [11] 


### Cost equations --> "Loop" of f5_loop_cont/4 
* CEs [10] --> Loop 10 
* CEs [11] --> Loop 11 

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

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


### Specialization of cost equations f0/3 
* CE 1 is refined into CE [12,13,14] 


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

### Ranking functions of CR f0(A,B,C) 

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


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

#### Cost of chains of f5(A,B,C,D,E):
* Chain [[7],9]: 1*it(7)+0
  Such that:it(7) =< -A/2+10

  with precondition: [C=2,B=A+2,D+2=E,21>=D,B>=4,D>=20,D>=B] 

* Chain [[7],8]: 1*it(7)+0
  Such that:it(7) =< -B/2+11

  with precondition: [C=3,B=A+2,21>=B,B>=4] 

* Chain [8]: 0
  with precondition: [C=3,A+2=B,A>=2] 


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

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


#### Cost of chains of f0(A,B,C):
* Chain [12]: 18
  with precondition: [] 


Closed-form bounds of f0(A,B,C): 
-------------------------------------
* Chain [12] with precondition: [] 
    - Upper bound: 18 
    - Complexity: constant 

### Maximum cost of f0(A,B,C): 18 
Asymptotic class: constant 
* Total analysis performed in 70 ms.