/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


NO

Solver Timeout: 4
Global Timeout: 300
Maximum number of concurrent processes: 900
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, (undef12 = __disjvr_0^0) /\ (__disjvr_0^0 = undef12), par{__disjvr_0^0 -> undef12}>
<l3, l4, (undef23 = __disjvr_1^0) /\ (__disjvr_1^0 = undef23), par{__disjvr_1^0 -> undef23}>
<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, (undef54 = __disjvr_2^0) /\ (__disjvr_2^0 = undef54), par{__disjvr_2^0 -> undef54}>
<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, (undef95 = __disjvr_3^0) /\ (__disjvr_3^0 = undef95), par{__disjvr_3^0 -> undef95}>
<l9, l10, (undef106 = __disjvr_4^0) /\ (__disjvr_4^0 = undef106), par{__disjvr_4^0 -> undef106}>
<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, (undef137 = __disjvr_5^0) /\ (__disjvr_5^0 = undef137), par{__disjvr_5^0 -> undef137}>
<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))) /\ (undef170 = (1 + x_6^0)) /\ ((0 + undef170) <= 2) /\ (2 <= (0 + undef170)), par{w_5^0 -> (1 + w_5^0), x_6^0 -> undef170}>
<l14, l15, (undef178 = __disjvr_6^0) /\ (__disjvr_6^0 = undef178), par{__disjvr_6^0 -> undef178}>
<l15, l1, true>
<l1, l16, (0 <= (1 + (~(1) * x_6^0))) /\ (undef200 = (1 + x_6^0)) /\ (undef201 = (1 + w_5^0)) /\ ((0 + undef200) <= 2) /\ (2 <= (0 + undef200)) /\ ((0 + undef201) <= 2) /\ (2 <= (0 + undef201)), par{w_5^0 -> 1, x_6^0 -> undef200}>
<l16, l1, true>
<l1, l17, ((2 + (~(1) * x_6^0)) <= 0) /\ ((3 + (~(1) * w_5^0)) <= 0) /\ (undef212 = undef212), par{Result_4^0 -> undef212}>
<l18, l1, true>
<l19, l18, true>

Fresh variables:
undef12, undef23, undef54, undef95, undef106, undef137, undef170, undef178, undef200, undef201, undef212, 

Undef variables:
undef12, undef23, undef54, undef95, undef106, undef137, undef170, undef178, undef200, undef201, undef212, 

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))) /\ (undef12 = __disjvr_0^0) /\ (__disjvr_0^0 = undef12) /\ (undef23 = __disjvr_1^0) /\ (__disjvr_1^0 = undef23), par{__disjvr_0^0 -> undef12, __disjvr_1^0 -> undef23, 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))) /\ (undef54 = __disjvr_2^0) /\ (__disjvr_2^0 = undef54) /\ ((0 + (1 + w_5^0)) <= 2) /\ (2 <= (0 + (1 + w_5^0))), par{__disjvr_2^0 -> undef54, w_5^0 -> 1, x_6^0 -> (1 + x_6^0)}>
<l1, l1, (0 <= (1 + (~(1) * x_6^0))) /\ (undef95 = __disjvr_3^0) /\ (__disjvr_3^0 = undef95) /\ (undef106 = __disjvr_4^0) /\ (__disjvr_4^0 = undef106), par{__disjvr_3^0 -> undef95, __disjvr_4^0 -> undef106, w_5^0 -> (1 + w_5^0), x_6^0 -> (1 + x_6^0)}>
<l1, l1, (0 <= (1 + (~(1) * x_6^0))) /\ (undef137 = __disjvr_5^0) /\ (__disjvr_5^0 = undef137) /\ ((0 + (1 + w_5^0)) <= 2) /\ (2 <= (0 + (1 + w_5^0))), par{__disjvr_5^0 -> undef137, w_5^0 -> 1, x_6^0 -> (1 + x_6^0)}>
<l1, l1, (0 <= (1 + (~(1) * x_6^0))) /\ (undef170 = (1 + x_6^0)) /\ ((0 + undef170) <= 2) /\ (2 <= (0 + undef170)) /\ (undef178 = __disjvr_6^0) /\ (__disjvr_6^0 = undef178), par{__disjvr_6^0 -> undef178, w_5^0 -> (1 + w_5^0), x_6^0 -> undef170}>
<l1, l1, (0 <= (1 + (~(1) * x_6^0))) /\ (undef200 = (1 + x_6^0)) /\ (undef201 = (1 + w_5^0)) /\ ((0 + undef200) <= 2) /\ (2 <= (0 + undef200)) /\ ((0 + undef201) <= 2) /\ (2 <= (0 + undef201)), par{w_5^0 -> 1, x_6^0 -> undef200}>
<l1, l17, ((2 + (~(1) * x_6^0)) <= 0) /\ ((3 + (~(1) * w_5^0)) <= 0) /\ (undef212 = undef212)>

Fresh variables:
undef12, undef23, undef54, undef95, undef106, undef137, undef170, undef178, undef200, undef201, undef212, 

Undef variables:
undef12, undef23, undef54, undef95, undef106, undef137, undef170, undef178, undef200, undef201, undef212, 

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 <= 2 /\ __disjvr_0^0 = undef12 /\ __disjvr_1^0 = undef23, {__disjvr_0^0 -> undef12, __disjvr_1^0 -> undef23, 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 /\ __disjvr_2^0 = undef54, {__disjvr_2^0 -> undef54, w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
<l1, l1, x_6^0 <= 1 /\ __disjvr_3^0 = undef95 /\ __disjvr_4^0 = undef106, {__disjvr_3^0 -> undef95, __disjvr_4^0 -> undef106, w_5^0 -> 1 + w_5^0, x_6^0 -> 1 + x_6^0, rest remain the same}>
<l1, l1, x_6^0 <= 1 /\ w_5^0 = 1 /\ __disjvr_5^0 = undef137, {__disjvr_5^0 -> undef137, w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
<l1, l1, x_6^0 <= 1 /\ 1 + x_6^0 = undef170 /\ __disjvr_6^0 = undef178 /\ undef170 = 2, {__disjvr_6^0 -> undef178, w_5^0 -> 1 + w_5^0, x_6^0 -> undef170, rest remain the same}>
<l1, l1, x_6^0 <= 1 /\ 1 + w_5^0 = undef201 /\ 1 + x_6^0 = undef200 /\ undef200 = 2 /\ undef201 = 2, {w_5^0 -> 1, x_6^0 -> undef200, rest remain the same}>
Variables:
__disjvr_0^0, __disjvr_1^0, w_5^0, x_6^0, __disjvr_2^0, __disjvr_3^0, __disjvr_4^0, __disjvr_5^0, __disjvr_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.04117

Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008651s
Ranking function: 2 - w_5^0
New Graphs: 
Transitions:
<l1, l1, 2 <= x_6^0 /\ w_5^0 = 1 /\ __disjvr_2^0 = undef54, {__disjvr_2^0 -> undef54, w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
<l1, l1, x_6^0 <= 1 /\ __disjvr_3^0 = undef95 /\ __disjvr_4^0 = undef106, {__disjvr_3^0 -> undef95, __disjvr_4^0 -> undef106, w_5^0 -> 1 + w_5^0, x_6^0 -> 1 + x_6^0, rest remain the same}>
<l1, l1, x_6^0 <= 1 /\ w_5^0 = 1 /\ __disjvr_5^0 = undef137, {__disjvr_5^0 -> undef137, w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
<l1, l1, x_6^0 <= 1 /\ 1 + x_6^0 = undef170 /\ __disjvr_6^0 = undef178 /\ undef170 = 2, {__disjvr_6^0 -> undef178, w_5^0 -> 1 + w_5^0, x_6^0 -> undef170, rest remain the same}>
<l1, l1, x_6^0 <= 1 /\ 1 + w_5^0 = undef201 /\ 1 + x_6^0 = undef200 /\ undef200 = 2 /\ undef201 = 2, {w_5^0 -> 1, x_6^0 -> undef200, rest remain the same}>
Variables:
__disjvr_2^0, __disjvr_3^0, __disjvr_4^0, __disjvr_5^0, __disjvr_6^0, w_5^0, x_6^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000640s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002310s
[44502 : 44503]
[44502 : 44504]
Successful child: 44503
[ 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 /\ __disjvr_0^0 = undef12 /\ __disjvr_1^0 = undef23 /\ w_5^0 = 2, {__disjvr_0^0 -> undef12, __disjvr_1^0 -> undef23, 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 /\ __disjvr_2^0 = undef54, {__disjvr_2^0 -> undef54, 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, 2 <= w_5^0 /\ x_6^0 <= 1 /\ __disjvr_3^0 = undef95 /\ __disjvr_4^0 = undef106, {__disjvr_3^0 -> undef95, __disjvr_4^0 -> undef106, 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 <= 1 /\ w_5^0 = 1 /\ __disjvr_5^0 = undef137, {__disjvr_5^0 -> undef137, 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, 2 <= w_5^0 /\ x_6^0 <= 1 /\ 1 + x_6^0 = undef170 /\ __disjvr_6^0 = undef178 /\ undef170 = 2, {__disjvr_6^0 -> undef178, w_5^0 -> 1 + w_5^0, x_6^0 -> undef170, 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 = undef201 /\ 1 + x_6^0 = undef200 /\ undef200 = 2 /\ undef201 = 2, {w_5^0 -> 1, x_6^0 -> undef200, rest remain the same}>
[ Termination 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 = 1 /\ __disjvr_2^0 = undef54, {__disjvr_2^0 -> undef54, w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
New Graphs: 

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.000494s
> Postcondition is not implied!

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

LOG: Narrow transition size 1
Narrowing transition: 
<l1, l1, 2 <= x_6^0 /\ w_5^0 = 1 /\ __disjvr_2^0 = undef54, {__disjvr_2^0 -> undef54, 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 /\ __disjvr_3^0 = undef95 /\ __disjvr_4^0 = undef106, {__disjvr_3^0 -> undef95, __disjvr_4^0 -> undef106, w_5^0 -> 1 + w_5^0, 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 = 1 /\ __disjvr_5^0 = undef137, {__disjvr_5^0 -> undef137, 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 /\ 1 + x_6^0 = undef170 /\ __disjvr_6^0 = undef178 /\ undef170 = 2, {__disjvr_6^0 -> undef178, w_5^0 -> 1 + w_5^0, x_6^0 -> undef170, rest remain the same}>

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

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l1, l1, 2 <= x_6^0 /\ w_5^0 <= 1 /\ __disjvr_0^0 = undef12 /\ __disjvr_1^0 = undef23, {__disjvr_0^0 -> undef12, __disjvr_1^0 -> undef23, 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 /\ __disjvr_2^0 = undef54, {__disjvr_2^0 -> undef54, 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 /\ __disjvr_3^0 = undef95 /\ __disjvr_4^0 = undef106, {__disjvr_3^0 -> undef95, __disjvr_4^0 -> undef106, w_5^0 -> 1 + w_5^0, x_6^0 -> 1 + x_6^0, rest remain the same}>
<l1, l1, x_6^0 <= 1 /\ w_5^0 = 1 /\ __disjvr_5^0 = undef137, {__disjvr_5^0 -> undef137, 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 + x_6^0 = undef170 /\ __disjvr_6^0 = undef178 /\ undef170 = 2, {__disjvr_6^0 -> undef178, w_5^0 -> 1 + w_5^0, x_6^0 -> undef170, rest remain the same}>
<l1, l1, w_5^0 <= 1 /\ x_6^0 <= 1 /\ 1 + w_5^0 = undef201 /\ 1 + x_6^0 = undef200 /\ undef200 = 2 /\ undef201 = 2, {w_5^0 -> 1, x_6^0 -> undef200, rest remain the same}>
Variables:
__disjvr_0^0, __disjvr_1^0, w_5^0, x_6^0, __disjvr_2^0, __disjvr_3^0, __disjvr_4^0, __disjvr_5^0, __disjvr_6^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005145s
Ranking function: 1 - w_5^0
New Graphs: 
Transitions:
<l1, l1, 2 <= x_6^0 /\ w_5^0 = 1 /\ __disjvr_2^0 = undef54, {__disjvr_2^0 -> undef54, w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
<l1, l1, x_6^0 <= 1 /\ w_5^0 = 1 /\ __disjvr_5^0 = undef137, {__disjvr_5^0 -> undef137, 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 = undef201 /\ 1 + x_6^0 = undef200 /\ undef200 = 2 /\ undef201 = 2, {w_5^0 -> 1, x_6^0 -> undef200, rest remain the same}>
Variables:
__disjvr_2^0, __disjvr_5^0, w_5^0, x_6^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000673s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002356s
[44502 : 44508]
[44502 : 44509]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.089751s
Time used: 0.089743

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000688s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002520s
[44502 : 44609]
[44502 : 44610]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.072145s
Time used: 0.072139

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000776s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003191s
[44502 : 44614]
[44502 : 44615]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.062370s
Time used: 0.062363

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000887s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003174s
[44502 : 44619]
[44502 : 44620]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.072992s
Time used: 0.072986

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001009s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003742s
[44502 : 44624]
[44502 : 44625]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.067596s
Time used: 0.067589

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001100s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005152s
[44502 : 44635]
[44502 : 44636]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.086851s
Time used: 0.086844

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001216s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006474s
[44502 : 44788]
[44502 : 44789]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.062301s
Time used: 0.062294

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001315s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.012209s
[44502 : 44795]
[44502 : 44796]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.062065s
Time used: 0.062058

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001405s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005633s
[44502 : 44998]
[44502 : 44999]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.064466s
Time used: 0.06446

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001525s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008992s
[44502 : 45008]
[44502 : 45009]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.053409s
Time used: 0.052764

[44502 : 45018]
[44502 : 45019]
Successful child: 45019

Program does NOT terminate