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) /\ (arg1 < 20), par{arg1 -> (arg1 + 1)}>
<l2, l2, (arg1 > 10) /\ (arg1 < 20)>
<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) /\ (arg1 < 20), par{arg1 -> (arg1 + 1)}>
<l2, l2, (arg1 > 10) /\ (arg1 < 20)>

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 /\ arg1 <= 19, {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.009291

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000636s
Ranking function: 10 - arg1
New Graphs: 
Transitions:
<l2, l2, 11 <= arg1 /\ arg1 <= 19, {all remain the same}>
Variables:
arg1
> No variable changes in termination graph.
Checking conditional unfeasibility...
Calling Safety with literal 20 <= arg1 and entry <l2, l2, true, {all remain the same}>

LOG: CALL check - Post:20 <= arg1 - Process 1
* Exit transition: <l2, l2, true, {all remain the same}>
* Postcondition  : 20 <= arg1
Quasi-invariants: 
Location 2: 20 <= arg1 ; 
Postcondition: 20 <= arg1

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000327s

LOG: NarrowEntry size 1
Narrowing transition: 
<l2, l2, arg1 <= 10, {arg1 -> 1 + arg1, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l2, l2, 11 <= arg1 /\ arg1 <= 19, {all remain the same}>

LOG: Narrow transition size 1
ENTRIES:
<l0, l2, arg1 = 0, {all remain the same}>
END ENTRIES:
GRAPH:
<l2, l2, arg1 <= 10, {arg1 -> 1 + arg1, rest remain the same}>
<l2, l2, 11 <= arg1 /\ arg1 <= 19, {all remain the same}>
END GRAPH:
EXIT: <l2, l2, true, {all remain the same}>
POST: 20 <= arg1


LOG: Try proving POST
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.815173s
Time used: 0.811922

LOG: Postcondition is not implied - no solution
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.998911s

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

Checking conditional non-termination of SCC {l2}...
EXIT TRANSITIONS:
<l2, end, 20 <= arg1, {all remain the same}>

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018567s
Time used: 0.018465

LOG: SAT solveNonLinear - Elapsed time: 0.018567s
Cost: 0; Total time: 0.018465
Non-termination implied by a set of quasi-invariant(s):
Quasi-invariant at l2: arg1 <= 11

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, arg1 <= 10, {arg1 -> 1 + arg1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, arg1 = 11, {all remain the same}>

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

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

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

> Conditions are reachable!

Program does NOT terminate