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


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


MAYBE

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

#### Computed strongly connected components 
0. recursive  : [f1/5]
1. non_recursive  : [exit_location/1]
2. non_recursive  : [f10000/3]
3. non_recursive  : [f2/3]
4. non_recursive  : [f1_loop_cont/4]
5. non_recursive  : [f0/3]

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

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

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


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

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

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


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


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

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

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


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


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

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

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


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

#### Cost of chains of f1(A,B,C,D,E):
* Chain [[9]]...: 1*it(9)+0
  with precondition: [A=B] 

* Chain [[9],11]: 1*it(9)+0
  with precondition: [C=2,A=B,D=E,D>=A+1] 

* Chain [[9],10]: 1*it(9)+0
  with precondition: [C=4,A=B] 

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

* Chain [10]: 0
  with precondition: [C=4,B=A] 


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

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

* Chain [12]: 0
  with precondition: [A=4] 


#### Cost of chains of f0(A,B,C):
* Chain [16]: 1*aux(1)+0
  with precondition: [B=A] 

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


Closed-form bounds of f0(A,B,C): 
-------------------------------------
* Chain [16] with precondition: [B=A] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [15]... with precondition: [B=A] 
    - Upper bound: inf 
    - Complexity: infinity 

### Maximum cost of f0(A,B,C): inf 
Asymptotic class: infinity 
* Total analysis performed in 76 ms.