NO

Solver Timeout: 4
Global Timeout: 60
No parsing errors!
Init Location: 0
Transitions:
<l0, l14, true>
<l1, l2, (6 <= (0 + WItemsNum^0)) /\ (undef2 = undef2), par{tmp1^0 -> undef2}>
<l1, l3, ((0 + WItemsNum^0) <= 5)>
<l4, l5, true>
<l5, l1, true>
<l6, l7, true>
<l8, l9, true>
<l10, l11, true>
<l11, l12, true>
<l12, l11, true>
<l7, l4, ((0 + WItemsNum^0) <= 2)>
<l7, l6, (3 <= (0 + WItemsNum^0)), par{WItemsNum^0 -> (~(1) + WItemsNum^0)}>
<l2, l6, ((0 + tmp1^0) <= 0) /\ (0 <= (0 + tmp1^0))>
<l2, l3, (1 <= (0 + tmp1^0))>
<l2, l3, ((1 + tmp1^0) <= 0)>
<l3, l5, (6 <= (0 + WItemsNum^0)), par{WItemsNum^0 -> (1 + WItemsNum^0)}>
<l3, l5, ((0 + WItemsNum^0) <= 5), par{WItemsNum^0 -> (1 + WItemsNum^0)}>
<l13, l4, (undef35 = undef35) /\ (undef33 = undef33), par{WItemsNum^0 -> undef33}>
<l14, l13, true>

Fresh variables:
undef2, undef33, undef35, 

Undef variables:
undef2, undef33, undef35, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l5, (WItemsNum^0 = undef33) /\ (undef35 = undef35) /\ (undef33 = undef33)>
<l5, l6, (6 <= (0 + WItemsNum^0)) /\ (undef2 = undef2) /\ ((0 + undef2) <= 0) /\ (0 <= (0 + undef2))>
<l5, l5, (6 <= (0 + WItemsNum^0)) /\ (undef2 = undef2) /\ (1 <= (0 + undef2)) /\ (6 <= (0 + WItemsNum^0)), par{WItemsNum^0 -> (1 + WItemsNum^0)}>
<l5, l5, (6 <= (0 + WItemsNum^0)) /\ (undef2 = undef2) /\ ((1 + undef2) <= 0) /\ (6 <= (0 + WItemsNum^0)), par{WItemsNum^0 -> (1 + WItemsNum^0)}>
<l5, l5, ((0 + WItemsNum^0) <= 5) /\ ((0 + WItemsNum^0) <= 5), par{WItemsNum^0 -> (1 + WItemsNum^0)}>
<l6, l5, ((0 + WItemsNum^0) <= 2)>
<l6, l6, (3 <= (0 + WItemsNum^0)), par{WItemsNum^0 -> (~(1) + WItemsNum^0)}>

Fresh variables:
undef2, undef33, undef35, 

Undef variables:
undef2, undef33, undef35, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l5, l6, 6 <= WItemsNum^0 /\ undef2 = 0, {all remain the same}>
<l5, l5, 6 <= WItemsNum^0 /\ 1 <= undef2, {WItemsNum^0 -> 1 + WItemsNum^0, rest remain the same}>
<l5, l5, 6 <= WItemsNum^0 /\ 1 + undef2 <= 0, {WItemsNum^0 -> 1 + WItemsNum^0, rest remain the same}>
<l5, l5, WItemsNum^0 <= 5, {WItemsNum^0 -> 1 + WItemsNum^0, rest remain the same}>
<l6, l5, WItemsNum^0 <= 2, {all remain the same}>
<l6, l6, 3 <= WItemsNum^0, {WItemsNum^0 -> -1 + WItemsNum^0, rest remain the same}>
Variables:
WItemsNum^0

Precedence: 
Graph 0

Graph 1
<l0, l5, WItemsNum^0 = undef33, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l5, l6}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001531s

LOG: CALL solveLinear

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.048776s
Time used: 0.048573
Trying to remove transition: <l5, l5, WItemsNum^0 <= 5, {WItemsNum^0 -> 1 + WItemsNum^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.078745s
Time used: 0.077856
Trying to remove transition: <l5, l5, 6 <= WItemsNum^0 /\ 1 + undef2 <= 0, {WItemsNum^0 -> 1 + WItemsNum^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013578s
Time used: 0.011338
Trying to remove transition: <l5, l5, 6 <= WItemsNum^0 /\ 1 <= undef2, {WItemsNum^0 -> 1 + WItemsNum^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.236439s
Time used: 0.217979
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l5, WItemsNum^0 = undef33, {all remain the same}>

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

LOG: CALL solveLinear

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

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

Proving non-termination of subgraph 1
Transitions:
<l5, l6, 6 <= WItemsNum^0 /\ undef2 = 0, {all remain the same}>
<l5, l5, 6 <= WItemsNum^0 /\ 1 <= undef2, {WItemsNum^0 -> 1 + WItemsNum^0, rest remain the same}>
<l5, l5, 6 <= WItemsNum^0 /\ 1 + undef2 <= 0, {WItemsNum^0 -> 1 + WItemsNum^0, rest remain the same}>
<l5, l5, WItemsNum^0 <= 5, {WItemsNum^0 -> 1 + WItemsNum^0, rest remain the same}>
<l6, l5, WItemsNum^0 <= 2, {all remain the same}>
<l6, l6, 3 <= WItemsNum^0, {WItemsNum^0 -> -1 + WItemsNum^0, rest remain the same}>
Variables:
WItemsNum^0

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

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

Calling reachability with...
Transition: <l0, l5, WItemsNum^0 = undef33, {all remain the same}>
Conditions: 
OPEN EXITS: 
<l0, l5, WItemsNum^0 = undef33, {all remain the same}>

> Conditions are reachable!

Program does NOT terminate