/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  : [f16/49]
1. recursive  : [f16_loop_cont/66,f3/65]
2. non_recursive  : [exit_location/1]
3. non_recursive  : [f18/33]
4. non_recursive  : [f22/33]
5. non_recursive  : [f25/33]
6. non_recursive  : [f3_loop_cont/34]
7. non_recursive  : [f33/33]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into f16/49
1. SCC is partially evaluated into f3/65
2. SCC is completely evaluated into other SCCs
3. SCC is completely evaluated into other SCCs
4. SCC is completely evaluated into other SCCs
5. SCC is completely evaluated into other SCCs
6. SCC is partially evaluated into f3_loop_cont/34
7. SCC is partially evaluated into f33/33

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

### Specialization of cost equations f16/49 
* CE 20 is refined into CE [21] 
* CE 18 is refined into CE [22] 
* CE 19 is refined into CE [23] 
* CE 17 is refined into CE [24] 
* CE 16 is refined into CE [25] 


### Cost equations --> "Loop" of f16/49 
* CEs [25] --> Loop 20 
* CEs [21] --> Loop 21 
* CEs [22] --> Loop 22 
* CEs [23] --> Loop 23 
* CEs [24] --> Loop 24 

### Ranking functions of CR f16(A,B,F,G,H,I,J,K,L,M,O,P,Q,R,U,V,W,X,Y,Z,A1,B1,C1,D1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2,U2) 

#### Partial ranking functions of CR f16(A,B,F,G,H,I,J,K,L,M,O,P,Q,R,U,V,W,X,Y,Z,A1,B1,C1,D1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2,U2) 


### Specialization of cost equations f3/65 
* CE 8 is refined into CE [26] 
* CE 9 is refined into CE [27] 
* CE 2 is refined into CE [28,29,30] 
* CE 3 is refined into CE [31,32,33] 
* CE 11 is refined into CE [34] 
* CE 7 is refined into CE [35,36,37] 
* CE 6 is refined into CE [38,39,40] 
* CE 10 is refined into CE [41] 
* CE 5 is refined into CE [42,43,44,45,46] 
* CE 4 is refined into CE [47,48,49,50,51] 


### Cost equations --> "Loop" of f3/65 
* CEs [46] --> Loop 25 
* CEs [51] --> Loop 26 
* CEs [45] --> Loop 27 
* CEs [44] --> Loop 28 
* CEs [43] --> Loop 29 
* CEs [42] --> Loop 30 
* CEs [50] --> Loop 31 
* CEs [49] --> Loop 32 
* CEs [48] --> Loop 33 
* CEs [47] --> Loop 34 
* CEs [26] --> Loop 35 
* CEs [27] --> Loop 36 
* CEs [32] --> Loop 37 
* CEs [29] --> Loop 38 
* CEs [28] --> Loop 39 
* CEs [31,34] --> Loop 40 
* CEs [36] --> Loop 41 
* CEs [35] --> Loop 42 
* CEs [39] --> Loop 43 
* CEs [38] --> Loop 44 
* CEs [41] --> Loop 45 
* CEs [33] --> Loop 46 
* CEs [30] --> Loop 47 
* CEs [37] --> Loop 48 
* CEs [40] --> Loop 49 

### Ranking functions of CR f3(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,A1,B1,C1,D1,E1,F1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3,B3,C3) 

#### Partial ranking functions of CR f3(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,A1,B1,C1,D1,E1,F1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3,B3,C3) 


### Specialization of cost equations f3_loop_cont/34 
* CE 13 is refined into CE [52] 
* CE 12 is refined into CE [53] 
* CE 14 is refined into CE [54] 
* CE 15 is refined into CE [55] 


### Cost equations --> "Loop" of f3_loop_cont/34 
* CEs [52] --> Loop 50 
* CEs [53] --> Loop 51 
* CEs [54] --> Loop 52 
* CEs [55] --> Loop 53 

### Ranking functions of CR f3_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,A1,B1,C1,D1,E1,F1,G1,H1) 

#### Partial ranking functions of CR f3_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,A1,B1,C1,D1,E1,F1,G1,H1) 


### Specialization of cost equations f33/33 
* CE 1 is refined into CE [56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80] 


### Cost equations --> "Loop" of f33/33 
* CEs [76,80] --> Loop 54 
* CEs [75,79] --> Loop 55 
* CEs [71,72,73,74,77,78] --> Loop 56 
* CEs [59] --> Loop 57 
* CEs [60,65] --> Loop 58 
* CEs [67] --> Loop 59 
* CEs [57] --> Loop 60 
* CEs [58,64] --> Loop 61 
* CEs [63] --> Loop 62 
* CEs [66] --> Loop 63 
* CEs [56] --> Loop 64 
* CEs [61,62,68,69,70] --> Loop 65 

### Ranking functions of CR f33(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,A1,B1,C1,D1,E1,F1,W1) 

#### Partial ranking functions of CR f33(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,A1,B1,C1,D1,E1,F1,W1) 


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

#### Cost of chains of f16(A,B,F,G,H,I,J,K,L,M,O,P,Q,R,U,V,W,X,Y,Z,A1,B1,C1,D1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2,U2):
* Chain [[20]]...: 1*it(20)+0
  with precondition: [F=K,F=I,F=H,F=G,A>=0,Q>=J+1,W1>=2,4>=W1] 

* Chain [[20],24]: 1*it(20)+0
  with precondition: [W1=2,G2=0,H2=0,K2=0,F=G,F=H,F=I,F=K,B=Y1,Z1=A2,Z1=B2,Z1=C2,Z1=E2,L=F2,A1=R2,B1=S2,C1=T2,D1=U2,A>=0,X1>=0,Q>=J+1] 

* Chain [[20],23]: 1*it(20)+0
  with precondition: [W1=3,G2=0,F=G,F=H,F=I,F=K,Z1=A2,Z1=B2,Z1=C2,0>=R2+1,A>=0,Q>=J+1] 

* Chain [[20],22]: 1*it(20)+0
  with precondition: [W1=3,G2=0,F=G,F=H,F=I,F=K,Z1=A2,Z1=B2,Z1=C2,A>=0,R2>=1,Q>=J+1] 

* Chain [[20],21]: 1*it(20)+0
  with precondition: [W1=4,F=G,F=H,F=I,F=K,A>=0,Q>=J+1] 

* Chain [24]: 0
  with precondition: [W1=2,G2=0,H2=0,K2=0,Y1=B,F=G,F=H,F=I,F=K,F2=L,L2=U,M2=V,N2=W,O2=X,P2=Y,R2=A1,S2=B1,T2=C1,U2=D1,F=Z1,F=A2,F=B2,F=C2,F=E2,A>=0,X1>=0,J>=Q] 

* Chain [23]: 0
  with precondition: [W1=3,G2=0,F=G,F=H,F=I,F=K,L2=U,M2=V,N2=W,O2=X,P2=Y,F=Z1,F=A2,F=B2,F=C2,0>=R2+1,A>=0,J>=Q] 

* Chain [22]: 0
  with precondition: [W1=3,G2=0,F=G,F=H,F=I,F=K,L2=U,M2=V,N2=W,O2=X,P2=Y,F=Z1,F=A2,F=B2,F=C2,A>=0,R2>=1,J>=Q] 

* Chain [21]: 0
  with precondition: [W1=4,F=G,F=H,F=I,F=K] 


#### Cost of chains of f3(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,A1,B1,C1,D1,E1,F1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3,B3,C3):
* Chain [[25,26,27,28,29,30,31,32,33,34]]...: 16*it(25)+0
  with precondition: [] 

* Chain [[25,26,27,28,29,30,31,32,33,34],49]...: 17*it(25)+0
  with precondition: [W1=2,C=Z1,D=A2,N=K2,S=P2,T=Q2,E1=B3,F1=C3] 

* Chain [[25,26,27,28,29,30,31,32,33,34],48]...: 17*it(25)+0
  with precondition: [W1=2,C=Z1,D=A2,N=K2,S=P2,T=Q2,E1=B3,F1=C3] 

* Chain [[25,26,27,28,29,30,31,32,33,34],47]...: 17*it(25)+0
  with precondition: [W1=4] 

* Chain [[25,26,27,28,29,30,31,32,33,34],46]...: 17*it(25)+0
  with precondition: [W1=4] 

* Chain [[25,26,27,28,29,30,31,32,33,34],45]: 16*it(25)+0
  with precondition: [W1=6,Z1=0,A2=0,Y1=F2,Y1=I2,Y1=J2,Y1=K2,S=P2,T=Q2,E1=B3,F1=C3] 

* Chain [[25,26,27,28,29,30,31,32,33,34],44]: 16*it(25)+0
  with precondition: [W1=2,J2=0,L2=0,O2=0,C=Z1,D=A2,C2=D2,C2=E2,C2=F2,C2=H2,N=K2,S=P2,T=Q2,E1=B3,F1=C3,X1>=0] 

* Chain [[25,26,27,28,29,30,31,32,33,34],43]: 17*it(25)+0
  with precondition: [W1=2,J2=0,L2=0,O2=0,C=Z1,D=A2,C2=D2,C2=E2,C2=F2,C2=H2,N=K2,S=P2,T=Q2,E1=B3,F1=C3,X1>=0] 

* Chain [[25,26,27,28,29,30,31,32,33,34],42]: 16*it(25)+0
  with precondition: [W1=2,J2=0,L2=0,O2=0,C=Z1,D=A2,C2=D2,C2=E2,C2=F2,C2=H2,N=K2,S=P2,T=Q2,E1=B3,F1=C3,X1>=0] 

* Chain [[25,26,27,28,29,30,31,32,33,34],41]: 17*it(25)+0
  with precondition: [W1=2,J2=0,L2=0,O2=0,C=Z1,D=A2,C2=D2,C2=E2,C2=F2,C2=H2,N=K2,S=P2,T=Q2,E1=B3,F1=C3,X1>=0] 

* Chain [[25,26,27,28,29,30,31,32,33,34],40]: 16*it(25)+0
  with precondition: [W1=4] 

* Chain [[25,26,27,28,29,30,31,32,33,34],39]: 16*it(25)+0
  with precondition: [W1=4] 

* Chain [[25,26,27,28,29,30,31,32,33,34],38]: 17*it(25)+0
  with precondition: [W1=4] 

* Chain [[25,26,27,28,29,30,31,32,33,34],37]: 17*it(25)+0
  with precondition: [W1=4] 

* Chain [[25,26,27,28,29,30,31,32,33,34],36]: 16*it(25)+0
  with precondition: [W1=5,A2=0,Y1=Z1,N=K2,S=P2,T=Q2,E1=B3,F1=C3,0>=Y1+1,X1>=1] 

* Chain [[25,26,27,28,29,30,31,32,33,34],35]: 16*it(25)+0
  with precondition: [W1=5,A2=0,Y1=Z1,N=K2,S=P2,T=Q2,E1=B3,F1=C3,X1>=1,Y1>=1] 

* Chain [49]...: 1*s(19)+0
  with precondition: [W1=2,Z1=C,A2=D,B2=E,K2=N,P2=S,Q2=T,B3=E1,C3=F1,A>=0,Q>=J+2] 

* Chain [48]...: 1*s(20)+0
  with precondition: [W1=2,Z1=C,A2=D,K2=N,P2=S,Q2=T,B3=E1,C3=F1,J>=0,Q>=J+2] 

* Chain [47]...: 1*s(21)+0
  with precondition: [W1=4,A>=0,Q>=J+2] 

* Chain [46]...: 1*s(22)+0
  with precondition: [W1=4,J>=0,Q>=J+2] 

* Chain [45]: 0
  with precondition: [B=0,W1=6,Z1=0,A2=0,B2=E,C2=F,D2=G,E2=H,G2=J,H2=K,L2=O,M2=P,N2=Q,O2=R,P2=S,Q2=T,R2=U,S2=V,T2=W,U2=X,V2=Y,W2=Z,X2=A1,Y2=B1,Z2=C1,A3=D1,B3=E1,C3=F1,L=Y1,L=F2,L=I2,L=J2,L=K2,A>=1] 

* Chain [44]: 0
  with precondition: [W1=2,J2=0,L2=0,O2=0,Y1=B,Z1=C,A2=D,B2=E,I2=L,K2=N,P2=S,Q2=T,R2=U,S2=V,T2=W,U2=X,V2=Y,X2=A1,Y2=B1,Z2=C1,A3=D1,B3=E1,C3=F1,C2=D2,C2=E2,C2=F2,C2=H2,A>=0,X1>=0,J+1>=Q] 

* Chain [43]: 1*s(23)+0
  with precondition: [W1=2,J2=0,L2=0,O2=0,Y1=B,Z1=C,A2=D,B2=E,I2=L,K2=N,P2=S,Q2=T,X2=A1,Y2=B1,Z2=C1,A3=D1,B3=E1,C3=F1,C2=D2,C2=E2,C2=F2,C2=H2,A>=0,X1>=0,Q>=J+2] 

* Chain [42]: 0
  with precondition: [W1=2,J2=0,L2=0,O2=0,Y1=B,Z1=C,A2=D,I2=L,K2=N,P2=S,Q2=T,R2=U,S2=V,T2=W,U2=X,V2=Y,X2=A1,Y2=B1,Z2=C1,A3=D1,B3=E1,C3=F1,C2=D2,C2=E2,C2=F2,C2=H2,J>=0,X1>=0,J+1>=Q] 

* Chain [41]: 1*s(24)+0
  with precondition: [W1=2,J2=0,L2=0,O2=0,Y1=B,Z1=C,A2=D,I2=L,K2=N,P2=S,Q2=T,X2=A1,Y2=B1,Z2=C1,A3=D1,B3=E1,C3=F1,C2=D2,C2=E2,C2=F2,C2=H2,J>=0,X1>=0,Q>=J+2] 

* Chain [40]: 0
  with precondition: [W1=4] 

* Chain [39]: 0
  with precondition: [W1=4,A>=0] 

* Chain [38]: 1*s(25)+0
  with precondition: [W1=4,A>=0,Q>=J+2] 

* Chain [37]: 1*s(26)+0
  with precondition: [W1=4,J>=0,Q>=J+2] 

* Chain [36]: 0
  with precondition: [W1=5,A2=0,B2=E,C2=F,D2=G,E2=H,F2=I,G2=J,H2=K,I2=L,J2=M,K2=N,L2=O,M2=P,N2=Q,O2=R,P2=S,Q2=T,R2=U,S2=V,T2=W,U2=X,V2=Y,W2=Z,X2=A1,Y2=B1,Z2=C1,A3=D1,B3=E1,C3=F1,B=Y1,B=Z1,0>=B+1,A>=1,X1>=1] 

* Chain [35]: 0
  with precondition: [W1=5,A2=0,B2=E,C2=F,D2=G,E2=H,F2=I,G2=J,H2=K,I2=L,J2=M,K2=N,L2=O,M2=P,N2=Q,O2=R,P2=S,Q2=T,R2=U,S2=V,T2=W,U2=X,V2=Y,W2=Z,X2=A1,Y2=B1,Z2=C1,A3=D1,B3=E1,C3=F1,B=Y1,B=Z1,A>=1,B>=1,X1>=1] 


#### Cost of chains of f3_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,A1,B1,C1,D1,E1,F1,G1,H1):
* Chain [53]: 0
  with precondition: [A=2] 

* Chain [52]: 0
  with precondition: [A=4] 

* Chain [51]: 0
  with precondition: [A=5] 

* Chain [50]: 0
  with precondition: [A=6] 


#### Cost of chains of f33(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,A1,B1,C1,D1,E1,F1,W1):
* Chain [65]: 1*aux(5)+0
  with precondition: [] 

* Chain [64]: 0
  with precondition: [B=0,A>=1] 

* Chain [63]: 0
  with precondition: [0>=B+1,A>=1] 

* Chain [62]: 0
  with precondition: [A>=0] 

* Chain [61]: 1*aux(6)+0
  with precondition: [A>=0,Q>=J+2] 

* Chain [60]: 0
  with precondition: [A>=0,J+1>=Q] 

* Chain [59]: 0
  with precondition: [A>=1,B>=1] 

* Chain [58]: 1*aux(7)+0
  with precondition: [J>=0,Q>=J+2] 

* Chain [57]: 0
  with precondition: [J>=0,J+1>=Q] 

* Chain [56]...: 1*aux(8)+0
  with precondition: [] 

* Chain [55]...: 1*aux(9)+0
  with precondition: [A>=0,Q>=J+2] 

* Chain [54]...: 1*aux(10)+0
  with precondition: [J>=0,Q>=J+2] 


Closed-form bounds of f33(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,A1,B1,C1,D1,E1,F1,W1): 
-------------------------------------
* Chain [65] with precondition: [] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [64] with precondition: [B=0,A>=1] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [63] with precondition: [0>=B+1,A>=1] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [62] with precondition: [A>=0] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [61] with precondition: [A>=0,Q>=J+2] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [60] with precondition: [A>=0,J+1>=Q] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [59] with precondition: [A>=1,B>=1] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [58] with precondition: [J>=0,Q>=J+2] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [57] with precondition: [J>=0,J+1>=Q] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [56]... with precondition: [] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [55]... with precondition: [A>=0,Q>=J+2] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [54]... with precondition: [J>=0,Q>=J+2] 
    - Upper bound: inf 
    - Complexity: infinity 

### Maximum cost of f33(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,A1,B1,C1,D1,E1,F1,W1): inf 
Asymptotic class: infinity 
* Total analysis performed in 6472 ms.