WARNING: Excluded non-linear constraints:[E=A+B*B*C,F=B-2*(C*C),A+B*B>=0+1]

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

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

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

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

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


### Cost equations --> "Loop" of l1/4 
* CEs [5] --> Loop 4 
* CEs [4] --> Loop 5 

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

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


### Specialization of cost equations l0/4 
* CE 1 is refined into CE [6,7] 


### Cost equations --> "Loop" of l0/4 
* CEs [7] --> Loop 6 
* CEs [6] --> Loop 7 

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

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


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

#### Cost of chains of l1(A,B,C,D):
* Chain [[4]]...: 1*it(4)+0
  with precondition: [0>=C+1,D=2] 

* Chain [[4],5]: 1*it(4)+0
  with precondition: [D=2,0>=C+1] 

* Chain [5]: 0
  with precondition: [D=2,0>=C+1] 


#### Cost of chains of l0(A,B,C,D):
* Chain [7]: 1*s(2)+0
  with precondition: [0>=C+1] 

* Chain [6]...: 1*s(3)+0
  with precondition: [0>=C+1] 


Closed-form bounds of l0(A,B,C,D): 
-------------------------------------
* Chain [7] with precondition: [0>=C+1] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [6]... with precondition: [0>=C+1] 
    - Upper bound: inf 
    - Complexity: infinity 

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

