/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  : [f4/3,f5/3]
1. non_recursive  : [exit_location/1]
2. non_recursive  : [f14/2]
3. non_recursive  : [f11/2]
4. non_recursive  : [f4_loop_cont/3]
5. non_recursive  : [f0/2]

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

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

### Specialization of cost equations f4/3 
* CE 4 is refined into CE [9] 
* CE 3 is refined into CE [10] 
* CE 2 is refined into CE [11] 


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

### Ranking functions of CR f4(A,C,D) 
* RF of phase [9]: [-A+3]

#### Partial ranking functions of CR f4(A,C,D) 
* Partial RF of phase [9]:
  - RF of loop [9:1]:
    -A+3


### Specialization of cost equations f11/2 
* CE 8 is refined into CE [12] 
* CE 7 is refined into CE [13] 


### Cost equations --> "Loop" of f11/2 
* CEs [12] --> Loop 12 
* CEs [13] --> Loop 13 

### Ranking functions of CR f11(A,C) 

#### Partial ranking functions of CR f11(A,C) 


### Specialization of cost equations f4_loop_cont/3 
* CE 6 is refined into CE [14] 
* CE 5 is refined into CE [15,16] 


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

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

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


### Specialization of cost equations f0/2 
* CE 1 is refined into CE [17,18,19,20,21] 


### Cost equations --> "Loop" of f0/2 
* CEs [17,18,19,20,21] --> Loop 17 

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

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


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

#### Cost of chains of f4(A,C,D):
* Chain [[9],11]: 1*it(9)+0
  Such that:it(9) =< -A+D

  with precondition: [C=2,3>=D,A>=0,D>=A+1] 

* Chain [[9],10]: 1*it(9)+0
  Such that:it(9) =< -A+3

  with precondition: [C=3,2>=A,A>=0] 

* Chain [11]: 0
  with precondition: [C=2,A=D,A>=0] 

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


#### Cost of chains of f11(A,C):
* Chain [13]: 0
  with precondition: [1>=A] 

* Chain [12]: 0
  with precondition: [A>=2] 


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

* Chain [15]: 0
  with precondition: [A=2,B>=2] 

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


#### Cost of chains of f0(A,C):
* Chain [17]: 7
  with precondition: [] 


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

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