NO

Solver Timeout: 4
Global Timeout: 60
No parsing errors!
Init Location: 0
Transitions:
<l0, l6, true>
<l1, l2, ((0 + nd^0) <= 0), par{p^0 -> 2}>
<l1, l2, (1 <= (0 + nd^0)), par{p^0 -> 1}>
<l2, l1, (undef7 = undef7), par{nd^0 -> undef7}>
<l3, l4, ((0 + nd^0) <= 0), par{x^0 -> (~(2) + x^0)}>
<l3, l4, (1 <= (0 + nd^0)), par{x^0 -> (~(1) + x^0)}>
<l4, l2, ((0 + x^0) <= 0)>
<l4, l3, (1 <= (0 + x^0)) /\ (undef19 = undef19), par{nd^0 -> undef19}>
<l5, l4, true, par{p^0 -> 0}>
<l6, l5, true>

Fresh variables:
undef7, undef19, 

Undef variables:
undef7, undef19, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l4, true>
<l2, l2, (undef7 = undef7) /\ ((0 + undef7) <= 0)>
<l2, l2, (undef7 = undef7) /\ (1 <= (0 + undef7))>
<l4, l2, ((0 + x^0) <= 0)>
<l4, l4, (1 <= (0 + x^0)) /\ (undef19 = undef19) /\ ((0 + undef19) <= 0), par{x^0 -> (~(2) + x^0)}>
<l4, l4, (1 <= (0 + x^0)) /\ (undef19 = undef19) /\ (1 <= (0 + undef19)), par{x^0 -> (~(1) + x^0)}>

Fresh variables:
undef7, undef19, 

Undef variables:
undef7, undef19, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l4, l4, undef19 <= 0 /\ 1 <= x^0, {x^0 -> -2 + x^0, rest remain the same}>
<l4, l4, 1 <= x^0 /\ 1 <= undef19, {x^0 -> -1 + x^0, rest remain the same}>
Variables:
x^0

Graph 2:
Transitions:
<l2, l2, undef7 <= 0, {all remain the same}>
<l2, l2, 1 <= undef7, {all remain the same}>
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l4, true, {all remain the same}>

Graph 2
<l4, l2, x^0 <= 0, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001004s
Ranking function: -1 + x^0
New Graphs: 
Proving termination of subgraph 2
Checking unfeasibility...
Time used: 0.001412

> No variable changes in termination graph.
Checking conditional unfeasibility...
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l4, l2, x^0 <= 0, {all remain the same}>

LOG: CALL check - Post:1 <= 0 - Process 1
* Exit transition: <l4, l2, x^0 <= 0, {all remain the same}>
* Postcondition  : 1 <= 0
Postcodition moved up: 1 <= 0

LOG: Try proving POST
Postcondition: 1 <= 0

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000235s

LOG: NarrowEntry size 1
Narrowing transition: 
<l4, l4, undef19 <= 0 /\ 1 <= x^0, {x^0 -> -2 + x^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l4, l4, 1 <= x^0 /\ 1 <= undef19, {x^0 -> -1 + x^0, rest remain the same}>

LOG: Narrow transition size 1
ENTRIES:
<l0, l4, 0 <= 0, {all remain the same}>
END ENTRIES:
GRAPH:
<l4, l4, 0 <= 0 /\ undef19 <= 0 /\ 1 <= x^0, {x^0 -> -2 + x^0, rest remain the same}>
<l4, l4, 0 <= 0 /\ 1 <= x^0 /\ 1 <= undef19, {x^0 -> -1 + x^0, rest remain the same}>
END GRAPH:
EXIT: <l4, l2, x^0 <= 0, {all remain the same}>
POST: 1 <= 0


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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006742s
Time used: 0.006584
Improving Solution with cost 51 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.004003s
Time used: 1.00401

LOG: SAT solveNonLinear - Elapsed time: 1.010746s
Cost: 51; Total time: 1.01059
Failed at location 4: x^0 <= 0
Before Improving: 
Quasi-invariant at l4: x^0 <= 0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003320s
Remaining time after improvement: 0.999002
Some transition disabled by a set of quasi-invariant(s):
Quasi-invariant at l4: x^0 <= 0

LOG: NEXT CALL check - disable

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000428s
Solving with 2 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.021237s
Time used: 0.021053
Improving Solution with cost 51 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000452s
Time used: 1.00046

LOG: SAT solveNonLinear - Elapsed time: 1.021689s
Cost: 51; Total time: 1.02151
Failed at location 4: x^0 <= 0
Before Improving: 
Quasi-invariant at l4: x^0 <= 0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.011010s
Remaining time after improvement: 0.998628
Some transition disabled by a set of quasi-invariant(s):
Quasi-invariant at l4: x^0 <= 0

LOG: NEXT CALL check - disable

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000552s
Solving with 3 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.060047s
Time used: 0.059799
Improving Solution with cost 51 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.940725s
Time used: 0.940714

LOG: SAT solveNonLinear - Elapsed time: 1.000772s
Cost: 51; Total time: 1.00051
Failed at location 4: x^0 <= 0
Before Improving: 
Quasi-invariant at l4: x^0 <= 0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.014191s
Remaining time after improvement: 0.998426
Some transition disabled by a set of quasi-invariant(s):
Quasi-invariant at l4: x^0 <= 0

LOG: NEXT CALL check - disable

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000636s

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

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

Proving non-termination of subgraph 2
Transitions:
<l2, l2, undef7 <= 0, {all remain the same}>
<l2, l2, 1 <= undef7, {all remain the same}>
Variables:

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

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

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

> Conditions are reachable!

Program does NOT terminate