YES

Solver Timeout: 4
Global Timeout: 60
No parsing errors!
Init Location: 0
Transitions:
<l0, l3, true>
<l1, l2, (undef2 > ~(1)) /\ (arg2 > ~(1)) /\ (undef1 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef1, arg2 -> undef2, arg3 -> undef1, arg4 -> undef2, arg5 -> undef1}>
<l2, l2, (arg3 > 0) /\ (arg4 > 0) /\ (arg3 = arg5), par{arg3 -> (arg3 - 1), arg4 -> (arg4 - 1), arg5 -> (arg3 - 1)}>
<l2, l2, (arg3 > 0) /\ (0 = arg4) /\ (arg3 = arg5), par{arg2 -> (arg2 + 1), arg3 -> arg1, arg4 -> (arg2 + 1), arg5 -> arg1}>
<l3, l1, true, par{arg1 -> undef16, arg2 -> undef17, arg3 -> undef18, arg4 -> undef19, arg5 -> undef20}>

Fresh variables:
undef1, undef2, undef16, undef17, undef18, undef19, undef20, 

Undef variables:
undef1, undef2, undef16, undef17, undef18, undef19, undef20, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (arg1 = undef1) /\ (arg2 = undef2) /\ (arg3 = undef1) /\ (arg4 = undef2) /\ (arg5 = undef1) /\ (undef2 > ~(1)) /\ (undef17 > ~(1)) /\ (undef1 > ~(1)) /\ (undef16 > 0)>
<l2, l2, (arg3 > 0) /\ (arg4 > 0) /\ (arg3 = arg5), par{arg3 -> (arg3 - 1), arg4 -> (arg4 - 1), arg5 -> (arg3 - 1)}>
<l2, l2, (arg3 > 0) /\ (0 = arg4) /\ (arg3 = arg5), par{arg2 -> (arg2 + 1), arg3 -> arg1, arg4 -> (arg2 + 1), arg5 -> arg1}>

Fresh variables:
undef1, undef2, undef16, undef17, undef18, undef19, undef20, 

Undef variables:
undef1, undef2, undef16, undef17, undef18, undef19, undef20, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

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

Precedence: 
Graph 0

Graph 1
<l0, l2, 1 <= undef16 /\ 0 <= undef1 /\ 0 <= undef2 /\ 0 <= undef17 /\ arg1 = undef1 /\ arg2 = undef2 /\ arg3 = undef1 /\ arg4 = undef2 /\ arg5 = undef1, {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.01039

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001456s

LOG: CALL solveLinear

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.041947s
Time used: 0.041283

LOG: SAT solveNonLinear - Elapsed time: 0.041947s
Cost: 0; Total time: 0.041283
Termination implied by a set of invariant(s):
Invariant at l2: arg2 + arg3 <= arg1 + arg4
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= arg3 /\ 1 <= arg4 /\ arg2 + arg3 <= arg1 + arg4 /\ arg3 = arg5, {arg3 -> -1 + arg3, arg4 -> -1 + arg4, arg5 -> -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 <= arg3 /\ arg2 + arg3 <= arg1 + arg4 /\ arg3 = arg5 /\ arg4 = 0, {arg2 -> 1 + arg2, arg3 -> arg1, arg4 -> 1 + arg2, arg5 -> arg1, 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): 
<l2, l2, 1 <= arg3 /\ 1 <= arg4 /\ arg2 + arg3 <= arg1 + arg4 /\ arg3 = arg5, {arg3 -> -1 + arg3, arg4 -> -1 + arg4, arg5 -> -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 <= arg3 /\ arg2 + arg3 <= arg1 + arg4 /\ arg3 = arg5 /\ arg4 = 0, {arg2 -> 1 + arg2, arg3 -> arg1, arg4 -> 1 + arg2, arg5 -> arg1, rest remain the same}>
Ranking function: 2*arg1 - 2*arg2 + arg4 - arg5
New Graphs: 
Transitions:
<l2, l2, 1 <= arg3 /\ 1 <= arg4 /\ arg2 + arg3 <= arg1 + arg4 /\ arg3 = arg5, {arg3 -> -1 + arg3, arg4 -> -1 + arg4, arg5 -> -1 + arg3, rest remain the same}>
Variables:
arg1, arg2, arg3, arg4, arg5
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001132s
Ranking function: -1 + arg3
New Graphs: 
INVARIANTS: 
2: arg2 + arg3 <= arg1 + arg4 , 
Quasi-INVARIANTS to narrow Graph: 
2: 
Program Terminates