/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. recursive  : [f12/9]
1. non_recursive  : [exit_location/1]
2. recursive  : [f25/4]
3. non_recursive  : [f34/8]
4. non_recursive  : [f25_loop_cont/9]
5. non_recursive  : [f12_loop_cont/9]
6. non_recursive  : [f0/8]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into f12/9
1. SCC is completely evaluated into other SCCs
2. SCC is partially evaluated into f25/4
3. SCC is completely evaluated into other SCCs
4. SCC is partially evaluated into f25_loop_cont/9
5. SCC is partially evaluated into f12_loop_cont/9
6. SCC is partially evaluated into f0/8

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

### Specialization of cost equations f12/9 
* CE 3 is refined into CE [12] 
* CE 4 is refined into CE [13] 
* CE 2 is refined into CE [14] 


### Cost equations --> "Loop" of f12/9 
* CEs [14] --> Loop 12 
* CEs [12] --> Loop 13 
* CEs [13] --> Loop 14 

### Ranking functions of CR f12(C,D,E,F,G,K,L,M,N) 
* RF of phase [12]: [C-D]

#### Partial ranking functions of CR f12(C,D,E,F,G,K,L,M,N) 
* Partial RF of phase [12]:
  - RF of loop [12:1]:
    C-D


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


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

### Ranking functions of CR f25(E,F,K,L) 
* RF of phase [15]: [E-F]

#### Partial ranking functions of CR f25(E,F,K,L) 
* Partial RF of phase [15]:
  - RF of loop [15:1]:
    E-F


### Specialization of cost equations f25_loop_cont/9 
* CE 11 is refined into CE [18] 
* CE 10 is refined into CE [19] 


### Cost equations --> "Loop" of f25_loop_cont/9 
* CEs [18] --> Loop 18 
* CEs [19] --> Loop 19 

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

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


### Specialization of cost equations f12_loop_cont/9 
* CE 6 is refined into CE [20,21,22,23] 
* CE 5 is refined into CE [24] 


### Cost equations --> "Loop" of f12_loop_cont/9 
* CEs [20,23] --> Loop 20 
* CEs [21] --> Loop 21 
* CEs [22] --> Loop 22 
* CEs [24] --> Loop 23 

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

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


### Specialization of cost equations f0/8 
* CE 1 is refined into CE [25,26,27,28,29,30,31,32] 


### Cost equations --> "Loop" of f0/8 
* CEs [25,26,27,28,29,30,31,32] --> Loop 24 

### Ranking functions of CR f0(A,B,C,D,E,F,G,K) 

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


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

#### Cost of chains of f12(C,D,E,F,G,K,L,M,N):
* Chain [[12],14]: 1*it(12)+0
  Such that:it(12) =< C-D

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

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

  with precondition: [K=4,M=0,C=L,D>=0,C>=D+1] 

* Chain [14]: 0
  with precondition: [K=3,D>=0] 

* Chain [13]: 0
  with precondition: [K=4,M=0,D=L,D>=0,D>=C] 


#### Cost of chains of f25(E,F,K,L):
* Chain [[15],17]: 1*it(15)+0
  Such that:it(15) =< E-F

  with precondition: [K=2,E=L,E>=F+1] 

* Chain [[15],16]: 1*it(15)+0
  Such that:it(15) =< E-F

  with precondition: [K=3,E>=F+1] 

* Chain [17]: 0
  with precondition: [K=2,F=L,F>=E] 

* Chain [16]: 0
  with precondition: [K=3] 


#### Cost of chains of f25_loop_cont(A,B,C,D,E,F,G,H,I):
* Chain [19]: 0
  with precondition: [A=2,F=B] 

* Chain [18]: 0
  with precondition: [A=3,F=B] 


#### Cost of chains of f12_loop_cont(A,B,C,D,E,F,G,H,I):
* Chain [23]: 0
  with precondition: [A=3,F=B] 

* Chain [22]: 0
  with precondition: [A=4,F=B] 

* Chain [21]: 0
  with precondition: [A=4,F=B,G>=F] 

* Chain [20]: 2*s(1)+0
  Such that:aux(1) =< B-G
s(1) =< aux(1)

  with precondition: [A=4,F=B,F>=G+1] 


#### Cost of chains of f0(A,B,C,D,E,F,G,K):
* Chain [24]: 1*aux(2)+0
  with precondition: [] 


Closed-form bounds of f0(A,B,C,D,E,F,G,K): 
-------------------------------------
* Chain [24] with precondition: [] 
    - Upper bound: inf 
    - Complexity: infinity 

### Maximum cost of f0(A,B,C,D,E,F,G,K): inf 
Asymptotic class: infinity 
* Total analysis performed in 179 ms.