/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  : [f1/11]
1. non_recursive  : [exit_location/1]
2. non_recursive  : [f300/9]
3. non_recursive  : [f1_loop_cont/10]
4. non_recursive  : [f2/9]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into f1/11
1. SCC is completely evaluated into other SCCs
2. SCC is completely evaluated into other SCCs
3. SCC is partially evaluated into f1_loop_cont/10
4. SCC is partially evaluated into f2/9

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

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


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

### Ranking functions of CR f1(A,B,C,D,E,F,L,M,N,O,P) 

#### Partial ranking functions of CR f1(A,B,C,D,E,F,L,M,N,O,P) 


### Specialization of cost equations f1_loop_cont/10 
* CE 7 is refined into CE [12] 
* CE 6 is refined into CE [13] 


### Cost equations --> "Loop" of f1_loop_cont/10 
* CEs [12] --> Loop 12 
* CEs [13] --> Loop 13 

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

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


### Specialization of cost equations f2/9 
* CE 1 is refined into CE [14,15,16,17,18,19,20,21] 


### Cost equations --> "Loop" of f2/9 
* CEs [20,21] --> Loop 14 
* CEs [18,19] --> Loop 15 
* CEs [17] --> Loop 16 
* CEs [16] --> Loop 17 
* CEs [14] --> Loop 18 
* CEs [15] --> Loop 19 

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

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


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

#### Cost of chains of f1(A,B,C,D,E,F,L,M,N,O,P):
* Chain [[9]]...: 1*it(9)+0
  with precondition: [B>=A+1] 

* Chain [[9],10]: 1*it(9)+0
  with precondition: [L=3,B>=A+1] 

* Chain [[8]]...: 1*it(8)+0
  with precondition: [A>=B+1] 

* Chain [[8],10]: 1*it(8)+0
  with precondition: [L=3,A>=B+1] 

* Chain [11]: 0
  with precondition: [L=2,B=A,O=E] 

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


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

* Chain [12]: 0
  with precondition: [A=3,C=B] 


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

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

* Chain [17]: 1*s(1)+0
  with precondition: [B>=A+1] 

* Chain [16]: 1*s(2)+0
  with precondition: [A>=B+1] 

* Chain [15]...: 1*aux(1)+0
  with precondition: [B>=A+1] 

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


Closed-form bounds of f2(A,B,C,D,E,F,G,H,L): 
-------------------------------------
* Chain [19] with precondition: [] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [18] with precondition: [B=A] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [17] with precondition: [B>=A+1] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [16] with precondition: [A>=B+1] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [15]... with precondition: [B>=A+1] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [14]... with precondition: [A>=B+1] 
    - Upper bound: inf 
    - Complexity: infinity 

### Maximum cost of f2(A,B,C,D,E,F,G,H,L): inf 
Asymptotic class: infinity 
* Total analysis performed in 134 ms.