NO

Solver Timeout: 4
Global Timeout: 300
No parsing errors!
Init Location: 0
Transitions:
<l0, l6, true>
<l1, l2, ((arg2 + 15) > arg2) /\ (arg2 > ~(1)) /\ (arg1 > 0), par{arg1 -> 20, arg2 -> 0, arg3 -> (arg2 + 15), arg4 -> undef4, arg5 -> undef5}>
<l2, l3, (arg3 > 0) /\ (arg3 < arg1) /\ (arg1 > ~(1)) /\ (arg2 < 0), par{arg1 -> arg3, arg2 -> arg1, arg3 -> arg2, arg4 -> (arg3 + 1), arg5 -> (arg1 - 2)}>
<l2, l3, (arg3 > 0) /\ (arg3 < arg1) /\ (arg1 > ~(1)) /\ (arg2 > 0), par{arg1 -> arg3, arg2 -> arg1, arg3 -> arg2, arg4 -> (arg3 + 1), arg5 -> (arg1 - 2)}>
<l2, l4, (arg1 > ~(1)) /\ (arg3 > 0) /\ (arg3 < arg1) /\ (0 = arg2), par{arg1 -> arg3, arg2 -> arg1, arg3 -> (arg3 - 1), arg4 -> (arg1 - 2), arg5 -> undef20}>
<l2, l5, (arg1 > 0) /\ (arg1 = arg3), par{arg2 -> (arg1 - 1), arg3 -> (arg1 - 2), arg4 -> undef24, arg5 -> undef25}>
<l3, l2, (arg1 > 0) /\ (arg4 > 1) /\ (arg1 < arg2) /\ (arg5 > arg4), par{arg1 -> arg2, arg2 -> arg3, arg3 -> arg4, arg4 -> undef29, arg5 -> undef30}>
<l3, l2, (arg1 > 0) /\ (arg4 > 1) /\ (arg1 > arg2) /\ (arg5 > arg4), par{arg1 -> arg2, arg2 -> arg3, arg3 -> arg4, arg4 -> undef34, arg5 -> undef35}>
<l3, l2, (arg1 > 0) /\ (arg4 > 1) /\ (arg1 < arg2) /\ (arg5 < arg4), par{arg1 -> arg2, arg2 -> arg3, arg3 -> arg4, arg4 -> undef39, arg5 -> undef40}>
<l3, l2, (arg1 > 0) /\ (arg4 > 1) /\ (arg1 > arg2) /\ (arg5 < arg4), par{arg1 -> arg2, arg2 -> arg3, arg3 -> arg4, arg4 -> undef44, arg5 -> undef45}>
<l4, l2, (arg1 > 0) /\ (arg2 > arg1) /\ (arg4 > arg3), par{arg1 -> arg2, arg2 -> 0, arg4 -> undef49, arg5 -> undef50}>
<l4, l2, (arg1 > 0) /\ (arg2 < arg1) /\ (arg4 > arg3), par{arg1 -> arg2, arg2 -> 0, arg4 -> undef54, arg5 -> undef55}>
<l4, l2, (arg1 > 0) /\ (arg2 > arg1) /\ (arg4 < arg3), par{arg1 -> arg2, arg2 -> 0, arg4 -> undef59, arg5 -> undef60}>
<l4, l2, (arg1 > 0) /\ (arg2 < arg1) /\ (arg4 < arg3), par{arg1 -> arg2, arg2 -> 0, arg4 -> undef64, arg5 -> undef65}>
<l3, l2, (arg1 > 0) /\ (arg4 <= (arg2 - 1)) /\ (arg4 = arg5), par{arg1 -> (arg2 - 1), arg2 -> arg3, arg3 -> arg4, arg4 -> undef69, arg5 -> undef70}>
<l4, l2, (arg1 > 0) /\ (arg3 <= (arg2 - 1)) /\ (arg3 = arg4), par{arg1 -> (arg2 - 1), arg2 -> 0, arg4 -> undef74, arg5 -> undef75}>
<l5, l2, (arg3 > arg2), par{arg2 -> 0, arg3 -> arg2, arg4 -> undef79, arg5 -> undef80}>
<l5, l2, (arg3 < arg2), par{arg2 -> 0, arg3 -> arg2, arg4 -> undef84, arg5 -> undef85}>
<l2, l2, (arg1 > 0) /\ (arg1 < 3) /\ (0 = arg3), par{arg2 -> 1, arg3 -> 1, arg4 -> undef89, arg5 -> undef90}>
<l2, l2, (arg1 > 3) /\ (0 = arg3), par{arg2 -> 1, arg3 -> 1, arg4 -> undef94, arg5 -> undef95}>
<l5, l2, (arg2 < arg1) /\ (arg2 <= (arg1 - 1)) /\ (arg2 = arg3), par{arg1 -> (arg1 - 1), arg2 -> 0, arg3 -> arg2, arg4 -> undef99, arg5 -> undef100}>
<l2, l2, (3 = arg1) /\ (0 = arg3), par{arg1 -> 2, arg2 -> 1, arg3 -> 1, arg4 -> undef104, arg5 -> undef105}>
<l2, l2, (0 = arg1) /\ (0 = arg3), par{arg1 -> 0, arg2 -> 0, arg3 -> ~(1), arg4 -> undef109, arg5 -> undef110}>
<l6, l1, true, par{arg1 -> undef111, arg2 -> undef112, arg3 -> undef113, arg4 -> undef114, arg5 -> undef115}>

Fresh variables:
undef4, undef5, undef20, undef24, undef25, undef29, undef30, undef34, undef35, undef39, undef40, undef44, undef45, undef49, undef50, undef54, undef55, undef59, undef60, undef64, undef65, undef69, undef70, undef74, undef75, undef79, undef80, undef84, undef85, undef89, undef90, undef94, undef95, undef99, undef100, undef104, undef105, undef109, undef110, undef111, undef112, undef113, undef114, undef115, 

Undef variables:
undef4, undef5, undef20, undef24, undef25, undef29, undef30, undef34, undef35, undef39, undef40, undef44, undef45, undef49, undef50, undef54, undef55, undef59, undef60, undef64, undef65, undef69, undef70, undef74, undef75, undef79, undef80, undef84, undef85, undef89, undef90, undef94, undef95, undef99, undef100, undef104, undef105, undef109, undef110, undef111, undef112, undef113, undef114, undef115, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (arg1 = 20) /\ (arg2 = 0) /\ (arg3 = (undef112 + 15)) /\ ((undef112 + 15) > undef112) /\ (undef112 > ~(1)) /\ (undef111 > 0)>
<l2, l2, (arg3 > 0) /\ (arg3 < arg1) /\ (arg1 > ~(1)) /\ (arg2 < 0) /\ (arg3 > 0) /\ ((arg3 + 1) > 1) /\ (arg3 < arg1) /\ ((arg1 - 2) > (arg3 + 1)), par{arg1 -> arg1, arg2 -> arg2, arg3 -> (arg3 + 1)}>
<l2, l2, (arg3 > 0) /\ (arg3 < arg1) /\ (arg1 > ~(1)) /\ (arg2 < 0) /\ (arg3 > 0) /\ ((arg3 + 1) > 1) /\ (arg3 < arg1) /\ ((arg1 - 2) < (arg3 + 1)), par{arg1 -> arg1, arg2 -> arg2, arg3 -> (arg3 + 1)}>
<l2, l2, (arg3 > 0) /\ (arg3 < arg1) /\ (arg1 > ~(1)) /\ (arg2 < 0) /\ (arg3 > 0) /\ ((arg3 + 1) <= (arg1 - 1)) /\ ((arg3 + 1) = (arg1 - 2)), par{arg1 -> (arg1 - 1), arg2 -> arg2, arg3 -> (arg3 + 1)}>
<l2, l2, (arg3 > 0) /\ (arg3 < arg1) /\ (arg1 > ~(1)) /\ (arg2 > 0) /\ (arg3 > 0) /\ ((arg3 + 1) > 1) /\ (arg3 < arg1) /\ ((arg1 - 2) > (arg3 + 1)), par{arg1 -> arg1, arg2 -> arg2, arg3 -> (arg3 + 1)}>
<l2, l2, (arg3 > 0) /\ (arg3 < arg1) /\ (arg1 > ~(1)) /\ (arg2 > 0) /\ (arg3 > 0) /\ ((arg3 + 1) > 1) /\ (arg3 < arg1) /\ ((arg1 - 2) < (arg3 + 1)), par{arg1 -> arg1, arg2 -> arg2, arg3 -> (arg3 + 1)}>
<l2, l2, (arg3 > 0) /\ (arg3 < arg1) /\ (arg1 > ~(1)) /\ (arg2 > 0) /\ (arg3 > 0) /\ ((arg3 + 1) <= (arg1 - 1)) /\ ((arg3 + 1) = (arg1 - 2)), par{arg1 -> (arg1 - 1), arg2 -> arg2, arg3 -> (arg3 + 1)}>
<l2, l2, (arg1 > ~(1)) /\ (arg3 > 0) /\ (arg3 < arg1) /\ (0 = arg2) /\ (arg3 > 0) /\ (arg1 > arg3) /\ ((arg1 - 2) > (arg3 - 1)), par{arg1 -> arg1, arg2 -> 0, arg3 -> (arg3 - 1)}>
<l2, l2, (arg1 > ~(1)) /\ (arg3 > 0) /\ (arg3 < arg1) /\ (0 = arg2) /\ (arg3 > 0) /\ ((arg3 - 1) <= (arg1 - 1)) /\ ((arg3 - 1) = (arg1 - 2)), par{arg1 -> (arg1 - 1), arg2 -> 0, arg3 -> (arg3 - 1)}>
<l2, l2, (arg1 > 0) /\ (arg1 = arg3) /\ ((arg1 - 2) < (arg1 - 1)), par{arg2 -> 0, arg3 -> (arg1 - 1)}>
<l2, l2, (arg1 > 0) /\ (arg1 < 3) /\ (0 = arg3), par{arg2 -> 1, arg3 -> 1}>
<l2, l2, (arg1 > 3) /\ (0 = arg3), par{arg2 -> 1, arg3 -> 1}>
<l2, l2, (3 = arg1) /\ (0 = arg3), par{arg1 -> 2, arg2 -> 1, arg3 -> 1}>
<l2, l2, (0 = arg1) /\ (0 = arg3), par{arg1 -> 0, arg2 -> 0, arg3 -> ~(1)}>

Fresh variables:
undef4, undef5, undef20, undef24, undef25, undef29, undef30, undef34, undef35, undef39, undef40, undef44, undef45, undef49, undef50, undef54, undef55, undef59, undef60, undef64, undef65, undef69, undef70, undef74, undef75, undef79, undef80, undef84, undef85, undef89, undef90, undef94, undef95, undef99, undef100, undef104, undef105, undef109, undef110, undef111, undef112, undef113, undef114, undef115, 

Undef variables:
undef4, undef5, undef20, undef24, undef25, undef29, undef30, undef34, undef35, undef39, undef40, undef44, undef45, undef49, undef50, undef54, undef55, undef59, undef60, undef64, undef65, undef69, undef70, undef74, undef75, undef79, undef80, undef84, undef85, undef89, undef90, undef94, undef95, undef99, undef100, undef104, undef105, undef109, undef110, undef111, undef112, undef113, undef114, undef115, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, 1 + arg2 <= 0 /\ 1 <= arg3 /\ 0 <= arg1 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>
<l2, l2, 1 + arg3 <= arg1 /\ 1 + arg2 <= 0 /\ 1 <= arg3 /\ 0 <= arg1 /\ arg1 <= 2 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
<l2, l2, 1 + arg2 <= 0 /\ 1 <= arg3 /\ 0 <= arg1 /\ arg1 = 3 + arg3, {arg1 -> -1 + arg1, arg3 -> 1 + arg3, rest remain the same}>
<l2, l2, 1 <= arg2 /\ 1 <= arg3 /\ 0 <= arg1 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>
<l2, l2, 1 + arg3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 0 <= arg1 /\ arg1 <= 2 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
<l2, l2, 1 <= arg2 /\ 1 <= arg3 /\ 0 <= arg1 /\ arg1 = 3 + arg3, {arg1 -> -1 + arg1, arg3 -> 1 + arg3, rest remain the same}>
<l2, l2, 1 <= arg3 /\ 0 <= arg1 /\ 2 + arg3 <= arg1 /\ arg2 = 0, {arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
<l2, l2, 1 <= arg3 /\ 0 <= arg1 /\ arg1 = 1 + arg3 /\ arg2 = 0, {arg1 -> -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
<l2, l2, 1 <= arg1 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
<l2, l2, 1 <= arg1 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
<l2, l2, 4 <= arg1 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
<l2, l2, arg3 = 0 /\ arg1 = 3, {arg1 -> 2, arg2 -> 1, arg3 -> 1, rest remain the same}>
<l2, l2, arg1 = 0 /\ arg3 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1, rest remain the same}>
Variables:
arg1, arg2, arg3

Precedence: 
Graph 0

Graph 1
<l0, l2, 1 <= undef111 /\ 0 <= undef112 /\ arg2 = 0 /\ arg1 = 20 /\ arg3 = 15 + undef112, {all remain the same}>

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

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

Proving termination of subgraph 0
Proving termination of subgraph 1
Checking unfeasibility...
Time used: 0.04243
Some transition disabled by a set of invariant(s):
Invariant at l2: 1 <= arg1

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l2, l2, arg1 = 0 /\ arg3 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= arg1 /\ 1 + arg2 <= 0 /\ 1 <= arg3 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 + arg2 <= 0 /\ 1 <= arg3 /\ arg1 <= 2 + arg3, {arg3 -> 1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= arg1 /\ 1 + arg2 <= 0 /\ 1 <= arg3 /\ arg1 = 3 + arg3, {arg1 -> -1 + arg1, arg3 -> 1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 <= 2 + arg3, {arg3 -> 1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 = 3 + arg3, {arg1 -> -1 + arg1, arg3 -> 1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ 2 + arg3 <= arg1 /\ arg2 = 0, {arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ arg1 = 1 + arg3 /\ arg2 = 0, {arg1 -> -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= arg1 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= arg1 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 4 <= arg1 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, arg3 = 0 /\ arg1 = 3, {arg1 -> 2, arg2 -> 1, arg3 -> 1, rest remain the same}>
Checking unfeasibility...
Time used: 0.035973
Some transition disabled by a set of invariant(s):
Invariant at l2: 0 <= arg2

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 + arg2 <= 0 /\ 1 <= arg3 /\ arg1 <= 2 + arg3, {arg3 -> 1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 1 <= arg1 /\ 1 + arg2 <= 0 /\ 1 <= arg3 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 1 <= arg1 /\ 1 + arg2 <= 0 /\ 1 <= arg3 /\ arg1 = 3 + arg3, {arg1 -> -1 + arg1, arg3 -> 1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 <= 2 + arg3, {arg3 -> 1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 = 3 + arg3, {arg1 -> -1 + arg1, arg3 -> 1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ 2 + arg3 <= arg1 /\ arg2 = 0, {arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ arg1 = 1 + arg3 /\ arg2 = 0, {arg1 -> -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= arg1 /\ 0 <= arg2 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= arg1 /\ 0 <= arg2 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 0 <= arg2 /\ 4 <= arg1 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 0 <= arg2 /\ arg3 = 0 /\ arg1 = 3, {arg1 -> 2, arg2 -> 1, arg3 -> 1, rest remain the same}>
Checking unfeasibility...
Time used: 4.00178

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.007106s
Ranking function: -16 + 4*arg1
New Graphs: 
Transitions:
<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>
<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 <= 2 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ 2 + arg3 <= arg1 /\ arg2 = 0, {arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ arg1 = 1 + arg3 /\ arg2 = 0, {arg1 -> -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
<l2, l2, 1 <= arg1 /\ 0 <= arg2 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
<l2, l2, 1 <= arg1 /\ 0 <= arg2 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
<l2, l2, 0 <= arg2 /\ 4 <= arg1 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
<l2, l2, 0 <= arg2 /\ arg3 = 0 /\ arg1 = 3, {arg1 -> 2, arg2 -> 1, arg3 -> 1, rest remain the same}>
Variables:
arg1, arg2, arg3
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002404s
Ranking function: -6 + 3*arg1
New Graphs: 
Transitions:
<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>
<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 <= 2 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ 2 + arg3 <= arg1 /\ arg2 = 0, {arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
<l2, l2, 1 <= arg1 /\ 0 <= arg2 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
<l2, l2, 1 <= arg1 /\ 0 <= arg2 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
<l2, l2, 0 <= arg2 /\ 4 <= arg1 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
Variables:
arg1, arg2, arg3
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001441s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.087505s
Trying to remove transition: <l2, l2, 0 <= arg2 /\ 4 <= arg1 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015572s
Time used: 0.014605
Trying to remove transition: <l2, l2, 1 <= arg1 /\ 0 <= arg2 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016652s
Time used: 0.015069
Trying to remove transition: <l2, l2, 1 <= arg1 /\ 0 <= arg2 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018634s
Time used: 0.017174
Trying to remove transition: <l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ 2 + arg3 <= arg1 /\ arg2 = 0, {arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016176s
Time used: 0.014568
Trying to remove transition: <l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 <= 2 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018373s
Time used: 0.016732
Trying to remove transition: <l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000770s
Time used: 1.00076

LOG: SAT solveNonLinear - Elapsed time: 1.101944s
Cost: 1; Total time: 1.09995
Failed at location 2: arg1 <= 1 + arg3
Before Improving: 
Quasi-invariant at l2: arg1 <= 1 + arg3
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006226s
Remaining time after improvement: 0.996164
Termination implied by a set of quasi-invariant(s):
Quasi-invariant at l2: arg1 <= 1 + arg3
[ 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: 
<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 = 1 + arg3, {arg3 -> 1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 = 3 + arg3, {arg1 -> -1 + arg1, arg3 -> 1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ arg1 = 1 + arg3 /\ arg2 = 0, {arg1 -> -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= arg1 /\ 0 <= arg2 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= arg1 /\ arg1 <= 1 + arg3 /\ 0 <= arg2 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 0 <= arg2 /\ 4 <= arg1 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 0 <= arg2 /\ arg3 = 0 /\ arg1 = 3, {arg1 -> 2, arg2 -> 1, arg3 -> 1, 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: 
<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 = 1 + arg3, {arg3 -> 1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= arg1 /\ 0 <= arg2 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= arg1 /\ arg1 <= 1 + arg3 /\ 0 <= arg2 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 0 <= arg2 /\ 4 <= arg1 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
New Graphs: 
Transitions:
<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 = 1 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
<l2, l2, 1 <= arg1 /\ 0 <= arg2 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
<l2, l2, 1 <= arg1 /\ arg1 <= 1 + arg3 /\ 0 <= arg2 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
Variables:
arg1, arg2, arg3
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000832s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.009636s
Trying to remove transition: <l2, l2, 1 <= arg1 /\ arg1 <= 1 + arg3 /\ 0 <= arg2 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.000467s
Time used: 4.00006
Trying to remove transition: <l2, l2, 1 <= arg1 /\ 0 <= arg2 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.024264s
Time used: 0.011022
Trying to remove transition: <l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 = 1 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011034s
Time used: 0.01036

LOG: SAT solveNonLinear - Elapsed time: 0.011034s
Cost: 0; Total time: 0.01036
Termination implied by a set of quasi-invariant(s):
Quasi-invariant at l2: 1 + arg3 <= arg1 + arg2
Ranking function: 2*arg1 + 2*arg2 - 2*arg3
Ranking function and negation of Quasi-Invariant applied
New Graphs: 
Transitions:
<l2, l2, 1 <= arg1 /\ 0 <= arg2 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
<l2, l2, 1 <= arg1 /\ arg1 <= 1 + arg3 /\ 0 <= arg2 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
Variables:
arg1, arg2, arg3
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000665s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005195s
Trying to remove transition: <l2, l2, 1 <= arg1 /\ arg1 <= 1 + arg3 /\ 0 <= arg2 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.000384s
Time used: 4.00019
Trying to remove transition: <l2, l2, 1 <= arg1 /\ 0 <= arg2 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000730s
Time used: 1.0007

LOG: SAT solveNonLinear - Elapsed time: 1.036746s
Cost: 1; Total time: 1.03608
Failed at location 2: 1 + arg1 + arg2 <= arg3
Before Improving: 
Quasi-invariant at l2: 1 + arg1 + arg2 <= arg3
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.007166s
Remaining time after improvement: 0.998189
Termination implied by a set of quasi-invariant(s):
Quasi-invariant at l2: 1 + arg1 + arg2 <= arg3
[ 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: 
<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 = 1 + arg3, {arg3 -> 1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ arg1 = 1 + arg3 /\ arg2 = 0, {arg1 -> -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 1 <= arg1 /\ 0 <= arg2 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 1 <= arg1 /\ arg1 <= 1 + arg3 /\ 0 <= arg2 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l2, l2, 1 <= arg1 /\ arg1 <= 1 + arg3 /\ 0 <= arg2 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 1 <= arg1 /\ 0 <= arg2 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
New Graphs: 
Calling Safety with literal arg1 <= 1 + arg3 and entry <l0, l2, 1 <= undef111 /\ 0 <= undef112 /\ arg2 = 0 /\ arg1 = 20 /\ arg3 = 15 + undef112, {all remain the same}>

LOG: CALL check - Post:arg1 <= 1 + arg3 - Process 1
* Exit transition: <l0, l2, 1 <= undef111 /\ 0 <= undef112 /\ arg2 = 0 /\ arg1 = 20 /\ arg3 = 15 + undef112, {all remain the same}>
* Postcondition  : arg1 <= 1 + arg3

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000902s
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: arg1 <= 1 + arg3 , 
Calling Safety with literal 1 + arg1 + arg2 <= arg3 and entry <l0, l2, 1 <= undef111 /\ 0 <= undef112 /\ arg2 = 0 /\ arg1 = 20 /\ arg3 = 15 + undef112, {all remain the same}>

LOG: CALL check - Post:1 + arg1 + arg2 <= arg3 - Process 2
* Exit transition: <l0, l2, 1 <= undef111 /\ 0 <= undef112 /\ arg2 = 0 /\ arg1 = 20 /\ arg3 = 15 + undef112, {all remain the same}>
* Postcondition  : 1 + arg1 + arg2 <= arg3

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.001042s
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: 1 + arg1 + arg2 <= arg3 , 
Narrowing transition: 
<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>

LOG: Narrow transition size 2
Narrowing transition: 
<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 <= 2 + arg3, {arg3 -> 1 + arg3, rest remain the same}>

LOG: Narrow transition size 2
Narrowing transition: 
<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 = 3 + arg3, {arg1 -> -1 + arg1, arg3 -> 1 + arg3, rest remain the same}>

LOG: Narrow transition size 2
Narrowing transition: 
<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ 2 + arg3 <= arg1 /\ arg2 = 0, {arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>

LOG: Narrow transition size 2
Narrowing transition: 
<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ arg1 = 1 + arg3 /\ arg2 = 0, {arg1 -> -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>

LOG: Narrow transition size 2
Narrowing transition: 
<l2, l2, 1 <= arg1 /\ 0 <= arg2 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>

LOG: Narrow transition size 2
Narrowing transition: 
<l2, l2, 1 <= arg1 /\ 0 <= arg2 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>

LOG: Narrow transition size 2
Narrowing transition: 
<l2, l2, 0 <= arg2 /\ 4 <= arg1 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>

LOG: Narrow transition size 2
Narrowing transition: 
<l2, l2, 0 <= arg2 /\ arg3 = 0 /\ arg1 = 3, {arg1 -> 2, arg2 -> 1, arg3 -> 1, rest remain the same}>

LOG: Narrow transition size 2
invGraph after Narrowing: 
Transitions:
<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>
<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ arg1 <= 2 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ arg1 = 3 + arg3, {arg1 -> -1 + arg1, arg3 -> 1 + arg3, rest remain the same}>
<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ 2 + arg3 <= arg1 /\ arg2 = 0, {arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ arg1 = 1 + arg3 /\ arg2 = 0, {arg1 -> -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
<l2, l2, 1 <= arg1 /\ arg3 <= arg1 + arg2 /\ 0 <= arg2 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
<l2, l2, 1 <= arg1 /\ arg3 <= arg1 + arg2 /\ 0 <= arg2 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
<l2, l2, arg3 <= arg1 + arg2 /\ 0 <= arg2 /\ 4 <= arg1 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
<l2, l2, arg3 <= arg1 + arg2 /\ 0 <= arg2 /\ arg3 = 0 /\ arg1 = 3, {arg1 -> 2, arg2 -> 1, arg3 -> 1, rest remain the same}>
Variables:
arg1, arg2, arg3
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004384s
Ranking function: -6 + 3*arg1
New Graphs: 
Transitions:
<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>
<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ arg1 <= 2 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ 2 + arg3 <= arg1 /\ arg2 = 0, {arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
<l2, l2, 1 <= arg1 /\ arg3 <= arg1 + arg2 /\ 0 <= arg2 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
<l2, l2, 1 <= arg1 /\ arg3 <= arg1 + arg2 /\ 0 <= arg2 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
<l2, l2, arg3 <= arg1 + arg2 /\ 0 <= arg2 /\ 4 <= arg1 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
Variables:
arg1, arg2, arg3
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001891s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.097579s
Trying to remove transition: <l2, l2, arg3 <= arg1 + arg2 /\ 0 <= arg2 /\ 4 <= arg1 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.019260s
Time used: 0.017913
Trying to remove transition: <l2, l2, 1 <= arg1 /\ arg3 <= arg1 + arg2 /\ 0 <= arg2 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.017602s
Time used: 0.015874
Trying to remove transition: <l2, l2, 1 <= arg1 /\ arg3 <= arg1 + arg2 /\ 0 <= arg2 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020640s
Time used: 0.018912
Trying to remove transition: <l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ 2 + arg3 <= arg1 /\ arg2 = 0, {arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.019041s
Time used: 0.01735
Trying to remove transition: <l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ arg1 <= 2 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.021882s
Time used: 0.020157
Trying to remove transition: <l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001231s
Time used: 1.00123

LOG: SAT solveNonLinear - Elapsed time: 1.579108s
Cost: 1; Total time: 1.56403
Failed at location 2: arg1 + arg2 <= 1 + arg3
Before Improving: 
Quasi-invariant at l2: arg1 + arg2 <= 1 + arg3
Quasi-invariant at l2: 0 <= 1 + arg2
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.012982s
Remaining time after improvement: 0.992478
Termination implied by a set of quasi-invariant(s):
Quasi-invariant at l2: arg1 + arg2 <= 1 + arg3
Quasi-invariant at l2: 0 <= 1 + arg2
[ 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: 
<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ arg1 <= 2 + arg3, {arg3 -> 1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ arg1 = 3 + arg3, {arg1 -> -1 + arg1, arg3 -> 1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ arg1 + arg2 <= 1 + arg3 /\ arg3 <= arg1 + arg2 /\ arg1 = 1 + arg3 /\ arg2 = 0, {arg1 -> -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= arg1 /\ arg1 + arg2 <= 1 + arg3 /\ arg3 <= arg1 + arg2 /\ 0 <= arg2 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= arg1 /\ arg1 + arg2 <= 1 + arg3 /\ arg3 <= arg1 + arg2 /\ 0 <= arg2 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, arg3 <= arg1 + arg2 /\ 0 <= arg2 /\ 4 <= arg1 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, arg3 <= arg1 + arg2 /\ 0 <= arg2 /\ arg3 = 0 /\ arg1 = 3, {arg1 -> 2, arg2 -> 1, arg3 -> 1, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ arg1 <= 2 + arg3, {arg3 -> 1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= arg1 /\ arg1 + arg2 <= 1 + arg3 /\ arg3 <= arg1 + arg2 /\ 0 <= arg2 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= arg1 /\ arg1 + arg2 <= 1 + arg3 /\ arg3 <= arg1 + arg2 /\ 0 <= arg2 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, arg3 <= arg1 + arg2 /\ 0 <= arg2 /\ 4 <= arg1 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
New Graphs: 
Transitions:
<l2, l2, 1 <= arg1 /\ arg1 + arg2 <= 1 + arg3 /\ arg3 <= arg1 + arg2 /\ 0 <= arg2 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
<l2, l2, 1 <= arg1 /\ arg1 + arg2 <= 1 + arg3 /\ arg3 <= arg1 + arg2 /\ 0 <= arg2 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
Variables:
arg1, arg2, arg3
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000926s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005042s
Trying to remove transition: <l2, l2, 1 <= arg1 /\ arg1 + arg2 <= 1 + arg3 /\ arg3 <= arg1 + arg2 /\ 0 <= arg2 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.000392s
Time used: 4.0001
Trying to remove transition: <l2, l2, 1 <= arg1 /\ arg1 + arg2 <= 1 + arg3 /\ arg3 <= arg1 + arg2 /\ 0 <= arg2 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.010804s
Time used: 4.00012

Proving non-termination of subgraph 1
Transitions:
<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>
<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ arg1 <= 2 + arg3, {arg3 -> 1 + arg3, rest remain the same}>
<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ arg1 = 3 + arg3, {arg1 -> -1 + arg1, arg3 -> 1 + arg3, rest remain the same}>
<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ 2 + arg3 <= arg1 /\ arg2 = 0, {arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ arg1 = 1 + arg3 /\ arg2 = 0, {arg1 -> -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
<l2, l2, 1 <= arg1 /\ arg3 <= arg1 + arg2 /\ 0 <= arg2 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>
<l2, l2, 1 <= arg1 /\ arg3 <= arg1 + arg2 /\ 0 <= arg2 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
<l2, l2, arg3 <= arg1 + arg2 /\ 0 <= arg2 /\ 4 <= arg1 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
<l2, l2, arg3 <= arg1 + arg2 /\ 0 <= arg2 /\ arg3 = 0 /\ arg1 = 3, {arg1 -> 2, arg2 -> 1, arg3 -> 1, rest remain the same}>
Variables:
arg1, arg2, arg3

Checking conditional non-termination of SCC {l2}...
EXIT TRANSITIONS:
<l2, end, 1 + arg1 <= arg3 /\ 1 <= arg2 /\ 1 <= arg3 /\ 3 <= arg1, {all remain the same}>
<l2, end, 1 + arg1 <= arg3 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 <= 2, {all remain the same}>
<l2, end, 1 <= arg1 /\ 1 <= arg2 /\ 1 + arg3 <= 0 /\ arg3 <= arg1 + arg2 /\ arg1 <= 2 /\ arg1 = 2 + arg3, {all remain the same}>
<l2, end, 1 <= arg1 /\ 1 <= arg2 /\ 1 + arg3 <= 0 /\ arg3 <= arg1 + arg2 /\ arg1 <= 2 /\ arg1 = 3 + arg3, {all remain the same}>
<l2, end, 1 <= arg2 /\ 1 + arg3 <= 0 /\ arg3 <= arg1 + arg2 /\ 3 <= arg1 /\ 4 + arg3 <= arg1, {all remain the same}>
<l2, end, 1 <= arg1 /\ 1 <= arg2 /\ 1 + arg3 <= 0 /\ arg3 <= arg1 + arg2 /\ arg1 <= 2 /\ 4 + arg3 <= arg1, {all remain the same}>
<l2, end, 1 + arg1 + arg2 <= arg3 /\ 1 + arg1 <= arg3 /\ 1 <= arg3 /\ 3 <= arg1 /\ arg2 = 0, {all remain the same}>
<l2, end, 1 + arg1 + arg2 <= arg3 /\ 1 + arg1 <= arg3 /\ 1 <= arg1 /\ 1 <= arg3 /\ arg1 <= 2 /\ arg2 = 0, {all remain the same}>
<l2, end, 1 <= arg1 /\ 1 + arg3 <= 0 /\ arg3 <= arg1 + arg2 /\ arg1 <= 2 /\ arg2 = 0 /\ arg1 = 2 + arg3, {all remain the same}>
<l2, end, 1 <= arg1 /\ 1 + arg3 <= 0 /\ arg3 <= arg1 + arg2 /\ arg1 <= 2 /\ arg2 = 0 /\ arg1 = 3 + arg3, {all remain the same}>
<l2, end, 1 + arg3 <= 0 /\ arg3 <= arg1 + arg2 /\ 3 <= arg1 /\ 4 + arg3 <= arg1 /\ arg2 = 0, {all remain the same}>
<l2, end, 1 <= arg1 /\ 1 + arg3 <= 0 /\ arg3 <= arg1 + arg2 /\ arg1 <= 2 /\ 4 + arg3 <= arg1 /\ arg2 = 0, {all remain the same}>

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.116290s
Time used: 0.115878
Improving Solution with cost 8 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.214528s
Time used: 0.214525

LOG: SAT solveNonLinear - Elapsed time: 0.330818s
Cost: 8; Total time: 0.330403
Non-termination implied by a set of quasi-invariant(s):
Quasi-invariant at l2: arg2 <= arg3

Strengthening and disabling EXIT transitions...
Closed exits from l2: 8
Strengthening exit transition (result): 
<l2, end, 1 + arg1 <= arg3 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg2 <= arg3 /\ 3 <= arg1, {all remain the same}>
Strengthening exit transition (result): 
<l2, end, 1 + arg1 <= arg3 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg2 <= arg3 /\ arg1 <= 2, {all remain the same}>
Strengthening exit transition (result): 
<l2, end, 1 + arg1 + arg2 <= arg3 /\ 1 + arg1 <= arg3 /\ 1 <= arg3 /\ arg2 <= arg3 /\ 3 <= arg1 /\ arg2 = 0, {all remain the same}>
Strengthening exit transition (result): 
<l2, end, 1 + arg1 + arg2 <= arg3 /\ 1 + arg1 <= arg3 /\ 1 <= arg1 /\ 1 <= arg3 /\ arg2 <= arg3 /\ arg1 <= 2 /\ arg2 = 0, {all remain the same}>

Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ arg2 <= arg3 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ arg2 <= arg3 /\ arg1 <= 2 + arg3, {arg3 -> 1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ arg2 <= arg3 /\ arg1 = 3 + arg3, {arg1 -> -1 + arg1, arg3 -> 1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ arg2 <= arg3 /\ 2 + arg3 <= arg1 /\ arg2 = 0, {arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ arg2 <= arg3 /\ arg1 = 1 + arg3 /\ arg2 = 0, {arg1 -> -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= arg1 /\ arg3 <= arg1 + arg2 /\ arg2 <= arg3 /\ 0 <= arg2 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= arg1 /\ arg3 <= arg1 + arg2 /\ arg2 <= arg3 /\ 0 <= arg2 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, arg3 <= arg1 + arg2 /\ arg2 <= arg3 /\ 0 <= arg2 /\ 4 <= arg1 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, arg3 <= arg1 + arg2 /\ arg2 <= arg3 /\ 0 <= arg2 /\ arg3 = 0 /\ arg1 = 3, {arg1 -> 2, arg2 -> 1, arg3 -> 1, rest remain the same}>

Checking conditional non-termination of SCC {l2}...
EXIT TRANSITIONS:
<l2, end, 1 + arg1 <= arg3 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg2 <= arg3 /\ 3 <= arg1, {all remain the same}>
<l2, end, 1 + arg1 <= arg3 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg2 <= arg3 /\ arg1 <= 2, {all remain the same}>
<l2, end, 1 + arg1 + arg2 <= arg3 /\ 1 + arg1 <= arg3 /\ 1 <= arg3 /\ arg2 <= arg3 /\ 3 <= arg1 /\ arg2 = 0, {all remain the same}>
<l2, end, 1 + arg1 + arg2 <= arg3 /\ 1 + arg1 <= arg3 /\ 1 <= arg1 /\ 1 <= arg3 /\ arg2 <= arg3 /\ arg1 <= 2 /\ arg2 = 0, {all remain the same}>

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.030584s
Time used: 0.030583

LOG: SAT solveNonLinear - Elapsed time: 0.069166s
Cost: 1; Total time: 0.068839
Failed at location 2: arg3 <= arg1
Before Improving: 
Quasi-invariant at l2: arg3 <= arg1
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.010344s
Remaining time after improvement: 0.996838
Non-termination implied by a set of quasi-invariant(s):
Quasi-invariant at l2: arg3 <= arg1

Strengthening and disabling EXIT transitions...
Closed exits from l2: 4

Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ arg2 <= arg3 /\ 4 + arg3 <= arg1, {arg3 -> 1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ arg2 <= arg3 /\ arg1 <= 2 + arg3, {arg3 -> 1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ arg2 <= arg3 /\ arg1 = 3 + arg3, {arg1 -> -1 + arg1, arg3 -> 1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ arg2 <= arg3 /\ 2 + arg3 <= arg1 /\ arg2 = 0, {arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ arg2 <= arg3 /\ arg1 = 1 + arg3 /\ arg2 = 0, {arg1 -> -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= arg1 /\ arg3 <= arg1 + arg2 /\ arg2 <= arg3 /\ 0 <= arg2 /\ arg1 = arg3, {arg2 -> 0, arg3 -> -1 + arg1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= arg1 /\ arg3 <= arg1 + arg2 /\ arg3 <= arg1 /\ arg2 <= arg3 /\ 0 <= arg2 /\ arg1 <= 2 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, arg3 <= arg1 + arg2 /\ arg3 <= arg1 /\ arg2 <= arg3 /\ 0 <= arg2 /\ 4 <= arg1 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, arg3 <= arg1 + arg2 /\ arg3 <= arg1 /\ arg2 <= arg3 /\ 0 <= arg2 /\ arg3 = 0 /\ arg1 = 3, {arg1 -> 2, arg2 -> 1, arg3 -> 1, rest remain the same}>

Calling reachability with...
Transition: <l2, end, true, {all remain the same}>
Conditions: arg2 <= arg3, arg3 <= arg1, 
OPEN EXITS: 
<l2, end, arg3 <= arg1 /\ arg2 <= arg3, {all remain the same}>

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

Calling reachability with...
Transition: <l0, l2, 1 <= undef111 /\ 0 <= undef112 /\ arg2 = 0 /\ arg1 = 20 /\ arg3 = 15 + undef112, {all remain the same}>
Conditions: arg3 <= arg1, arg2 <= arg3, 
OPEN EXITS: 
<l0, l2, 1 <= undef111 /\ arg3 <= arg1 /\ arg2 <= arg3 /\ 0 <= undef112 /\ arg2 = 0 /\ arg1 = 20 /\ arg3 = 15 + undef112, {all remain the same}>

> Conditions are reachable!

Program does NOT terminate