NO

Solver Timeout: 4
Global Timeout: 60
No parsing errors!
Init Location: 0
Transitions:
<l0, l3, true>
<l1, l1, (undef1 <= arg1) /\ (arg1 > 0) /\ (undef1 > 0), par{arg1 -> undef1}>
<l2, l1, (undef3 <= arg1) /\ (arg2 > ~(1)) /\ (arg1 > 0) /\ (undef3 > 0), par{arg1 -> undef3}>
<l3, l2, true, par{arg1 -> undef5, arg2 -> undef6}>

Fresh variables:
undef1, undef3, undef5, undef6, 

Undef variables:
undef1, undef3, undef5, undef6, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l1, (arg1 = undef3) /\ (undef3 <= undef5) /\ (undef6 > ~(1)) /\ (undef5 > 0) /\ (undef3 > 0)>
<l1, l1, (undef1 <= arg1) /\ (arg1 > 0) /\ (undef1 > 0), par{arg1 -> undef1}>

Fresh variables:
undef1, undef3, undef5, undef6, 

Undef variables:
undef1, undef3, undef5, undef6, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l1, l1, undef1 <= arg1 /\ 1 <= arg1 /\ 1 <= undef1, {arg1 -> undef1, rest remain the same}>
Variables:
arg1

Precedence: 
Graph 0

Graph 1
<l0, l1, undef3 <= undef5 /\ 0 <= undef6 /\ 1 <= undef3 /\ 1 <= undef5 /\ arg1 = undef3, {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.001988

Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000605s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002033s
Trying to remove transition: <l1, l1, undef1 <= arg1 /\ 1 <= arg1 /\ 1 <= undef1, {arg1 -> undef1, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007747s
Time used: 0.004451
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l1, undef3 <= undef5 /\ 0 <= undef6 /\ 1 <= undef3 /\ 1 <= undef5 /\ arg1 = undef3, {all remain the same}>

LOG: CALL check - Post:1 <= 0 - Process 1
* Exit transition: <l0, l1, undef3 <= undef5 /\ 0 <= undef6 /\ 1 <= undef3 /\ 1 <= undef5 /\ arg1 = undef3, {all remain the same}>
* Postcondition  : 1 <= 0

LOG: CALL solveLinear

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

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

Proving non-termination of subgraph 1
Transitions:
<l1, l1, undef1 <= arg1 /\ 1 <= arg1 /\ 1 <= undef1, {arg1 -> undef1, rest remain the same}>
Variables:
arg1

Checking that every undef value has an assignment...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001031s
Checking conditional non-termination of SCC {l1}...
EXIT TRANSITIONS:
<l1, end, arg1 <= 0, {all remain the same}>

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008341s
Time used: 0.008233

LOG: SAT solveNonLinear - Elapsed time: 0.008341s
Cost: 0; Total time: 0.008233
Minimizing number of undef constraints...

LOG: CALL solveNonLinear

LOG: RETURN solveNonLinear - Elapsed time: 0.002793s
Number of undef constraints reduced!

Non-termination implied by a set of quasi-invariant(s):
Quasi-invariant at l1: 1 <= arg1

Strengthening and disabling EXIT transitions...
Closed exits from l1: 1

Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, undef1 <= arg1 /\ 1 <= arg1 /\ 1 <= undef1, {arg1 -> undef1, rest remain the same}>

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

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

Calling reachability with...
Transition: <l0, l1, undef3 <= undef5 /\ 0 <= undef6 /\ 1 <= undef3 /\ 1 <= undef5 /\ arg1 = undef3, {all remain the same}>
Conditions: 1 <= arg1, 
OPEN EXITS: 
<l0, l1, undef3 <= undef5 /\ 0 <= undef6 /\ 1 <= arg1 /\ 1 <= undef3 /\ 1 <= undef5 /\ arg1 = undef3, {all remain the same}>

> Conditions are reachable!

Program does NOT terminate