YES

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

Fresh variables:
undef3, 

Undef variables:
undef3, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Fresh variables:
undef3, 

Undef variables:
undef3, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, 0 <= x^0 /\ x^0 = undef3, {x^0 -> -1 + undef3, rest remain the same}>
Variables:
x^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.001448

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000617s
Ranking function: x^0
New Graphs: 
Program Terminates