/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  : [f2/2]
1. non_recursive  : [exit_location/1]
2. non_recursive  : [f2_loop_cont/2]
3. recursive  : [f3/5]
4. recursive  : [f5/2]
5. non_recursive  : [f5_loop_cont/2]
6. non_recursive  : [f3_loop_cont/5]
7. non_recursive  : [f0/4]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into f2/2
1. SCC is completely evaluated into other SCCs
2. SCC is completely evaluated into other SCCs
3. SCC is partially evaluated into f3/5
4. SCC is partially evaluated into f5/2
5. SCC is completely evaluated into other SCCs
6. SCC is partially evaluated into f3_loop_cont/5
7. SCC is partially evaluated into f0/4

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

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


### Cost equations --> "Loop" of f2/2 
* CEs [13] --> Loop 12 
* CEs [12] --> Loop 13 

### Ranking functions of CR f2(A,D) 

#### Partial ranking functions of CR f2(A,D) 


### Specialization of cost equations f3/5 
* CE 6 is refined into CE [14] 
* CE 7 is refined into CE [15] 
* CE 5 is refined into CE [16] 


### Cost equations --> "Loop" of f3/5 
* CEs [16] --> Loop 14 
* CEs [14] --> Loop 15 
* CEs [15] --> Loop 16 

### Ranking functions of CR f3(A,B,D,E,F) 
* RF of phase [14]: [B]

#### Partial ranking functions of CR f3(A,B,D,E,F) 
* Partial RF of phase [14]:
  - RF of loop [14:1]:
    B


### Specialization of cost equations f5/2 
* CE 11 is refined into CE [17] 
* CE 10 is refined into CE [18] 


### Cost equations --> "Loop" of f5/2 
* CEs [18] --> Loop 17 
* CEs [17] --> Loop 18 

### Ranking functions of CR f5(C,D) 

#### Partial ranking functions of CR f5(C,D) 


### Specialization of cost equations f3_loop_cont/5 
* CE 9 is refined into CE [19,20] 
* CE 8 is refined into CE [21] 


### Cost equations --> "Loop" of f3_loop_cont/5 
* CEs [19] --> Loop 19 
* CEs [21] --> Loop 20 
* CEs [20] --> Loop 21 

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

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


### Specialization of cost equations f0/4 
* CE 1 is refined into CE [22,23] 
* CE 2 is refined into CE [24,25,26,27,28,29] 


### Cost equations --> "Loop" of f0/4 
* CEs [23] --> Loop 22 
* CEs [27] --> Loop 23 
* CEs [29] --> Loop 24 
* CEs [22] --> Loop 25 
* CEs [25,26] --> Loop 26 
* CEs [24] --> Loop 27 
* CEs [28] --> Loop 28 

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

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


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

#### Cost of chains of f2(A,D):
* Chain [[12]]...: 1*it(12)+0
  with precondition: [A>=0,D=2] 

* Chain [[12],13]: 1*it(12)+0
  with precondition: [D=2,A>=0] 

* Chain [13]: 0
  with precondition: [D=2,A>=0] 


#### Cost of chains of f3(A,B,D,E,F):
* Chain [[14],16]: 1*it(14)+0
  Such that:it(14) =< B

  with precondition: [A=0,D=2,B>=1] 

* Chain [[14],15]: 1*it(14)+0
  Such that:it(14) =< B

  with precondition: [A=0,D=3,E=0,F=0,B>=1] 

* Chain [16]: 0
  with precondition: [A=0,D=2] 

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


#### Cost of chains of f5(C,D):
* Chain [[17]]...: 1*it(17)+0
  with precondition: [1>=C,D=2] 

* Chain [[17],18]: 1*it(17)+0
  with precondition: [D=2,1>=C] 

* Chain [18]: 0
  with precondition: [D=2,1>=C] 


#### Cost of chains of f3_loop_cont(A,B,C,D,E):
* Chain [21]...: 1*s(3)+0
  with precondition: [A=3,0>=D] 

* Chain [20]: 0
  with precondition: [A=2,0>=D] 

* Chain [19]: 1*s(4)+0
  with precondition: [A=3,0>=D] 


#### Cost of chains of f0(A,B,C,D):
* Chain [28]: 1*s(5)+0
  with precondition: [0>=B,0>=C] 

* Chain [27]: 0
  with precondition: [0>=C] 

* Chain [26]: 2*s(6)+1*s(8)+0
  Such that:aux(3) =< B
s(6) =< aux(3)

  with precondition: [0>=C,B>=1] 

* Chain [25]: 1*s(9)+0
  with precondition: [C>=1] 

* Chain [24]...: 1*s(10)+0
  with precondition: [0>=B,0>=C] 

* Chain [23]...: 1*s(11)+1*s(12)+0
  Such that:s(11) =< B

  with precondition: [0>=C,B>=1] 

* Chain [22]...: 1*s(13)+0
  with precondition: [C>=1] 


Closed-form bounds of f0(A,B,C,D): 
-------------------------------------
* Chain [28] with precondition: [0>=B,0>=C] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [27] with precondition: [0>=C] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [26] with precondition: [0>=C,B>=1] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [25] with precondition: [C>=1] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [24]... with precondition: [0>=B,0>=C] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [23]... with precondition: [0>=C,B>=1] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [22]... with precondition: [C>=1] 
    - Upper bound: inf 
    - Complexity: infinity 

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