NO

Solver Timeout: 4
Global Timeout: 300
No parsing errors!
Init Location: 0
Transitions:
<l0, l5, true>
<l1, l2, true, par{x^0 -> (~(1) + x^0)}>
<l2, l3, ((1 + x^0) <= 300)>
<l2, l3, (301 <= (0 + x^0))>
<l3, l1, true>
<l4, l1, true, par{x^0 -> 100}>
<l5, l4, true>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l1, (x^0 = 100)>
<l1, l1, ((1 + (~(1) + x^0)) <= 300), par{x^0 -> (~(1) + x^0)}>
<l1, l1, (301 <= (0 + (~(1) + x^0))), par{x^0 -> (~(1) + x^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:
<l1, l1, x^0 <= 300, {x^0 -> -1 + x^0, rest remain the same}>
<l1, l1, 302 <= x^0, {x^0 -> -1 + x^0, rest remain the same}>
Variables:
x^0

Precedence: 
Graph 0

Graph 1
<l0, l1, x^0 = 100, {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.045146
Some transition disabled by a set of invariant(s):
Invariant at l1: x^0 <= 101

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l1, l1, 302 <= x^0, {x^0 -> -1 + x^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, x^0 <= 101, {x^0 -> -1 + x^0, rest remain the same}>
Checking unfeasibility...
Time used: 0.050189

Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000825s

LOG: CALL solveLinear

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.014863s
Time used: 1.01483

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000216s

LOG: CALL solveLinear

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003066s
Time used: 4.00081
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l1, x^0 = 100, {all remain the same}>

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

LOG: CALL solveLinear

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

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

Proving non-termination of subgraph 1
Transitions:
<l1, l1, x^0 <= 101, {x^0 -> -1 + x^0, rest remain the same}>
Variables:
x^0

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

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

Calling reachability with...
Transition: <l0, l1, x^0 = 100, {all remain the same}>
Conditions: 
OPEN EXITS: 
<l0, l1, x^0 = 100, {all remain the same}>

> Conditions are reachable!

Program does NOT terminate