
Preprocessing Cost Relations
=====================================

#### Computed strongly connected components 
0. recursive  : [f29/4]
1. non_recursive  : [exit_location/1]
2. recursive  : [f69/4]
3. recursive  : [f109/4]
4. recursive  : [f149/4]
5. non_recursive  : [f166/25]
6. non_recursive  : [f149_loop_cont/26]
7. non_recursive  : [f146/25]
8. non_recursive  : [f140/25]
9. non_recursive  : [f137/25]
10. non_recursive  : [f125/25]
11. non_recursive  : [f109_loop_cont/26]
12. non_recursive  : [f106/25]
13. non_recursive  : [f100/25]
14. non_recursive  : [f97/25]
15. non_recursive  : [f85/25]
16. non_recursive  : [f69_loop_cont/26]
17. non_recursive  : [f66/25]
18. non_recursive  : [f60/25]
19. non_recursive  : [f57/25]
20. non_recursive  : [f45/25]
21. non_recursive  : [f29_loop_cont/26]
22. non_recursive  : [f26/25]
23. non_recursive  : [f20/25]
24. non_recursive  : [f17/25]
25. non_recursive  : [f0/25]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into f29/4
1. SCC is completely evaluated into other SCCs
2. SCC is partially evaluated into f69/4
3. SCC is partially evaluated into f109/4
4. SCC is partially evaluated into f149/4
5. SCC is completely evaluated into other SCCs
6. SCC is partially evaluated into f149_loop_cont/26
7. SCC is partially evaluated into f146/25
8. SCC is partially evaluated into f140/25
9. SCC is partially evaluated into f137/25
10. SCC is partially evaluated into f125/25
11. SCC is partially evaluated into f109_loop_cont/26
12. SCC is partially evaluated into f106/25
13. SCC is partially evaluated into f100/25
14. SCC is partially evaluated into f97/25
15. SCC is partially evaluated into f85/25
16. SCC is partially evaluated into f69_loop_cont/26
17. SCC is partially evaluated into f66/25
18. SCC is partially evaluated into f60/25
19. SCC is partially evaluated into f57/25
20. SCC is partially evaluated into f45/25
21. SCC is partially evaluated into f29_loop_cont/26
22. SCC is partially evaluated into f26/25
23. SCC is partially evaluated into f20/25
24. SCC is partially evaluated into f17/25
25. SCC is partially evaluated into f0/25

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

### Specialization of cost equations f29/4 
* CE 17 is refined into CE [61] 
* CE 18 is refined into CE [62] 
* CE 16 is refined into CE [63] 


### Cost equations --> "Loop" of f29/4 
* CEs [63] --> Loop 53 
* CEs [61] --> Loop 54 
* CEs [62] --> Loop 55 

### Ranking functions of CR f29(A,F,Y,Z) 
* RF of phase [53]: [-F+100]

#### Partial ranking functions of CR f29(A,F,Y,Z) 
* Partial RF of phase [53]:
  - RF of loop [53:1]:
    -F+100


### Specialization of cost equations f69/4 
* CE 32 is refined into CE [64] 
* CE 33 is refined into CE [65] 
* CE 31 is refined into CE [66] 


### Cost equations --> "Loop" of f69/4 
* CEs [66] --> Loop 56 
* CEs [64] --> Loop 57 
* CEs [65] --> Loop 58 

### Ranking functions of CR f69(G,L,Y,Z) 
* RF of phase [56]: [-L+200]

#### Partial ranking functions of CR f69(G,L,Y,Z) 
* Partial RF of phase [56]:
  - RF of loop [56:1]:
    -L+200


### Specialization of cost equations f109/4 
* CE 48 is refined into CE [67] 
* CE 47 is refined into CE [68] 
* CE 46 is refined into CE [69] 


### Cost equations --> "Loop" of f109/4 
* CEs [69] --> Loop 59 
* CEs [67] --> Loop 60 
* CEs [68] --> Loop 61 

### Ranking functions of CR f109(M,R,Y,Z) 
* RF of phase [59]: [-R+50]

#### Partial ranking functions of CR f109(M,R,Y,Z) 
* Partial RF of phase [59]:
  - RF of loop [59:1]:
    -R+50


### Specialization of cost equations f149/4 
* CE 57 is refined into CE [70] 
* CE 58 is refined into CE [71] 
* CE 56 is refined into CE [72] 


### Cost equations --> "Loop" of f149/4 
* CEs [72] --> Loop 62 
* CEs [70] --> Loop 63 
* CEs [71] --> Loop 64 

### Ranking functions of CR f149(S,X,Y,Z) 
* RF of phase [62]: [-X+20]

#### Partial ranking functions of CR f149(S,X,Y,Z) 
* Partial RF of phase [62]:
  - RF of loop [62:1]:
    -X+20


### Specialization of cost equations f149_loop_cont/26 
* CE 59 is refined into CE [73] 
* CE 60 is refined into CE [74] 


### Cost equations --> "Loop" of f149_loop_cont/26 
* CEs [73] --> Loop 65 
* CEs [74] --> Loop 66 

### Ranking functions of CR f149_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 f149_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 f146/25 
* CE 55 is refined into CE [75,76,77] 
* CE 54 is discarded (unfeasible) 
* CE 53 is refined into CE [78] 


### Cost equations --> "Loop" of f146/25 
* CEs [75,76,77] --> Loop 67 
* CEs [78] --> Loop 68 

### Ranking functions of CR f146(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) 

#### Partial ranking functions of CR f146(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) 


### Specialization of cost equations f140/25 
* CE 51 is refined into CE [79] 
* CE 52 is refined into CE [80] 


### Cost equations --> "Loop" of f140/25 
* CEs [79,80] --> Loop 69 

### Ranking functions of CR f140(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) 

#### Partial ranking functions of CR f140(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) 


### Specialization of cost equations f137/25 
* CE 44 is refined into CE [81] 
* CE 43 is discarded (unfeasible) 
* CE 45 is refined into CE [82] 


### Cost equations --> "Loop" of f137/25 
* CEs [81] --> Loop 70 
* CEs [82] --> Loop 71 

### Ranking functions of CR f137(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) 

#### Partial ranking functions of CR f137(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) 


### Specialization of cost equations f125/25 
* CE 38 is refined into CE [83] 
* CE 39 is refined into CE [84] 


### Cost equations --> "Loop" of f125/25 
* CEs [83,84] --> Loop 72 

### Ranking functions of CR f125(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) 

#### Partial ranking functions of CR f125(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) 


### Specialization of cost equations f109_loop_cont/26 
* CE 50 is refined into CE [85] 
* CE 49 is refined into CE [86] 


### Cost equations --> "Loop" of f109_loop_cont/26 
* CEs [85] --> Loop 73 
* CEs [86] --> Loop 74 

### Ranking functions of CR f109_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 f109_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 f106/25 
* CE 42 is refined into CE [87,88,89] 
* CE 41 is discarded (unfeasible) 
* CE 40 is refined into CE [90] 


### Cost equations --> "Loop" of f106/25 
* CEs [87,88,89] --> Loop 75 
* CEs [90] --> Loop 76 

### Ranking functions of CR f106(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) 

#### Partial ranking functions of CR f106(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) 


### Specialization of cost equations f100/25 
* CE 36 is refined into CE [91] 
* CE 37 is refined into CE [92] 


### Cost equations --> "Loop" of f100/25 
* CEs [91,92] --> Loop 77 

### Ranking functions of CR f100(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) 

#### Partial ranking functions of CR f100(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) 


### Specialization of cost equations f97/25 
* CE 29 is refined into CE [93] 
* CE 28 is discarded (unfeasible) 
* CE 30 is refined into CE [94] 


### Cost equations --> "Loop" of f97/25 
* CEs [93] --> Loop 78 
* CEs [94] --> Loop 79 

### Ranking functions of CR f97(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) 

#### Partial ranking functions of CR f97(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) 


### Specialization of cost equations f85/25 
* CE 23 is refined into CE [95] 
* CE 24 is refined into CE [96] 


### Cost equations --> "Loop" of f85/25 
* CEs [95,96] --> Loop 80 

### Ranking functions of CR f85(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) 

#### Partial ranking functions of CR f85(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) 


### Specialization of cost equations f69_loop_cont/26 
* CE 34 is refined into CE [97] 
* CE 35 is refined into CE [98] 


### Cost equations --> "Loop" of f69_loop_cont/26 
* CEs [97] --> Loop 81 
* CEs [98] --> Loop 82 

### Ranking functions of CR f69_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 f69_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 f66/25 
* CE 27 is refined into CE [99,100,101] 
* CE 26 is discarded (unfeasible) 
* CE 25 is refined into CE [102] 


### Cost equations --> "Loop" of f66/25 
* CEs [99,100,101] --> Loop 83 
* CEs [102] --> Loop 84 

### Ranking functions of CR f66(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) 

#### Partial ranking functions of CR f66(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) 


### Specialization of cost equations f60/25 
* CE 21 is refined into CE [103] 
* CE 22 is refined into CE [104] 


### Cost equations --> "Loop" of f60/25 
* CEs [103,104] --> Loop 85 

### Ranking functions of CR f60(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) 

#### Partial ranking functions of CR f60(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) 


### Specialization of cost equations f57/25 
* CE 14 is refined into CE [105] 
* CE 13 is discarded (unfeasible) 
* CE 15 is refined into CE [106] 


### Cost equations --> "Loop" of f57/25 
* CEs [105] --> Loop 86 
* CEs [106] --> Loop 87 

### Ranking functions of CR f57(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) 

#### Partial ranking functions of CR f57(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) 


### Specialization of cost equations f45/25 
* CE 8 is refined into CE [107] 
* CE 9 is refined into CE [108] 


### Cost equations --> "Loop" of f45/25 
* CEs [107,108] --> Loop 88 

### Ranking functions of CR f45(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) 

#### Partial ranking functions of CR f45(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) 


### Specialization of cost equations f29_loop_cont/26 
* CE 19 is refined into CE [109] 
* CE 20 is refined into CE [110] 


### Cost equations --> "Loop" of f29_loop_cont/26 
* CEs [109] --> Loop 89 
* CEs [110] --> Loop 90 

### Ranking functions of CR f29_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 f29_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 f26/25 
* CE 12 is refined into CE [111,112,113] 
* CE 11 is discarded (unfeasible) 
* CE 10 is refined into CE [114] 


### Cost equations --> "Loop" of f26/25 
* CEs [111,112,113] --> Loop 91 
* CEs [114] --> Loop 92 

### Ranking functions of CR f26(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) 

#### Partial ranking functions of CR f26(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) 


### Specialization of cost equations f20/25 
* CE 6 is refined into CE [115] 
* CE 7 is refined into CE [116] 


### Cost equations --> "Loop" of f20/25 
* CEs [115,116] --> Loop 93 

### Ranking functions of CR f20(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) 

#### Partial ranking functions of CR f20(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) 


### Specialization of cost equations f17/25 
* CE 4 is refined into CE [117] 
* CE 3 is discarded (unfeasible) 
* CE 5 is refined into CE [118] 


### Cost equations --> "Loop" of f17/25 
* CEs [117] --> Loop 94 
* CEs [118] --> Loop 95 

### Ranking functions of CR f17(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) 

#### Partial ranking functions of CR f17(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) 


### Specialization of cost equations f0/25 
* CE 1 is refined into CE [119] 
* CE 2 is refined into CE [120] 


### Cost equations --> "Loop" of f0/25 
* CEs [119,120] --> Loop 96 

### 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,Y) 

#### 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,Y) 


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

#### Cost of chains of f29(A,F,Y,Z):
* Chain [[53],55]: 1*it(53)+0
  Such that:it(53) =< -F+100

  with precondition: [A=100,Y=3,99>=F,F>=0] 

* Chain [[53],54]: 1*it(53)+0
  Such that:it(53) =< -F+100

  with precondition: [A=100,Y=5,Z=100,99>=F,F>=0] 

* Chain [55]: 0
  with precondition: [A=100,Y=3,F>=0] 


#### Cost of chains of f69(G,L,Y,Z):
* Chain [[56],58]: 1*it(56)+0
  Such that:it(56) =< -L+200

  with precondition: [G=200,Y=3,199>=L,L>=0] 

* Chain [[56],57]: 1*it(56)+0
  Such that:it(56) =< -L+200

  with precondition: [G=200,Y=6,Z=200,199>=L,L>=0] 

* Chain [58]: 0
  with precondition: [G=200,Y=3,L>=0] 


#### Cost of chains of f109(M,R,Y,Z):
* Chain [[59],61]: 1*it(59)+0
  Such that:it(59) =< -R+50

  with precondition: [M=50,Y=2,Z=50,49>=R,R>=0] 

* Chain [[59],60]: 1*it(59)+0
  Such that:it(59) =< -R+50

  with precondition: [M=50,Y=3,49>=R,R>=0] 

* Chain [60]: 0
  with precondition: [M=50,Y=3,R>=0] 


#### Cost of chains of f149(S,X,Y,Z):
* Chain [[62],64]: 1*it(62)+0
  Such that:it(62) =< -X+20

  with precondition: [S=20,Y=3,19>=X,X>=0] 

* Chain [[62],63]: 1*it(62)+0
  Such that:it(62) =< -X+20

  with precondition: [S=20,Y=4,Z=20,19>=X,X>=0] 

* Chain [64]: 0
  with precondition: [S=20,Y=3,X>=0] 


#### Cost of chains of f149_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 [66]: 0
  with precondition: [A=3,B=100,H=200,N=50,T=20,D=C,J=I,P=O,V=U,X=W,10>=D,10>=J,10>=P,10>=V,10>=X,D>=0,J>=0,P>=0,V>=1,X>=1] 

* Chain [65]: 0
  with precondition: [A=4,B=100,H=200,N=50,T=20,D=C,J=I,P=O,V=U,X=W,10>=D,10>=J,10>=P,10>=V,10>=X,D>=0,J>=0,P>=0,V>=1,X>=1] 


#### Cost of chains of f146(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):
* Chain [68]: 0
  with precondition: [A=100,G=200,M=50,S=20,V=0,C=B,I=H,O=N,U=T,10>=C,10>=I,10>=O,10>=U,C>=0,I>=0,O>=0,U>=1] 

* Chain [67]: 40
  with precondition: [A=100,G=200,M=50,S=20,C=B,I=H,O=N,U=T,10>=C,10>=I,10>=O,10>=U,10>=V,C>=0,I>=0,O>=0,U>=1,V>=1] 


#### Cost of chains of f140(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):
* Chain [69]: 40
  with precondition: [A=100,G=200,M=50,S=20,C=B,I=H,O=N,U=T,10>=C,10>=I,10>=O,10>=U,C>=0,I>=0,O>=0,U>=1] 


#### Cost of chains of f137(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):
* Chain [71]: 0
  with precondition: [A=100,G=200,M=50,S=20,T=0,C=B,I=H,O=N,10>=C,10>=I,10>=O,C>=0,I>=0,O>=0] 

* Chain [70]: 40
  with precondition: [A=100,G=200,M=50,S=20,C=B,I=H,O=N,10>=C,10>=I,10>=O,10>=T,C>=0,I>=0,O>=0,T>=1] 


#### Cost of chains of f125(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):
* Chain [72]: 40
  with precondition: [A=100,G=200,M=50,C=B,I=H,O=N,10>=C,10>=I,10>=O,C>=0,I>=0,O>=0] 


#### Cost of chains of f109_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 [74]: 40
  with precondition: [A=2,B=100,H=200,N=50,D=C,J=I,P=O,R=Q,10>=D,10>=J,10>=P,10>=R,D>=0,J>=0,P>=1,R>=1] 

* Chain [73]: 0
  with precondition: [A=3,B=100,H=200,N=50,D=C,J=I,P=O,R=Q,10>=D,10>=J,10>=P,10>=R,D>=0,J>=0,P>=1,R>=1] 


#### Cost of chains of f106(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):
* Chain [76]: 40
  with precondition: [A=100,G=200,M=50,P=0,C=B,I=H,O=N,10>=C,10>=I,10>=O,C>=0,I>=0,O>=1] 

* Chain [75]: 140
  with precondition: [A=100,G=200,M=50,C=B,I=H,O=N,10>=C,10>=I,10>=O,10>=P,C>=0,I>=0,O>=1,P>=1] 


#### Cost of chains of f100(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):
* Chain [77]: 140
  with precondition: [A=100,G=200,M=50,C=B,I=H,O=N,10>=C,10>=I,10>=O,C>=0,I>=0,O>=1] 


#### Cost of chains of f97(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):
* Chain [79]: 40
  with precondition: [A=100,G=200,M=50,N=0,C=B,I=H,10>=C,10>=I,C>=0,I>=0] 

* Chain [78]: 140
  with precondition: [A=100,G=200,M=50,C=B,I=H,10>=C,10>=I,10>=N,C>=0,I>=0,N>=1] 


#### Cost of chains of f85(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):
* Chain [80]: 140
  with precondition: [A=100,G=200,C=B,I=H,10>=C,10>=I,C>=0,I>=0] 


#### Cost of chains of f69_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 [82]: 0
  with precondition: [A=3,B=100,H=200,D=C,J=I,L=K,10>=D,10>=J,10>=L,D>=0,J>=1,L>=1] 

* Chain [81]: 140
  with precondition: [A=6,B=100,H=200,D=C,J=I,L=K,10>=D,10>=J,10>=L,D>=0,J>=1,L>=1] 


#### Cost of chains of f66(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):
* Chain [84]: 140
  with precondition: [A=100,G=200,J=0,C=B,I=H,10>=C,10>=I,C>=0,I>=1] 

* Chain [83]: 540
  with precondition: [A=100,G=200,C=B,I=H,10>=C,10>=I,10>=J,C>=0,I>=1,J>=1] 


#### Cost of chains of f60(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):
* Chain [85]: 540
  with precondition: [A=100,G=200,C=B,I=H,10>=C,10>=I,C>=0,I>=1] 


#### Cost of chains of f57(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):
* Chain [87]: 140
  with precondition: [A=100,G=200,H=0,C=B,10>=C,C>=0] 

* Chain [86]: 540
  with precondition: [A=100,G=200,C=B,10>=C,10>=H,C>=0,H>=1] 


#### Cost of chains of f45(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):
* Chain [88]: 540
  with precondition: [A=100,C=B,10>=C,C>=0] 


#### Cost of chains of f29_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 [90]: 0
  with precondition: [A=3,B=100,D=C,F=E,10>=D,10>=F,D>=1,F>=1] 

* Chain [89]: 540
  with precondition: [A=5,B=100,D=C,F=E,10>=D,10>=F,D>=1,F>=1] 


#### Cost of chains of f26(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):
* Chain [92]: 540
  with precondition: [A=100,D=0,C=B,10>=C,C>=1] 

* Chain [91]: 740
  with precondition: [A=100,C=B,10>=C,10>=D,C>=1,D>=1] 


#### Cost of chains of f20(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):
* Chain [93]: 740
  with precondition: [A=100,C=B,10>=C,C>=1] 


#### Cost of chains of f17(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):
* Chain [95]: 540
  with precondition: [A=100,B=0] 

* Chain [94]: 740
  with precondition: [A=100,10>=B,B>=1] 


#### 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,Y):
* Chain [96]: 740
  with precondition: [] 


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,Y): 
-------------------------------------
* Chain [96] with precondition: [] 
    - Upper bound: 740 
    - Complexity: constant 

### 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,Y): 740 
Asymptotic class: constant 
* Total analysis performed in 717 ms.

