NO

Solver Timeout: 4
Global Timeout: 60
No parsing errors!
Init Location: 0
Transitions:
<l0, l10, true>
<l1, l2, true, par{i^0 -> (1 + i^0)}>
<l3, l1, true>
<l3, l1, true>
<l3, l4, true>
<l2, l3, true>
<l5, l6, true>
<l7, l5, true>
<l7, l5, true>
<l7, l6, true>
<l8, l5, ((0 + i^0) <= (0 + k^0))>
<l8, l7, ((1 + k^0) <= (0 + i^0))>
<l4, l5, ((1 + k^0) <= 0)>
<l4, l8, (0 <= (0 + k^0))>
<l9, l2, (undef28 = undef28), par{i^0 -> 0, k^0 -> undef28}>
<l10, l9, true>

Fresh variables:
undef28, 

Undef variables:
undef28, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (i^0 = 0) /\ (k^0 = undef28) /\ (undef28 = undef28)>
<l2, l2, true, par{i^0 -> (1 + i^0)}>
<l2, l2, true, par{i^0 -> (1 + i^0)}>
<l2, l6, ((1 + k^0) <= 0)>
<l2, l6, (0 <= (0 + k^0)) /\ ((0 + i^0) <= (0 + k^0))>
<l2, l6, (0 <= (0 + k^0)) /\ ((1 + k^0) <= (0 + i^0))>
<l2, l6, (0 <= (0 + k^0)) /\ ((1 + k^0) <= (0 + i^0))>
<l2, l6, (0 <= (0 + k^0)) /\ ((1 + k^0) <= (0 + i^0))>

Fresh variables:
undef28, 

Undef variables:
undef28, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

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

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l2, i^0 = 0 /\ k^0 = undef28, {all remain the same}>

Graph 2
<l2, l6, 1 + k^0 <= 0, {all remain the same}>
<l2, l6, i^0 <= k^0 /\ 0 <= k^0, {all remain the same}>
<l2, l6, 1 + k^0 <= i^0 /\ 0 <= k^0, {all remain the same}>
<l2, l6, 1 + k^0 <= i^0 /\ 0 <= k^0, {all remain the same}>
<l2, l6, 1 + k^0 <= i^0 /\ 0 <= k^0, {all remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 2 , 1 )
( 6 , 2 )

*******************************************************************************************
********************************    CHECKING ASSERTIONS    ********************************
*******************************************************************************************

Proving termination of subgraph 0
Proving termination of subgraph 1
Checking unfeasibility...
Time used: 0.002624

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000581s

LOG: CALL solveLinear

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004278s
Time used: 0.004166
Trying to remove transition: <l2, l2, true, {i^0 -> 1 + i^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001029s
Time used: 1.00088

LOG: SAT solveNonLinear - Elapsed time: 1.018412s
Cost: 1; Total time: 1.0098
Quasi-ranking function: 50000 - i^0
New Graphs: 
Transitions:
<l2, l2, 50001 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
<l2, l2, 50001 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
Variables:
i^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000686s

LOG: CALL solveLinear

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005741s
Time used: 0.005589
Trying to remove transition: <l2, l2, 50001 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.010357s
Time used: 4.00143
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l2, i^0 = 0 /\ k^0 = undef28, {all remain the same}>

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

LOG: CALL solveLinear

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

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

Proving non-termination of subgraph 1
Transitions:
<l2, l2, true, {i^0 -> 1 + i^0, rest remain the same}>
<l2, l2, true, {i^0 -> 1 + i^0, rest remain the same}>
Variables:
i^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, i^0 = 0 /\ k^0 = undef28, {all remain the same}>
Conditions: 
OPEN EXITS: 
<l0, l2, i^0 = 0 /\ k^0 = undef28, {all remain the same}>

> Conditions are reachable!

Program does NOT terminate