/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  : [f25/9]
1. recursive  : [f15/11,f25_loop_cont/12,f41/11]
2. non_recursive  : [exit_location/1]
3. non_recursive  : [f48/9]
4. non_recursive  : [f15_loop_cont/10]
5. non_recursive  : [f0/9]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into f25/9
1. SCC is partially evaluated into f15/11
2. SCC is completely evaluated into other SCCs
3. SCC is completely evaluated into other SCCs
4. SCC is partially evaluated into f15_loop_cont/10
5. SCC is partially evaluated into f0/9

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

### Specialization of cost equations f25/9 
* CE 13 is refined into CE [14] 
* CE 12 is refined into CE [15] 
* CE 11 is refined into CE [16] 
* CE 10 is refined into CE [17] 


### Cost equations --> "Loop" of f25/9 
* CEs [17] --> Loop 14 
* CEs [14] --> Loop 15 
* CEs [15] --> Loop 16 
* CEs [16] --> Loop 17 

### Ranking functions of CR f25(E,F,G,H,K,L,M,N,O) 
* RF of phase [14]: [E-H]

#### Partial ranking functions of CR f25(E,F,G,H,K,L,M,N,O) 
* Partial RF of phase [14]:
  - RF of loop [14:1]:
    E-H


### Specialization of cost equations f15/11 
* CE 6 is refined into CE [18] 
* CE 2 is refined into CE [19,20] 
* CE 7 is refined into CE [21] 
* CE 5 is refined into CE [22,23] 
* CE 3 is refined into CE [24,25] 
* CE 4 is refined into CE [26] 


### Cost equations --> "Loop" of f15/11 
* CEs [25] --> Loop 18 
* CEs [26] --> Loop 19 
* CEs [23] --> Loop 20 
* CEs [24] --> Loop 21 
* CEs [22] --> Loop 22 
* CEs [18] --> Loop 23 
* CEs [20] --> Loop 24 
* CEs [19] --> Loop 25 
* CEs [21] --> Loop 26 

### Ranking functions of CR f15(A,B,E,F,G,H,K,L,M,N,O) 
* RF of phase [18,19,20,21,22]: [-F+10]

#### Partial ranking functions of CR f15(A,B,E,F,G,H,K,L,M,N,O) 
* Partial RF of phase [18,19,20,21,22]:
  - RF of loop [18:1]:
    E-1 depends on loops [20:1,22:1] 
  - RF of loop [18:1,19:1,20:1,21:1,22:1]:
    -F+10
  - RF of loop [20:1]:
    -E+35 depends on loops [18:1,21:1] 
  - RF of loop [22:1]:
    -E+2 depends on loops [18:1,21:1] 


### Specialization of cost equations f15_loop_cont/10 
* CE 8 is refined into CE [27] 
* CE 9 is refined into CE [28] 


### Cost equations --> "Loop" of f15_loop_cont/10 
* CEs [27] --> Loop 27 
* CEs [28] --> Loop 28 

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

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


### Specialization of cost equations f0/9 
* CE 1 is refined into CE [29,30,31,32,33,34] 


### Cost equations --> "Loop" of f0/9 
* CEs [29,30,31,32,33,34] --> Loop 29 

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

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


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

#### Cost of chains of f25(E,F,G,H,K,L,M,N,O):
* Chain [[14],17]: 1*it(14)+0
  Such that:it(14) =< -H+L

  with precondition: [K=2,E=L,F=M,E=O,9>=F,H>=1,E>=H+1] 

* Chain [[14],16]: 1*it(14)+0
  Such that:it(14) =< -H+L+1

  with precondition: [K=3,E=L+1,F+1=M,E=O,9>=F,H>=1,E>=H+1] 

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

  with precondition: [K=4,9>=F,H>=1,E>=H+1] 

* Chain [17]: 0
  with precondition: [K=2,N=G,E=L,F=M,H=O,9>=F,H>=1,H>=E] 

* Chain [16]: 0
  with precondition: [K=3,N=G,E=L+1,F+1=M,H=O,9>=F,H>=1,H>=E] 

* Chain [15]: 0
  with precondition: [K=4,9>=F,H>=1] 


#### Cost of chains of f15(A,B,E,F,G,H,K,L,M,N,O):
* Chain [[18,19,20,21,22],26]: 3*it(18)+2*it(21)+1*s(7)+1*s(8)+1*s(9)+0
  Such that:aux(3) =< E-F+8
aux(17) =< -35*F+350
aux(18) =< -F+10
it(21) =< aux(17)
s(9) =< aux(17)
it(18) =< aux(18)
it(21) =< aux(18)
aux(4) =< aux(3)+1
s(8) =< it(18)*aux(4)
s(7) =< it(18)*aux(3)

  with precondition: [A=10,B=35,K=4,9>=F,F>=0] 

* Chain [[18,19,20,21,22],25]: 3*it(18)+2*it(21)+1*s(7)+1*s(8)+1*s(9)+0
  Such that:aux(3) =< E-F+8
aux(14) =< -35*F+315
aux(13) =< -35*F+350
aux(16) =< -F+9
aux(15) =< -F+10
it(21) =< aux(13)
s(9) =< aux(13)
it(21) =< aux(14)
s(9) =< aux(14)
it(18) =< aux(15)
it(21) =< aux(15)
it(18) =< aux(16)
it(21) =< aux(16)
aux(4) =< aux(3)+1
s(8) =< it(18)*aux(4)
s(7) =< it(18)*aux(3)

  with precondition: [A=10,B=35,K=4,8>=F,F>=0] 

* Chain [[18,19,20,21,22],24]: 3*it(18)+2*it(21)+1*s(7)+1*s(8)+1*s(9)+1*s(10)+0
  Such that:aux(3) =< E-F+8
s(10) =< E-F+9
aux(14) =< -35*F+315
aux(13) =< -35*F+350
aux(16) =< -F+9
aux(15) =< -F+10
it(21) =< aux(13)
s(9) =< aux(13)
it(21) =< aux(14)
s(9) =< aux(14)
it(18) =< aux(15)
it(21) =< aux(15)
it(18) =< aux(16)
it(21) =< aux(16)
aux(4) =< aux(3)+1
s(8) =< it(18)*aux(4)
s(7) =< it(18)*aux(3)

  with precondition: [A=10,B=35,K=4,8>=F,F>=0,E+7>=F] 

* Chain [[18,19,20,21,22],23]: 3*it(18)+2*it(21)+1*s(7)+1*s(8)+1*s(9)+0
  Such that:aux(3) =< E-F+8
aux(19) =< -35*F+350
aux(20) =< -F+10
it(21) =< aux(19)
s(9) =< aux(19)
it(18) =< aux(20)
it(21) =< aux(20)
aux(4) =< aux(3)+1
s(8) =< it(18)*aux(4)
s(7) =< it(18)*aux(3)

  with precondition: [A=10,B=35,K=5,M=10,9>=F,O>=1,O+1>=L,L+10>=E+F,O+9>=E+F,E+10>=F+L] 

* Chain [26]: 0
  with precondition: [A=10,B=35,K=4,F>=0] 

* Chain [25]: 0
  with precondition: [A=10,B=35,K=4,9>=F,F>=0] 

* Chain [24]: 1*s(10)+0
  Such that:s(10) =< E

  with precondition: [A=10,B=35,K=4,9>=F,E>=2,F>=0] 


#### Cost of chains of f15_loop_cont(A,B,C,D,E,F,G,H,I,J):
* Chain [28]: 0
  with precondition: [A=4,B=10,C=35,D=285] 

* Chain [27]: 0
  with precondition: [A=5,B=10,C=35,D=285] 


#### Cost of chains of f0(A,B,C,D,E,F,G,H,K):
* Chain [29]: 1*aux(25)+0
  with precondition: [] 


Closed-form bounds of f0(A,B,C,D,E,F,G,H,K): 
-------------------------------------
* Chain [29] with precondition: [] 
    - Upper bound: inf 
    - Complexity: infinity 

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