/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  : [f36/17,f48/17]
1. recursive  : [f15/20,f36_loop_cont/21,f77/20]
2. non_recursive  : [exit_location/1]
3. non_recursive  : [f81/11]
4. non_recursive  : [f15_loop_cont/12]
5. non_recursive  : [f0/11]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into f36/17
1. SCC is partially evaluated into f15/20
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/12
5. SCC is partially evaluated into f0/11

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

### Specialization of cost equations f36/17 
* CE 37 is refined into CE [38] 
* CE 36 is refined into CE [39] 
* CE 35 is refined into CE [40] 
* CE 19 is refined into CE [41] 
* CE 28 is refined into CE [42] 
* CE 31 is refined into CE [43] 
* CE 34 is refined into CE [44] 
* CE 27 is refined into CE [45] 
* CE 30 is refined into CE [46] 
* CE 29 is refined into CE [47] 
* CE 22 is refined into CE [48] 
* CE 20 is refined into CE [49] 
* CE 33 is refined into CE [50] 
* CE 32 is refined into CE [51] 
* CE 26 is refined into CE [52] 
* CE 21 is refined into CE [53] 
* CE 25 is refined into CE [54] 
* CE 24 is refined into CE [55] 
* CE 23 is refined into CE [56] 


### Cost equations --> "Loop" of f36/17 
* CEs [43] --> Loop 38 
* CEs [44] --> Loop 39 
* CEs [50] --> Loop 40 
* CEs [51] --> Loop 41 
* CEs [42] --> Loop 42 
* CEs [46] --> Loop 43 
* CEs [47] --> Loop 44 
* CEs [41] --> Loop 45 
* CEs [45] --> Loop 46 
* CEs [48] --> Loop 47 
* CEs [49] --> Loop 48 
* CEs [52] --> Loop 49 
* CEs [53] --> Loop 50 
* CEs [54] --> Loop 51 
* CEs [55] --> Loop 52 
* CEs [56] --> Loop 53 
* CEs [38] --> Loop 54 
* CEs [40] --> Loop 55 
* CEs [39] --> Loop 56 

### Ranking functions of CR f36(A,B,C,D,E,F,G,H,J,M,N,O,P,Q,R,S,T) 
* RF of phase [38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53]: [E-J+1]

#### Partial ranking functions of CR f36(A,B,C,D,E,F,G,H,J,M,N,O,P,Q,R,S,T) 
* Partial RF of phase [38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53]:
  - RF of loop [38:1,39:1,40:1,41:1,42:1,43:1,44:1,45:1,46:1,47:1,48:1,49:1,50:1,51:1,52:1,53:1]:
    E-J+1
  - RF of loop [38:1,42:1,51:1,52:1]:
    C depends on loops [41:1,44:1,47:1,48:1,49:1,50:1,53:1] 
  - RF of loop [39:1,51:1]:
    -D+1 depends on loops [40:1,41:1,43:1,44:1,46:1,47:1,48:1,49:1,50:1,52:1,53:1] 
  - RF of loop [40:1,43:1,52:1]:
    B depends on loops [41:1,44:1,47:1,48:1,49:1,50:1,53:1] 
  - RF of loop [40:1,43:1,52:1,53:1]:
    D depends on loops [39:1,41:1,44:1,47:1,48:1,49:1,50:1,51:1] 
  - RF of loop [45:1]:
    C/2-1/2 depends on loops [41:1,44:1,47:1,48:1,49:1,50:1,53:1] 
  - RF of loop [46:1]:
    B-1 depends on loops [41:1,44:1,47:1,48:1,49:1,50:1,53:1] 
  - RF of loop [47:1]:
    -A/2-3/2
  - RF of loop [48:1,49:1,50:1,53:1]:
    -A+E+1
  - RF of loop [49:1]:
    -B+1 depends on loops [40:1,41:1,43:1,44:1,46:1,47:1,48:1,50:1,52:1,53:1] 


### Specialization of cost equations f15/20 
* CE 15 is refined into CE [57] 
* CE 14 is discarded (unfeasible) 
* CE 16 is refined into CE [58] 
* CE 2 is refined into CE [59,60] 
* CE 4 is refined into CE [61,62] 
* CE 5 is refined into CE [63,64] 
* CE 3 is refined into CE [65,66] 
* CE 10 is refined into CE [67] 
* CE 12 is refined into CE [68] 
* CE 11 is refined into CE [69] 
* CE 6 is refined into CE [70] 
* CE 8 is refined into CE [71] 
* CE 7 is refined into CE [72] 
* CE 13 is refined into CE [73] 
* CE 9 is refined into CE [74] 


### Cost equations --> "Loop" of f15/20 
* CEs [67] --> Loop 57 
* CEs [68] --> Loop 58 
* CEs [69] --> Loop 59 
* CEs [73] --> Loop 60 
* CEs [70] --> Loop 61 
* CEs [71] --> Loop 62 
* CEs [74] --> Loop 63 
* CEs [72] --> Loop 64 
* CEs [58] --> Loop 65 
* CEs [57] --> Loop 66 
* CEs [59,60] --> Loop 67 
* CEs [61,62] --> Loop 68 
* CEs [63,64] --> Loop 69 
* CEs [65,66] --> Loop 70 

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

#### Partial ranking functions of CR f15(A,B,C,D,E,F,G,H,I,J,M,N,O,P,Q,R,S,T,U,V) 
* Partial RF of phase [61,62,63,64]:
  - RF of loop [64:1]:
    -A+E+1
    -A+7*E-5


### Specialization of cost equations f15_loop_cont/12 
* CE 17 is refined into CE [75] 
* CE 18 is refined into CE [76] 


### Cost equations --> "Loop" of f15_loop_cont/12 
* CEs [75] --> Loop 71 
* CEs [76] --> Loop 72 

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

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


### Specialization of cost equations f0/11 
* CE 1 is refined into CE [77,78,79,80,81,82,83,84,85,86,87,88,89] 


### Cost equations --> "Loop" of f0/11 
* CEs [88,89] --> Loop 73 
* CEs [77,78,79,80,81,82,83,84,85,86,87] --> Loop 74 

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

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


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

#### Cost of chains of f36(A,B,C,D,E,F,G,H,J,M,N,O,P,Q,R,S,T):
* Chain [[38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53],56]: 9*it(38)+1*it(47)+3*it(48)+1*it(49)+2*it(51)+0
  Such that:aux(214) =< -A+E+1
aux(215) =< -A+N
aux(216) =< A+2*E-2*J+4
aux(217) =< A-2*J-N+2*T
aux(218) =< -A/2
aux(219) =< -A/2+N/2
aux(223) =< E-J+1
aux(224) =< -J+T
it(48) =< aux(214)
it(49) =< aux(214)
it(48) =< aux(215)
it(49) =< aux(215)
it(49) =< aux(216)
it(48) =< aux(217)
it(49) =< aux(217)
it(51) =< aux(217)
it(47) =< aux(218)
it(47) =< aux(219)
it(38) =< aux(223)
it(47) =< aux(223)
it(48) =< aux(223)
it(49) =< aux(223)
it(51) =< aux(223)
it(38) =< aux(224)
it(47) =< aux(224)
it(48) =< aux(224)
it(49) =< aux(224)
it(51) =< aux(224)

  with precondition: [F=0,H=0,M=2,R=1,S=1,G>=0,P>=0,N>=A,J>=G,T>=J+1,E+1>=N,E+1>=T,A+2*T>=2*J+N,E+3*A+6*T>=6*J+4*N+2,A+P+2*T>=2*J+C+N] 

* Chain [[38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53],55]: 9*it(38)+1*it(47)+3*it(48)+1*it(49)+2*it(51)+0
  Such that:aux(214) =< -A+E+1
aux(215) =< -A+N
aux(216) =< A+2*E-2*J+4
aux(217) =< A+2*E-2*J-N+2
aux(218) =< -A/2
aux(219) =< -A/2+N/2
aux(225) =< E-J+1
it(48) =< aux(214)
it(49) =< aux(214)
it(48) =< aux(215)
it(49) =< aux(215)
it(49) =< aux(216)
it(48) =< aux(217)
it(49) =< aux(217)
it(51) =< aux(217)
it(47) =< aux(218)
it(47) =< aux(219)
it(38) =< aux(225)
it(47) =< aux(225)
it(48) =< aux(225)
it(49) =< aux(225)
it(51) =< aux(225)

  with precondition: [H=0,M=2,S=0,E+1=T,1>=F,1>=R,F>=0,G>=0,R>=0,N>=A,J>=G,E>=J,A+2*E+2>=2*J+F+N,A+R+2*E+1>=2*J+N,A+P+2*E+2>=2*J+C+F+N,A+P+R+2*E+1>=2*J+C+N] 

* Chain [[38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53],54]: 9*it(38)+1*it(47)+3*it(48)+1*it(49)+2*it(51)+0
  Such that:aux(214) =< -A+E+1
aux(216) =< A+2*E-2*J+4
aux(218) =< -A/2
aux(219) =< E-F/2-J+1
aux(215) =< 2*E-F-2*J+2
aux(226) =< E-J+1
aux(227) =< 2*E-2*J+2
aux(215) =< aux(227)
aux(219) =< aux(227)
it(48) =< aux(214)
it(49) =< aux(214)
it(48) =< aux(215)
it(49) =< aux(215)
it(49) =< aux(216)
it(48) =< aux(227)
it(49) =< aux(227)
it(51) =< aux(227)
it(47) =< aux(218)
it(47) =< aux(219)
it(38) =< aux(226)
it(47) =< aux(226)
it(48) =< aux(226)
it(49) =< aux(226)
it(51) =< aux(226)

  with precondition: [H=0,M=3,1>=F,F>=0,G>=0,J>=G,E>=J] 

* Chain [54]: 0
  with precondition: [M=3,E>=0,F>=0,H>=0,1>=F+H,J>=G,G>=H] 


#### Cost of chains of f15(A,B,C,D,E,F,G,H,I,J,M,N,O,P,Q,R,S,T,U,V):
* Chain [[61,62,63,64]]...: 36*it(61)+1*it(64)+12*s(102)+3*s(141)+1*s(142)+2*s(143)+9*s(144)+0
  Such that:it(64) =< -A+7*E
aux(257) =< -A+7*E+4
aux(228) =< E
aux(230) =< 3*E+5
aux(261) =< -A+E+1
aux(228) =< aux(261)
aux(231) =< aux(261)
it(64) =< aux(261)
aux(231) =< aux(257)
it(64) =< aux(257)
aux(233) =< aux(228)+1
aux(251) =< aux(228)*3+5
aux(229) =< aux(228)*2+2
aux(249) =< aux(228)-1
aux(230) =< aux(228)*3+5
aux(251) =< aux(230)+1
s(145) =< it(64)*aux(233)
s(147) =< it(64)*aux(229)
s(150) =< it(64)*aux(249)
s(148) =< it(64)*aux(251)
s(141) =< s(150)
s(142) =< s(150)
s(141) =< aux(231)
s(142) =< aux(231)
s(142) =< s(148)
s(141) =< s(147)
s(142) =< s(147)
s(143) =< s(147)
s(144) =< s(145)
s(141) =< s(145)
s(142) =< s(145)
s(143) =< s(145)
s(102) =< aux(231)

  with precondition: [E+1>=A,E>=0,H>=F,F>=0,1>=F,I=0] 

* Chain [[61,62,63,64],70]: 36*it(61)+1*it(64)+12*s(102)+3*s(141)+1*s(142)+2*s(143)+9*s(144)+3*s(158)+1*s(159)+2*s(160)+9*s(162)+0
  Such that:s(151) =< -A+E
it(64) =< -A+7*E
aux(257) =< -A+7*E+4
aux(262) =< E+1
aux(263) =< 2*E+2
aux(230) =< 3*E+5
s(152) =< 3*E+6
aux(264) =< -A+E+1
aux(265) =< E
aux(228) =< aux(265)
s(151) =< aux(265)
s(158) =< s(151)
s(159) =< s(151)
s(158) =< aux(263)
s(159) =< aux(263)
s(159) =< s(152)
s(160) =< aux(263)
s(162) =< aux(262)
s(158) =< aux(262)
s(159) =< aux(262)
s(160) =< aux(262)
aux(228) =< aux(264)
aux(231) =< aux(264)
it(64) =< aux(264)
aux(231) =< aux(257)
it(64) =< aux(257)
aux(233) =< aux(228)+1
aux(251) =< aux(228)*3+5
aux(229) =< aux(228)*2+2
aux(249) =< aux(228)-1
aux(230) =< aux(228)*3+5
aux(251) =< aux(230)+1
s(145) =< it(64)*aux(233)
s(147) =< it(64)*aux(229)
s(150) =< it(64)*aux(249)
s(148) =< it(64)*aux(251)
s(141) =< s(150)
s(142) =< s(150)
s(141) =< aux(231)
s(142) =< aux(231)
s(142) =< s(148)
s(141) =< s(147)
s(142) =< s(147)
s(143) =< s(147)
s(144) =< s(145)
s(141) =< s(145)
s(142) =< s(145)
s(143) =< s(145)
s(102) =< aux(231)

  with precondition: [F=0,I=0,M=3,H=G,1>=H,A>=1,C>=0,H>=0,E+1>=A,J>=H,E+H>=J] 

* Chain [[61,62,63,64],69]: 36*it(61)+1*it(64)+12*s(102)+3*s(141)+1*s(142)+2*s(143)+9*s(144)+3*s(170)+1*s(171)+2*s(172)+9*s(174)+0
  Such that:it(64) =< -A+7*E
aux(257) =< -A+7*E+4
aux(228) =< E
aux(266) =< E+1
aux(267) =< 2*E+2
aux(268) =< -A+E+1
aux(269) =< 3*E+5
aux(230) =< aux(269)
s(170) =< aux(268)
s(171) =< aux(268)
s(170) =< aux(267)
s(171) =< aux(267)
s(171) =< aux(269)
s(172) =< aux(267)
s(174) =< aux(266)
s(170) =< aux(266)
s(171) =< aux(266)
s(172) =< aux(266)
aux(228) =< aux(268)
aux(231) =< aux(268)
it(64) =< aux(268)
aux(231) =< aux(257)
it(64) =< aux(257)
aux(233) =< aux(228)+1
aux(251) =< aux(228)*3+5
aux(229) =< aux(228)*2+2
aux(249) =< aux(228)-1
aux(230) =< aux(228)*3+5
aux(251) =< aux(230)+1
s(145) =< it(64)*aux(233)
s(147) =< it(64)*aux(229)
s(150) =< it(64)*aux(249)
s(148) =< it(64)*aux(251)
s(141) =< s(150)
s(142) =< s(150)
s(141) =< aux(231)
s(142) =< aux(231)
s(142) =< s(148)
s(141) =< s(147)
s(142) =< s(147)
s(143) =< s(147)
s(144) =< s(145)
s(141) =< s(145)
s(142) =< s(145)
s(143) =< s(145)
s(102) =< aux(231)

  with precondition: [F=0,I=0,M=3,H=G,1>=H,A>=1,C>=0,H>=0,E+1>=A,J>=H,E+H>=J] 

* Chain [[61,62,63,64],68]: 36*it(61)+1*it(64)+12*s(102)+3*s(141)+1*s(142)+2*s(143)+9*s(144)+3*s(182)+1*s(183)+2*s(184)+9*s(186)+0
  Such that:it(64) =< -A+7*E
aux(257) =< -A+7*E+4
aux(228) =< E
aux(270) =< E+1
aux(271) =< 2*E+2
aux(272) =< -A+E+1
aux(273) =< 3*E+5
aux(230) =< aux(273)
s(182) =< aux(272)
s(183) =< aux(272)
s(182) =< aux(271)
s(183) =< aux(271)
s(183) =< aux(273)
s(184) =< aux(271)
s(186) =< aux(270)
s(182) =< aux(270)
s(183) =< aux(270)
s(184) =< aux(270)
aux(228) =< aux(272)
aux(231) =< aux(272)
it(64) =< aux(272)
aux(231) =< aux(257)
it(64) =< aux(257)
aux(233) =< aux(228)+1
aux(251) =< aux(228)*3+5
aux(229) =< aux(228)*2+2
aux(249) =< aux(228)-1
aux(230) =< aux(228)*3+5
aux(251) =< aux(230)+1
s(145) =< it(64)*aux(233)
s(147) =< it(64)*aux(229)
s(150) =< it(64)*aux(249)
s(148) =< it(64)*aux(251)
s(141) =< s(150)
s(142) =< s(150)
s(141) =< aux(231)
s(142) =< aux(231)
s(142) =< s(148)
s(141) =< s(147)
s(142) =< s(147)
s(143) =< s(147)
s(144) =< s(145)
s(141) =< s(145)
s(142) =< s(145)
s(143) =< s(145)
s(102) =< aux(231)

  with precondition: [F=0,I=0,M=3,H=G,1>=H,A>=1,C>=0,H>=0,E+1>=A,J>=H,E+H>=J] 

* Chain [[61,62,63,64],67]: 36*it(61)+1*it(64)+12*s(102)+3*s(141)+1*s(142)+2*s(143)+9*s(144)+3*s(194)+1*s(195)+2*s(196)+9*s(198)+0
  Such that:it(64) =< -A+7*E
aux(257) =< -A+7*E+4
aux(228) =< E
aux(274) =< E+1
aux(275) =< 2*E+2
aux(276) =< -A+E+1
aux(277) =< 3*E+5
aux(230) =< aux(277)
s(194) =< aux(276)
s(195) =< aux(276)
s(194) =< aux(275)
s(195) =< aux(275)
s(195) =< aux(277)
s(196) =< aux(275)
s(198) =< aux(274)
s(194) =< aux(274)
s(195) =< aux(274)
s(196) =< aux(274)
aux(228) =< aux(276)
aux(231) =< aux(276)
it(64) =< aux(276)
aux(231) =< aux(257)
it(64) =< aux(257)
aux(233) =< aux(228)+1
aux(251) =< aux(228)*3+5
aux(229) =< aux(228)*2+2
aux(249) =< aux(228)-1
aux(230) =< aux(228)*3+5
aux(251) =< aux(230)+1
s(145) =< it(64)*aux(233)
s(147) =< it(64)*aux(229)
s(150) =< it(64)*aux(249)
s(148) =< it(64)*aux(251)
s(141) =< s(150)
s(142) =< s(150)
s(141) =< aux(231)
s(142) =< aux(231)
s(142) =< s(148)
s(141) =< s(147)
s(142) =< s(147)
s(143) =< s(147)
s(144) =< s(145)
s(141) =< s(145)
s(142) =< s(145)
s(143) =< s(145)
s(102) =< aux(231)

  with precondition: [F=0,I=0,M=3,H=G,1>=H,A>=1,C>=0,H>=0,E+1>=A,J>=H,E+H>=J] 

* Chain [[61,62,63,64],65]: 36*it(61)+1*it(64)+12*s(102)+3*s(141)+1*s(142)+2*s(143)+9*s(144)+0
  Such that:it(64) =< -A+7*E
aux(257) =< -A+7*E+4
aux(228) =< E
aux(230) =< 3*E+5
aux(278) =< -A+E+1
aux(228) =< aux(278)
aux(231) =< aux(278)
it(64) =< aux(278)
aux(231) =< aux(257)
it(64) =< aux(257)
aux(233) =< aux(228)+1
aux(251) =< aux(228)*3+5
aux(229) =< aux(228)*2+2
aux(249) =< aux(228)-1
aux(230) =< aux(228)*3+5
aux(251) =< aux(230)+1
s(145) =< it(64)*aux(233)
s(147) =< it(64)*aux(229)
s(150) =< it(64)*aux(249)
s(148) =< it(64)*aux(251)
s(141) =< s(150)
s(142) =< s(150)
s(141) =< aux(231)
s(142) =< aux(231)
s(142) =< s(148)
s(141) =< s(147)
s(142) =< s(147)
s(143) =< s(147)
s(144) =< s(145)
s(141) =< s(145)
s(142) =< s(145)
s(143) =< s(145)
s(102) =< aux(231)

  with precondition: [F=0,I=0,M=3,H=G,1>=H,A>=1,C>=0,H>=0,E+1>=A,J>=H,E+H>=J] 

* Chain [[61,62,63,64],60,66]: 36*it(61)+1*it(64)+12*s(102)+3*s(141)+1*s(142)+2*s(143)+9*s(144)+3*s(206)+1*s(207)+2*s(208)+1*s(209)+9*s(210)+1
  Such that:it(64) =< -A+7*E
aux(257) =< -A+7*E+4
s(203) =< -A/2
aux(228) =< E
s(205) =< E+1
s(203) =< E-N/2+S/2+1
s(202) =< 2*E+2
s(201) =< 2*E+N+4
s(202) =< 3*E-N+3
s(203) =< -N/2+S/2+V
aux(279) =< -A+E+1
aux(280) =< -A+N
aux(281) =< 3*E+5
aux(256) =< aux(279)
aux(256) =< aux(280)
aux(230) =< aux(281)
s(201) =< aux(281)
s(206) =< aux(279)
s(207) =< aux(279)
s(206) =< aux(280)
s(207) =< aux(280)
s(207) =< s(201)
s(206) =< s(202)
s(207) =< s(202)
s(208) =< s(202)
s(209) =< s(203)
s(209) =< aux(280)
s(210) =< s(205)
s(209) =< s(205)
s(206) =< s(205)
s(207) =< s(205)
s(208) =< s(205)
aux(228) =< aux(279)
aux(231) =< aux(279)
it(64) =< aux(279)
aux(231) =< aux(256)
it(64) =< aux(256)
aux(231) =< aux(257)
it(64) =< aux(257)
aux(233) =< aux(228)+1
aux(251) =< aux(228)*3+5
aux(229) =< aux(228)*2+2
aux(249) =< aux(228)-1
aux(230) =< aux(228)*3+5
aux(251) =< aux(230)+1
s(145) =< it(64)*aux(233)
s(147) =< it(64)*aux(229)
s(150) =< it(64)*aux(249)
s(148) =< it(64)*aux(251)
s(141) =< s(150)
s(142) =< s(150)
s(141) =< aux(231)
s(142) =< aux(231)
s(142) =< s(148)
s(141) =< s(147)
s(142) =< s(147)
s(143) =< s(147)
s(144) =< s(145)
s(141) =< s(145)
s(142) =< s(145)
s(143) =< s(145)
s(102) =< aux(231)

  with precondition: [F=0,I=0,M=4,R=0,T=0,U=1,H=G,E+1=V,1>=H,1>=S,A>=1,C>=0,H>=0,S>=0,E+1>=A,N>=A,J>=H,E+H>=J,S+3*E+2>=N,P+S+2*E+1>=0,P+S+3*E+2>=N] 

* Chain [[61,62,63,64],60,65]: 36*it(61)+1*it(64)+12*s(102)+3*s(141)+1*s(142)+2*s(143)+9*s(144)+3*s(206)+1*s(207)+2*s(208)+9*s(210)+1
  Such that:it(64) =< -A+7*E
aux(257) =< -A+7*E+4
aux(228) =< E
aux(282) =< E+1
aux(283) =< 2*E+2
s(201) =< 4*E+7
aux(284) =< -A+E+1
aux(285) =< -A+2*E+3
aux(286) =< 3*E+5
aux(256) =< aux(284)
aux(256) =< aux(285)
aux(230) =< aux(286)
s(201) =< aux(286)
s(206) =< aux(284)
s(207) =< aux(284)
s(206) =< aux(283)
s(207) =< aux(283)
s(207) =< s(201)
s(208) =< aux(283)
s(210) =< aux(282)
s(206) =< aux(282)
s(207) =< aux(282)
s(208) =< aux(282)
aux(228) =< aux(284)
aux(231) =< aux(284)
it(64) =< aux(284)
aux(231) =< aux(256)
it(64) =< aux(256)
aux(231) =< aux(257)
it(64) =< aux(257)
aux(233) =< aux(228)+1
aux(251) =< aux(228)*3+5
aux(229) =< aux(228)*2+2
aux(249) =< aux(228)-1
aux(230) =< aux(228)*3+5
aux(251) =< aux(230)+1
s(145) =< it(64)*aux(233)
s(147) =< it(64)*aux(229)
s(150) =< it(64)*aux(249)
s(148) =< it(64)*aux(251)
s(141) =< s(150)
s(142) =< s(150)
s(141) =< aux(231)
s(142) =< aux(231)
s(142) =< s(148)
s(141) =< s(147)
s(142) =< s(147)
s(143) =< s(147)
s(144) =< s(145)
s(141) =< s(145)
s(142) =< s(145)
s(143) =< s(145)
s(102) =< aux(231)

  with precondition: [F=0,I=0,M=3,H=G,1>=H,A>=1,C>=0,H>=0,E+1>=A,J>=H,E+H>=J] 

* Chain [[61,62,63,64],59,66]: 36*it(61)+1*it(64)+12*s(102)+3*s(141)+1*s(142)+2*s(143)+9*s(144)+3*s(218)+1*s(219)+2*s(220)+9*s(222)+1
  Such that:it(64) =< -A+7*E
aux(257) =< -A+7*E+4
s(211) =< -A+V
aux(228) =< E
aux(287) =< E+1
s(214) =< 2*E+2
s(214) =< 2*E+3
s(213) =< 2*E+N+5
aux(230) =< 3*E+5
s(213) =< 3*E+6
s(211) =< -N-R+3*V
aux(288) =< -A+E+1
aux(289) =< -A+N
aux(256) =< aux(288)
aux(256) =< aux(289)
s(211) =< aux(287)
s(218) =< s(211)
s(219) =< s(211)
s(218) =< aux(289)
s(219) =< aux(289)
s(219) =< s(213)
s(218) =< s(214)
s(219) =< s(214)
s(220) =< s(214)
s(222) =< aux(287)
s(218) =< aux(287)
s(219) =< aux(287)
s(220) =< aux(287)
aux(228) =< aux(288)
aux(231) =< aux(288)
it(64) =< aux(288)
aux(231) =< aux(256)
it(64) =< aux(256)
aux(231) =< aux(257)
it(64) =< aux(257)
aux(233) =< aux(228)+1
aux(251) =< aux(228)*3+5
aux(229) =< aux(228)*2+2
aux(249) =< aux(228)-1
aux(230) =< aux(228)*3+5
aux(251) =< aux(230)+1
s(145) =< it(64)*aux(233)
s(147) =< it(64)*aux(229)
s(150) =< it(64)*aux(249)
s(148) =< it(64)*aux(251)
s(141) =< s(150)
s(142) =< s(150)
s(141) =< aux(231)
s(142) =< aux(231)
s(142) =< s(148)
s(141) =< s(147)
s(142) =< s(147)
s(143) =< s(147)
s(144) =< s(145)
s(141) =< s(145)
s(142) =< s(145)
s(143) =< s(145)
s(102) =< aux(231)

  with precondition: [F=0,I=0,M=4,T=0,U=1,H=G,E+1=V,1>=H,1>=R,1>=S,A>=1,C>=0,H>=0,R>=0,S>=0,E+1>=A,N>=A+1,J>=H,E+H>=J,3*E+4>=N+R,S+3*E+3>=N,P+2*E+2>=R,P+S+2*E+1>=0,P+3*E+4>=N+R,P+S+3*E+3>=N] 

* Chain [[61,62,63,64],59,65]: 36*it(61)+1*it(64)+12*s(102)+3*s(141)+1*s(142)+2*s(143)+9*s(144)+3*s(218)+1*s(219)+2*s(220)+9*s(222)+1
  Such that:s(211) =< -A+E
it(64) =< -A+7*E
aux(257) =< -A+7*E+4
aux(290) =< E+1
s(214) =< 2*E+2
aux(291) =< 2*E+3
aux(230) =< 3*E+5
s(213) =< 3*E+6
aux(292) =< -A+E+1
aux(293) =< E
aux(228) =< aux(293)
s(211) =< aux(293)
s(211) =< aux(290)
s(214) =< aux(291)
s(218) =< s(211)
s(219) =< s(211)
s(218) =< aux(291)
s(219) =< aux(291)
s(219) =< s(213)
s(218) =< s(214)
s(219) =< s(214)
s(220) =< s(214)
s(222) =< aux(290)
s(218) =< aux(290)
s(219) =< aux(290)
s(220) =< aux(290)
aux(228) =< aux(292)
aux(231) =< aux(292)
it(64) =< aux(292)
aux(231) =< aux(257)
it(64) =< aux(257)
aux(233) =< aux(228)+1
aux(251) =< aux(228)*3+5
aux(229) =< aux(228)*2+2
aux(249) =< aux(228)-1
aux(230) =< aux(228)*3+5
aux(251) =< aux(230)+1
s(145) =< it(64)*aux(233)
s(147) =< it(64)*aux(229)
s(150) =< it(64)*aux(249)
s(148) =< it(64)*aux(251)
s(141) =< s(150)
s(142) =< s(150)
s(141) =< aux(231)
s(142) =< aux(231)
s(142) =< s(148)
s(141) =< s(147)
s(142) =< s(147)
s(143) =< s(147)
s(144) =< s(145)
s(141) =< s(145)
s(142) =< s(145)
s(143) =< s(145)
s(102) =< aux(231)

  with precondition: [F=0,I=0,M=3,H=G,1>=H,A>=1,C>=0,H>=0,E+1>=A,J>=H,E+H>=J] 

* Chain [[61,62,63,64],58,66]: 36*it(61)+1*it(64)+12*s(102)+3*s(141)+1*s(142)+2*s(143)+9*s(144)+3*s(230)+1*s(231)+2*s(232)+1*s(233)+9*s(234)+1
  Such that:it(64) =< -A+7*E
aux(257) =< -A+7*E+4
s(227) =< -A/2
aux(228) =< E
s(229) =< E+1
s(227) =< E-N/2-R/2+1
s(226) =< 2*E+2
s(225) =< 2*E+N+4
aux(230) =< 3*E+5
s(227) =< -N/2-R/2+V
aux(294) =< -A+E+1
aux(295) =< -A+N
s(230) =< aux(294)
s(231) =< aux(294)
s(230) =< aux(295)
s(231) =< aux(295)
s(231) =< s(225)
s(230) =< s(226)
s(231) =< s(226)
s(232) =< s(226)
s(233) =< s(227)
s(233) =< aux(295)
s(234) =< s(229)
s(233) =< s(229)
s(230) =< s(229)
s(231) =< s(229)
s(232) =< s(229)
aux(228) =< aux(294)
aux(231) =< aux(294)
it(64) =< aux(294)
aux(231) =< aux(295)
it(64) =< aux(295)
aux(231) =< aux(257)
it(64) =< aux(257)
aux(233) =< aux(228)+1
aux(251) =< aux(228)*3+5
aux(229) =< aux(228)*2+2
aux(249) =< aux(228)-1
aux(230) =< aux(228)*3+5
aux(251) =< aux(230)+1
s(145) =< it(64)*aux(233)
s(147) =< it(64)*aux(229)
s(150) =< it(64)*aux(249)
s(148) =< it(64)*aux(251)
s(141) =< s(150)
s(142) =< s(150)
s(141) =< aux(231)
s(142) =< aux(231)
s(142) =< s(148)
s(141) =< s(147)
s(142) =< s(147)
s(143) =< s(147)
s(144) =< s(145)
s(141) =< s(145)
s(142) =< s(145)
s(143) =< s(145)
s(102) =< aux(231)

  with precondition: [F=0,I=0,M=4,T=0,U=1,H=G,E+1=V,1>=H,1>=R,1>=S,A>=1,C>=0,H>=0,R>=0,S>=0,E+1>=A,N>=A,J>=H,E+H>=J,3*E+3>=N+R,S+3*E+2>=N,P+2*E+2>=R,P+S+2*E+1>=0,P+3*E+3>=N+R,P+S+3*E+2>=N] 

* Chain [[61,62,63,64],58,65]: 36*it(61)+1*it(64)+12*s(102)+3*s(141)+1*s(142)+2*s(143)+9*s(144)+3*s(230)+1*s(231)+2*s(232)+9*s(234)+1
  Such that:it(64) =< -A+7*E
aux(257) =< -A+7*E+4
aux(228) =< E
aux(296) =< E+1
aux(297) =< 2*E+2
s(225) =< 4*E+6
aux(298) =< -A+E+1
aux(299) =< -A+2*E+2
aux(300) =< 3*E+5
aux(256) =< aux(298)
aux(256) =< aux(299)
aux(230) =< aux(300)
s(225) =< aux(300)
s(230) =< aux(298)
s(231) =< aux(298)
s(230) =< aux(297)
s(231) =< aux(297)
s(231) =< s(225)
s(232) =< aux(297)
s(234) =< aux(296)
s(230) =< aux(296)
s(231) =< aux(296)
s(232) =< aux(296)
aux(228) =< aux(298)
aux(231) =< aux(298)
it(64) =< aux(298)
aux(231) =< aux(256)
it(64) =< aux(256)
aux(231) =< aux(257)
it(64) =< aux(257)
aux(233) =< aux(228)+1
aux(251) =< aux(228)*3+5
aux(229) =< aux(228)*2+2
aux(249) =< aux(228)-1
aux(230) =< aux(228)*3+5
aux(251) =< aux(230)+1
s(145) =< it(64)*aux(233)
s(147) =< it(64)*aux(229)
s(150) =< it(64)*aux(249)
s(148) =< it(64)*aux(251)
s(141) =< s(150)
s(142) =< s(150)
s(141) =< aux(231)
s(142) =< aux(231)
s(142) =< s(148)
s(141) =< s(147)
s(142) =< s(147)
s(143) =< s(147)
s(144) =< s(145)
s(141) =< s(145)
s(142) =< s(145)
s(143) =< s(145)
s(102) =< aux(231)

  with precondition: [F=0,I=0,M=3,H=G,1>=H,A>=1,C>=0,H>=0,E+1>=A,J>=H,E+H>=J] 

* Chain [[61,62,63,64],57,66]: 36*it(61)+1*it(64)+12*s(102)+3*s(141)+1*s(142)+2*s(143)+9*s(144)+3*s(242)+1*s(243)+2*s(244)+1*s(245)+9*s(246)+1
  Such that:it(64) =< -A+7*E
aux(257) =< -A+7*E+4
s(239) =< -A/2
aux(228) =< E
s(241) =< E+1
s(239) =< E-N/2-R/2+1
s(238) =< 2*E+2
s(237) =< 2*E+N+4
aux(230) =< 3*E+5
s(239) =< -N/2-R/2+V
aux(301) =< -A+E+1
aux(302) =< -A+N
s(242) =< aux(301)
s(243) =< aux(301)
s(242) =< aux(302)
s(243) =< aux(302)
s(243) =< s(237)
s(242) =< s(238)
s(243) =< s(238)
s(244) =< s(238)
s(245) =< s(239)
s(245) =< aux(302)
s(246) =< s(241)
s(245) =< s(241)
s(242) =< s(241)
s(243) =< s(241)
s(244) =< s(241)
aux(228) =< aux(301)
aux(231) =< aux(301)
it(64) =< aux(301)
aux(231) =< aux(302)
it(64) =< aux(302)
aux(231) =< aux(257)
it(64) =< aux(257)
aux(233) =< aux(228)+1
aux(251) =< aux(228)*3+5
aux(229) =< aux(228)*2+2
aux(249) =< aux(228)-1
aux(230) =< aux(228)*3+5
aux(251) =< aux(230)+1
s(145) =< it(64)*aux(233)
s(147) =< it(64)*aux(229)
s(150) =< it(64)*aux(249)
s(148) =< it(64)*aux(251)
s(141) =< s(150)
s(142) =< s(150)
s(141) =< aux(231)
s(142) =< aux(231)
s(142) =< s(148)
s(141) =< s(147)
s(142) =< s(147)
s(143) =< s(147)
s(144) =< s(145)
s(141) =< s(145)
s(142) =< s(145)
s(143) =< s(145)
s(102) =< aux(231)

  with precondition: [F=0,I=0,M=4,T=0,U=1,H=G,E+1=V,1>=H,1>=R,1>=S,A>=1,C>=0,H>=0,R>=0,S>=0,E+1>=A,N>=A,J>=H,E+H>=J,3*E+3>=N+R,S+3*E+2>=N,P+2*E+2>=R,P+S+2*E+1>=0,P+3*E+3>=N+R,P+S+3*E+2>=N] 

* Chain [[61,62,63,64],57,65]: 36*it(61)+1*it(64)+12*s(102)+3*s(141)+1*s(142)+2*s(143)+9*s(144)+3*s(242)+1*s(243)+2*s(244)+9*s(246)+1
  Such that:it(64) =< -A+7*E
aux(257) =< -A+7*E+4
aux(228) =< E
aux(303) =< E+1
aux(304) =< 2*E+2
s(237) =< 4*E+6
aux(305) =< -A+E+1
aux(306) =< -A+2*E+2
aux(307) =< 3*E+5
aux(256) =< aux(305)
aux(256) =< aux(306)
aux(230) =< aux(307)
s(237) =< aux(307)
s(242) =< aux(305)
s(243) =< aux(305)
s(242) =< aux(304)
s(243) =< aux(304)
s(243) =< s(237)
s(244) =< aux(304)
s(246) =< aux(303)
s(242) =< aux(303)
s(243) =< aux(303)
s(244) =< aux(303)
aux(228) =< aux(305)
aux(231) =< aux(305)
it(64) =< aux(305)
aux(231) =< aux(256)
it(64) =< aux(256)
aux(231) =< aux(257)
it(64) =< aux(257)
aux(233) =< aux(228)+1
aux(251) =< aux(228)*3+5
aux(229) =< aux(228)*2+2
aux(249) =< aux(228)-1
aux(230) =< aux(228)*3+5
aux(251) =< aux(230)+1
s(145) =< it(64)*aux(233)
s(147) =< it(64)*aux(229)
s(150) =< it(64)*aux(249)
s(148) =< it(64)*aux(251)
s(141) =< s(150)
s(142) =< s(150)
s(141) =< aux(231)
s(142) =< aux(231)
s(142) =< s(148)
s(141) =< s(147)
s(142) =< s(147)
s(143) =< s(147)
s(144) =< s(145)
s(141) =< s(145)
s(142) =< s(145)
s(143) =< s(145)
s(102) =< aux(231)

  with precondition: [F=0,I=0,M=3,H=G,1>=H,A>=1,C>=0,H>=0,E+1>=A,J>=H,E+H>=J] 

* Chain [69]: 3*s(170)+1*s(171)+2*s(172)+9*s(174)+0
  Such that:s(163) =< -A+E+1
s(164) =< A+2*E+4
aux(266) =< E+1
aux(267) =< 2*E+2
s(170) =< s(163)
s(171) =< s(163)
s(170) =< aux(267)
s(171) =< aux(267)
s(171) =< s(164)
s(172) =< aux(267)
s(174) =< aux(266)
s(170) =< aux(266)
s(171) =< aux(266)
s(172) =< aux(266)

  with precondition: [C=0,F=0,I=0,M=3,H=G,0>=D,1>=H,A>=1,B>=1,H>=0,E+1>=A,J>=H,E+H>=J] 

* Chain [67]: 3*s(194)+1*s(195)+2*s(196)+9*s(198)+0
  Such that:s(187) =< -A+E+1
s(188) =< A+2*E+4
aux(274) =< E+1
aux(275) =< 2*E+2
s(194) =< s(187)
s(195) =< s(187)
s(194) =< aux(275)
s(195) =< aux(275)
s(195) =< s(188)
s(196) =< aux(275)
s(198) =< aux(274)
s(194) =< aux(274)
s(195) =< aux(274)
s(196) =< aux(274)

  with precondition: [F=0,I=0,M=3,H=G,1>=H,A>=1,C>=1,H>=0,E+1>=A,J>=H,E+H>=J] 

* Chain [65]: 0
  with precondition: [M=3,A>=1,F>=0,H>=0,I>=F,1>=H+I,G>=H,H+I>=G,J>=H+I,C+2*J>=2*H+F,E+H+I>=J,E+G+2*J+1>=3*H+A,C+G+2*J>=3*H+I,C+E+G+2*J+1>=3*H+A,E+I+2*J+1>=2*H+A+F,C+E+I+2*J+1>=2*H+A+F] 

* Chain [60,66]: 3*s(206)+1*s(207)+2*s(208)+1*s(209)+9*s(210)+1
  Such that:s(200) =< -A+N
s(199) =< -A+V
s(202) =< A-N+2*V
s(201) =< A+2*V+2
s(203) =< -A/2
s(204) =< -A/2+N/2
s(203) =< E-N/2+S/2+1
s(203) =< -N/2+S/2+V
s(205) =< V
s(206) =< s(199)
s(207) =< s(199)
s(206) =< s(200)
s(207) =< s(200)
s(207) =< s(201)
s(206) =< s(202)
s(207) =< s(202)
s(208) =< s(202)
s(209) =< s(203)
s(209) =< s(204)
s(210) =< s(205)
s(209) =< s(205)
s(206) =< s(205)
s(207) =< s(205)
s(208) =< s(205)

  with precondition: [C=0,F=0,I=0,M=4,R=0,T=0,U=1,G=H,E+1=V,0>=D,1>=G,1>=S,A>=1,B>=1,G>=0,S>=0,E+1>=A,N>=A,J>=G,E+G>=J,A+S+2*E+1>=N,A+P+S+2*E+1>=N] 

* Chain [60,65]: 3*s(206)+1*s(207)+2*s(208)+1*s(209)+9*s(210)+1
  Such that:s(199) =< -A+E+1
s(201) =< A+2*E+4
s(203) =< -A/2
s(203) =< -A/2+E+3/2
aux(282) =< E+1
aux(283) =< 2*E+2
s(203) =< aux(282)
s(204) =< aux(282)
s(204) =< aux(283)
s(206) =< s(199)
s(207) =< s(199)
s(206) =< aux(283)
s(207) =< aux(283)
s(207) =< s(201)
s(208) =< aux(283)
s(209) =< s(203)
s(209) =< s(204)
s(210) =< aux(282)
s(209) =< aux(282)
s(206) =< aux(282)
s(207) =< aux(282)
s(208) =< aux(282)

  with precondition: [C=0,F=0,I=0,M=3,G=H,0>=D,1>=G,A>=1,B>=1,G>=0,E+1>=A,J>=G,E+G>=J] 

* Chain [57,66]: 3*s(242)+1*s(243)+2*s(244)+1*s(245)+9*s(246)+1
  Such that:s(236) =< -A+N
s(235) =< -A+V
s(238) =< A-N+2*V
s(237) =< A+2*V+2
s(239) =< -A/2
s(240) =< -A/2+N/2
s(239) =< E-N/2-R/2+1
s(239) =< -N/2-R/2+V
s(241) =< V
s(242) =< s(235)
s(243) =< s(235)
s(242) =< s(236)
s(243) =< s(236)
s(243) =< s(237)
s(242) =< s(238)
s(243) =< s(238)
s(244) =< s(238)
s(245) =< s(239)
s(245) =< s(240)
s(246) =< s(241)
s(245) =< s(241)
s(242) =< s(241)
s(243) =< s(241)
s(244) =< s(241)

  with precondition: [F=0,I=0,M=4,T=0,U=1,G=H,E+1=V,1>=G,1>=R,1>=S,A>=1,C>=1,G>=0,R>=0,S>=0,E+1>=A,N>=A,J>=G,E+G>=J,A+2*E+2>=N+R,A+S+2*E+1>=N,A+P+2*E+3>=C+N+R,A+P+S+2*E+2>=C+N] 

* Chain [57,65]: 3*s(242)+1*s(243)+2*s(244)+1*s(245)+9*s(246)+1
  Such that:s(235) =< -A+E+1
s(237) =< A+2*E+4
s(239) =< -A/2
s(239) =< -A/2+E+1
s(239) =< E+1/2
aux(303) =< E+1
aux(304) =< 2*E+2
s(240) =< aux(303)
s(240) =< aux(304)
s(242) =< s(235)
s(243) =< s(235)
s(242) =< aux(304)
s(243) =< aux(304)
s(243) =< s(237)
s(244) =< aux(304)
s(245) =< s(239)
s(245) =< s(240)
s(246) =< aux(303)
s(245) =< aux(303)
s(242) =< aux(303)
s(243) =< aux(303)
s(244) =< aux(303)

  with precondition: [F=0,I=0,M=3,G=H,1>=G,A>=1,C>=1,G>=0,E+1>=A,J>=G,E+G>=J] 


#### Cost of chains of f15_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L):
* Chain [72]: 0
  with precondition: [A=3,F>=0] 

* Chain [71]: 0
  with precondition: [A=4,F>=0] 


#### Cost of chains of f0(A,B,C,D,E,F,G,H,I,J,M):
* Chain [74]: 1*aux(331)+0
  with precondition: [] 

* Chain [73]...: 1*aux(332)+0
  with precondition: [] 


Closed-form bounds of f0(A,B,C,D,E,F,G,H,I,J,M): 
-------------------------------------
* Chain [74] with precondition: [] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [73]... with precondition: [] 
    - Upper bound: inf 
    - Complexity: infinity 

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