NO

Solver Timeout: 4
Global Timeout: 60
No parsing errors!
Init Location: 0
Transitions:
<l0, l5, true>
<l1, l2, true, par{x_1^0 -> 1, y_1^0 -> 1}>
<l2, l3, true, par{x_1^0 -> (1 + x_1^0)}>
<l3, l2, true>
<l2, l4, (2 <= 0)>
<l5, l1, true>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (x_1^0 = 1)>
<l2, l2, true, par{x_1^0 -> (1 + x_1^0)}>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, true, {x_1^0 -> 1 + x_1^0, rest remain the same}>
Variables:
x_1^0

Precedence: 
Graph 0

Graph 1
<l0, l2, x_1^0 = 1, {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.001474

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000466s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000856s
Trying to remove transition: <l2, l2, true, {x_1^0 -> 1 + x_1^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007794s
Time used: 0.004409
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000656s
Time used: 1.00053

LOG: SAT solveNonLinear - Elapsed time: 1.008449s
Cost: 1; Total time: 1.00494
Termination implied by a set of invariant(s):
Invariant at l2: 0 <= 1 + x_1^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 0 <= 1 + x_1^0, {x_1^0 -> 1 + x_1^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 0 <= 1 + x_1^0, {x_1^0 -> 1 + x_1^0, rest remain the same}>
Quasi-ranking function: 50000 - x_1^0
New Graphs: 
Transitions:
<l2, l2, 50001 <= x_1^0, {x_1^0 -> 1 + x_1^0, rest remain the same}>
Variables:
x_1^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000430s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001255s
Trying to remove transition: <l2, l2, 50001 <= x_1^0, {x_1^0 -> 1 + x_1^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005379s
Time used: 4.00143
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l2, x_1^0 = 1, {all remain the same}>

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

LOG: CALL solveLinear

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

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

Proving non-termination of subgraph 1
Transitions:
<l2, l2, true, {x_1^0 -> 1 + x_1^0, rest remain the same}>
Variables:
x_1^0

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, x_1^0 = 1, {all remain the same}>
Conditions: 
OPEN EXITS: 
<l0, l2, x_1^0 = 1, {all remain the same}>

> Conditions are reachable!

Program does NOT terminate