NO

Solver Timeout: 4
Global Timeout: 60
No parsing errors!
Init Location: 0
Transitions:
<l0, l8, true>
<l1, l2, (undef8 = undef8), par{p_7^0 -> (0 + undef8), x_5^0 -> undef8}>
<l2, l3, (undef19 = (0 + cnt_16^0)) /\ (((0 + (~(1) * undef19)) + y_6^0) <= 0) /\ (undef13 = undef13) /\ (undef10 = undef10), par{Result_4^0 -> undef10, lt_10^0 -> undef13}>
<l2, l4, (undef29 = (0 + cnt_16^0)) /\ (0 <= ((~(1) + (~(1) * undef29)) + y_6^0)) /\ (undef23 = undef23) /\ (undef26 = undef26) /\ ((0 + undef26) <= 0) /\ (0 <= (0 + undef26)), par{lt_10^0 -> undef23, tmp_8^0 -> undef26}>
<l4, l2, true>
<l2, l5, (undef48 = (0 + cnt_16^0)) /\ (0 <= ((~(1) + (~(1) * undef48)) + y_6^0)) /\ (undef42 = undef42) /\ (undef45 = undef45), par{lt_10^0 -> undef42, tmp_8^0 -> undef45}>
<l5, l6, (undef50 = __disjvr_0^0) /\ (__disjvr_0^0 = undef50), par{__disjvr_0^0 -> undef50}>
<l6, l7, (undef67 = (0 + cnt_16^0)) /\ (undef62 = undef62), par{lt_9^0 -> undef62}>
<l7, l2, true>
<l8, l1, true>

Fresh variables:
undef8, undef10, undef13, undef19, undef23, undef26, undef29, undef42, undef45, undef48, undef50, undef62, undef67, 

Undef variables:
undef8, undef10, undef13, undef19, undef23, undef26, undef29, undef42, undef45, undef48, undef50, undef62, undef67, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (undef8 = undef8)>
<l2, l3, (undef19 = (0 + cnt_16^0)) /\ (((0 + (~(1) * undef19)) + y_6^0) <= 0) /\ (undef13 = undef13) /\ (undef10 = undef10)>
<l2, l2, (undef29 = (0 + cnt_16^0)) /\ (0 <= ((~(1) + (~(1) * undef29)) + y_6^0)) /\ (undef23 = undef23) /\ (undef26 = undef26) /\ ((0 + undef26) <= 0) /\ (0 <= (0 + undef26))>
<l2, l2, (undef48 = (0 + cnt_16^0)) /\ (0 <= ((~(1) + (~(1) * undef48)) + y_6^0)) /\ (undef42 = undef42) /\ (undef45 = undef45) /\ (undef50 = __disjvr_0^0) /\ (__disjvr_0^0 = undef50) /\ (undef67 = (0 + cnt_16^0)) /\ (undef62 = undef62), par{__disjvr_0^0 -> undef50}>

Fresh variables:
undef8, undef10, undef13, undef19, undef23, undef26, undef29, undef42, undef45, undef48, undef50, undef62, undef67, 

Undef variables:
undef8, undef10, undef13, undef19, undef23, undef26, undef29, undef42, undef45, undef48, undef50, undef62, undef67, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, 1 + undef29 <= y_6^0 /\ cnt_16^0 = undef29 /\ undef26 = 0, {all remain the same}>
<l2, l2, 1 + undef48 <= y_6^0 /\ __disjvr_0^0 = undef50 /\ cnt_16^0 = undef48 /\ cnt_16^0 = undef67, {__disjvr_0^0 -> undef50, rest remain the same}>
Variables:
cnt_16^0, y_6^0, __disjvr_0^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l2, true, {all remain the same}>

Graph 2
<l2, l3, y_6^0 <= undef19 /\ cnt_16^0 = undef19, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000819s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002655s
Trying to remove transition: <l2, l2, 1 + undef48 <= y_6^0 /\ __disjvr_0^0 = undef50 /\ cnt_16^0 = undef48 /\ cnt_16^0 = undef67, {__disjvr_0^0 -> undef50, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009715s
Time used: 0.00949
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012829s
Time used: 0.01198
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.026600s
Time used: 0.026594

LOG: SAT solveNonLinear - Elapsed time: 0.039429s
Cost: 1; Total time: 0.038574
Failed at location 2: 1 + y_6^0 <= cnt_16^0
Before Improving: 
Quasi-invariant at l2: 1 + y_6^0 <= cnt_16^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004631s
Remaining time after improvement: 0.998158
Termination implied by a set of quasi-invariant(s):
Quasi-invariant at l2: 1 + y_6^0 <= cnt_16^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 1 + undef29 <= y_6^0 /\ cnt_16^0 = undef29 /\ undef26 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 1 + undef48 <= y_6^0 /\ __disjvr_0^0 = undef50 /\ cnt_16^0 = undef48 /\ cnt_16^0 = undef67, {__disjvr_0^0 -> undef50, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l2, l2, 1 + undef48 <= y_6^0 /\ __disjvr_0^0 = undef50 /\ cnt_16^0 = undef48 /\ cnt_16^0 = undef67, {__disjvr_0^0 -> undef50, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 1 + undef29 <= y_6^0 /\ cnt_16^0 = undef29 /\ undef26 = 0, {all remain the same}>
New Graphs: 
Calling Safety with literal 1 + y_6^0 <= cnt_16^0 and entry <l0, l2, true, {all remain the same}>

LOG: CALL check - Post:1 + y_6^0 <= cnt_16^0 - Process 1
* Exit transition: <l0, l2, true, {all remain the same}>
* Postcondition  : 1 + y_6^0 <= cnt_16^0

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000479s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000551s
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: 1 + y_6^0 <= cnt_16^0 , 
Narrowing transition: 
<l2, l2, 1 + undef29 <= y_6^0 /\ cnt_16^0 = undef29 /\ undef26 = 0, {all remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l2, l2, 1 + undef48 <= y_6^0 /\ __disjvr_0^0 = undef50 /\ cnt_16^0 = undef48 /\ cnt_16^0 = undef67, {__disjvr_0^0 -> undef50, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l2, l2, cnt_16^0 <= y_6^0 /\ 1 + undef29 <= y_6^0 /\ cnt_16^0 = undef29 /\ undef26 = 0, {all remain the same}>
<l2, l2, cnt_16^0 <= y_6^0 /\ 1 + undef48 <= y_6^0 /\ __disjvr_0^0 = undef50 /\ cnt_16^0 = undef48 /\ cnt_16^0 = undef67, {__disjvr_0^0 -> undef50, rest remain the same}>
Variables:
cnt_16^0, y_6^0, __disjvr_0^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000779s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003116s
Trying to remove transition: <l2, l2, cnt_16^0 <= y_6^0 /\ 1 + undef48 <= y_6^0 /\ __disjvr_0^0 = undef50 /\ cnt_16^0 = undef48 /\ cnt_16^0 = undef67, {__disjvr_0^0 -> undef50, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008439s
Time used: 0.008197
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014705s
Time used: 0.013976
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.019417s
Time used: 0.01941

LOG: SAT solveNonLinear - Elapsed time: 0.034122s
Cost: 1; Total time: 0.033386
Failed at location 2: y_6^0 <= cnt_16^0
Before Improving: 
Quasi-invariant at l2: y_6^0 <= cnt_16^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004973s
Remaining time after improvement: 0.997824
Termination implied by a set of quasi-invariant(s):
Quasi-invariant at l2: y_6^0 <= cnt_16^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, cnt_16^0 <= y_6^0 /\ 1 + undef29 <= y_6^0 /\ cnt_16^0 = undef29 /\ undef26 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, cnt_16^0 <= y_6^0 /\ 1 + undef48 <= y_6^0 /\ __disjvr_0^0 = undef50 /\ cnt_16^0 = undef48 /\ cnt_16^0 = undef67, {__disjvr_0^0 -> undef50, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l2, l2, cnt_16^0 <= y_6^0 /\ 1 + undef29 <= y_6^0 /\ cnt_16^0 = undef29 /\ undef26 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, cnt_16^0 <= y_6^0 /\ 1 + undef48 <= y_6^0 /\ __disjvr_0^0 = undef50 /\ cnt_16^0 = undef48 /\ cnt_16^0 = undef67, {__disjvr_0^0 -> undef50, rest remain the same}>
New Graphs: 
Calling Safety with literal y_6^0 <= cnt_16^0 and entry <l0, l2, cnt_16^0 <= y_6^0, {all remain the same}>

LOG: CALL check - Post:y_6^0 <= cnt_16^0 - Process 2
* Exit transition: <l0, l2, cnt_16^0 <= y_6^0, {all remain the same}>
* Postcondition  : y_6^0 <= cnt_16^0

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000587s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000674s
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: y_6^0 <= cnt_16^0 , 
Narrowing transition: 
<l2, l2, cnt_16^0 <= y_6^0 /\ 1 + undef29 <= y_6^0 /\ cnt_16^0 = undef29 /\ undef26 = 0, {all remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l2, l2, cnt_16^0 <= y_6^0 /\ 1 + undef48 <= y_6^0 /\ __disjvr_0^0 = undef50 /\ cnt_16^0 = undef48 /\ cnt_16^0 = undef67, {__disjvr_0^0 -> undef50, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l2, l2, 1 + cnt_16^0 <= y_6^0 /\ 1 + undef29 <= y_6^0 /\ cnt_16^0 = undef29 /\ undef26 = 0, {all remain the same}>
<l2, l2, 1 + cnt_16^0 <= y_6^0 /\ 1 + undef48 <= y_6^0 /\ __disjvr_0^0 = undef50 /\ cnt_16^0 = undef48 /\ cnt_16^0 = undef67, {__disjvr_0^0 -> undef50, rest remain the same}>
Variables:
cnt_16^0, y_6^0, __disjvr_0^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000784s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003065s
Trying to remove transition: <l2, l2, 1 + cnt_16^0 <= y_6^0 /\ 1 + undef48 <= y_6^0 /\ __disjvr_0^0 = undef50 /\ cnt_16^0 = undef48 /\ cnt_16^0 = undef67, {__disjvr_0^0 -> undef50, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009572s
Time used: 0.009383
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016863s
Time used: 0.016202
Solving with 2 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001751s
Time used: 4.00052
Solving with 3 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004878s
Time used: 1.00035
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.026144s
Time used: 0.011337

Proving non-termination of subgraph 1
Transitions:
<l2, l2, 1 + cnt_16^0 <= y_6^0 /\ 1 + undef29 <= y_6^0 /\ cnt_16^0 = undef29 /\ undef26 = 0, {all remain the same}>
<l2, l2, 1 + cnt_16^0 <= y_6^0 /\ 1 + undef48 <= y_6^0 /\ __disjvr_0^0 = undef50 /\ cnt_16^0 = undef48 /\ cnt_16^0 = undef67, {__disjvr_0^0 -> undef50, rest remain the same}>
Variables:
cnt_16^0, y_6^0, __disjvr_0^0

Checking that every undef value has an assignment...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002773s
Checking conditional non-termination of SCC {l2}...
EXIT TRANSITIONS:
<l2, end, y_6^0 <= cnt_16^0, {all remain the same}>

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.061700s
Time used: 0.061113
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.053105s
Time used: 0.053098

LOG: SAT solveNonLinear - Elapsed time: 0.114805s
Cost: 1; Total time: 0.114211
Failed at location 2: 1 + cnt_16^0 <= y_6^0
Before Improving: 
Quasi-invariant at l2: 1 + cnt_16^0 <= y_6^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006428s
Remaining time after improvement: 0.996688
Minimizing number of undef constraints...

LOG: CALL solveNonLinear

LOG: RETURN solveNonLinear - Elapsed time: 0.006813s
Number of undef constraints reduced!

Non-termination implied by a set of quasi-invariant(s):
Quasi-invariant at l2: 1 + cnt_16^0 <= y_6^0

Strengthening and disabling EXIT transitions...
Closed exits from l2: 1

Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 + cnt_16^0 <= y_6^0 /\ 1 + undef29 <= y_6^0 /\ cnt_16^0 = undef29 /\ undef26 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 + cnt_16^0 <= y_6^0 /\ 1 + undef48 <= y_6^0 /\ __disjvr_0^0 = undef50 /\ cnt_16^0 = undef48 /\ cnt_16^0 = undef67, {__disjvr_0^0 -> undef50, rest remain the same}>

Calling reachability with...
Transition: <l2, end, true, {all remain the same}>
Conditions: 1 + cnt_16^0 <= y_6^0, 
OPEN EXITS: 
<l2, end, true, {all remain the same}> (condsUp: 1 + cnt_16^0 <= y_6^0)

--- Reachability graph ---
> Graph without transitions.

Calling reachability with...
Transition: <l0, l2, true, {all remain the same}>
Conditions: 1 + cnt_16^0 <= y_6^0, 
OPEN EXITS: 
<l0, l2, 1 + cnt_16^0 <= y_6^0, {all remain the same}>

> Conditions are reachable!

Program does NOT terminate