NO

Solver Timeout: 4
Global Timeout: 300
No parsing errors!
Init Location: 0
Transitions:
<l0, l5, true>
<l1, l2, true>
<l2, l3, (undef2 = (~(1) + x_5^0)) /\ ((0 + undef2) <= 0), par{x_5^0 -> undef2}>
<l3, l2, true>
<l2, l4, (undef4 = (~(1) + x_5^0)) /\ (0 <= (~(1) + undef4)), par{x_5^0 -> undef4}>
<l4, l2, true>
<l5, l1, true>

Fresh variables:
undef2, undef4, 

Undef variables:
undef2, undef4, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, true>
<l2, l2, (undef2 = (~(1) + x_5^0)) /\ ((0 + undef2) <= 0), par{x_5^0 -> undef2}>
<l2, l2, (undef4 = (~(1) + x_5^0)) /\ (0 <= (~(1) + undef4)), par{x_5^0 -> undef4}>

Fresh variables:
undef2, undef4, 

Undef variables:
undef2, undef4, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, undef2 <= 0 /\ x_5^0 = 1 + undef2, {x_5^0 -> undef2, rest remain the same}>
<l2, l2, 1 <= undef4 /\ x_5^0 = 1 + undef4, {x_5^0 -> undef4, rest remain the same}>
Variables:
x_5^0

Precedence: 
Graph 0

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

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

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

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

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000842s
Ranking function: -1 + x_5^0
New Graphs: 
Transitions:
<l2, l2, undef2 <= 0 /\ x_5^0 = 1 + undef2, {x_5^0 -> undef2, rest remain the same}>
Variables:
x_5^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000390s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001177s
Trying to remove transition: <l2, l2, undef2 <= 0 /\ x_5^0 = 1 + undef2, {x_5^0 -> undef2, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.004669s
Time used: 0.004667

LOG: SAT solveNonLinear - Elapsed time: 0.010401s
Cost: 1; Total time: 0.007583
Quasi-ranking function: 50000 + x_5^0
New Graphs: 
Transitions:
<l2, l2, undef2 <= 0 /\ 50001 + x_5^0 <= 0 /\ x_5^0 = 1 + undef2, {x_5^0 -> undef2, rest remain the same}>
Variables:
x_5^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000280s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000994s
Trying to remove transition: <l2, l2, undef2 <= 0 /\ 50001 + x_5^0 <= 0 /\ x_5^0 = 1 + undef2, {x_5^0 -> undef2, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005577s
Time used: 0.002692
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l2, true, {all remain the same}>

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000497s
Cannot prove unreachability

Proving non-termination of subgraph 1
Transitions:
<l2, l2, undef2 <= 0 /\ x_5^0 = 1 + undef2, {x_5^0 -> undef2, rest remain the same}>
<l2, l2, 1 <= undef4 /\ x_5^0 = 1 + undef4, {x_5^0 -> undef4, rest remain the same}>
Variables:
x_5^0

Checking conditional non-termination of SCC {l2}...
> No exit transition to close.
Checking that every undef value has an assignment...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000502s
> No assignment for some undef value.

Proving non-termination of subgraph 1
Transitions:
<l2, l2, undef2 <= 0 /\ 50001 + x_5^0 <= 0 /\ x_5^0 = 1 + undef2, {x_5^0 -> undef2, rest remain the same}>
Variables:
x_5^0

Checking that every undef value has an assignment...

LOG: CALL solveLinear

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

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.021167s
Time used: 5.00373
> Checking if the negation of the conditions of every pending exit is quasi-invariant... YES
Calling reachability with...
Transition: <l2, end, true, {all remain the same}>
Conditions: 50001 + x_5^0 <= 0, 
OPEN EXITS: 
<l2, end, 50001 + x_5^0 <= 0, {all remain the same}>

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

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

> Conditions are reachable!

Program does NOT terminate