NO

Solver Timeout: 4
Global Timeout: 60
No parsing errors!
Init Location: 0
Transitions:
<l0, l29, true>
<l1, l2, true>
<l3, l4, true>
<l5, l6, true>
<l7, l8, true, par{k_1^0 -> (1 + k_1^0)}>
<l9, l7, (1 <= (0 + destflag^0))>
<l9, l7, ((1 + destflag^0) <= 0)>
<l9, l7, ((0 + destflag^0) <= 0) /\ (0 <= (0 + destflag^0))>
<l10, l7, (1 <= (0 + sourceflag^0))>
<l10, l7, ((1 + sourceflag^0) <= 0)>
<l10, l9, ((0 + sourceflag^0) <= 0) /\ (0 <= (0 + sourceflag^0))>
<l11, l12, true>
<l13, l14, true, par{j^0 -> (1 + j^0)}>
<l15, l13, true>
<l15, l13, true, par{destflag^0 -> 0}>
<l15, l13, true>
<l16, l10, ((0 + nodecount^0) <= (0 + j^0))>
<l16, l15, ((1 + j^0) <= (0 + nodecount^0))>
<l17, l18, true, par{j^0 -> (1 + j^0)}>
<l8, l19, true>
<l20, l17, true>
<l20, l17, true, par{sourceflag^0 -> 1}>
<l20, l17, true>
<l21, l14, ((0 + nodecount^0) <= (0 + j^0)), par{destflag^0 -> 1, j^0 -> 0}>
<l21, l20, ((1 + j^0) <= (0 + nodecount^0))>
<l22, l23, true, par{h^0 -> (1 + h^0)}>
<l24, l22, true, par{min^0 -> (0 + h^0)}>
<l24, l22, true>
<l23, l25, true>
<l25, l18, ((0 + edgecount^0) <= (0 + h^0)), par{j^0 -> 0, sourceflag^0 -> 0}>
<l25, l24, ((1 + h^0) <= (0 + edgecount^0))>
<l19, l5, ((0 + edgecount^0) <= (0 + k_1^0)), par{k^0 -> (1 + k^0)}>
<l19, l23, ((1 + k_1^0) <= (0 + edgecount^0)), par{h^0 -> 0}>
<l12, l8, ((0 + edgecount^0) <= (0 + i^0)), par{k_1^0 -> 0}>
<l12, l11, ((1 + i^0) <= (0 + edgecount^0)), par{i^0 -> (1 + i^0)}>
<l18, l21, true>
<l26, l11, true, par{i^0 -> 0, min^0 -> 0}>
<l6, l27, ((0 + k^0) <= (~(1) + nodecount^0)) /\ ((~(1) + nodecount^0) <= (0 + k^0))>
<l6, l26, ((0 + nodecount^0) <= (0 + k^0))>
<l6, l26, ((1 + k^0) <= (~(1) + nodecount^0))>
<l4, l5, ((~(1) + nodecount^0) <= (0 + i^0)), par{k^0 -> 0}>
<l4, l3, ((1 + i^0) <= (~(1) + nodecount^0)), par{i^0 -> (1 + i^0)}>
<l14, l16, true>
<l2, l3, ((0 + nodecount^0) <= (0 + i^0)), par{i^0 -> 0}>
<l2, l1, ((1 + i^0) <= (0 + nodecount^0)), par{i^0 -> (1 + i^0)}>
<l28, l1, true, par{__lengthofvisited^0 -> (0 + edgecount^0), i^0 -> 1}>
<l29, l28, true>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l1, (i^0 = 1)>
<l1, l3, ((0 + nodecount^0) <= (0 + i^0)), par{i^0 -> 0}>
<l1, l1, ((1 + i^0) <= (0 + nodecount^0)), par{i^0 -> (1 + i^0)}>
<l3, l27, ((~(1) + nodecount^0) <= (0 + i^0)) /\ ((0 + 0) <= (~(1) + nodecount^0)) /\ ((~(1) + nodecount^0) <= (0 + 0)), par{k^0 -> 0}>
<l3, l11, ((~(1) + nodecount^0) <= (0 + i^0)) /\ ((0 + nodecount^0) <= (0 + 0)), par{i^0 -> 0, k^0 -> 0}>
<l3, l11, ((~(1) + nodecount^0) <= (0 + i^0)) /\ ((1 + 0) <= (~(1) + nodecount^0)), par{i^0 -> 0, k^0 -> 0}>
<l3, l3, ((1 + i^0) <= (~(1) + nodecount^0)), par{i^0 -> (1 + i^0)}>
<l11, l27, ((0 + edgecount^0) <= (0 + i^0)) /\ ((0 + edgecount^0) <= (0 + 0)) /\ ((0 + (1 + k^0)) <= (~(1) + nodecount^0)) /\ ((~(1) + nodecount^0) <= (0 + (1 + k^0))), par{k^0 -> (1 + k^0), k_1^0 -> 0}>
<l11, l11, ((0 + edgecount^0) <= (0 + i^0)) /\ ((0 + edgecount^0) <= (0 + 0)) /\ ((0 + nodecount^0) <= (0 + (1 + k^0))), par{i^0 -> 0, k^0 -> (1 + k^0), k_1^0 -> 0}>
<l11, l11, ((0 + edgecount^0) <= (0 + i^0)) /\ ((0 + edgecount^0) <= (0 + 0)) /\ ((1 + (1 + k^0)) <= (~(1) + nodecount^0)), par{i^0 -> 0, k^0 -> (1 + k^0), k_1^0 -> 0}>
<l11, l23, ((0 + edgecount^0) <= (0 + i^0)) /\ ((1 + 0) <= (0 + edgecount^0)), par{h^0 -> 0, k_1^0 -> 0}>
<l11, l11, ((1 + i^0) <= (0 + edgecount^0)), par{i^0 -> (1 + i^0)}>
<l14, l27, ((0 + nodecount^0) <= (0 + j^0)) /\ (1 <= (0 + sourceflag^0)) /\ ((0 + edgecount^0) <= (0 + (1 + k_1^0))) /\ ((0 + (1 + k^0)) <= (~(1) + nodecount^0)) /\ ((~(1) + nodecount^0) <= (0 + (1 + k^0))), par{k^0 -> (1 + k^0), k_1^0 -> (1 + k_1^0)}>
<l14, l11, ((0 + nodecount^0) <= (0 + j^0)) /\ (1 <= (0 + sourceflag^0)) /\ ((0 + edgecount^0) <= (0 + (1 + k_1^0))) /\ ((0 + nodecount^0) <= (0 + (1 + k^0))), par{i^0 -> 0, k^0 -> (1 + k^0), k_1^0 -> (1 + k_1^0)}>
<l14, l11, ((0 + nodecount^0) <= (0 + j^0)) /\ (1 <= (0 + sourceflag^0)) /\ ((0 + edgecount^0) <= (0 + (1 + k_1^0))) /\ ((1 + (1 + k^0)) <= (~(1) + nodecount^0)), par{i^0 -> 0, k^0 -> (1 + k^0), k_1^0 -> (1 + k_1^0)}>
<l14, l23, ((0 + nodecount^0) <= (0 + j^0)) /\ (1 <= (0 + sourceflag^0)) /\ ((1 + (1 + k_1^0)) <= (0 + edgecount^0)), par{h^0 -> 0, k_1^0 -> (1 + k_1^0)}>
<l14, l27, ((0 + nodecount^0) <= (0 + j^0)) /\ ((1 + sourceflag^0) <= 0) /\ ((0 + edgecount^0) <= (0 + (1 + k_1^0))) /\ ((0 + (1 + k^0)) <= (~(1) + nodecount^0)) /\ ((~(1) + nodecount^0) <= (0 + (1 + k^0))), par{k^0 -> (1 + k^0), k_1^0 -> (1 + k_1^0)}>
<l14, l11, ((0 + nodecount^0) <= (0 + j^0)) /\ ((1 + sourceflag^0) <= 0) /\ ((0 + edgecount^0) <= (0 + (1 + k_1^0))) /\ ((0 + nodecount^0) <= (0 + (1 + k^0))), par{i^0 -> 0, k^0 -> (1 + k^0), k_1^0 -> (1 + k_1^0)}>
<l14, l11, ((0 + nodecount^0) <= (0 + j^0)) /\ ((1 + sourceflag^0) <= 0) /\ ((0 + edgecount^0) <= (0 + (1 + k_1^0))) /\ ((1 + (1 + k^0)) <= (~(1) + nodecount^0)), par{i^0 -> 0, k^0 -> (1 + k^0), k_1^0 -> (1 + k_1^0)}>
<l14, l23, ((0 + nodecount^0) <= (0 + j^0)) /\ ((1 + sourceflag^0) <= 0) /\ ((1 + (1 + k_1^0)) <= (0 + edgecount^0)), par{h^0 -> 0, k_1^0 -> (1 + k_1^0)}>
<l14, l27, ((0 + nodecount^0) <= (0 + j^0)) /\ ((0 + sourceflag^0) <= 0) /\ (0 <= (0 + sourceflag^0)) /\ (1 <= (0 + destflag^0)) /\ ((0 + edgecount^0) <= (0 + (1 + k_1^0))) /\ ((0 + (1 + k^0)) <= (~(1) + nodecount^0)) /\ ((~(1) + nodecount^0) <= (0 + (1 + k^0))), par{k^0 -> (1 + k^0), k_1^0 -> (1 + k_1^0)}>
<l14, l11, ((0 + nodecount^0) <= (0 + j^0)) /\ ((0 + sourceflag^0) <= 0) /\ (0 <= (0 + sourceflag^0)) /\ (1 <= (0 + destflag^0)) /\ ((0 + edgecount^0) <= (0 + (1 + k_1^0))) /\ ((0 + nodecount^0) <= (0 + (1 + k^0))), par{i^0 -> 0, k^0 -> (1 + k^0), k_1^0 -> (1 + k_1^0)}>
<l14, l11, ((0 + nodecount^0) <= (0 + j^0)) /\ ((0 + sourceflag^0) <= 0) /\ (0 <= (0 + sourceflag^0)) /\ (1 <= (0 + destflag^0)) /\ ((0 + edgecount^0) <= (0 + (1 + k_1^0))) /\ ((1 + (1 + k^0)) <= (~(1) + nodecount^0)), par{i^0 -> 0, k^0 -> (1 + k^0), k_1^0 -> (1 + k_1^0)}>
<l14, l23, ((0 + nodecount^0) <= (0 + j^0)) /\ ((0 + sourceflag^0) <= 0) /\ (0 <= (0 + sourceflag^0)) /\ (1 <= (0 + destflag^0)) /\ ((1 + (1 + k_1^0)) <= (0 + edgecount^0)), par{h^0 -> 0, k_1^0 -> (1 + k_1^0)}>
<l14, l27, ((0 + nodecount^0) <= (0 + j^0)) /\ ((0 + sourceflag^0) <= 0) /\ (0 <= (0 + sourceflag^0)) /\ ((1 + destflag^0) <= 0) /\ ((0 + edgecount^0) <= (0 + (1 + k_1^0))) /\ ((0 + (1 + k^0)) <= (~(1) + nodecount^0)) /\ ((~(1) + nodecount^0) <= (0 + (1 + k^0))), par{k^0 -> (1 + k^0), k_1^0 -> (1 + k_1^0)}>
<l14, l11, ((0 + nodecount^0) <= (0 + j^0)) /\ ((0 + sourceflag^0) <= 0) /\ (0 <= (0 + sourceflag^0)) /\ ((1 + destflag^0) <= 0) /\ ((0 + edgecount^0) <= (0 + (1 + k_1^0))) /\ ((0 + nodecount^0) <= (0 + (1 + k^0))), par{i^0 -> 0, k^0 -> (1 + k^0), k_1^0 -> (1 + k_1^0)}>
<l14, l11, ((0 + nodecount^0) <= (0 + j^0)) /\ ((0 + sourceflag^0) <= 0) /\ (0 <= (0 + sourceflag^0)) /\ ((1 + destflag^0) <= 0) /\ ((0 + edgecount^0) <= (0 + (1 + k_1^0))) /\ ((1 + (1 + k^0)) <= (~(1) + nodecount^0)), par{i^0 -> 0, k^0 -> (1 + k^0), k_1^0 -> (1 + k_1^0)}>
<l14, l23, ((0 + nodecount^0) <= (0 + j^0)) /\ ((0 + sourceflag^0) <= 0) /\ (0 <= (0 + sourceflag^0)) /\ ((1 + destflag^0) <= 0) /\ ((1 + (1 + k_1^0)) <= (0 + edgecount^0)), par{h^0 -> 0, k_1^0 -> (1 + k_1^0)}>
<l14, l27, ((0 + nodecount^0) <= (0 + j^0)) /\ ((0 + sourceflag^0) <= 0) /\ (0 <= (0 + sourceflag^0)) /\ ((0 + destflag^0) <= 0) /\ (0 <= (0 + destflag^0)) /\ ((0 + edgecount^0) <= (0 + (1 + k_1^0))) /\ ((0 + (1 + k^0)) <= (~(1) + nodecount^0)) /\ ((~(1) + nodecount^0) <= (0 + (1 + k^0))), par{k^0 -> (1 + k^0), k_1^0 -> (1 + k_1^0)}>
<l14, l11, ((0 + nodecount^0) <= (0 + j^0)) /\ ((0 + sourceflag^0) <= 0) /\ (0 <= (0 + sourceflag^0)) /\ ((0 + destflag^0) <= 0) /\ (0 <= (0 + destflag^0)) /\ ((0 + edgecount^0) <= (0 + (1 + k_1^0))) /\ ((0 + nodecount^0) <= (0 + (1 + k^0))), par{i^0 -> 0, k^0 -> (1 + k^0), k_1^0 -> (1 + k_1^0)}>
<l14, l11, ((0 + nodecount^0) <= (0 + j^0)) /\ ((0 + sourceflag^0) <= 0) /\ (0 <= (0 + sourceflag^0)) /\ ((0 + destflag^0) <= 0) /\ (0 <= (0 + destflag^0)) /\ ((0 + edgecount^0) <= (0 + (1 + k_1^0))) /\ ((1 + (1 + k^0)) <= (~(1) + nodecount^0)), par{i^0 -> 0, k^0 -> (1 + k^0), k_1^0 -> (1 + k_1^0)}>
<l14, l23, ((0 + nodecount^0) <= (0 + j^0)) /\ ((0 + sourceflag^0) <= 0) /\ (0 <= (0 + sourceflag^0)) /\ ((0 + destflag^0) <= 0) /\ (0 <= (0 + destflag^0)) /\ ((1 + (1 + k_1^0)) <= (0 + edgecount^0)), par{h^0 -> 0, k_1^0 -> (1 + k_1^0)}>
<l14, l14, ((1 + j^0) <= (0 + nodecount^0)), par{j^0 -> (1 + j^0)}>
<l14, l14, ((1 + j^0) <= (0 + nodecount^0)), par{destflag^0 -> 0, j^0 -> (1 + j^0)}>
<l14, l14, ((1 + j^0) <= (0 + nodecount^0)), par{j^0 -> (1 + j^0)}>
<l18, l14, ((0 + nodecount^0) <= (0 + j^0)), par{destflag^0 -> 1, j^0 -> 0}>
<l18, l18, ((1 + j^0) <= (0 + nodecount^0)), par{j^0 -> (1 + j^0)}>
<l18, l18, ((1 + j^0) <= (0 + nodecount^0)), par{j^0 -> (1 + j^0), sourceflag^0 -> 1}>
<l18, l18, ((1 + j^0) <= (0 + nodecount^0)), par{j^0 -> (1 + j^0)}>
<l23, l18, ((0 + edgecount^0) <= (0 + h^0)), par{j^0 -> 0, sourceflag^0 -> 0}>
<l23, l23, ((1 + h^0) <= (0 + edgecount^0)), par{h^0 -> (1 + h^0)}>
<l23, l23, ((1 + h^0) <= (0 + edgecount^0)), par{h^0 -> (1 + h^0)}>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l1, l1, 1 + i^0 <= nodecount^0, {i^0 -> 1 + i^0, rest remain the same}>
Variables:
i^0, nodecount^0

Graph 2:
Transitions:
<l3, l3, 2 + i^0 <= nodecount^0, {i^0 -> 1 + i^0, rest remain the same}>
Variables:
i^0, nodecount^0

Graph 3:
Transitions:
<l11, l11, edgecount^0 <= 0 /\ edgecount^0 <= i^0 /\ nodecount^0 <= 1 + k^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 0, rest remain the same}>
<l11, l11, edgecount^0 <= 0 /\ edgecount^0 <= i^0 /\ 3 + k^0 <= nodecount^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 0, rest remain the same}>
<l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>
<l11, l11, 1 + i^0 <= edgecount^0, {i^0 -> 1 + i^0, rest remain the same}>
<l14, l11, 1 <= sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, 1 <= sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 3 + k^0 <= nodecount^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l23, 1 <= sourceflag^0 /\ nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, 1 + sourceflag^0 <= 0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, 1 + sourceflag^0 <= 0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 3 + k^0 <= nodecount^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l23, 1 + sourceflag^0 <= 0 /\ nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, 1 <= destflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, 1 <= destflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 3 + k^0 <= nodecount^0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l23, 1 <= destflag^0 /\ nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, 1 + destflag^0 <= 0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, 1 + destflag^0 <= 0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 3 + k^0 <= nodecount^0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l23, 1 + destflag^0 <= 0 /\ nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 3 + k^0 <= nodecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l23, nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l14, 1 + j^0 <= nodecount^0, {j^0 -> 1 + j^0, rest remain the same}>
<l14, l14, 1 + j^0 <= nodecount^0, {destflag^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
<l14, l14, 1 + j^0 <= nodecount^0, {j^0 -> 1 + j^0, rest remain the same}>
<l18, l14, nodecount^0 <= j^0, {destflag^0 -> 1, j^0 -> 0, rest remain the same}>
<l18, l18, 1 + j^0 <= nodecount^0, {j^0 -> 1 + j^0, rest remain the same}>
<l18, l18, 1 + j^0 <= nodecount^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>
<l18, l18, 1 + j^0 <= nodecount^0, {j^0 -> 1 + j^0, rest remain the same}>
<l23, l18, edgecount^0 <= h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
<l23, l23, 1 + h^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
<l23, l23, 1 + h^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
Variables:
edgecount^0, i^0, k^0, nodecount^0, j^0, k_1^0, sourceflag^0, destflag^0, h^0

Graph 4:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l1, i^0 = 1, {all remain the same}>

Graph 2
<l1, l3, nodecount^0 <= i^0, {i^0 -> 0, rest remain the same}>

Graph 3
<l3, l11, nodecount^0 <= 0 /\ nodecount^0 <= 1 + i^0, {i^0 -> 0, k^0 -> 0, rest remain the same}>
<l3, l11, nodecount^0 <= 1 + i^0 /\ 2 <= nodecount^0, {i^0 -> 0, k^0 -> 0, rest remain the same}>

Graph 4
<l3, l27, nodecount^0 <= 1 + i^0 /\ nodecount^0 = 1, {k^0 -> 0, rest remain the same}>
<l11, l27, edgecount^0 <= 0 /\ edgecount^0 <= i^0 /\ 2 + k^0 = nodecount^0, {k^0 -> 1 + k^0, k_1^0 -> 0, rest remain the same}>
<l14, l27, 1 <= sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 2 + k^0 = nodecount^0, {k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l27, 1 + sourceflag^0 <= 0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 2 + k^0 = nodecount^0, {k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l27, 1 <= destflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ sourceflag^0 = 0 /\ 2 + k^0 = nodecount^0, {k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l27, 1 + destflag^0 <= 0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ sourceflag^0 = 0 /\ 2 + k^0 = nodecount^0, {k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l27, nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0 /\ 2 + k^0 = nodecount^0, {k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 1 , 1 )
( 3 , 2 )
( 11 , 3 )
( 14 , 3 )
( 18 , 3 )
( 23 , 3 )
( 27 , 4 )

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

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

Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001029s
Ranking function: -1 - i^0 + nodecount^0
New Graphs: 
Proving termination of subgraph 2
Checking unfeasibility...
Time used: 0.001728

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000897s
Ranking function: -2 - i^0 + nodecount^0
New Graphs: 
Proving termination of subgraph 3
Checking unfeasibility...
Time used: 0.504775
Some transition disabled by a set of invariant(s):
Invariant at l11: 0 <= i^0
Invariant at l14: 0 <= destflag^0
Invariant at l18: 1 + k_1^0 <= h^0
Invariant at l23: 1 + k_1^0 <= edgecount^0

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l14, l11, 1 + destflag^0 <= 0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l11, l11, edgecount^0 <= 0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ nodecount^0 <= 1 + k^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l11, l11, edgecount^0 <= 0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ 3 + k^0 <= nodecount^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0 /\ 0 <= i^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 3 + k^0 <= nodecount^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, 1 + sourceflag^0 <= 0 /\ 0 <= destflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, 1 + sourceflag^0 <= 0 /\ 0 <= destflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 3 + k^0 <= nodecount^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, 1 + sourceflag^0 <= 0 /\ 0 <= destflag^0 /\ nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, 1 <= destflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, 1 <= destflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 3 + k^0 <= nodecount^0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, 1 <= destflag^0 /\ nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l14, l11, 1 + destflag^0 <= 0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 3 + k^0 <= nodecount^0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l14, l23, 1 + destflag^0 <= 0 /\ nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 3 + k^0 <= nodecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0, {destflag^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l18, l14, 1 + k_1^0 <= h^0 /\ nodecount^0 <= j^0, {destflag^0 -> 1, j^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
Checking unfeasibility...
Time used: 0.91925
Some transition disabled by a set of invariant(s):
Invariant at l14: 0 <= sourceflag^0
Invariant at l18: 0 <= sourceflag^0

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l14, l11, 1 + sourceflag^0 <= 0 /\ 0 <= destflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 3 + k^0 <= nodecount^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 3 + k^0 <= nodecount^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l14, l11, 1 + sourceflag^0 <= 0 /\ 0 <= destflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l14, l23, 1 + sourceflag^0 <= 0 /\ 0 <= destflag^0 /\ nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, 1 <= destflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, 1 <= destflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 3 + k^0 <= nodecount^0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, 1 <= destflag^0 /\ nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 3 + k^0 <= nodecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ 0 <= sourceflag^0, {destflag^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l18, l14, 1 + k_1^0 <= h^0 /\ nodecount^0 <= j^0 /\ 0 <= sourceflag^0, {destflag^0 -> 1, j^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Checking unfeasibility...
Time used: 2.41408

Checking conditional termination of SCC {l11, l14, l18, l23}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.027287s
Ranking function: -5 - 10*edgecount^0 - 2*k^0 + 2*nodecount^0
New Graphs: 
Transitions:
<l11, l11, edgecount^0 <= 0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ nodecount^0 <= 1 + k^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 0, rest remain the same}>
<l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0 /\ 0 <= i^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>
<l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
<l14, l11, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 3 + k^0 <= nodecount^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l23, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, 1 <= destflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, 1 <= destflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 3 + k^0 <= nodecount^0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l23, 1 <= destflag^0 /\ nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 3 + k^0 <= nodecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l23, nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ 0 <= sourceflag^0, {destflag^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
<l18, l14, 1 + k_1^0 <= h^0 /\ nodecount^0 <= j^0 /\ 0 <= sourceflag^0, {destflag^0 -> 1, j^0 -> 0, rest remain the same}>
<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>
<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
<l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
Variables:
destflag^0, edgecount^0, h^0, i^0, j^0, k^0, k_1^0, nodecount^0, sourceflag^0
Checking conditional termination of SCC {l11, l14, l18, l23}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.019159s
Ranking function: -5 - 2*k^0 + 2*nodecount^0
New Graphs: 
Transitions:
<l11, l11, edgecount^0 <= 0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ nodecount^0 <= 1 + k^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 0, rest remain the same}>
<l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0 /\ 0 <= i^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>
<l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
<l14, l11, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l23, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, 1 <= destflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l23, 1 <= destflag^0 /\ nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l23, nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ 0 <= sourceflag^0, {destflag^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
<l18, l14, 1 + k_1^0 <= h^0 /\ nodecount^0 <= j^0 /\ 0 <= sourceflag^0, {destflag^0 -> 1, j^0 -> 0, rest remain the same}>
<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>
<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
<l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
Variables:
destflag^0, edgecount^0, h^0, i^0, j^0, k^0, k_1^0, nodecount^0, sourceflag^0
Checking conditional termination of SCC {l11, l14, l18, l23}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.012235s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.249974s
Trying to remove transition: <l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.190503s
Time used: 0.177558
Trying to remove transition: <l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.184074s
Time used: 0.167768
Trying to remove transition: <l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.080199s
Time used: 0.065207
Trying to remove transition: <l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.083627s
Time used: 0.081382
Trying to remove transition: <l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.101631s
Time used: 0.098639
Trying to remove transition: <l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.109908s
Time used: 0.107521
Trying to remove transition: <l18, l14, 1 + k_1^0 <= h^0 /\ nodecount^0 <= j^0 /\ 0 <= sourceflag^0, {destflag^0 -> 1, j^0 -> 0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.076786s
Time used: 0.074305
Trying to remove transition: <l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.171179s
Time used: 0.168612
Trying to remove transition: <l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ 0 <= sourceflag^0, {destflag^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.164941s
Time used: 0.143626
Trying to remove transition: <l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.126737s
Time used: 0.105486
Trying to remove transition: <l14, l23, nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.581618s
Time used: 0.560421
Trying to remove transition: <l14, l11, nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.146565s
Time used: 0.142705
Trying to remove transition: <l14, l23, 1 <= destflag^0 /\ nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.924659s
Time used: 0.921091
Trying to remove transition: <l14, l11, 1 <= destflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.156844s
Time used: 0.152907
Trying to remove transition: <l14, l23, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.875583s
Time used: 0.871804
Trying to remove transition: <l14, l11, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.186349s
Time used: 0.182152
Trying to remove transition: <l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.134313s
Time used: 0.130197
Trying to remove transition: <l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0 /\ 0 <= i^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.235686s
Time used: 0.225847
Trying to remove transition: <l11, l11, edgecount^0 <= 0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ nodecount^0 <= 1 + k^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.005413s
Time used: 1.0054

LOG: SAT solveNonLinear - Elapsed time: 4.049659s
Cost: 1; Total time: 3.99403
Termination implied by a set of invariant(s):
Invariant at l14: k_1^0 <= h^0 + j^0 + sourceflag^0
Invariant at l18: k_1^0 + sourceflag^0 <= h^0
Invariant at l23: k_1^0 <= edgecount^0
[ 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): 
<l14, l11, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 3 + k^0 <= nodecount^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, 1 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, 1 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 3 + k^0 <= nodecount^0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, 1 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 3 + k^0 <= nodecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0, {destflag^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l18, l14, 1 + k_1^0 <= h^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ nodecount^0 <= j^0 /\ 0 <= sourceflag^0, {destflag^0 -> 1, j^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^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): 
<l14, l11, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, 1 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, 1 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0, {destflag^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l18, l14, 1 + k_1^0 <= h^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ nodecount^0 <= j^0 /\ 0 <= sourceflag^0, {destflag^0 -> 1, j^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
Quasi-ranking function: 50000 - k^0
New Graphs: 
Transitions:
<l11, l11, edgecount^0 <= 0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ nodecount^0 <= 1 + k^0 /\ 50001 <= k^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 0, rest remain the same}>
<l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0 /\ 0 <= i^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>
<l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
<l14, l11, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0 /\ 50001 <= k^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l23, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, 1 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0 /\ 50001 <= k^0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l23, 1 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0 /\ 50001 <= k^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l23, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0, {destflag^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
<l18, l14, 1 + k_1^0 <= h^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ nodecount^0 <= j^0 /\ 0 <= sourceflag^0, {destflag^0 -> 1, j^0 -> 0, rest remain the same}>
<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>
<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
<l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
Variables:
destflag^0, edgecount^0, h^0, i^0, j^0, k^0, k_1^0, nodecount^0, sourceflag^0
Checking conditional termination of SCC {l11, l14, l18, l23}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.019509s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.280103s
Trying to remove transition: <l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.177102s
Time used: 0.156787
Trying to remove transition: <l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.167494s
Time used: 0.146632
Trying to remove transition: <l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.106974s
Time used: 0.088267
Trying to remove transition: <l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.120739s
Time used: 0.116683
Trying to remove transition: <l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.146775s
Time used: 0.142744
Trying to remove transition: <l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.128131s
Time used: 0.123808
Trying to remove transition: <l18, l14, 1 + k_1^0 <= h^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ nodecount^0 <= j^0 /\ 0 <= sourceflag^0, {destflag^0 -> 1, j^0 -> 0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.105858s
Time used: 0.101996
Trying to remove transition: <l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.144335s
Time used: 0.140291
Trying to remove transition: <l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0, {destflag^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.153540s
Time used: 0.149204
Trying to remove transition: <l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.147251s
Time used: 0.143107
Trying to remove transition: <l14, l23, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.930504s
Time used: 0.926613
Trying to remove transition: <l14, l11, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0 /\ 50001 <= k^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.520838s
Time used: 0.516232
Trying to remove transition: <l14, l23, 1 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.954841s
Time used: 0.949844
Trying to remove transition: <l14, l11, 1 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0 /\ 50001 <= k^0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.570166s
Time used: 0.565408
Trying to remove transition: <l14, l23, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.191906s
Time used: 1.18672
Trying to remove transition: <l14, l11, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0 /\ 50001 <= k^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.430675s
Time used: 0.425917
Trying to remove transition: <l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.164016s
Time used: 0.159095
Trying to remove transition: <l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0 /\ 0 <= i^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.144824s
Time used: 0.13256
Trying to remove transition: <l11, l11, edgecount^0 <= 0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ nodecount^0 <= 1 + k^0 /\ 50001 <= k^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.826653s
Time used: 0.773193
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l3, l11, nodecount^0 <= 0 /\ nodecount^0 <= 1 + i^0, {i^0 -> 0, k^0 -> 0, rest remain the same}>

LOG: CALL check - Post:1 <= 0 - Process 1
* Exit transition: <l3, l11, nodecount^0 <= 0 /\ nodecount^0 <= 1 + i^0, {i^0 -> 0, k^0 -> 0, rest remain the same}>
* Postcondition  : 1 <= 0
Postcodition moved up: 1 <= 0

LOG: Try proving POST
Postcondition: 1 <= 0

LOG: CALL check - Post:1 <= 0 - Process 2
* Exit transition: <l1, l3, nodecount^0 <= i^0 /\ nodecount^0 <= 0, {i^0 -> 0, rest remain the same}>
* Postcondition  : 1 <= 0
Postcodition moved up: 1 <= 0

LOG: Try proving POST
Postcondition: 1 <= 0

LOG: CALL check - Post:1 <= 0 - Process 3
* Exit transition: <l0, l1, i^0 = 1, {all remain the same}>
* Postcondition  : 1 <= 0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.007925s

LOG: NarrowEntry size 1
Narrowing transition: 
<l1, l1, 1 + i^0 <= nodecount^0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: Narrow transition size 1
ENTRIES:
<l0, l1, 0 <= 0 /\ i^0 = 1, {all remain the same}>
END ENTRIES:
GRAPH:
<l1, l1, 1 + i^0 <= nodecount^0 /\ 0 <= 0, {i^0 -> 1 + i^0, rest remain the same}>
END GRAPH:
EXIT: <l1, l3, nodecount^0 <= i^0 /\ nodecount^0 <= 0, {i^0 -> 0, rest remain the same}>
POST: 1 <= 0


LOG: Try proving POST
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.025611s
Time used: 0.025569

LOG: SAT solveNonLinear - Elapsed time: 0.063579s
Cost: 1; Total time: 0.063269
Failed at location 1: 1 <= nodecount^0
Before Improving: 
Quasi-invariant at l1: 1 <= nodecount^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003040s
Remaining time after improvement: 0.998104
Postcondition implied by a set of quasi-invariant(s):
Quasi-invariant at l1: 1 <= nodecount^0
Postcondition: 1 <= nodecount^0

LOG: CALL check - Post:1 <= nodecount^0 - Process 4
* Exit transition: <l0, l1, 0 <= 0 /\ i^0 = 1, {all remain the same}>
* Postcondition  : 1 <= nodecount^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.009105s

LOG: NarrowEntry size 1
INVARIANTS: 
1: 
Quasi-INVARIANTS to narrow Graph: 
1: 1 <= nodecount^0 , 
Narrowing transition: 
<l1, l1, 1 + i^0 <= nodecount^0 /\ 0 <= 0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: Narrow transition size 1
ENTRIES:
<l0, l1, 0 <= 0 /\ nodecount^0 <= 0 /\ i^0 = 1, {all remain the same}>
END ENTRIES:
GRAPH:
<l1, l1, 1 + i^0 <= nodecount^0 /\ 0 <= 0 /\ nodecount^0 <= 0, {i^0 -> 1 + i^0, rest remain the same}>
END GRAPH:
EXIT: <l1, l3, nodecount^0 <= i^0 /\ nodecount^0 <= 0, {i^0 -> 0, rest remain the same}>
POST: 1 <= 0


LOG: Try proving POST
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.038077s
Time used: 0.037824
Improving Solution with cost 50 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.027352s
Time used: 0.027342

LOG: SAT solveNonLinear - Elapsed time: 0.065428s
Cost: 50; Total time: 0.065166
Some transition disabled by a set of invariant(s):
Invariant at l1: 1 + nodecount^0 <= i^0
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l1, l1, 1 + i^0 <= nodecount^0 /\ 0 <= 0 /\ nodecount^0 <= 0, {i^0 -> 1 + i^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.007967s
Time used: 1.00774

LOG: Postcondition is not implied - no solution
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 1.300494s

LOG: NarrowEntry size 1
Narrowing transition: 
<l3, l3, 2 + i^0 <= nodecount^0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: Narrow transition size 1
ENTRIES:
<l1, l3, 0 <= 0 /\ nodecount^0 <= i^0 /\ nodecount^0 <= 0, {i^0 -> 0, rest remain the same}>
END ENTRIES:
GRAPH:
<l3, l3, 0 <= 0 /\ nodecount^0 <= 0 /\ 2 + i^0 <= nodecount^0, {i^0 -> 1 + i^0, rest remain the same}>
END GRAPH:
EXIT: <l3, l11, nodecount^0 <= 0 /\ nodecount^0 <= 1 + i^0, {i^0 -> 0, k^0 -> 0, rest remain the same}>
POST: 1 <= 0


LOG: Try proving POST
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.038039s
Time used: 0.037781
Improving Solution with cost 50 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.024759s
Time used: 0.02475

LOG: SAT solveNonLinear - Elapsed time: 0.062798s
Cost: 50; Total time: 0.062531
Some transition disabled by a set of invariant(s):
Invariant at l3: nodecount^0 <= 1 + i^0
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l3, l3, 0 <= 0 /\ nodecount^0 <= 0 /\ 2 + i^0 <= nodecount^0, {i^0 -> 1 + i^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.008817s
Time used: 1.0085

LOG: Postcondition is not implied - no solution
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 2.484371s
Cannot prove unreachability

Proving non-termination of subgraph 3
Transitions:
<l11, l11, edgecount^0 <= 0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ nodecount^0 <= 1 + k^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 0, rest remain the same}>
<l11, l11, edgecount^0 <= 0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ 3 + k^0 <= nodecount^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 0, rest remain the same}>
<l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0 /\ 0 <= i^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>
<l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
<l14, l11, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 3 + k^0 <= nodecount^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l23, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, 1 <= destflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, 1 <= destflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 3 + k^0 <= nodecount^0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l23, 1 <= destflag^0 /\ nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 3 + k^0 <= nodecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l23, nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ 0 <= sourceflag^0, {destflag^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
<l18, l14, 1 + k_1^0 <= h^0 /\ nodecount^0 <= j^0 /\ 0 <= sourceflag^0, {destflag^0 -> 1, j^0 -> 0, rest remain the same}>
<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>
<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
<l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
Variables:
edgecount^0, i^0, k^0, nodecount^0, j^0, k_1^0, sourceflag^0, destflag^0, h^0

Checking conditional non-termination of SCC {l11, l14, l18, l23}...
EXIT TRANSITIONS:
<l11, end, edgecount^0 <= 0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ 2 + k^0 = nodecount^0, {all remain the same}>
<l14, end, 1 <= destflag^0 /\ 1 <= sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 2 + k^0 = nodecount^0, {all remain the same}>
<l14, end, 1 <= sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ destflag^0 = 0 /\ 2 + k^0 = nodecount^0, {all remain the same}>
<l14, end, 1 <= destflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ sourceflag^0 = 0 /\ 2 + k^0 = nodecount^0, {all remain the same}>
<l14, end, nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0 /\ 2 + k^0 = nodecount^0, {all remain the same}>

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.101976s
Time used: 0.101969

LOG: SAT solveNonLinear - Elapsed time: 0.570027s
Cost: 1; Total time: 0.56823
Failed at location 11: nodecount^0 <= k^0
Before Improving: 
Quasi-invariant at l11: nodecount^0 <= k^0
Quasi-invariant at l14: nodecount^0 <= 1 + k^0
Quasi-invariant at l18: nodecount^0 <= 1 + k^0
Quasi-invariant at l23: nodecount^0 <= 1 + k^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.019048s
Remaining time after improvement: 0.986658
Non-termination implied by a set of quasi-invariant(s):
Quasi-invariant at l11: nodecount^0 <= k^0
Quasi-invariant at l14: nodecount^0 <= 1 + k^0
Quasi-invariant at l18: nodecount^0 <= 1 + k^0
Quasi-invariant at l23: nodecount^0 <= 1 + k^0

Strengthening and disabling EXIT transitions...
Closed exits from l11: 1
Closed exits from l14: 4

Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l11, l11, edgecount^0 <= 0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ nodecount^0 <= k^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l11, l11, edgecount^0 <= 0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ 3 + k^0 <= nodecount^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ nodecount^0 <= k^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= i^0 /\ nodecount^0 <= k^0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l14, l11, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 3 + k^0 <= nodecount^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ nodecount^0 <= j^0 /\ nodecount^0 <= 1 + k^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, 1 <= destflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l14, l11, 1 <= destflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 3 + k^0 <= nodecount^0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, 1 <= destflag^0 /\ nodecount^0 <= j^0 /\ nodecount^0 <= 1 + k^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l14, l11, nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 3 + k^0 <= nodecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, nodecount^0 <= j^0 /\ nodecount^0 <= 1 + k^0 /\ 2 + k_1^0 <= edgecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ 0 <= sourceflag^0 /\ nodecount^0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ 0 <= sourceflag^0 /\ nodecount^0 <= 1 + k^0, {destflag^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ 0 <= sourceflag^0 /\ nodecount^0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l18, l14, 1 + k_1^0 <= h^0 /\ nodecount^0 <= j^0 /\ 0 <= sourceflag^0 /\ nodecount^0 <= 1 + k^0, {destflag^0 -> 1, j^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= sourceflag^0 /\ nodecount^0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= sourceflag^0 /\ nodecount^0 <= 1 + k^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= sourceflag^0 /\ nodecount^0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0 /\ nodecount^0 <= 1 + k^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 /\ nodecount^0 <= 1 + k^0, {h^0 -> 1 + h^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 /\ nodecount^0 <= 1 + k^0, {h^0 -> 1 + h^0, rest remain the same}>

Calling reachability with...
Transition: <l11, end, true, {all remain the same}>
Conditions: nodecount^0 <= k^0, 
Transition: <l11, end, true, {all remain the same}>
Conditions: nodecount^0 <= k^0, 
OPEN EXITS: 
<l11, end, nodecount^0 <= k^0, {all remain the same}>
<l11, end, nodecount^0 <= k^0, {all remain the same}>

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

Calling reachability with...
Transition: <l3, l11, nodecount^0 <= 0 /\ nodecount^0 <= 1 + i^0, {i^0 -> 0, k^0 -> 0, rest remain the same}>
Conditions: nodecount^0 <= k^0, 
Transition: <l3, l11, nodecount^0 <= 1 + i^0 /\ 2 <= nodecount^0, {i^0 -> 0, k^0 -> 0, rest remain the same}>
Conditions: nodecount^0 <= k^0, 
Transition: <l3, l11, nodecount^0 <= 0 /\ nodecount^0 <= 1 + i^0, {i^0 -> 0, k^0 -> 0, rest remain the same}>
Conditions: nodecount^0 <= k^0, 
Transition: <l3, l11, nodecount^0 <= 1 + i^0 /\ 2 <= nodecount^0, {i^0 -> 0, k^0 -> 0, rest remain the same}>
Conditions: nodecount^0 <= k^0, 
OPEN EXITS: 
<l3, l11, nodecount^0 <= 1 + i^0, {i^0 -> 0, k^0 -> 0, rest remain the same}> (condsUp: nodecount^0 <= 0, nodecount^0 <= 0)
<l3, l11, nodecount^0 <= 1 + i^0, {i^0 -> 0, k^0 -> 0, rest remain the same}> (condsUp: nodecount^0 <= 0, nodecount^0 <= 0)

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

Calling reachability with...
Transition: <l1, l3, nodecount^0 <= i^0, {i^0 -> 0, rest remain the same}>
Conditions: nodecount^0 <= 1 + i^0, nodecount^0 <= 0, nodecount^0 <= 0, 
Transition: <l1, l3, nodecount^0 <= i^0, {i^0 -> 0, rest remain the same}>
Conditions: nodecount^0 <= 1 + i^0, nodecount^0 <= 0, nodecount^0 <= 0, 
OPEN EXITS: 
<l1, l3, nodecount^0 <= i^0, {i^0 -> 0, rest remain the same}> (condsUp: nodecount^0 <= 1, nodecount^0 <= 0, nodecount^0 <= 0)
<l1, l3, nodecount^0 <= i^0, {i^0 -> 0, rest remain the same}> (condsUp: nodecount^0 <= 1, nodecount^0 <= 0, nodecount^0 <= 0)

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

Calling reachability with...
Transition: <l0, l1, i^0 = 1, {all remain the same}>
Conditions: nodecount^0 <= i^0, nodecount^0 <= 1, nodecount^0 <= 0, nodecount^0 <= 0, 
Transition: <l0, l1, i^0 = 1, {all remain the same}>
Conditions: nodecount^0 <= i^0, nodecount^0 <= 1, nodecount^0 <= 0, nodecount^0 <= 0, 
OPEN EXITS: 
<l0, l1, nodecount^0 <= i^0 /\ nodecount^0 <= 0 /\ i^0 = 1, {all remain the same}>
<l0, l1, nodecount^0 <= i^0 /\ nodecount^0 <= 0 /\ i^0 = 1, {all remain the same}>

> Conditions are reachable!

Program does NOT terminate