YES

Solver Timeout: 4
Global Timeout: 60
No parsing errors!
Init Location: 0
Transitions:
<l0, l7, true>
<l1, l2, true, par{nI6^0 -> (1 + nI6^0), res5^0 -> ((0 + res5^0) + tmp7^0)}>
<l3, l1, true, par{tmp7^0 -> 0}>
<l3, l1, true, par{tmp7^0 -> 1}>
<l4, l5, (16 <= (0 + nI6^0)) /\ (undef40 = (0 + res5^0)) /\ (undef36 = (0 + nX^0)) /\ (undef45 = (0 + undef36)) /\ (undef46 = undef46) /\ (undef47 = undef47) /\ (undef48 = undef48) /\ (undef38 = undef38) /\ (undef41 = (0 + undef38)), par{nX9^0 -> undef36, res10^0 -> undef38, ret_nBC18^0 -> undef40, ret_nBC211^0 -> undef41, tmp^0 -> (0 + undef40), tmp___0^0 -> (0 + undef41)}>
<l4, l3, ((1 + nI6^0) <= 16)>
<l2, l4, true>
<l6, l2, true, par{nI6^0 -> 0, nX4^0 -> (0 + nX^0), res5^0 -> 0}>
<l7, l6, true>

Fresh variables:
undef36, undef38, undef40, undef41, undef45, undef46, undef47, undef48, 

Undef variables:
undef36, undef38, undef40, undef41, undef45, undef46, undef47, undef48, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (nI6^0 = 0) /\ (res5^0 = 0)>
<l2, l5, (16 <= (0 + nI6^0)) /\ (undef40 = (0 + res5^0)) /\ (undef36 = (0 + nX^0)) /\ (undef45 = (0 + undef36)) /\ (undef46 = undef46) /\ (undef47 = undef47) /\ (undef48 = undef48) /\ (undef38 = undef38) /\ (undef41 = (0 + undef38))>
<l2, l2, ((1 + nI6^0) <= 16), par{nI6^0 -> (1 + nI6^0), res5^0 -> ((0 + res5^0) + 0)}>
<l2, l2, ((1 + nI6^0) <= 16), par{nI6^0 -> (1 + nI6^0), res5^0 -> ((0 + res5^0) + 1)}>

Fresh variables:
undef36, undef38, undef40, undef41, undef45, undef46, undef47, undef48, 

Undef variables:
undef36, undef38, undef40, undef41, undef45, undef46, undef47, undef48, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

*************************************************************
*******************************************************************************************
***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
*******************************************************************************************

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, nI6^0 <= 15, {nI6^0 -> 1 + nI6^0, rest remain the same}>
<l2, l2, nI6^0 <= 15, {nI6^0 -> 1 + nI6^0, res5^0 -> 1 + res5^0, rest remain the same}>
Variables:
nI6^0, res5^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l2, nI6^0 = 0 /\ res5^0 = 0, {all remain the same}>

Graph 2
<l2, l5, 16 <= nI6^0 /\ nX^0 = undef36 /\ res5^0 = undef40 /\ undef36 = undef45 /\ undef38 = undef41, {all remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 2 , 1 )
( 5 , 2 )

*******************************************************************************************
********************************    CHECKING ASSERTIONS    ********************************
*******************************************************************************************

Proving termination of subgraph 0
Proving termination of subgraph 1
Checking unfeasibility...
Time used: 0.00354

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000941s
Ranking function: 15 - nI6^0
New Graphs: 
Proving termination of subgraph 2
Analyzing SCC {l5}...
No cycles found.

Program Terminates