NO

Solver Timeout: 4
Global Timeout: 300
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.011364

Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002435s
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.001357s
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.001196s
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.001051s
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.000920s
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.000690s
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.000254s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000805s
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.002804s
Time used: 0.002732
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.031148s
Time used: 0.031146

LOG: SAT solveNonLinear - Elapsed time: 0.057271s
Cost: 1; Total time: 0.05703
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.005716s
Remaining time after improvement: 0.998765
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.000219s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000244s
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.001383s
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.001279s
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.000901s
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.000777s
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.000265s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000814s
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.002860s
Time used: 0.002789
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.017982s
Time used: 0.01798

LOG: SAT solveNonLinear - Elapsed time: 0.044135s
Cost: 1; Total time: 0.026769
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.000330s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001039s
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.003830s
Time used: 0.003748
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.013276s
Time used: 0.013274

LOG: SAT solveNonLinear - Elapsed time: 0.032720s
Cost: 1; Total time: 0.022485
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.000341s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001081s
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.004434s
Time used: 0.004352
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.020026s
Time used: 0.020024

LOG: SAT solveNonLinear - Elapsed time: 0.049000s
Cost: 1; Total time: 0.030489
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.000401s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001421s
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.003588s
Time used: 0.003498
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018393s
Time used: 0.009154

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.000879s
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