YES

Solver Timeout: 4
Global Timeout: 60
No parsing errors!
Init Location: 0
Transitions:
<l0, l25, true>
<l1, l2, true>
<l3, l4, true>
<l5, l6, true>
<l7, l8, true>
<l9, l10, (4 <= (0 + j62^0)), par{i61^0 -> (1 + i61^0)}>
<l9, l11, ((1 + j62^0) <= 4), par{j62^0 -> (1 + j62^0)}>
<l12, l13, (8 <= (0 + i61^0)), par{k63^0 -> (7 + k63^0), m64^0 -> (3 + m64^0), n65^0 -> (3 + n65^0), p66^0 -> (~(7) + p66^0)}>
<l12, l11, ((1 + i61^0) <= 8), par{j62^0 -> 0}>
<l14, l15, (9 <= (0 + k63^0))>
<l14, l10, ((0 + k63^0) <= 8), par{i61^0 -> 0}>
<l16, l13, ((1 + numbasis49^0) <= (0 + j55^0)) /\ (undef448 = (0 + g51^0)), par{k63^0 -> 1, m64^0 -> 0, n65^0 -> 13, p66^0 -> 8, ret_codebook57^0 -> undef448, tmp___0^0 -> (0 + undef448)}>
<l16, l17, ((0 + j55^0) <= (0 + numbasis49^0)), par{j55^0 -> (1 + j55^0)}>
<l8, l17, (50 <= (0 + n45^0)) /\ (undef505 = 1) /\ (undef507 = undef507) /\ (undef541 = undef541), par{bitchanged48^0 -> undef505, codeword50^0 -> undef507, ddim53^0 -> (0 + c^0), g51^0 -> (0 + d^0), j55^0 -> (1 + undef505), mask47^0 -> (0 + d^0), numbasis49^0 -> 17, theta54^0 -> 1, tmpMask56^0 -> undef541}>
<l8, l7, ((1 + n45^0) <= 50) /\ (undef581 = undef581) /\ (undef588 = undef588), par{n45^0 -> (1 + n45^0), t44^0 -> undef581, x43^0 -> undef588}>
<l17, l16, true>
<l6, l7, ((1 + i37^0) <= 0) /\ (undef659 = (0 + f36^0)) /\ (undef672 = undef672), par{d^0 -> (0 + undef659), n45^0 -> 0, ret_latsynth38^0 -> undef659, x43^0 -> undef672}>
<l6, l5, (0 <= (0 + i37^0)) /\ (undef679 = undef679), par{f36^0 -> undef679, i37^0 -> (~(1) + i37^0)}>
<l4, l1, (32 <= (0 + i25^0)), par{j26^0 -> (2 + j26^0)}>
<l4, l3, ((1 + i25^0) <= 32) /\ (undef797 = undef797) /\ (undef765 = undef765) /\ (undef799 = undef799) /\ (undef800 = undef800) /\ (undef796 = undef796) /\ (undef766 = undef766) /\ (undef788 = undef788) /\ (undef789 = undef789), par{h031^0 -> undef765, h132^0 -> undef766, i25^0 -> (2 + i25^0), sum027^0 -> undef788, sum128^0 -> undef789, x029^0 -> undef796, x130^0 -> undef797}>
<l2, l5, (100 <= (0 + j26^0)) /\ (undef823 = 100) /\ (undef843 = (0 + d^0)) /\ (undef807 = undef807), par{f36^0 -> undef807, i37^0 -> (~(2) + undef823), n35^0 -> undef823}>
<l2, l3, ((1 + j26^0) <= 100) /\ (undef883 = undef883), par{i25^0 -> 0, sum027^0 -> 0, sum128^0 -> 0, x029^0 -> undef883}>
<l18, l19, (50 <= (0 + j20^0)), par{i19^0 -> (1 + i19^0)}>
<l18, l20, ((1 + j20^0) <= 50) /\ (undef961 = undef961), par{j20^0 -> (1 + j20^0), sum21^0 -> undef961}>
<l21, l1, (50 <= (0 + i19^0)), par{j26^0 -> 0}>
<l21, l20, ((1 + i19^0) <= 50), par{j20^0 -> 0, sum21^0 -> 0}>
<l22, l19, (150 <= (0 + i13^0)) /\ (undef1083 = (0 + sqr11^0)) /\ (undef1091 = (0 + undef1083)), par{c^0 -> (0 + undef1091), i19^0 -> 0, ret_mac15^0 -> undef1083, tmp^0 -> undef1091}>
<l22, l23, ((1 + i13^0) <= 150) /\ (undef1101 = undef1101) /\ (undef1126 = undef1126), par{dotp14^0 -> undef1101, i13^0 -> (1 + i13^0), sqr11^0 -> undef1126}>
<l13, l14, true>
<l10, l12, true>
<l11, l9, true>
<l23, l22, true>
<l19, l21, true>
<l20, l18, true>
<l24, l23, (undef1391 = 3) /\ (undef1395 = undef1395), par{c^0 -> undef1391, d^0 -> 43690, dotp14^0 -> undef1395, i13^0 -> 0, sqr11^0 -> (0 + undef1391)}>
<l25, l24, true>

Fresh variables:
undef448, undef505, undef507, undef541, undef581, undef588, undef659, undef672, undef679, undef765, undef766, undef788, undef789, undef796, undef797, undef799, undef800, undef807, undef823, undef843, undef883, undef961, undef1083, undef1091, undef1101, undef1126, undef1391, undef1395, 

Undef variables:
undef448, undef505, undef507, undef541, undef581, undef588, undef659, undef672, undef679, undef765, undef766, undef788, undef789, undef796, undef797, undef799, undef800, undef807, undef823, undef843, undef883, undef961, undef1083, undef1091, undef1101, undef1126, undef1391, undef1395, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l23, (c^0 = undef1391) /\ (d^0 = 43690) /\ (i13^0 = 0) /\ (sqr11^0 = (0 + undef1391)) /\ (undef1391 = 3) /\ (undef1395 = undef1395)>
<l3, l5, (32 <= (0 + i25^0)) /\ (100 <= (0 + (2 + j26^0))) /\ (undef823 = 100) /\ (undef843 = (0 + d^0)) /\ (undef807 = undef807), par{f36^0 -> undef807, i37^0 -> (~(2) + undef823), j26^0 -> (2 + j26^0)}>
<l3, l3, (32 <= (0 + i25^0)) /\ ((1 + (2 + j26^0)) <= 100) /\ (undef883 = undef883), par{i25^0 -> 0, j26^0 -> (2 + j26^0)}>
<l3, l3, ((1 + i25^0) <= 32) /\ (undef797 = undef797) /\ (undef765 = undef765) /\ (undef799 = undef799) /\ (undef800 = undef800) /\ (undef796 = undef796) /\ (undef766 = undef766) /\ (undef788 = undef788) /\ (undef789 = undef789), par{i25^0 -> (2 + i25^0)}>
<l5, l7, ((1 + i37^0) <= 0) /\ (undef659 = (0 + f36^0)) /\ (undef672 = undef672), par{d^0 -> (0 + undef659), n45^0 -> 0}>
<l5, l5, (0 <= (0 + i37^0)) /\ (undef679 = undef679), par{f36^0 -> undef679, i37^0 -> (~(1) + i37^0)}>
<l7, l17, (50 <= (0 + n45^0)) /\ (undef505 = 1) /\ (undef507 = undef507) /\ (undef541 = undef541), par{g51^0 -> (0 + d^0), j55^0 -> (1 + undef505), numbasis49^0 -> 17}>
<l7, l7, ((1 + n45^0) <= 50) /\ (undef581 = undef581) /\ (undef588 = undef588), par{n45^0 -> (1 + n45^0)}>
<l11, l15, (4 <= (0 + j62^0)) /\ (8 <= (0 + (1 + i61^0))) /\ (9 <= (0 + (7 + k63^0))), par{i61^0 -> (1 + i61^0), k63^0 -> (7 + k63^0), m64^0 -> (3 + m64^0), n65^0 -> (3 + n65^0), p66^0 -> (~(7) + p66^0)}>
<l11, l11, (4 <= (0 + j62^0)) /\ (8 <= (0 + (1 + i61^0))) /\ ((0 + (7 + k63^0)) <= 8) /\ ((1 + 0) <= 8), par{i61^0 -> 0, j62^0 -> 0, k63^0 -> (7 + k63^0), m64^0 -> (3 + m64^0), n65^0 -> (3 + n65^0), p66^0 -> (~(7) + p66^0)}>
<l11, l11, (4 <= (0 + j62^0)) /\ ((1 + (1 + i61^0)) <= 8), par{i61^0 -> (1 + i61^0), j62^0 -> 0}>
<l11, l11, ((1 + j62^0) <= 4), par{j62^0 -> (1 + j62^0)}>
<l17, l11, ((1 + numbasis49^0) <= (0 + j55^0)) /\ (undef448 = (0 + g51^0)) /\ ((0 + 1) <= 8) /\ ((1 + 0) <= 8), par{i61^0 -> 0, j62^0 -> 0, k63^0 -> 1, m64^0 -> 0, n65^0 -> 13, p66^0 -> 8}>
<l17, l17, ((0 + j55^0) <= (0 + numbasis49^0)), par{j55^0 -> (1 + j55^0)}>
<l20, l3, (50 <= (0 + j20^0)) /\ (50 <= (0 + (1 + i19^0))) /\ ((1 + 0) <= 100) /\ (undef883 = undef883), par{i19^0 -> (1 + i19^0), i25^0 -> 0, j26^0 -> 0}>
<l20, l20, (50 <= (0 + j20^0)) /\ ((1 + (1 + i19^0)) <= 50), par{i19^0 -> (1 + i19^0), j20^0 -> 0}>
<l20, l20, ((1 + j20^0) <= 50) /\ (undef961 = undef961), par{j20^0 -> (1 + j20^0)}>
<l23, l20, (150 <= (0 + i13^0)) /\ (undef1083 = (0 + sqr11^0)) /\ (undef1091 = (0 + undef1083)) /\ ((1 + 0) <= 50), par{c^0 -> (0 + undef1091), i19^0 -> 0, j20^0 -> 0}>
<l23, l23, ((1 + i13^0) <= 150) /\ (undef1101 = undef1101) /\ (undef1126 = undef1126), par{i13^0 -> (1 + i13^0), sqr11^0 -> undef1126}>

Fresh variables:
undef448, undef505, undef507, undef541, undef581, undef588, undef659, undef672, undef679, undef765, undef766, undef788, undef789, undef796, undef797, undef799, undef800, undef807, undef823, undef843, undef883, undef961, undef1083, undef1091, undef1101, undef1126, undef1391, undef1395, 

Undef variables:
undef448, undef505, undef507, undef541, undef581, undef588, undef659, undef672, undef679, undef765, undef766, undef788, undef789, undef796, undef797, undef799, undef800, undef807, undef823, undef843, undef883, undef961, undef1083, undef1091, undef1101, undef1126, undef1391, undef1395, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l23, l23, i13^0 <= 149, {i13^0 -> 1 + i13^0, sqr11^0 -> undef1126, rest remain the same}>
Variables:
i13^0, sqr11^0

Graph 2:
Transitions:
<l20, l20, 50 <= j20^0 /\ i19^0 <= 48, {i19^0 -> 1 + i19^0, j20^0 -> 0, rest remain the same}>
<l20, l20, j20^0 <= 49, {j20^0 -> 1 + j20^0, rest remain the same}>
Variables:
i19^0, j20^0

Graph 3:
Transitions:
<l3, l3, 32 <= i25^0 /\ j26^0 <= 97, {i25^0 -> 0, j26^0 -> 2 + j26^0, rest remain the same}>
<l3, l3, i25^0 <= 31, {i25^0 -> 2 + i25^0, rest remain the same}>
Variables:
i25^0, j26^0

Graph 4:
Transitions:
<l5, l5, 0 <= i37^0, {f36^0 -> undef679, i37^0 -> -1 + i37^0, rest remain the same}>
Variables:
f36^0, i37^0

Graph 5:
Transitions:
<l7, l7, n45^0 <= 49, {n45^0 -> 1 + n45^0, rest remain the same}>
Variables:
n45^0

Graph 6:
Transitions:
<l17, l17, j55^0 <= numbasis49^0, {j55^0 -> 1 + j55^0, rest remain the same}>
Variables:
j55^0, numbasis49^0

Graph 7:
Transitions:
<l11, l11, 4 <= j62^0 /\ 7 <= i61^0 /\ k63^0 <= 1, {i61^0 -> 0, j62^0 -> 0, k63^0 -> 7 + k63^0, m64^0 -> 3 + m64^0, n65^0 -> 3 + n65^0, p66^0 -> -7 + p66^0, rest remain the same}>
<l11, l11, 4 <= j62^0 /\ i61^0 <= 6, {i61^0 -> 1 + i61^0, j62^0 -> 0, rest remain the same}>
<l11, l11, j62^0 <= 3, {j62^0 -> 1 + j62^0, rest remain the same}>
Variables:
i61^0, j62^0, k63^0, m64^0, n65^0, p66^0

Graph 8:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l23, c^0 = undef1391 /\ i13^0 = 0 /\ sqr11^0 = undef1391 /\ undef1391 = 3 /\ d^0 = 43690, {all remain the same}>

Graph 2
<l23, l20, 150 <= i13^0 /\ sqr11^0 = undef1083 /\ undef1083 = undef1091, {c^0 -> undef1091, i19^0 -> 0, j20^0 -> 0, rest remain the same}>

Graph 3
<l20, l3, 50 <= j20^0 /\ 49 <= i19^0, {i19^0 -> 1 + i19^0, i25^0 -> 0, j26^0 -> 0, rest remain the same}>

Graph 4
<l3, l5, 32 <= i25^0 /\ 98 <= j26^0 /\ d^0 = undef843 /\ undef823 = 100, {f36^0 -> undef807, i37^0 -> -2 + undef823, j26^0 -> 2 + j26^0, rest remain the same}>

Graph 5
<l5, l7, 1 + i37^0 <= 0 /\ f36^0 = undef659, {d^0 -> undef659, n45^0 -> 0, rest remain the same}>

Graph 6
<l7, l17, 50 <= n45^0 /\ undef505 = 1, {g51^0 -> d^0, j55^0 -> 1 + undef505, numbasis49^0 -> 17, rest remain the same}>

Graph 7
<l17, l11, 1 + numbasis49^0 <= j55^0 /\ g51^0 = undef448, {i61^0 -> 0, j62^0 -> 0, k63^0 -> 1, m64^0 -> 0, n65^0 -> 13, p66^0 -> 8, rest remain the same}>

Graph 8
<l11, l15, 4 <= j62^0 /\ 7 <= i61^0 /\ 2 <= k63^0, {i61^0 -> 1 + i61^0, k63^0 -> 7 + k63^0, m64^0 -> 3 + m64^0, n65^0 -> 3 + n65^0, p66^0 -> -7 + p66^0, rest remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 3 , 3 )
( 5 , 4 )
( 7 , 5 )
( 11 , 7 )
( 15 , 8 )
( 17 , 6 )
( 20 , 2 )
( 23 , 1 )

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

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

Checking conditional termination of SCC {l23}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001460s
Ranking function: 149 - i13^0
New Graphs: 
Proving termination of subgraph 2
Checking unfeasibility...
Time used: 0.053277

Checking conditional termination of SCC {l20}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003016s
Ranking function: 48 - i19^0
New Graphs: 
Transitions:
<l20, l20, j20^0 <= 49, {j20^0 -> 1 + j20^0, rest remain the same}>
Variables:
j20^0
Checking conditional termination of SCC {l20}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001024s
Ranking function: 49 - j20^0
New Graphs: 
Proving termination of subgraph 3
Checking unfeasibility...
Time used: 0.08776

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003995s
Ranking function: 97 - j26^0
New Graphs: 
Transitions:
<l3, l3, i25^0 <= 31, {i25^0 -> 2 + i25^0, rest remain the same}>
Variables:
i25^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001080s
Ranking function: (31 / 2) + (~(1) / 2)*i25^0
New Graphs: 
Proving termination of subgraph 4
Checking unfeasibility...
Time used: 0.002127

Checking conditional termination of SCC {l5}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001947s
Ranking function: i37^0
New Graphs: 
Proving termination of subgraph 5
Checking unfeasibility...
Time used: 0.001534

Checking conditional termination of SCC {l7}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001508s
Ranking function: 49 - n45^0
New Graphs: 
Proving termination of subgraph 6
Checking unfeasibility...
Time used: 0.001966

Checking conditional termination of SCC {l17}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001787s
Ranking function: -j55^0 + numbasis49^0
New Graphs: 
Proving termination of subgraph 7
Checking unfeasibility...
Time used: 4.00058

Checking conditional termination of SCC {l11}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.010044s
Ranking function: 1 - k63^0
New Graphs: 
Transitions:
<l11, l11, 4 <= j62^0 /\ i61^0 <= 6, {i61^0 -> 1 + i61^0, j62^0 -> 0, rest remain the same}>
<l11, l11, j62^0 <= 3, {j62^0 -> 1 + j62^0, rest remain the same}>
Variables:
i61^0, j62^0
Checking conditional termination of SCC {l11}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001732s
Ranking function: 6 - i61^0
New Graphs: 
Transitions:
<l11, l11, j62^0 <= 3, {j62^0 -> 1 + j62^0, rest remain the same}>
Variables:
j62^0
Checking conditional termination of SCC {l11}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001228s
Ranking function: 3 - j62^0
New Graphs: 
Proving termination of subgraph 8
Analyzing SCC {l15}...
No cycles found.

Program Terminates