NO

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

Fresh variables:
undef1, undef2, undef4, 

Undef variables:
undef1, undef2, undef4, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l1, (undef4 = undef4) /\ (2 <= (0 + undef4))>
<l1, l1, (undef2 = undef2) /\ (1 <= (0 + undef2)) /\ (2 <= (0 + undef2)) /\ (undef1 = undef1) /\ (~(1) <= (0 + undef1)) /\ ((1 + undef1) <= 2)>

Fresh variables:
undef1, undef2, undef4, 

Undef variables:
undef1, undef2, undef4, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l1, l1, 2 <= undef2 /\ undef1 <= 1 /\ 0 <= 1 + undef1, {all remain the same}>
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l1, 2 <= undef4, {all remain the same}>

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

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

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

> No variable changes in termination graph.
Checking conditional unfeasibility...
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l1, 2 <= undef4, {all remain the same}>

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

LOG: CALL solveLinear

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

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

Proving non-termination of subgraph 1
Transitions:
<l1, l1, 2 <= undef2 /\ undef1 <= 1 /\ 0 <= 1 + undef1, {all remain the same}>
Variables:

Checking conditional non-termination of SCC {l1}...
> No exit transition to close.
Calling reachability with...
Transition: <l1, end, true, {all remain the same}>
Conditions: 
OPEN EXITS: 
<l1, end, true, {all remain the same}>

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

Calling reachability with...
Transition: <l0, l1, 2 <= undef4, {all remain the same}>
Conditions: 
OPEN EXITS: 
<l0, l1, 2 <= undef4, {all remain the same}>

> Conditions are reachable!

Program does NOT terminate