YES

Solver Timeout: 4
Global Timeout: 300
No parsing errors!
Init Location: 0
Transitions:
<l0, l11, true>
<l1, l2, true>
<l3, l1, ((0 + coef_len6^0) <= (0 + acc_length11^0))>
<l3, l1, ((1 + acc_length11^0) <= (0 + coef_len6^0)), par{acc_length11^0 -> (1 + acc_length11^0)}>
<l2, l4, true, par{i8^0 -> (1 + i8^0)}>
<l5, l3, true>
<l5, l2, true, par{acc_length11^0 -> (~(1) + acc_length11^0)}>
<l5, l3, true>
<l4, l6, true>
<l7, l5, ((0 + acc_length11^0) <= (0 + j9^0))>
<l7, l8, ((1 + j9^0) <= (0 + acc_length11^0)) /\ (undef73 = undef73), par{acc12^0 -> undef73, j9^0 -> (1 + j9^0)}>
<l8, l7, true>
<l6, l9, ((0 + in_len4^0) <= (0 + i8^0))>
<l6, l8, ((1 + i8^0) <= (0 + in_len4^0)) /\ (undef97 = undef97), par{acc12^0 -> undef97, j9^0 -> 1}>
<l10, l4, (undef107 = undef107), par{acc_length11^0 -> (0 + undef107), coef_len210^0 -> undef107, coef_len6^0 -> 35, i8^0 -> 0, in_len4^0 -> 10, scale7^0 -> 285}>
<l11, l10, true>

Fresh variables:
undef73, undef97, undef107, 

Undef variables:
undef73, undef97, undef107, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l8, (acc_length11^0 = (0 + undef107)) /\ (35 = 35) /\ (i8^0 = 0) /\ (10 = 10) /\ (undef107 = undef107) /\ ((1 + 0) <= (0 + 10)) /\ (undef97 = undef97), par{j9^0 -> 1}>
<l8, l9, ((0 + acc_length11^0) <= (0 + j9^0)) /\ ((0 + 35) <= (0 + acc_length11^0)) /\ ((0 + 10) <= (0 + (1 + i8^0))), par{i8^0 -> (1 + i8^0)}>
<l8, l8, ((0 + acc_length11^0) <= (0 + j9^0)) /\ ((0 + 35) <= (0 + acc_length11^0)) /\ ((1 + (1 + i8^0)) <= (0 + 10)) /\ (undef97 = undef97), par{i8^0 -> (1 + i8^0), j9^0 -> 1}>
<l8, l9, ((0 + acc_length11^0) <= (0 + j9^0)) /\ ((1 + acc_length11^0) <= (0 + 35)) /\ ((0 + 10) <= (0 + (1 + i8^0))), par{acc_length11^0 -> (1 + acc_length11^0), i8^0 -> (1 + i8^0)}>
<l8, l8, ((0 + acc_length11^0) <= (0 + j9^0)) /\ ((1 + acc_length11^0) <= (0 + 35)) /\ ((1 + (1 + i8^0)) <= (0 + 10)) /\ (undef97 = undef97), par{acc_length11^0 -> (1 + acc_length11^0), i8^0 -> (1 + i8^0), j9^0 -> 1}>
<l8, l9, ((0 + acc_length11^0) <= (0 + j9^0)) /\ ((0 + 10) <= (0 + (1 + i8^0))), par{acc_length11^0 -> (~(1) + acc_length11^0), i8^0 -> (1 + i8^0)}>
<l8, l8, ((0 + acc_length11^0) <= (0 + j9^0)) /\ ((1 + (1 + i8^0)) <= (0 + 10)) /\ (undef97 = undef97), par{acc_length11^0 -> (~(1) + acc_length11^0), i8^0 -> (1 + i8^0), j9^0 -> 1}>
<l8, l9, ((0 + acc_length11^0) <= (0 + j9^0)) /\ ((0 + 35) <= (0 + acc_length11^0)) /\ ((0 + 10) <= (0 + (1 + i8^0))), par{i8^0 -> (1 + i8^0)}>
<l8, l8, ((0 + acc_length11^0) <= (0 + j9^0)) /\ ((0 + 35) <= (0 + acc_length11^0)) /\ ((1 + (1 + i8^0)) <= (0 + 10)) /\ (undef97 = undef97), par{i8^0 -> (1 + i8^0), j9^0 -> 1}>
<l8, l9, ((0 + acc_length11^0) <= (0 + j9^0)) /\ ((1 + acc_length11^0) <= (0 + 35)) /\ ((0 + 10) <= (0 + (1 + i8^0))), par{acc_length11^0 -> (1 + acc_length11^0), i8^0 -> (1 + i8^0)}>
<l8, l8, ((0 + acc_length11^0) <= (0 + j9^0)) /\ ((1 + acc_length11^0) <= (0 + 35)) /\ ((1 + (1 + i8^0)) <= (0 + 10)) /\ (undef97 = undef97), par{acc_length11^0 -> (1 + acc_length11^0), i8^0 -> (1 + i8^0), j9^0 -> 1}>
<l8, l8, ((1 + j9^0) <= (0 + acc_length11^0)) /\ (undef73 = undef73), par{j9^0 -> (1 + j9^0)}>

Fresh variables:
undef73, undef97, undef107, 

Undef variables:
undef73, undef97, undef107, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l8, l8, acc_length11^0 <= j9^0 /\ 35 <= acc_length11^0 /\ i8^0 <= 8, {i8^0 -> 1 + i8^0, j9^0 -> 1, rest remain the same}>
<l8, l8, acc_length11^0 <= j9^0 /\ i8^0 <= 8 /\ acc_length11^0 <= 34, {acc_length11^0 -> 1 + acc_length11^0, i8^0 -> 1 + i8^0, j9^0 -> 1, rest remain the same}>
<l8, l8, acc_length11^0 <= j9^0 /\ i8^0 <= 8, {acc_length11^0 -> -1 + acc_length11^0, i8^0 -> 1 + i8^0, j9^0 -> 1, rest remain the same}>
<l8, l8, acc_length11^0 <= j9^0 /\ 35 <= acc_length11^0 /\ i8^0 <= 8, {i8^0 -> 1 + i8^0, j9^0 -> 1, rest remain the same}>
<l8, l8, acc_length11^0 <= j9^0 /\ i8^0 <= 8 /\ acc_length11^0 <= 34, {acc_length11^0 -> 1 + acc_length11^0, i8^0 -> 1 + i8^0, j9^0 -> 1, rest remain the same}>
<l8, l8, 1 + j9^0 <= acc_length11^0, {j9^0 -> 1 + j9^0, rest remain the same}>
Variables:
acc_length11^0, i8^0, j9^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l8, acc_length11^0 = undef107 /\ i8^0 = 0, {j9^0 -> 1, rest remain the same}>

Graph 2
<l8, l9, acc_length11^0 <= j9^0 /\ 35 <= acc_length11^0 /\ 9 <= i8^0, {i8^0 -> 1 + i8^0, rest remain the same}>
<l8, l9, acc_length11^0 <= j9^0 /\ 9 <= i8^0 /\ acc_length11^0 <= 34, {acc_length11^0 -> 1 + acc_length11^0, i8^0 -> 1 + i8^0, rest remain the same}>
<l8, l9, acc_length11^0 <= j9^0 /\ 9 <= i8^0, {acc_length11^0 -> -1 + acc_length11^0, i8^0 -> 1 + i8^0, rest remain the same}>
<l8, l9, acc_length11^0 <= j9^0 /\ 35 <= acc_length11^0 /\ 9 <= i8^0, {i8^0 -> 1 + i8^0, rest remain the same}>
<l8, l9, acc_length11^0 <= j9^0 /\ 9 <= i8^0 /\ acc_length11^0 <= 34, {acc_length11^0 -> 1 + acc_length11^0, i8^0 -> 1 + i8^0, rest remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 8 , 1 )
( 9 , 2 )

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

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

Checking conditional termination of SCC {l8}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004730s
Ranking function: 1 + 77*acc_length11^0 - 337*i8^0
New Graphs: 
Transitions:
<l8, l8, acc_length11^0 <= j9^0 /\ i8^0 <= 8 /\ acc_length11^0 <= 34, {acc_length11^0 -> 1 + acc_length11^0, i8^0 -> 1 + i8^0, j9^0 -> 1, rest remain the same}>
<l8, l8, acc_length11^0 <= j9^0 /\ i8^0 <= 8, {acc_length11^0 -> -1 + acc_length11^0, i8^0 -> 1 + i8^0, j9^0 -> 1, rest remain the same}>
<l8, l8, acc_length11^0 <= j9^0 /\ i8^0 <= 8 /\ acc_length11^0 <= 34, {acc_length11^0 -> 1 + acc_length11^0, i8^0 -> 1 + i8^0, j9^0 -> 1, rest remain the same}>
<l8, l8, 1 + j9^0 <= acc_length11^0, {j9^0 -> 1 + j9^0, rest remain the same}>
Variables:
acc_length11^0, i8^0, j9^0
Checking conditional termination of SCC {l8}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001024s
Ranking function: 84 - 2*acc_length11^0 - 2*i8^0
New Graphs: 
Transitions:
<l8, l8, acc_length11^0 <= j9^0 /\ i8^0 <= 8, {acc_length11^0 -> -1 + acc_length11^0, i8^0 -> 1 + i8^0, j9^0 -> 1, rest remain the same}>
<l8, l8, 1 + j9^0 <= acc_length11^0, {j9^0 -> 1 + j9^0, rest remain the same}>
Variables:
acc_length11^0, i8^0, j9^0
Checking conditional termination of SCC {l8}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000589s
Ranking function: 8 - i8^0
New Graphs: 
Transitions:
<l8, l8, 1 + j9^0 <= acc_length11^0, {j9^0 -> 1 + j9^0, rest remain the same}>
Variables:
acc_length11^0, j9^0
Checking conditional termination of SCC {l8}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000400s
Ranking function: -1 + acc_length11^0 - j9^0
New Graphs: 
Proving termination of subgraph 2
Analyzing SCC {l9}...
No cycles found.

Program Terminates