/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  : [f15/22,f25/22]
1. non_recursive  : [exit_location/1]
2. recursive  : [f31/1]
3. non_recursive  : [f31_loop_cont/2]
4. non_recursive  : [f15_loop_cont/26]
5. recursive  : [f45/23,f46/23]
6. recursive  : [f36/28,f45_loop_cont/29]
7. recursive  : [f61/1]
8. non_recursive  : [f61_loop_cont/2]
9. non_recursive  : [f36_loop_cont/26]
10. non_recursive  : [f0/25]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into f15/22
1. SCC is completely evaluated into other SCCs
2. SCC is partially evaluated into f31/1
3. SCC is completely evaluated into other SCCs
4. SCC is partially evaluated into f15_loop_cont/26
5. SCC is partially evaluated into f45/23
6. SCC is partially evaluated into f36/28
7. SCC is partially evaluated into f61/1
8. SCC is completely evaluated into other SCCs
9. SCC is partially evaluated into f36_loop_cont/26
10. SCC is partially evaluated into f0/25

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

### Specialization of cost equations f15/22 
* CE 9 is refined into CE [31] 
* CE 10 is refined into CE [32] 
* CE 6 is refined into CE [33] 
* CE 7 is refined into CE [34] 
* CE 8 is refined into CE [35] 
* CE 4 is refined into CE [36] 
* CE 5 is refined into CE [37] 


### Cost equations --> "Loop" of f15/22 
* CEs [33] --> Loop 29 
* CEs [34] --> Loop 30 
* CEs [35] --> Loop 31 
* CEs [36] --> Loop 32 
* CEs [37] --> Loop 33 
* CEs [31] --> Loop 34 
* CEs [32] --> Loop 35 

### Ranking functions of CR f15(A,B,C,D,E,F,R,S,T,U,V,W,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1) 
* RF of phase [29,30,31,32,33]: [-C+R]

#### Partial ranking functions of CR f15(A,B,C,D,E,F,R,S,T,U,V,W,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1) 
* Partial RF of phase [29,30,31,32,33]:
  - RF of loop [29:1,30:1,31:1,32:1,33:1]:
    -C+R


### Specialization of cost equations f31/1 
* CE 20 is refined into CE [38] 
* CE 19 is refined into CE [39] 


### Cost equations --> "Loop" of f31/1 
* CEs [39] --> Loop 36 
* CEs [38] --> Loop 37 

### Ranking functions of CR f31(C1) 

#### Partial ranking functions of CR f31(C1) 


### Specialization of cost equations f15_loop_cont/26 
* CE 12 is refined into CE [40,41] 
* CE 11 is refined into CE [42] 


### Cost equations --> "Loop" of f15_loop_cont/26 
* CEs [40] --> Loop 38 
* CEs [42] --> Loop 39 
* CEs [41] --> Loop 40 

### Ranking functions of CR f15_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z) 

#### Partial ranking functions of CR f15_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z) 


### Specialization of cost equations f45/23 
* CE 28 is refined into CE [43] 
* CE 25 is refined into CE [44] 
* CE 26 is refined into CE [45] 
* CE 23 is refined into CE [46] 
* CE 24 is refined into CE [47] 
* CE 27 is refined into CE [48] 
* CE 21 is refined into CE [49] 
* CE 22 is refined into CE [50] 


### Cost equations --> "Loop" of f45/23 
* CEs [49] --> Loop 41 
* CEs [50] --> Loop 42 
* CEs [43] --> Loop 43 
* CEs [44] --> Loop 44 
* CEs [45] --> Loop 45 
* CEs [46] --> Loop 46 
* CEs [47] --> Loop 47 
* CEs [48] --> Loop 48 

### Ranking functions of CR f45(A,B,C,D,E,J,K,L,M,N,O,P,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1) 

#### Partial ranking functions of CR f45(A,B,C,D,E,J,K,L,M,N,O,P,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1) 


### Specialization of cost equations f36/28 
* CE 15 is refined into CE [51] 
* CE 13 is refined into CE [52,53,54] 
* CE 16 is refined into CE [55] 
* CE 14 is refined into CE [56,57,58,59,60,61,62,63,64] 


### Cost equations --> "Loop" of f36/28 
* CEs [64] --> Loop 49 
* CEs [63] --> Loop 50 
* CEs [62] --> Loop 51 
* CEs [61] --> Loop 52 
* CEs [56] --> Loop 53 
* CEs [60] --> Loop 54 
* CEs [59] --> Loop 55 
* CEs [58] --> Loop 56 
* CEs [57] --> Loop 57 
* CEs [51] --> Loop 58 
* CEs [52] --> Loop 59 
* CEs [53] --> Loop 60 
* CEs [55] --> Loop 61 
* CEs [54] --> Loop 62 

### Ranking functions of CR f36(A,B,C,D,E,H,I,J,K,L,M,N,O,P,Q,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1) 

#### Partial ranking functions of CR f36(A,B,C,D,E,H,I,J,K,L,M,N,O,P,Q,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1) 
* Partial RF of phase [49,50,51,52,53,54,55,56,57]:
  - RF of loop [50:1,51:1,52:1,53:1,54:1,55:1,56:1,57:1]:
    -C+H+1 depends on loops [49:1] 


### Specialization of cost equations f61/1 
* CE 30 is refined into CE [65] 
* CE 29 is refined into CE [66] 


### Cost equations --> "Loop" of f61/1 
* CEs [66] --> Loop 63 
* CEs [65] --> Loop 64 

### Ranking functions of CR f61(C1) 

#### Partial ranking functions of CR f61(C1) 


### Specialization of cost equations f36_loop_cont/26 
* CE 18 is refined into CE [67,68] 
* CE 17 is refined into CE [69] 


### Cost equations --> "Loop" of f36_loop_cont/26 
* CEs [67] --> Loop 65 
* CEs [69] --> Loop 66 
* CEs [68] --> Loop 67 

### Ranking functions of CR f36_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z) 

#### Partial ranking functions of CR f36_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z) 


### Specialization of cost equations f0/25 
* CE 1 is refined into CE [70,71,72,73,74,75] 
* CE 2 is refined into CE [76,77,78,79,80,81,82,83,84,85,86] 
* CE 3 is refined into CE [87,88,89,90,91,92,93,94,95,96,97] 


### Cost equations --> "Loop" of f0/25 
* CEs [83,94] --> Loop 68 
* CEs [73,75,80,82,84,85,86,91,93,95,96,97] --> Loop 69 
* CEs [77,88] --> Loop 70 
* CEs [70,71,72,74,76,78,79,81,87,89,90,92] --> Loop 71 

### Ranking functions of CR f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,C1) 

#### Partial ranking functions of CR f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,C1) 


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

#### Cost of chains of f15(A,B,C,D,E,F,R,S,T,U,V,W,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1):
* Chain [[29,30,31,32,33],35]: 5*it(29)+0
  Such that:aux(3) =< -C+R
it(29) =< aux(3)

  with precondition: [C1=3,C>=0,R>=C+1] 

* Chain [[29,30,31,32,33],34]: 5*it(29)+0
  Such that:aux(4) =< -C+D1
it(29) =< aux(4)

  with precondition: [C1=4,R=D1,J1=K1,J1=L1,C>=0,R>=C+1] 

* Chain [35]: 0
  with precondition: [C1=3,C>=0] 

* Chain [34]: 0
  with precondition: [C1=4,E1=D,F1=E,G1=F,H1=S,I1=T,J1=U,K1=V,L1=W,C=D1,C>=0,C>=R] 


#### Cost of chains of f31(C1):
* Chain [[36]]...: 1*it(36)+0
  with precondition: [C1=3] 

* Chain [[36],37]: 1*it(36)+0
  with precondition: [C1=3] 

* Chain [37]: 0
  with precondition: [C1=3] 


#### Cost of chains of f15_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z):
* Chain [40]...: 1*s(2)+0
  with precondition: [A=4,H=0,R=0,Y=1] 

* Chain [39]: 0
  with precondition: [A=3,H=0,R=0,Y=1] 

* Chain [38]: 1*s(3)+0
  with precondition: [A=4,H=0,R=0,Y=1] 


#### Cost of chains of f45(A,B,C,D,E,J,K,L,M,N,O,P,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1):
* Chain [[41,42]]...: 2*it(41)+0
  with precondition: [L=M,B>=A,C1>=2,3>=C1] 

* Chain [[41,42],48]: 2*it(41)+0
  with precondition: [C1=2,I1=0,J1=0,K1=0,L=M,C+1=D1,D=E1,E=F1,O=L1,B>=A] 

* Chain [[41,42],47]: 2*it(41)+0
  with precondition: [C1=2,F1=0,L=M,C+1=D1,J1=I1,J1=K1,0>=J1+1,B>=A] 

* Chain [[41,42],46]: 2*it(41)+0
  with precondition: [C1=2,F1=0,L=M,C+1=D1,J1=I1,J1=K1,J1>=1,B>=A] 

* Chain [[41,42],43]: 2*it(41)+0
  with precondition: [C1=3,L=M,B>=A] 

* Chain [48]: 0
  with precondition: [L=0,M=0,C1=2,I1=0,J1=0,K1=0,D1=C+1,E1=D,F1=E,G1=J,H1=K,L1=O,M1=P] 

* Chain [47]: 0
  with precondition: [C1=2,F1=0,D1=C+1,G1=J,H1=K,M=L,M1=P,M=I1,M=J1,M=K1,0>=M+1,B>=A] 

* Chain [46]: 0
  with precondition: [C1=2,F1=0,D1=C+1,G1=J,H1=K,M=L,M1=P,M=I1,M=J1,M=K1,M>=1,B>=A] 

* Chain [45]: 0
  with precondition: [C1=2,D1=C+1,E1=D,F1=E,G1=J,H1=K,M=L,L1=O,M1=P,M=I1,M=J1,M=K1,0>=M+1,A>=B+1] 

* Chain [44]: 0
  with precondition: [C1=2,D1=C+1,E1=D,F1=E,G1=J,H1=K,M=L,L1=O,M1=P,M=I1,M=J1,M=K1,M>=1,A>=B+1] 

* Chain [43]: 0
  with precondition: [C1=3,M=L] 


#### Cost of chains of f36(A,B,C,D,E,H,I,J,K,L,M,N,O,P,Q,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1):
* Chain [[49,50,51,52,53,54,55,56,57]]...: 17*it(49)+0
  with precondition: [H>=C,Q=0] 

* Chain [[49,50,51,52,53,54,55,56,57],62]...: 19*it(49)+0
  with precondition: [Q=0,C1=3,B>=A,H>=C] 

* Chain [[49,50,51,52,53,54,55,56,57],61]: 17*it(49)+0
  with precondition: [Q=0,C1=3,H>=C] 

* Chain [[49,50,51,52,53,54,55,56,57],60]: 19*it(49)+0
  with precondition: [Q=0,C1=3,B>=A,H>=C] 

* Chain [[49,50,51,52,53,54,55,56,57],59]: 17*it(49)+0
  with precondition: [Q=0,C1=3,H>=C] 

* Chain [[49,50,51,52,53,54,55,56,57],58]: 17*it(49)+0
  with precondition: [Q=0,C1=5,O1=0,H>=C,D1>=H+1] 

* Chain [62]...: 2*s(16)+0
  with precondition: [Q=0,C1=3,B>=A,H>=C] 

* Chain [61]: 0
  with precondition: [Q=0,C1=3] 

* Chain [60]: 2*s(17)+0
  with precondition: [Q=0,C1=3,B>=A,H>=C] 

* Chain [59]: 0
  with precondition: [Q=0,C1=3,H>=C] 

* Chain [58]: 0
  with precondition: [Q=0,C1=5,O1=0,E1=D,F1=E,G1=I,H1=J,I1=K,J1=L,K1=M,L1=N,M1=O,N1=P,C=D1,C>=H+1] 


#### Cost of chains of f61(C1):
* Chain [[63]]...: 1*it(63)+0
  with precondition: [C1=3] 

* Chain [[63],64]: 1*it(63)+0
  with precondition: [C1=3] 

* Chain [64]: 0
  with precondition: [C1=3] 


#### Cost of chains of f36_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z):
* Chain [67]...: 1*s(25)+0
  with precondition: [A=5,H=0] 

* Chain [66]: 0
  with precondition: [A=3,H=0] 

* Chain [65]: 1*s(26)+0
  with precondition: [A=5,H=0] 


#### Cost of chains of f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,C1):
* Chain [71]: 1*aux(10)+0
  with precondition: [] 

* Chain [70]: 1*aux(11)+0
  with precondition: [B>=A] 

* Chain [69]...: 1*aux(12)+0
  with precondition: [] 

* Chain [68]...: 1*aux(13)+0
  with precondition: [B>=A] 


Closed-form bounds of f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,C1): 
-------------------------------------
* Chain [71] with precondition: [] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [70] with precondition: [B>=A] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [69]... with precondition: [] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [68]... with precondition: [B>=A] 
    - Upper bound: inf 
    - Complexity: infinity 

### Maximum cost of f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,C1): inf 
Asymptotic class: infinity 
* Total analysis performed in 2211 ms.