NO

Solver Timeout: 4
Global Timeout: 60
No parsing errors!
Init Location: 0
Transitions:
<l0, l3, true>
<l1, l2, true, par{arg1 -> 0}>
<l2, l2, (arg1 < 11), par{arg1 -> (arg1 + 1)}>
<l2, l2, (arg1 > 10)>
<l3, l1, true, par{arg1 -> undef4}>

Fresh variables:
undef4, 

Undef variables:
undef4, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (arg1 = 0)>
<l2, l2, (arg1 < 11), par{arg1 -> (arg1 + 1)}>
<l2, l2, (arg1 > 10)>

Fresh variables:
undef4, 

Undef variables:
undef4, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, arg1 <= 10, {arg1 -> 1 + arg1, rest remain the same}>
<l2, l2, 11 <= arg1, {all remain the same}>
Variables:
arg1

Precedence: 
Graph 0

Graph 1
<l0, l2, arg1 = 0, {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.020655

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000659s
Ranking function: 10 - arg1
New Graphs: 
Transitions:
<l2, l2, 11 <= arg1, {all remain the same}>
Variables:
arg1
> No variable changes in termination graph.
Checking conditional unfeasibility...
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l2, arg1 = 0, {all remain the same}>

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

LOG: CALL solveLinear

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

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

Proving non-termination of subgraph 1
Transitions:
<l2, l2, arg1 <= 10, {arg1 -> 1 + arg1, rest remain the same}>
<l2, l2, 11 <= arg1, {all remain the same}>
Variables:
arg1

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

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

Calling reachability with...
Transition: <l0, l2, arg1 = 0, {all remain the same}>
Conditions: 
OPEN EXITS: 
<l0, l2, arg1 = 0, {all remain the same}>

> Conditions are reachable!

Program does NOT terminate