YES

Solver Timeout: 4
Global Timeout: 60
No parsing errors!
Init Location: 0
Transitions:
<l0, l22, true>
<l1, l2, true>
<l3, l4, true>
<l5, l6, true, par{tmp___1^0 -> 1}>
<l7, l6, true, par{tmp___1^0 -> 1}>
<l8, l6, true, par{tmp___1^0 -> 1}>
<l9, l6, true, par{tmp___1^0 -> 1}>
<l6, l10, true>
<l11, l9, true>
<l11, l6, true, par{tmp___1^0 -> 0}>
<l11, l9, true>
<l12, l8, true>
<l12, l8, true>
<l12, l11, true>
<l13, l7, true>
<l13, l7, true>
<l13, l12, true>
<l14, l15, true>
<l16, l5, true>
<l16, l5, true>
<l16, l13, true>
<l17, l18, ((0 + nDim^0) <= (0 + nk^0)), par{nj^0 -> (1 + nj^0)}>
<l17, l19, ((1 + nk^0) <= (0 + nDim^0)), par{nk^0 -> (1 + nk^0)}>
<l18, l20, true>
<l20, l14, ((0 + nDim^0) <= (0 + nj^0)), par{ni^0 -> (1 + ni^0)}>
<l20, l19, ((1 + nj^0) <= (0 + nDim^0)), par{nk^0 -> 0}>
<l15, l16, ((0 + nDim^0) <= (0 + ni^0))>
<l15, l18, ((1 + ni^0) <= (0 + nDim^0)), par{nj^0 -> 0}>
<l19, l17, true>
<l4, l1, ((0 + nDim^0) <= (0 + nj^0)), par{ni^0 -> (1 + ni^0)}>
<l4, l3, ((1 + nj^0) <= (0 + nDim^0)), par{nj^0 -> (1 + nj^0)}>
<l2, l14, ((0 + nDim^0) <= (0 + ni^0)), par{ni^0 -> 0}>
<l2, l3, ((1 + ni^0) <= (0 + nDim^0)), par{nj^0 -> 0}>
<l21, l1, (undef229 = undef229) /\ (undef230 = undef230), par{nDim^0 -> 2, ni^0 -> 0, tmp^0 -> undef229, tmp___0^0 -> undef230}>
<l22, l21, true>

Fresh variables:
undef229, undef230, 

Undef variables:
undef229, undef230, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l3, (2 = 2) /\ (ni^0 = 0) /\ (undef229 = undef229) /\ (undef230 = undef230) /\ ((1 + 0) <= (0 + 2)), par{nj^0 -> 0}>
<l3, l18, ((0 + 2) <= (0 + nj^0)) /\ ((0 + 2) <= (0 + (1 + ni^0))) /\ ((1 + 0) <= (0 + 2)), par{ni^0 -> 0, nj^0 -> 0}>
<l3, l3, ((0 + 2) <= (0 + nj^0)) /\ ((1 + (1 + ni^0)) <= (0 + 2)), par{ni^0 -> (1 + ni^0), nj^0 -> 0}>
<l3, l3, ((1 + nj^0) <= (0 + 2)), par{nj^0 -> (1 + nj^0)}>
<l18, l10, ((0 + 2) <= (0 + nj^0)) /\ ((0 + 2) <= (0 + (1 + ni^0))), par{ni^0 -> (1 + ni^0)}>
<l18, l10, ((0 + 2) <= (0 + nj^0)) /\ ((0 + 2) <= (0 + (1 + ni^0))), par{ni^0 -> (1 + ni^0)}>
<l18, l10, ((0 + 2) <= (0 + nj^0)) /\ ((0 + 2) <= (0 + (1 + ni^0))), par{ni^0 -> (1 + ni^0)}>
<l18, l10, ((0 + 2) <= (0 + nj^0)) /\ ((0 + 2) <= (0 + (1 + ni^0))), par{ni^0 -> (1 + ni^0)}>
<l18, l10, ((0 + 2) <= (0 + nj^0)) /\ ((0 + 2) <= (0 + (1 + ni^0))), par{ni^0 -> (1 + ni^0)}>
<l18, l10, ((0 + 2) <= (0 + nj^0)) /\ ((0 + 2) <= (0 + (1 + ni^0))), par{ni^0 -> (1 + ni^0)}>
<l18, l10, ((0 + 2) <= (0 + nj^0)) /\ ((0 + 2) <= (0 + (1 + ni^0))), par{ni^0 -> (1 + ni^0)}>
<l18, l10, ((0 + 2) <= (0 + nj^0)) /\ ((0 + 2) <= (0 + (1 + ni^0))), par{ni^0 -> (1 + ni^0)}>
<l18, l10, ((0 + 2) <= (0 + nj^0)) /\ ((0 + 2) <= (0 + (1 + ni^0))), par{ni^0 -> (1 + ni^0)}>
<l18, l18, ((0 + 2) <= (0 + nj^0)) /\ ((1 + (1 + ni^0)) <= (0 + 2)), par{ni^0 -> (1 + ni^0), nj^0 -> 0}>
<l18, l19, ((1 + nj^0) <= (0 + 2)), par{nk^0 -> 0}>
<l19, l18, ((0 + 2) <= (0 + nk^0)), par{nj^0 -> (1 + nj^0)}>
<l19, l19, ((1 + nk^0) <= (0 + 2)), par{nk^0 -> (1 + nk^0)}>

Fresh variables:
undef229, undef230, 

Undef variables:
undef229, undef230, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l3, l3, ni^0 <= 0 /\ 2 <= nj^0, {ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}>
<l3, l3, nj^0 <= 1, {nj^0 -> 1 + nj^0, rest remain the same}>
Variables:
ni^0, nj^0

Graph 2:
Transitions:
<l18, l18, ni^0 <= 0 /\ 2 <= nj^0, {ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}>
<l18, l19, nj^0 <= 1, {nk^0 -> 0, rest remain the same}>
<l19, l18, 2 <= nk^0, {nj^0 -> 1 + nj^0, rest remain the same}>
<l19, l19, nk^0 <= 1, {nk^0 -> 1 + nk^0, rest remain the same}>
Variables:
ni^0, nj^0, nk^0

Graph 3:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l3, ni^0 = 0, {nj^0 -> 0, rest remain the same}>

Graph 2
<l3, l18, 1 <= ni^0 /\ 2 <= nj^0, {ni^0 -> 0, nj^0 -> 0, rest remain the same}>

Graph 3
<l18, l10, 1 <= ni^0 /\ 2 <= nj^0, {ni^0 -> 1 + ni^0, rest remain the same}>
<l18, l10, 1 <= ni^0 /\ 2 <= nj^0, {ni^0 -> 1 + ni^0, rest remain the same}>
<l18, l10, 1 <= ni^0 /\ 2 <= nj^0, {ni^0 -> 1 + ni^0, rest remain the same}>
<l18, l10, 1 <= ni^0 /\ 2 <= nj^0, {ni^0 -> 1 + ni^0, rest remain the same}>
<l18, l10, 1 <= ni^0 /\ 2 <= nj^0, {ni^0 -> 1 + ni^0, rest remain the same}>
<l18, l10, 1 <= ni^0 /\ 2 <= nj^0, {ni^0 -> 1 + ni^0, rest remain the same}>
<l18, l10, 1 <= ni^0 /\ 2 <= nj^0, {ni^0 -> 1 + ni^0, rest remain the same}>
<l18, l10, 1 <= ni^0 /\ 2 <= nj^0, {ni^0 -> 1 + ni^0, rest remain the same}>
<l18, l10, 1 <= ni^0 /\ 2 <= nj^0, {ni^0 -> 1 + ni^0, rest remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 3 , 1 )
( 10 , 3 )
( 18 , 2 )
( 19 , 2 )

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

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

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001127s
Ranking function: -ni^0
New Graphs: 
Transitions:
<l3, l3, nj^0 <= 1, {nj^0 -> 1 + nj^0, rest remain the same}>
Variables:
nj^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000533s
Ranking function: 1 - nj^0
New Graphs: 
Proving termination of subgraph 2
Checking unfeasibility...
Time used: 0.022848

Checking conditional termination of SCC {l18, l19}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002076s
Ranking function: -ni^0
New Graphs: 
Transitions:
<l18, l19, nj^0 <= 1, {nk^0 -> 0, rest remain the same}>
<l19, l18, 2 <= nk^0, {nj^0 -> 1 + nj^0, rest remain the same}>
<l19, l19, nk^0 <= 1, {nk^0 -> 1 + nk^0, rest remain the same}>
Variables:
nj^0, nk^0
Checking conditional termination of SCC {l18, l19}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001012s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004158s
Trying to remove transition: <l19, l19, nk^0 <= 1, {nk^0 -> 1 + nk^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009858s
Time used: 0.009647
Trying to remove transition: <l19, l18, 2 <= nk^0, {nj^0 -> 1 + nj^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010575s
Time used: 0.010137
Trying to remove transition: <l18, l19, nj^0 <= 1, {nk^0 -> 0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.037157s
Time used: 0.036521

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l19, l19, nj^0 <= 1 /\ nk^0 <= 1, {nk^0 -> 1 + nk^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l19, l19, nj^0 <= 1 /\ nk^0 <= 1, {nk^0 -> 1 + nk^0, rest remain the same}>
Ranking function: 1 - nj^0
New Graphs: 
Transitions:
<l19, l19, nj^0 <= 1 /\ nk^0 <= 1, {nk^0 -> 1 + nk^0, rest remain the same}>
Variables:
nj^0, nk^0
Checking conditional termination of SCC {l19}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000852s
Ranking function: 1 - nk^0
New Graphs: 
INVARIANTS: 
19: nj^0 <= 1 , 
Quasi-INVARIANTS to narrow Graph: 
19: 
Proving termination of subgraph 3
Analyzing SCC {l10}...
No cycles found.

Program Terminates