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


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


MAYBE

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

#### Computed strongly connected components 
0. non_recursive  : [f0/7]
1. recursive  : [f2/9]
2. non_recursive  : [exit_location/1]
3. non_recursive  : [f2_loop_cont/8]
4. non_recursive  : [f4/7]

#### Obtained direct recursion through partial evaluation 
0. SCC is completely evaluated into other SCCs
1. SCC is partially evaluated into f2/9
2. SCC is completely evaluated into other SCCs
3. SCC is partially evaluated into f2_loop_cont/8
4. SCC is partially evaluated into f4/7

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

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


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

### Ranking functions of CR f2(A,B,C,D,I,J,K,L,M) 

#### Partial ranking functions of CR f2(A,B,C,D,I,J,K,L,M) 


### Specialization of cost equations f2_loop_cont/8 
* CE 9 is refined into CE [14] 
* CE 8 is refined into CE [15] 


### Cost equations --> "Loop" of f2_loop_cont/8 
* CEs [14] --> Loop 12 
* CEs [15] --> Loop 13 

### Ranking functions of CR f2_loop_cont(A,B,C,D,E,F,G,H) 

#### Partial ranking functions of CR f2_loop_cont(A,B,C,D,E,F,G,H) 


### Specialization of cost equations f4/7 
* CE 1 is refined into CE [16] 
* CE 2 is refined into CE [17,18,19,20,21,22] 
* CE 3 is refined into CE [23,24,25,26,27,28] 


### Cost equations --> "Loop" of f4/7 
* CEs [21,22,27,28] --> Loop 14 
* CEs [16,17,18,19,20,23,24,25,26] --> Loop 15 

### Ranking functions of CR f4(A,B,C,D,E,F,I) 

#### Partial ranking functions of CR f4(A,B,C,D,E,F,I) 


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

#### Cost of chains of f2(A,B,C,D,I,J,K,L,M):
* Chain [[8,9]]...: 2*it(8)+0
  with precondition: [B=C,A>=2] 

* Chain [[8,9],11]: 2*it(8)+0
  with precondition: [I=2,K=0,L=0,B=C,A>=2,J>=A+1] 

* Chain [[8,9],10]: 2*it(8)+0
  with precondition: [I=3,B=C,A>=2] 

* Chain [11]: 0
  with precondition: [I=2,K=0,L=0,C=B,A=J,A>=2] 

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


#### Cost of chains of f2_loop_cont(A,B,C,D,E,F,G,H):
* Chain [13]: 0
  with precondition: [A=2,G=F,G>=1] 

* Chain [12]: 0
  with precondition: [A=3,G=F,G>=1] 


#### Cost of chains of f4(A,B,C,D,E,F,I):
* Chain [15]: 1*aux(1)+0
  with precondition: [] 

* Chain [14]...: 1*aux(2)+0
  with precondition: [] 


Closed-form bounds of f4(A,B,C,D,E,F,I): 
-------------------------------------
* Chain [15] with precondition: [] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [14]... with precondition: [] 
    - Upper bound: inf 
    - Complexity: infinity 

### Maximum cost of f4(A,B,C,D,E,F,I): inf 
Asymptotic class: infinity 
* Total analysis performed in 163 ms.