NO

Solver Timeout: 4
Global Timeout: 60
No parsing errors!
Init Location: 0
Transitions:
<l0, l19, true>
<l1, l2, ((2 + (~(1) * x_6^0)) <= 0) /\ (0 <= (2 + (~(1) * w_5^0))), par{w_5^0 -> (1 + w_5^0), x_6^0 -> (1 + x_6^0)}>
<l2, l3, ((1 + x_6^0) <= 2)>
<l2, l3, (3 <= (0 + x_6^0))>
<l3, l4, ((1 + w_5^0) <= 2)>
<l3, l4, (3 <= (0 + w_5^0))>
<l4, l1, true>
<l1, l5, ((2 + (~(1) * x_6^0)) <= 0) /\ (0 <= (2 + (~(1) * w_5^0))), par{w_5^0 -> (1 + w_5^0), x_6^0 -> (1 + x_6^0)}>
<l5, l6, ((1 + x_6^0) <= 2)>
<l5, l6, (3 <= (0 + x_6^0))>
<l6, l7, ((0 + w_5^0) <= 2) /\ (2 <= (0 + w_5^0)), par{w_5^0 -> 1}>
<l7, l1, true>
<l1, l8, (0 <= (1 + (~(1) * x_6^0))), par{w_5^0 -> (1 + w_5^0), x_6^0 -> (1 + x_6^0)}>
<l8, l9, ((1 + x_6^0) <= 2)>
<l8, l9, (3 <= (0 + x_6^0))>
<l9, l10, ((1 + w_5^0) <= 2)>
<l9, l10, (3 <= (0 + w_5^0))>
<l10, l1, true>
<l1, l11, (0 <= (1 + (~(1) * x_6^0))), par{w_5^0 -> (1 + w_5^0), x_6^0 -> (1 + x_6^0)}>
<l11, l12, ((1 + x_6^0) <= 2)>
<l11, l12, (3 <= (0 + x_6^0))>
<l12, l13, ((0 + w_5^0) <= 2) /\ (2 <= (0 + w_5^0)), par{w_5^0 -> 1}>
<l13, l1, true>
<l1, l14, (0 <= (1 + (~(1) * x_6^0))) /\ (undef69 = (1 + x_6^0)) /\ ((0 + undef69) <= 2) /\ (2 <= (0 + undef69)), par{w_5^0 -> (1 + w_5^0), x_6^0 -> undef69}>
<l14, l15, ((1 + w_5^0) <= 2)>
<l14, l15, (3 <= (0 + w_5^0))>
<l15, l1, true>
<l1, l16, (0 <= (1 + (~(1) * x_6^0))) /\ (undef81 = (1 + x_6^0)) /\ (undef82 = (1 + w_5^0)) /\ ((0 + undef81) <= 2) /\ (2 <= (0 + undef81)) /\ ((0 + undef82) <= 2) /\ (2 <= (0 + undef82)), par{w_5^0 -> 1, x_6^0 -> undef81}>
<l16, l1, true>
<l1, l17, ((2 + (~(1) * x_6^0)) <= 0) /\ ((3 + (~(1) * w_5^0)) <= 0) /\ (undef86 = undef86), par{Result_4^0 -> undef86}>
<l18, l1, true>
<l19, l18, true>

Fresh variables:
undef69, undef81, undef82, undef86, 

Undef variables:
undef69, undef81, undef82, undef86, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l1, true>
<l1, l1, ((2 + (~(1) * x_6^0)) <= 0) /\ (0 <= (2 + (~(1) * w_5^0))) /\ (3 <= (0 + (1 + x_6^0))) /\ ((1 + (1 + w_5^0)) <= 2), par{w_5^0 -> (1 + w_5^0), x_6^0 -> (1 + x_6^0)}>
<l1, l1, ((2 + (~(1) * x_6^0)) <= 0) /\ (0 <= (2 + (~(1) * w_5^0))) /\ (3 <= (0 + (1 + x_6^0))) /\ (3 <= (0 + (1 + w_5^0))), par{w_5^0 -> (1 + w_5^0), x_6^0 -> (1 + x_6^0)}>
<l1, l1, ((2 + (~(1) * x_6^0)) <= 0) /\ (0 <= (2 + (~(1) * w_5^0))) /\ (3 <= (0 + (1 + x_6^0))) /\ ((0 + (1 + w_5^0)) <= 2) /\ (2 <= (0 + (1 + w_5^0))), par{w_5^0 -> 1, x_6^0 -> (1 + x_6^0)}>
<l1, l1, (0 <= (1 + (~(1) * x_6^0))) /\ ((1 + (1 + x_6^0)) <= 2) /\ ((1 + (1 + w_5^0)) <= 2), par{w_5^0 -> (1 + w_5^0), x_6^0 -> (1 + x_6^0)}>
<l1, l1, (0 <= (1 + (~(1) * x_6^0))) /\ ((1 + (1 + x_6^0)) <= 2) /\ (3 <= (0 + (1 + w_5^0))), par{w_5^0 -> (1 + w_5^0), x_6^0 -> (1 + x_6^0)}>
<l1, l1, (0 <= (1 + (~(1) * x_6^0))) /\ ((1 + (1 + x_6^0)) <= 2) /\ ((0 + (1 + w_5^0)) <= 2) /\ (2 <= (0 + (1 + w_5^0))), par{w_5^0 -> 1, x_6^0 -> (1 + x_6^0)}>
<l1, l1, (0 <= (1 + (~(1) * x_6^0))) /\ (undef69 = (1 + x_6^0)) /\ ((0 + undef69) <= 2) /\ (2 <= (0 + undef69)) /\ ((1 + (1 + w_5^0)) <= 2), par{w_5^0 -> (1 + w_5^0), x_6^0 -> undef69}>
<l1, l1, (0 <= (1 + (~(1) * x_6^0))) /\ (undef69 = (1 + x_6^0)) /\ ((0 + undef69) <= 2) /\ (2 <= (0 + undef69)) /\ (3 <= (0 + (1 + w_5^0))), par{w_5^0 -> (1 + w_5^0), x_6^0 -> undef69}>
<l1, l1, (0 <= (1 + (~(1) * x_6^0))) /\ (undef81 = (1 + x_6^0)) /\ (undef82 = (1 + w_5^0)) /\ ((0 + undef81) <= 2) /\ (2 <= (0 + undef81)) /\ ((0 + undef82) <= 2) /\ (2 <= (0 + undef82)), par{w_5^0 -> 1, x_6^0 -> undef81}>
<l1, l17, ((2 + (~(1) * x_6^0)) <= 0) /\ ((3 + (~(1) * w_5^0)) <= 0) /\ (undef86 = undef86)>

Fresh variables:
undef69, undef81, undef82, undef86, 

Undef variables:
undef69, undef81, undef82, undef86, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l1, l1, 2 <= x_6^0 /\ w_5^0 <= 0, {w_5^0 -> 1 + w_5^0, x_6^0 -> 1 + x_6^0, rest remain the same}>
<l1, l1, 2 <= x_6^0 /\ w_5^0 = 2, {w_5^0 -> 1 + w_5^0, x_6^0 -> 1 + x_6^0, rest remain the same}>
<l1, l1, 2 <= x_6^0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
<l1, l1, w_5^0 <= 0 /\ x_6^0 <= 0, {w_5^0 -> 1 + w_5^0, x_6^0 -> 1 + x_6^0, rest remain the same}>
<l1, l1, 2 <= w_5^0 /\ x_6^0 <= 0, {w_5^0 -> 1 + w_5^0, x_6^0 -> 1 + x_6^0, rest remain the same}>
<l1, l1, x_6^0 <= 0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
<l1, l1, x_6^0 <= 1 /\ w_5^0 <= 0 /\ 1 + x_6^0 = undef69 /\ undef69 = 2, {w_5^0 -> 1 + w_5^0, x_6^0 -> undef69, rest remain the same}>
<l1, l1, 2 <= w_5^0 /\ x_6^0 <= 1 /\ 1 + x_6^0 = undef69 /\ undef69 = 2, {w_5^0 -> 1 + w_5^0, x_6^0 -> undef69, rest remain the same}>
<l1, l1, x_6^0 <= 1 /\ 1 + w_5^0 = undef82 /\ 1 + x_6^0 = undef81 /\ undef81 = 2 /\ undef82 = 2, {w_5^0 -> 1, x_6^0 -> undef81, rest remain the same}>
Variables:
w_5^0, x_6^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

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

Graph 2
<l1, l17, 2 <= x_6^0 /\ 3 <= w_5^0, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005260s
Ranking function: -7*w_5^0
New Graphs: 
Transitions:
<l1, l1, 2 <= x_6^0 /\ w_5^0 = 2, {w_5^0 -> 1 + w_5^0, x_6^0 -> 1 + x_6^0, rest remain the same}>
<l1, l1, 2 <= x_6^0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
<l1, l1, 2 <= w_5^0 /\ x_6^0 <= 0, {w_5^0 -> 1 + w_5^0, x_6^0 -> 1 + x_6^0, rest remain the same}>
<l1, l1, x_6^0 <= 0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
<l1, l1, 2 <= w_5^0 /\ x_6^0 <= 1 /\ 1 + x_6^0 = undef69 /\ undef69 = 2, {w_5^0 -> 1 + w_5^0, x_6^0 -> undef69, rest remain the same}>
<l1, l1, x_6^0 <= 1 /\ 1 + w_5^0 = undef82 /\ 1 + x_6^0 = undef81 /\ undef81 = 2 /\ undef82 = 2, {w_5^0 -> 1, x_6^0 -> undef81, rest remain the same}>
Variables:
w_5^0, x_6^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002886s
Ranking function: -4 + 2*w_5^0 - 6*x_6^0
New Graphs: 
Transitions:
<l1, l1, 2 <= x_6^0 /\ w_5^0 = 2, {w_5^0 -> 1 + w_5^0, x_6^0 -> 1 + x_6^0, rest remain the same}>
<l1, l1, 2 <= x_6^0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
<l1, l1, x_6^0 <= 0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
<l1, l1, 2 <= w_5^0 /\ x_6^0 <= 1 /\ 1 + x_6^0 = undef69 /\ undef69 = 2, {w_5^0 -> 1 + w_5^0, x_6^0 -> undef69, rest remain the same}>
<l1, l1, x_6^0 <= 1 /\ 1 + w_5^0 = undef82 /\ 1 + x_6^0 = undef81 /\ undef81 = 2 /\ undef82 = 2, {w_5^0 -> 1, x_6^0 -> undef81, rest remain the same}>
Variables:
w_5^0, x_6^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002523s
Ranking function: 4 - 2*w_5^0
New Graphs: 
Transitions:
<l1, l1, 2 <= x_6^0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
<l1, l1, x_6^0 <= 0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
<l1, l1, 2 <= w_5^0 /\ x_6^0 <= 1 /\ 1 + x_6^0 = undef69 /\ undef69 = 2, {w_5^0 -> 1 + w_5^0, x_6^0 -> undef69, rest remain the same}>
<l1, l1, x_6^0 <= 1 /\ 1 + w_5^0 = undef82 /\ 1 + x_6^0 = undef81 /\ undef81 = 2 /\ undef82 = 2, {w_5^0 -> 1, x_6^0 -> undef81, rest remain the same}>
Variables:
w_5^0, x_6^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002223s
Ranking function: 2 - 2*w_5^0 - 7*x_6^0
New Graphs: 
Transitions:
<l1, l1, 2 <= x_6^0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
<l1, l1, 2 <= w_5^0 /\ x_6^0 <= 1 /\ 1 + x_6^0 = undef69 /\ undef69 = 2, {w_5^0 -> 1 + w_5^0, x_6^0 -> undef69, rest remain the same}>
<l1, l1, x_6^0 <= 1 /\ 1 + w_5^0 = undef82 /\ 1 + x_6^0 = undef81 /\ undef81 = 2 /\ undef82 = 2, {w_5^0 -> 1, x_6^0 -> undef81, rest remain the same}>
Variables:
w_5^0, x_6^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001937s
Ranking function: -6 + 7*w_5^0 - 8*x_6^0
New Graphs: 
Transitions:
<l1, l1, 2 <= x_6^0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
<l1, l1, x_6^0 <= 1 /\ 1 + w_5^0 = undef82 /\ 1 + x_6^0 = undef81 /\ undef81 = 2 /\ undef82 = 2, {w_5^0 -> 1, x_6^0 -> undef81, rest remain the same}>
Variables:
w_5^0, x_6^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001446s
Ranking function: 4 - 4*x_6^0
New Graphs: 
Transitions:
<l1, l1, 2 <= x_6^0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
Variables:
w_5^0, x_6^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000525s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001684s
Trying to remove transition: <l1, l1, 2 <= x_6^0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.074312s
Time used: 0.074298

LOG: SAT solveNonLinear - Elapsed time: 0.134573s
Cost: 1; Total time: 0.133916
Failed at location 1: 2 <= w_5^0
Before Improving: 
Quasi-invariant at l1: 2 <= w_5^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.011659s
Remaining time after improvement: 0.997324
Termination implied by a set of quasi-invariant(s):
Quasi-invariant at l1: 2 <= w_5^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l1, l1, 2 <= x_6^0 /\ w_5^0 <= 0, {w_5^0 -> 1 + w_5^0, x_6^0 -> 1 + x_6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, 2 <= x_6^0 /\ w_5^0 = 2, {w_5^0 -> 1 + w_5^0, x_6^0 -> 1 + x_6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l1, l1, 2 <= x_6^0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l1, l1, w_5^0 <= 0 /\ x_6^0 <= 0, {w_5^0 -> 1 + w_5^0, x_6^0 -> 1 + x_6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, 2 <= w_5^0 /\ x_6^0 <= 0, {w_5^0 -> 1 + w_5^0, x_6^0 -> 1 + x_6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l1, l1, x_6^0 <= 0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l1, l1, x_6^0 <= 1 /\ w_5^0 <= 0 /\ 1 + x_6^0 = undef69 /\ undef69 = 2, {w_5^0 -> 1 + w_5^0, x_6^0 -> undef69, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, 2 <= w_5^0 /\ x_6^0 <= 1 /\ 1 + x_6^0 = undef69 /\ undef69 = 2, {w_5^0 -> 1 + w_5^0, x_6^0 -> undef69, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l1, l1, x_6^0 <= 1 /\ 1 + w_5^0 = undef82 /\ 1 + x_6^0 = undef81 /\ undef81 = 2 /\ undef82 = 2, {w_5^0 -> 1, x_6^0 -> undef81, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l1, l1, 2 <= x_6^0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
New Graphs: 
Calling Safety with literal 2 <= w_5^0 and entry <l0, l1, true, {all remain the same}>

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000531s
INVARIANTS: 
1: 
Quasi-INVARIANTS to narrow Graph: 
1: 2 <= w_5^0 , 
Narrowing transition: 
<l1, l1, 2 <= x_6^0 /\ w_5^0 <= 0, {w_5^0 -> 1 + w_5^0, x_6^0 -> 1 + x_6^0, rest remain the same}>

LOG: Narrow transition size 1
It's unfeasible. Removing transition: 
<l1, l1, 2 <= x_6^0 /\ w_5^0 = 2, {w_5^0 -> 1 + w_5^0, x_6^0 -> 1 + x_6^0, rest remain the same}>
Narrowing transition: 
<l1, l1, 2 <= x_6^0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l1, l1, w_5^0 <= 0 /\ x_6^0 <= 0, {w_5^0 -> 1 + w_5^0, x_6^0 -> 1 + x_6^0, rest remain the same}>

LOG: Narrow transition size 1
It's unfeasible. Removing transition: 
<l1, l1, 2 <= w_5^0 /\ x_6^0 <= 0, {w_5^0 -> 1 + w_5^0, x_6^0 -> 1 + x_6^0, rest remain the same}>
Narrowing transition: 
<l1, l1, x_6^0 <= 0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l1, l1, x_6^0 <= 1 /\ w_5^0 <= 0 /\ 1 + x_6^0 = undef69 /\ undef69 = 2, {w_5^0 -> 1 + w_5^0, x_6^0 -> undef69, rest remain the same}>

LOG: Narrow transition size 1
It's unfeasible. Removing transition: 
<l1, l1, 2 <= w_5^0 /\ x_6^0 <= 1 /\ 1 + x_6^0 = undef69 /\ undef69 = 2, {w_5^0 -> 1 + w_5^0, x_6^0 -> undef69, rest remain the same}>
Narrowing transition: 
<l1, l1, x_6^0 <= 1 /\ 1 + w_5^0 = undef82 /\ 1 + x_6^0 = undef81 /\ undef81 = 2 /\ undef82 = 2, {w_5^0 -> 1, x_6^0 -> undef81, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l1, l1, 2 <= x_6^0 /\ w_5^0 <= 0, {w_5^0 -> 1 + w_5^0, x_6^0 -> 1 + x_6^0, rest remain the same}>
<l1, l1, 2 <= x_6^0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
<l1, l1, w_5^0 <= 0 /\ x_6^0 <= 0, {w_5^0 -> 1 + w_5^0, x_6^0 -> 1 + x_6^0, rest remain the same}>
<l1, l1, x_6^0 <= 0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
<l1, l1, x_6^0 <= 1 /\ w_5^0 <= 0 /\ 1 + x_6^0 = undef69 /\ undef69 = 2, {w_5^0 -> 1 + w_5^0, x_6^0 -> undef69, rest remain the same}>
<l1, l1, w_5^0 <= 1 /\ x_6^0 <= 1 /\ 1 + w_5^0 = undef82 /\ 1 + x_6^0 = undef81 /\ undef81 = 2 /\ undef82 = 2, {w_5^0 -> 1, x_6^0 -> undef81, rest remain the same}>
Variables:
w_5^0, x_6^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003026s
Ranking function: -3*w_5^0 - 4*x_6^0
New Graphs: 
Transitions:
<l1, l1, 2 <= x_6^0 /\ w_5^0 <= 0, {w_5^0 -> 1 + w_5^0, x_6^0 -> 1 + x_6^0, rest remain the same}>
<l1, l1, 2 <= x_6^0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
<l1, l1, x_6^0 <= 0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
<l1, l1, x_6^0 <= 1 /\ w_5^0 <= 0 /\ 1 + x_6^0 = undef69 /\ undef69 = 2, {w_5^0 -> 1 + w_5^0, x_6^0 -> undef69, rest remain the same}>
<l1, l1, w_5^0 <= 1 /\ x_6^0 <= 1 /\ 1 + w_5^0 = undef82 /\ 1 + x_6^0 = undef81 /\ undef81 = 2 /\ undef82 = 2, {w_5^0 -> 1, x_6^0 -> undef81, rest remain the same}>
Variables:
w_5^0, x_6^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002776s
Ranking function: -7*w_5^0
New Graphs: 
Transitions:
<l1, l1, 2 <= x_6^0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
<l1, l1, x_6^0 <= 0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
<l1, l1, w_5^0 <= 1 /\ x_6^0 <= 1 /\ 1 + w_5^0 = undef82 /\ 1 + x_6^0 = undef81 /\ undef81 = 2 /\ undef82 = 2, {w_5^0 -> 1, x_6^0 -> undef81, rest remain the same}>
Variables:
w_5^0, x_6^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001937s
Ranking function: 1 - w_5^0 - 7*x_6^0
New Graphs: 
Transitions:
<l1, l1, 2 <= x_6^0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
<l1, l1, w_5^0 <= 1 /\ x_6^0 <= 1 /\ 1 + w_5^0 = undef82 /\ 1 + x_6^0 = undef81 /\ undef81 = 2 /\ undef82 = 2, {w_5^0 -> 1, x_6^0 -> undef81, rest remain the same}>
Variables:
w_5^0, x_6^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001655s
Ranking function: 2 - x_6^0
New Graphs: 
Transitions:
<l1, l1, 2 <= x_6^0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
Variables:
w_5^0, x_6^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000542s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001719s
Trying to remove transition: <l1, l1, 2 <= x_6^0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.040761s
Time used: 0.04075

LOG: SAT solveNonLinear - Elapsed time: 0.095346s
Cost: 1; Total time: 0.058762
Termination implied by a set of invariant(s):
Invariant at l1: w_5^0 <= 1
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, 2 <= x_6^0 /\ w_5^0 <= 0, {w_5^0 -> 1 + w_5^0, x_6^0 -> 1 + x_6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, 2 <= x_6^0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, w_5^0 <= 0 /\ x_6^0 <= 0, {w_5^0 -> 1 + w_5^0, x_6^0 -> 1 + x_6^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_6^0 <= 0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^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_6^0 <= 1 /\ w_5^0 <= 0 /\ 1 + x_6^0 = undef69 /\ undef69 = 2, {w_5^0 -> 1 + w_5^0, x_6^0 -> undef69, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, w_5^0 <= 1 /\ x_6^0 <= 1 /\ 1 + w_5^0 = undef82 /\ 1 + x_6^0 = undef81 /\ undef81 = 2 /\ undef82 = 2, {w_5^0 -> 1, x_6^0 -> undef81, 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): 
<l1, l1, 2 <= x_6^0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
Quasi-ranking function: 50000 + w_5^0 - x_6^0
New Graphs: 
Transitions:
<l1, l1, 2 <= x_6^0 /\ 50001 + w_5^0 <= x_6^0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
Variables:
w_5^0, x_6^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000672s

LOG: CALL solveLinear

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.028023s
Time used: 0.028013

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000707s

LOG: CALL solveLinear

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.044221s
Time used: 0.04421

LOG: SAT solveNonLinear - Elapsed time: 0.082551s
Cost: 1; Total time: 0.06443
Termination implied by a set of invariant(s):
Invariant at l1: w_5^0 <= 1
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, 2 <= x_6^0 /\ w_5^0 <= 0, {w_5^0 -> 1 + w_5^0, x_6^0 -> 1 + x_6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, 2 <= x_6^0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, w_5^0 <= 0 /\ x_6^0 <= 0, {w_5^0 -> 1 + w_5^0, x_6^0 -> 1 + x_6^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_6^0 <= 0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^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_6^0 <= 1 /\ w_5^0 <= 0 /\ 1 + x_6^0 = undef69 /\ undef69 = 2, {w_5^0 -> 1 + w_5^0, x_6^0 -> undef69, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, w_5^0 <= 1 /\ x_6^0 <= 1 /\ 1 + w_5^0 = undef82 /\ 1 + x_6^0 = undef81 /\ undef81 = 2 /\ undef82 = 2, {w_5^0 -> 1, x_6^0 -> undef81, 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): 
<l1, l1, 50001 + w_5^0 <= x_6^0 /\ 50001 <= x_6^0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
Quasi-ranking function: 50000 - w_5^0 - x_6^0
New Graphs: 
Transitions:
<l1, l1, 50001 + w_5^0 <= x_6^0 /\ 50001 <= w_5^0 + x_6^0 /\ 50001 <= x_6^0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
Variables:
w_5^0, x_6^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000773s

LOG: CALL solveLinear

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.034256s
Time used: 0.016688

Proving non-termination of subgraph 1
Transitions:
<l1, l1, 2 <= x_6^0 /\ w_5^0 <= 0, {w_5^0 -> 1 + w_5^0, x_6^0 -> 1 + x_6^0, rest remain the same}>
<l1, l1, 2 <= x_6^0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
<l1, l1, w_5^0 <= 0 /\ x_6^0 <= 0, {w_5^0 -> 1 + w_5^0, x_6^0 -> 1 + x_6^0, rest remain the same}>
<l1, l1, x_6^0 <= 0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
<l1, l1, x_6^0 <= 1 /\ w_5^0 <= 0 /\ 1 + x_6^0 = undef69 /\ undef69 = 2, {w_5^0 -> 1 + w_5^0, x_6^0 -> undef69, rest remain the same}>
<l1, l1, w_5^0 <= 1 /\ x_6^0 <= 1 /\ 1 + w_5^0 = undef82 /\ 1 + x_6^0 = undef81 /\ undef81 = 2 /\ undef82 = 2, {w_5^0 -> 1, x_6^0 -> undef81, rest remain the same}>
Variables:
w_5^0, x_6^0

Checking that every undef value has an assignment...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001991s
Checking conditional non-termination of SCC {l1}...
> No assignment for some undef value.
> Checking if the negation of the conditions of every pending exit is quasi-invariant... YES
Calling reachability with...
Transition: <l1, end, true, {all remain the same}>
Conditions: w_5^0 <= 1, 
OPEN EXITS: 
<l1, end, w_5^0 <= 1, {all remain the same}>

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

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

> Conditions are reachable!

Program does NOT terminate