WARNING: Excluded non-linear constraints:[J=A*A+D]

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

#### Computed strongly connected components 
0. recursive  : [l1/9]
1. non_recursive  : [exit_location/1]
2. recursive  : [l2/2]
3. non_recursive  : [l2_loop_cont/2]
4. non_recursive  : [l1_loop_cont/6]
5. non_recursive  : [l0/5]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into l1/9
1. SCC is completely evaluated into other SCCs
2. SCC is partially evaluated into l2/2
3. SCC is completely evaluated into other SCCs
4. SCC is partially evaluated into l1_loop_cont/6
5. SCC is partially evaluated into l0/5

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

### Specialization of cost equations l1/9 
* CE 3 is refined into CE [9] 
* CE 4 is refined into CE [10] 
* CE 2 is refined into CE [11] 


### Cost equations --> "Loop" of l1/9 
* CEs [11] --> Loop 9 
* CEs [9] --> Loop 10 
* CEs [10] --> Loop 11 

### Ranking functions of CR l1(A,B,C,D,E,F,G,H,I) 
* RF of phase [9]: [A]

#### Partial ranking functions of CR l1(A,B,C,D,E,F,G,H,I) 
* Partial RF of phase [9]:
  - RF of loop [9:1]:
    A


### Specialization of cost equations l2/2 
* CE 8 is refined into CE [12] 
* CE 7 is refined into CE [13] 


### Cost equations --> "Loop" of l2/2 
* CEs [13] --> Loop 12 
* CEs [12] --> Loop 13 

### Ranking functions of CR l2(D,E) 
* RF of phase [12]: [D]

#### Partial ranking functions of CR l2(D,E) 
* Partial RF of phase [12]:
  - RF of loop [12:1]:
    D


### Specialization of cost equations l1_loop_cont/6 
* CE 6 is refined into CE [14,15] 
* CE 5 is refined into CE [16] 


### Cost equations --> "Loop" of l1_loop_cont/6 
* CEs [15] --> Loop 14 
* CEs [14] --> Loop 15 
* CEs [16] --> Loop 16 

### Ranking functions of CR l1_loop_cont(A,B,C,D,E,F) 

#### Partial ranking functions of CR l1_loop_cont(A,B,C,D,E,F) 


### Specialization of cost equations l0/5 
* CE 1 is refined into CE [17,18,19,20,21,22] 


### Cost equations --> "Loop" of l0/5 
* CEs [20] --> Loop 17 
* CEs [18,21,22] --> Loop 18 
* CEs [17,19] --> Loop 19 

### Ranking functions of CR l0(A,B,C,D,E) 

#### Partial ranking functions of CR l0(A,B,C,D,E) 


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

#### Cost of chains of l1(A,B,C,D,E,F,G,H,I):
* Chain [[9],11]: 1*it(9)+0
  Such that:it(9) =< A

  with precondition: [E=2,A>=1] 

* Chain [[9],10]: 1*it(9)+0
  Such that:it(9) =< A-F

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

* Chain [11]: 0
  with precondition: [E=2] 

* Chain [10]: 0
  with precondition: [E=3,F=A,G=B,H=C,I=D] 


#### Cost of chains of l2(D,E):
* Chain [[12],13]: 1*it(12)+0
  Such that:it(12) =< D

  with precondition: [E=2,D>=1] 

* Chain [13]: 0
  with precondition: [E=2] 


#### Cost of chains of l1_loop_cont(A,B,C,D,E,F):
* Chain [16]: 0
  with precondition: [A=2] 

* Chain [15]: 0
  with precondition: [A=3] 

* Chain [14]: 1*s(1)+0
  Such that:s(1) =< E

  with precondition: [A=3,E>=1] 


#### Cost of chains of l0(A,B,C,D,E):
* Chain [19]: 0
  with precondition: [] 

* Chain [18]: 3*s(2)+1*s(5)+0
  Such that:aux(1) =< A
s(2) =< aux(1)

  with precondition: [A>=1] 

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

  with precondition: [D>=1] 


Closed-form bounds of l0(A,B,C,D,E): 
-------------------------------------
* Chain [19] with precondition: [] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [18] with precondition: [A>=1] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [17] with precondition: [D>=1] 
    - Upper bound: D 
    - Complexity: n 

### Maximum cost of l0(A,B,C,D,E): inf 
Asymptotic class: infinity 
* Total analysis performed in 49 ms.

