/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/6]
1. non_recursive  : [exit_location/1]
2. recursive  : [f27/3]
3. recursive  : [f42/1]
4. recursive  : [f55/1]
5. non_recursive  : [f66/7]
6. non_recursive  : [f55_loop_cont/8]
7. non_recursive  : [f42_loop_cont/8]
8. non_recursive  : [f27_loop_cont/8]
9. non_recursive  : [f12_loop_cont/8]
10. non_recursive  : [f0/7]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into f12/6
1. SCC is completely evaluated into other SCCs
2. SCC is partially evaluated into f27/3
3. SCC is partially evaluated into f42/1
4. SCC is partially evaluated into f55/1
5. SCC is completely evaluated into other SCCs
6. SCC is partially evaluated into f55_loop_cont/8
7. SCC is partially evaluated into f42_loop_cont/8
8. SCC is partially evaluated into f27_loop_cont/8
9. SCC is partially evaluated into f12_loop_cont/8
10. SCC is partially evaluated into f0/7

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

### Specialization of cost equations f12/6 
* CE 3 is refined into CE [22] 
* CE 4 is refined into CE [23] 
* CE 2 is refined into CE [24] 


### Cost equations --> "Loop" of f12/6 
* CEs [24] --> Loop 22 
* CEs [22] --> Loop 23 
* CEs [23] --> Loop 24 

### Ranking functions of CR f12(C,D,E,I,J,K) 
* RF of phase [22]: [C-D]

#### Partial ranking functions of CR f12(C,D,E,I,J,K) 
* Partial RF of phase [22]:
  - RF of loop [22:1]:
    C-D


### Specialization of cost equations f27/3 
* CE 8 is refined into CE [25] 
* CE 9 is refined into CE [26] 
* CE 7 is refined into CE [27] 


### Cost equations --> "Loop" of f27/3 
* CEs [27] --> Loop 25 
* CEs [25] --> Loop 26 
* CEs [26] --> Loop 27 

### Ranking functions of CR f27(F,I,J) 

#### Partial ranking functions of CR f27(F,I,J) 


### Specialization of cost equations f42/1 
* CE 13 is refined into CE [28] 
* CE 14 is refined into CE [29] 
* CE 12 is refined into CE [30] 


### Cost equations --> "Loop" of f42/1 
* CEs [30] --> Loop 28 
* CEs [28] --> Loop 29 
* CEs [29] --> Loop 30 

### Ranking functions of CR f42(I) 

#### Partial ranking functions of CR f42(I) 


### Specialization of cost equations f55/1 
* CE 19 is refined into CE [31] 
* CE 18 is refined into CE [32] 
* CE 17 is refined into CE [33] 


### Cost equations --> "Loop" of f55/1 
* CEs [33] --> Loop 31 
* CEs [31] --> Loop 32 
* CEs [32] --> Loop 33 

### Ranking functions of CR f55(I) 

#### Partial ranking functions of CR f55(I) 


### Specialization of cost equations f55_loop_cont/8 
* CE 21 is refined into CE [34] 
* CE 20 is refined into CE [35] 


### Cost equations --> "Loop" of f55_loop_cont/8 
* CEs [34] --> Loop 34 
* CEs [35] --> Loop 35 

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

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


### Specialization of cost equations f42_loop_cont/8 
* CE 16 is refined into CE [36,37,38,39] 
* CE 15 is refined into CE [40] 


### Cost equations --> "Loop" of f42_loop_cont/8 
* CEs [36,37] --> Loop 36 
* CEs [40] --> Loop 37 
* CEs [38,39] --> Loop 38 

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

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


### Specialization of cost equations f27_loop_cont/8 
* CE 11 is refined into CE [41,42,43,44,45,46] 
* CE 10 is refined into CE [47] 


### Cost equations --> "Loop" of f27_loop_cont/8 
* CEs [41,42] --> Loop 39 
* CEs [47] --> Loop 40 
* CEs [43,44,45,46] --> Loop 41 

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

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


### Specialization of cost equations f12_loop_cont/8 
* CE 6 is refined into CE [48,49,50,51,52,53,54,55] 
* CE 5 is refined into CE [56] 


### Cost equations --> "Loop" of f12_loop_cont/8 
* CEs [48,49,51] --> Loop 42 
* CEs [56] --> Loop 43 
* CEs [50,52,53,54,55] --> Loop 44 

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

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


### Specialization of cost equations f0/7 
* CE 1 is refined into CE [57,58,59,60,61,62] 


### Cost equations --> "Loop" of f0/7 
* CEs [60,62] --> Loop 45 
* CEs [57,58,59,61] --> Loop 46 

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

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


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

#### Cost of chains of f12(C,D,E,I,J,K):
* Chain [[22],24]: 1*it(22)+0
  Such that:it(22) =< C-D

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

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

  with precondition: [I=6,C=J,D>=0,C>=D+1] 

* Chain [24]: 0
  with precondition: [I=3,D>=0] 

* Chain [23]: 0
  with precondition: [I=6,K=E,D=J,D>=0,D>=C] 


#### Cost of chains of f27(F,I,J):
* Chain [[25]]...: 1*it(25)+0
  with precondition: [] 

* Chain [[25],27]: 1*it(25)+0
  with precondition: [I=3] 

* Chain [[25],26]: 1*it(25)+0
  with precondition: [I=5] 

* Chain [27]: 0
  with precondition: [I=3] 

* Chain [26]: 0
  with precondition: [I=5,J=F] 


#### Cost of chains of f42(I):
* Chain [[28]]...: 1*it(28)+0
  with precondition: [] 

* Chain [[28],30]: 1*it(28)+0
  with precondition: [I=3] 

* Chain [[28],29]: 1*it(28)+0
  with precondition: [I=4] 

* Chain [30]: 0
  with precondition: [I=3] 

* Chain [29]: 0
  with precondition: [I=4] 


#### Cost of chains of f55(I):
* Chain [[31]]...: 1*it(31)+0
  with precondition: [] 

* Chain [[31],33]: 1*it(31)+0
  with precondition: [I=2] 

* Chain [[31],32]: 1*it(31)+0
  with precondition: [I=3] 

* Chain [33]: 0
  with precondition: [I=2] 

* Chain [32]: 0
  with precondition: [I=3] 


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

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


#### Cost of chains of f42_loop_cont(A,B,C,D,E,F,G,H):
* Chain [38]...: 1*aux(6)+0
  with precondition: [A=4,C=B,C=D] 

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

* Chain [36]: 1*aux(7)+0
  with precondition: [A=4,C=B,C=D] 


#### Cost of chains of f27_loop_cont(A,B,C,D,E,F,G,H):
* Chain [41]...: 1*aux(8)+0
  with precondition: [A=5,C=B,C=D] 

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

* Chain [39]: 1*aux(9)+0
  with precondition: [A=5,C=B,C=D] 


#### Cost of chains of f12_loop_cont(A,B,C,D,E,F,G,H):
* Chain [44]...: 1*aux(10)+0
  with precondition: [A=6,C=B,C=D] 

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

* Chain [42]: 1*aux(11)+0
  with precondition: [A=6,C=B,C=D] 


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

* Chain [45]...: 1*aux(13)+0
  with precondition: [] 


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

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