/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  : [f1/29]
1. non_recursive  : [f10/51]
2. non_recursive  : [exit_location/1]
3. recursive  : [f116/36]
4. non_recursive  : [f300/51]
5. recursive  : [f8/25]
6. non_recursive  : [f8_loop_cont/52]
7. non_recursive  : [f116_loop_cont/52]
8. non_recursive  : [f1_loop_cont/52]
9. non_recursive  : [f9/51]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into f1/29
1. SCC is completely evaluated into other SCCs
2. SCC is completely evaluated into other SCCs
3. SCC is partially evaluated into f116/36
4. SCC is completely evaluated into other SCCs
5. SCC is partially evaluated into f8/25
6. SCC is partially evaluated into f8_loop_cont/52
7. SCC is partially evaluated into f116_loop_cont/52
8. SCC is partially evaluated into f1_loop_cont/52
9. SCC is partially evaluated into f9/51

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

### Specialization of cost equations f1/29 
* CE 5 is refined into CE [20] 
* CE 4 is refined into CE [21] 
* CE 3 is refined into CE [22] 


### Cost equations --> "Loop" of f1/29 
* CEs [22] --> Loop 20 
* CEs [20] --> Loop 21 
* CEs [21] --> Loop 22 

### Ranking functions of CR f1(A,B,C,F,Q,R,S,T,U,V,W,X,Y,Z,A1,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3,B3,C3,D3,E3) 
* RF of phase [20]: [A-B,-B+Q]

#### Partial ranking functions of CR f1(A,B,C,F,Q,R,S,T,U,V,W,X,Y,Z,A1,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3,B3,C3,D3,E3) 
* Partial RF of phase [20]:
  - RF of loop [20:1]:
    A-B
    -B+Q


### Specialization of cost equations f116/36 
* CE 11 is refined into CE [23] 
* CE 8 is discarded (unfeasible) 
* CE 10 is refined into CE [24] 
* CE 9 is refined into CE [25] 


### Cost equations --> "Loop" of f116/36 
* CEs [25] --> Loop 23 
* CEs [23] --> Loop 24 
* CEs [24] --> Loop 25 

### Ranking functions of CR f116(A,C,F,O,P,U,B1,C1,D1,G1,H1,I1,J1,L1,M1,N1,O1,P1,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3,B3,C3,D3,E3,F3,G3,H3,I3) 

#### Partial ranking functions of CR f116(A,C,F,O,P,U,B1,C1,D1,G1,H1,I1,J1,L1,M1,N1,O1,P1,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3,B3,C3,D3,E3,F3,G3,H3,I3) 


### Specialization of cost equations f8/25 
* CE 17 is refined into CE [26] 
* CE 16 is refined into CE [27] 
* CE 15 is refined into CE [28] 


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

### Ranking functions of CR f8(A,U,V,Y,C1,D1,E1,G1,H1,I1,J1,K1,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3,B3,C3,D3) 
* RF of phase [26]: [E1+1]

#### Partial ranking functions of CR f8(A,U,V,Y,C1,D1,E1,G1,H1,I1,J1,K1,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3,B3,C3,D3) 
* Partial RF of phase [26]:
  - RF of loop [26:1]:
    E1+1


### Specialization of cost equations f8_loop_cont/52 
* CE 19 is refined into CE [29] 
* CE 18 is refined into CE [30] 


### Cost equations --> "Loop" of f8_loop_cont/52 
* CEs [29] --> Loop 29 
* CEs [30] --> Loop 30 

### Ranking functions of CR f8_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,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1) 

#### Partial ranking functions of CR f8_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,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1) 


### Specialization of cost equations f116_loop_cont/52 
* CE 14 is refined into CE [31,32,33,34] 
* CE 12 is refined into CE [35] 
* CE 13 is refined into CE [36] 


### Cost equations --> "Loop" of f116_loop_cont/52 
* CEs [34] --> Loop 31 
* CEs [33] --> Loop 32 
* CEs [32] --> Loop 33 
* CEs [31] --> Loop 34 
* CEs [35] --> Loop 35 
* CEs [36] --> Loop 36 

### Ranking functions of CR f116_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,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1) 

#### Partial ranking functions of CR f116_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,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1) 


### Specialization of cost equations f1_loop_cont/52 
* CE 7 is refined into CE [37,38,39,40,41,42] 
* CE 6 is refined into CE [43] 


### Cost equations --> "Loop" of f1_loop_cont/52 
* CEs [42] --> Loop 37 
* CEs [41] --> Loop 38 
* CEs [38,39] --> Loop 39 
* CEs [40] --> Loop 40 
* CEs [37] --> Loop 41 
* CEs [43] --> Loop 42 

### Ranking functions of CR f1_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,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1) 

#### Partial ranking functions of CR f1_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,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1) 


### Specialization of cost equations f9/51 
* CE 2 is refined into CE [44,45,46,47,48,49,50,51,52,53,54,55] 
* CE 1 is refined into CE [56] 


### Cost equations --> "Loop" of f9/51 
* CEs [54,55] --> Loop 43 
* CEs [49] --> Loop 44 
* CEs [51] --> Loop 45 
* CEs [50,52,53] --> Loop 46 
* CEs [48] --> Loop 47 
* CEs [47] --> Loop 48 
* CEs [44] --> Loop 49 
* CEs [46] --> Loop 50 
* CEs [45] --> Loop 51 
* CEs [56] --> Loop 52 

### Ranking functions of CR f9(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,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,R2) 

#### Partial ranking functions of CR f9(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,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,R2) 


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

#### Cost of chains of f1(A,B,C,F,Q,R,S,T,U,V,W,X,Y,Z,A1,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3,B3,C3,D3,E3):
* Chain [[20],22]: 1*it(20)+0
  Such that:it(20) =< A-B

  with precondition: [C=0,R2=6,T2=0,A=Q,R=T,Y2=Z2,S2=D3,B>=2,F>=A,E3>=A,A>=B+1] 

* Chain [[20],21]: 1*it(20)+0
  Such that:it(20) =< -B+Q

  with precondition: [R2=3,A=Q,R=T,B>=2,A>=B+1] 

* Chain [22]: 0
  with precondition: [C=0,R2=6,T2=0,A=B,A=Q,T=R,D3=S2,T=Y2,T=Z2,A>=2,F>=A,E3>=A] 

* Chain [21]: 0
  with precondition: [R2=3,Q=A,T=R,B>=2,Q>=B] 


#### Cost of chains of f116(A,C,F,O,P,U,B1,C1,D1,G1,H1,I1,J1,L1,M1,N1,O1,P1,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3,B3,C3,D3,E3,F3,G3,H3,I3):
* Chain [25]: 0
  with precondition: [P=0,U=0,R2=5,V2=1,W2=0,A3=0,C3=0,E3+1=0,F3=M1,G3=N1,H3=O1,X2+1=S2,F=T2,F=U2,Y2=Z2,Y2=B3,Y2=D3,A>=2,C>=0,F>=0,I3>=0] 

* Chain [24]: 0
  with precondition: [R2=3,1>=P,A>=2,P>=0] 

* Chain [23,24]: 1
  with precondition: [P=0,R2=3,U=M1,A>=2,C>=0,F>=0] 


#### Cost of chains of f8(A,U,V,Y,C1,D1,E1,G1,H1,I1,J1,K1,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3,B3,C3,D3):
* Chain [[26],28]: 1*it(26)+0
  Such that:it(26) =< E1-Y2

  with precondition: [U=0,D1=0,G1=0,I1=0,R2=2,T2=0,V=H1,V=J1,V=U2,Y2=D3,A>=2,Y2>=0,E1>=Y2+1] 

* Chain [[26],27]: 1*it(26)+0
  Such that:it(26) =< E1+1

  with precondition: [U=0,G1=0,I1=0,R2=3,V=H1,V=J1,A>=2,E1>=0] 

* Chain [28]: 0
  with precondition: [R2=2,T2=U,U2=V,G1=D1,D3=K1,E1=Y2,A>=2,E1>=0] 

* Chain [27]: 0
  with precondition: [R2=3,A>=2] 


#### Cost of chains of f8_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,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1):
* Chain [30]: 0
  with precondition: [A=2,U1=2] 

* Chain [29]: 0
  with precondition: [A=3,U1=2] 


#### Cost of chains of f116_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,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1):
* Chain [36]: 0
  with precondition: [A=3,U1=2,B>=2] 

* Chain [35]: 0
  with precondition: [A=4,U1=2,B>=2] 

* Chain [34]: 1*s(1)+0
  Such that:s(1) =< F1

  with precondition: [A=5,V=0,E1=0,H1=0,J1=0,U1=2,W=I1,W=K1,B>=2,F1>=1] 

* Chain [33]: 1*s(2)+0
  Such that:s(2) =< F1+1

  with precondition: [A=5,V=0,H1=0,J1=0,U1=2,W=I1,W=K1,B>=2,F1>=0] 

* Chain [32]: 0
  with precondition: [A=5,U1=2,H1=E1,B>=2,F1>=0] 

* Chain [31]: 0
  with precondition: [A=5,U1=2,B>=2] 


#### Cost of chains of f1_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,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1):
* Chain [42]: 0
  with precondition: [A=3,Q=0,U1=2,B>=2] 

* Chain [41]: 1*s(3)+0
  Such that:s(3) =< F1

  with precondition: [A=6,Q=0,V=0,W=0,U1=2,B>=2,D>=0,G>=0,F1>=1] 

* Chain [40]: 0
  with precondition: [A=6,Q=0,V=0,U1=2,B>=2,D>=0,G>=0] 

* Chain [39]: 1*s(4)+0
  Such that:s(4) =< F1+1

  with precondition: [A=6,Q=0,V=0,U1=2,B>=2,D>=0,G>=0,F1>=0] 

* Chain [38]: 1
  with precondition: [A=6,Q=0,U1=2,N1=V,B>=2,D>=0,G>=0] 

* Chain [37]: 0
  with precondition: [A=6,Q=0,U1=2,B>=2] 


#### Cost of chains of f9(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,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,R2):
* Chain [52]: 0
  with precondition: [] 

* Chain [51]: 0
  with precondition: [C=0,S=0,W=0,F>=2] 

* Chain [50]: 1*s(5)+0
  Such that:s(5) =< E1+1

  with precondition: [C=0,S=0,W=0,F>=2,E1>=0] 

* Chain [49]: 1*s(6)+0
  Such that:s(6) =< E1

  with precondition: [C=0,S=0,W=0,F>=2,E1>=1] 

* Chain [48]: 1
  with precondition: [C=0,S=W,S=M1,F>=2] 

* Chain [47]: 0
  with precondition: [C=0,W=S,F>=2] 

* Chain [46]: 3*s(7)+1
  Such that:aux(1) =< F
s(7) =< aux(1)

  with precondition: [C=0,W=S,F>=3] 

* Chain [45]: 1*s(10)+1*s(11)+0
  Such that:s(10) =< F
s(11) =< E1+1

  with precondition: [C=0,W=S,F>=3,E1>=0] 

* Chain [44]: 1*s(12)+1*s(13)+0
  Such that:s(12) =< F
s(13) =< E1

  with precondition: [C=0,W=S,F>=3,E1>=1] 

* Chain [43]: 1*aux(2)+0
  with precondition: [W=S] 


Closed-form bounds of f9(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,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,R2): 
-------------------------------------
* Chain [52] with precondition: [] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [51] with precondition: [C=0,S=0,W=0,F>=2] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [50] with precondition: [C=0,S=0,W=0,F>=2,E1>=0] 
    - Upper bound: E1+1 
    - Complexity: n 
* Chain [49] with precondition: [C=0,S=0,W=0,F>=2,E1>=1] 
    - Upper bound: E1 
    - Complexity: n 
* Chain [48] with precondition: [C=0,S=W,S=M1,F>=2] 
    - Upper bound: 1 
    - Complexity: constant 
* Chain [47] with precondition: [C=0,W=S,F>=2] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [46] with precondition: [C=0,W=S,F>=3] 
    - Upper bound: 3*F+1 
    - Complexity: n 
* Chain [45] with precondition: [C=0,W=S,F>=3,E1>=0] 
    - Upper bound: F+E1+1 
    - Complexity: n 
* Chain [44] with precondition: [C=0,W=S,F>=3,E1>=1] 
    - Upper bound: F+E1 
    - Complexity: n 
* Chain [43] with precondition: [W=S] 
    - Upper bound: inf 
    - Complexity: infinity 

### Maximum cost of f9(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,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,R2): inf 
Asymptotic class: infinity 
* Total analysis performed in 1491 ms.