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

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

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

### Specialization of cost equations f4/5 
* CE 9 is refined into CE [12] 
* CE 8 is refined into CE [13] 
* CE 4 is discarded (unfeasible) 
* CE 6 is refined into CE [14] 
* CE 5 is discarded (unfeasible) 
* CE 7 is refined into CE [15] 
* CE 2 is refined into CE [16] 
* CE 3 is refined into CE [17] 


### Cost equations --> "Loop" of f4/5 
* CEs [14] --> Loop 12 
* CEs [15] --> Loop 13 
* CEs [16] --> Loop 14 
* CEs [17] --> Loop 15 
* CEs [12] --> Loop 16 
* CEs [13] --> Loop 17 

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

#### Partial ranking functions of CR f4(A,B,D,E,F) 
* Partial RF of phase [12,13,14,15]:
  - RF of loop [12:1,13:1]:
    -B+4 depends on loops [14:1,15:1] 
  - RF of loop [14:1,15:1]:
    B/3-1 depends on loops [12:1,13:1] 


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


### Cost equations --> "Loop" of f4_loop_cont/4 
* CEs [18] --> Loop 18 
* CEs [19] --> Loop 19 

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

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


### Specialization of cost equations f0/3 
* CE 1 is refined into CE [20,21,22,23,24,25] 


### Cost equations --> "Loop" of f0/3 
* CEs [24,25] --> Loop 20 
* CEs [20,21,22,23] --> Loop 21 

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

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


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

#### Cost of chains of f4(A,B,D,E,F):
* Chain [[12,13,14,15]]...: 4*it(12)+0
  with precondition: [4>=B,B>=0] 

* Chain [[12,13,14,15],17]: 4*it(12)+0
  with precondition: [D=2,E=0,4>=B,4>=F,B>=0,F>=1] 

* Chain [[12,13,14,15],16]: 4*it(12)+0
  with precondition: [D=3,4>=B,B>=0] 

* Chain [17]: 0
  with precondition: [A=0,D=2,E=0,B=F,B>=0] 

* Chain [16]: 0
  with precondition: [D=3,B>=0] 


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

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


#### Cost of chains of f0(A,B,D):
* Chain [21]: 1*aux(13)+0
  with precondition: [] 

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


Closed-form bounds of f0(A,B,D): 
-------------------------------------
* Chain [21] with precondition: [] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [20]... with precondition: [] 
    - Upper bound: inf 
    - Complexity: infinity 

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