121.62/121.83	NO
121.62/121.83	
121.62/121.83	Solver Timeout: 4
121.62/121.83	Global Timeout: 300
121.62/121.83	No parsing errors!
121.62/121.83	Init Location: 0
121.62/121.83	Transitions:
121.62/121.83	<l0, l29, true>
121.62/121.83	<l1, l2, true>
121.62/121.83	<l3, l4, true>
121.62/121.83	<l5, l6, true>
121.62/121.83	<l7, l8, true, par{k_1^0 -> (1 + k_1^0)}>
121.62/121.83	<l9, l7, (1 <= (0 + destflag^0))>
121.62/121.83	<l9, l7, ((1 + destflag^0) <= 0)>
121.62/121.83	<l9, l7, ((0 + destflag^0) <= 0) /\ (0 <= (0 + destflag^0))>
121.62/121.83	<l10, l7, (1 <= (0 + sourceflag^0))>
121.62/121.83	<l10, l7, ((1 + sourceflag^0) <= 0)>
121.62/121.83	<l10, l9, ((0 + sourceflag^0) <= 0) /\ (0 <= (0 + sourceflag^0))>
121.62/121.83	<l11, l12, true>
121.62/121.83	<l13, l14, true, par{j^0 -> (1 + j^0)}>
121.62/121.83	<l15, l13, true>
121.62/121.83	<l15, l13, true, par{destflag^0 -> 0}>
121.62/121.83	<l15, l13, true>
121.62/121.83	<l16, l10, ((0 + nodecount^0) <= (0 + j^0))>
121.62/121.83	<l16, l15, ((1 + j^0) <= (0 + nodecount^0))>
121.62/121.83	<l17, l18, true, par{j^0 -> (1 + j^0)}>
121.62/121.83	<l8, l19, true>
121.62/121.83	<l20, l17, true>
121.62/121.83	<l20, l17, true, par{sourceflag^0 -> 1}>
121.62/121.83	<l20, l17, true>
121.62/121.83	<l21, l14, ((0 + nodecount^0) <= (0 + j^0)), par{destflag^0 -> 1, j^0 -> 0}>
121.62/121.83	<l21, l20, ((1 + j^0) <= (0 + nodecount^0))>
121.62/121.83	<l22, l23, true, par{h^0 -> (1 + h^0)}>
121.62/121.83	<l24, l22, true, par{min^0 -> (0 + h^0)}>
121.62/121.83	<l24, l22, true>
121.62/121.83	<l23, l25, true>
121.62/121.83	<l25, l18, ((0 + edgecount^0) <= (0 + h^0)), par{j^0 -> 0, sourceflag^0 -> 0}>
121.62/121.83	<l25, l24, ((1 + h^0) <= (0 + edgecount^0))>
121.62/121.83	<l19, l5, ((0 + edgecount^0) <= (0 + k_1^0)), par{k^0 -> (1 + k^0)}>
121.62/121.83	<l19, l23, ((1 + k_1^0) <= (0 + edgecount^0)), par{h^0 -> 0}>
121.62/121.83	<l12, l8, ((0 + edgecount^0) <= (0 + i^0)), par{k_1^0 -> 0}>
121.62/121.83	<l12, l11, ((1 + i^0) <= (0 + edgecount^0)), par{i^0 -> (1 + i^0)}>
121.62/121.83	<l18, l21, true>
121.62/121.83	<l26, l11, true, par{i^0 -> 0, min^0 -> 0}>
121.62/121.83	<l6, l27, ((0 + k^0) <= (~(1) + nodecount^0)) /\ ((~(1) + nodecount^0) <= (0 + k^0))>
121.62/121.83	<l6, l26, ((0 + nodecount^0) <= (0 + k^0))>
121.62/121.83	<l6, l26, ((1 + k^0) <= (~(1) + nodecount^0))>
121.62/121.83	<l4, l5, ((~(1) + nodecount^0) <= (0 + i^0)), par{k^0 -> 0}>
121.62/121.83	<l4, l3, ((1 + i^0) <= (~(1) + nodecount^0)), par{i^0 -> (1 + i^0)}>
121.62/121.83	<l14, l16, true>
121.62/121.83	<l2, l3, ((0 + nodecount^0) <= (0 + i^0)), par{i^0 -> 0}>
121.62/121.83	<l2, l1, ((1 + i^0) <= (0 + nodecount^0)), par{i^0 -> (1 + i^0)}>
121.62/121.83	<l28, l1, true, par{__lengthofvisited^0 -> (0 + edgecount^0), i^0 -> 1}>
121.62/121.83	<l29, l28, true>
121.62/121.83	
121.62/121.83	Fresh variables:
121.62/121.83	
121.62/121.83	Undef variables:
121.62/121.83	
121.62/121.83	Abstraction variables:
121.62/121.83	
121.62/121.83	Exit nodes:
121.62/121.83	
121.62/121.83	Accepting locations:
121.62/121.83	
121.62/121.83	Asserts:
121.62/121.83	
121.62/121.83	Preprocessed LLVMGraph
121.62/121.83	Init Location: 0
121.62/121.83	Transitions:
121.62/121.83	<l0, l1, (i^0 = 1)>
121.62/121.83	<l1, l3, ((0 + nodecount^0) <= (0 + i^0)), par{i^0 -> 0}>
121.62/121.83	<l1, l1, ((1 + i^0) <= (0 + nodecount^0)), par{i^0 -> (1 + i^0)}>
121.62/121.83	<l3, l27, ((~(1) + nodecount^0) <= (0 + i^0)) /\ ((0 + 0) <= (~(1) + nodecount^0)) /\ ((~(1) + nodecount^0) <= (0 + 0)), par{k^0 -> 0}>
121.62/121.83	<l3, l11, ((~(1) + nodecount^0) <= (0 + i^0)) /\ ((0 + nodecount^0) <= (0 + 0)), par{i^0 -> 0, k^0 -> 0}>
121.62/121.83	<l3, l11, ((~(1) + nodecount^0) <= (0 + i^0)) /\ ((1 + 0) <= (~(1) + nodecount^0)), par{i^0 -> 0, k^0 -> 0}>
121.62/121.83	<l3, l3, ((1 + i^0) <= (~(1) + nodecount^0)), par{i^0 -> (1 + i^0)}>
121.62/121.83	<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}>
121.62/121.83	<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}>
121.62/121.83	<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}>
121.62/121.83	<l11, l23, ((0 + edgecount^0) <= (0 + i^0)) /\ ((1 + 0) <= (0 + edgecount^0)), par{h^0 -> 0, k_1^0 -> 0}>
121.62/121.83	<l11, l11, ((1 + i^0) <= (0 + edgecount^0)), par{i^0 -> (1 + i^0)}>
121.62/121.83	<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)}>
121.62/121.83	<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)}>
121.62/121.83	<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)}>
121.62/121.83	<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)}>
121.62/121.83	<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)}>
121.62/121.83	<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)}>
121.62/121.83	<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)}>
121.62/121.83	<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)}>
121.62/121.83	<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)}>
121.62/121.83	<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)}>
121.62/121.83	<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)}>
121.62/121.83	<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)}>
121.62/121.83	<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)}>
121.62/121.83	<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)}>
121.62/121.83	<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)}>
121.62/121.83	<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)}>
121.62/121.83	<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)}>
121.62/121.83	<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)}>
121.62/121.83	<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)}>
121.62/121.83	<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)}>
121.62/121.83	<l14, l14, ((1 + j^0) <= (0 + nodecount^0)), par{j^0 -> (1 + j^0)}>
121.62/121.83	<l14, l14, ((1 + j^0) <= (0 + nodecount^0)), par{destflag^0 -> 0, j^0 -> (1 + j^0)}>
121.62/121.83	<l14, l14, ((1 + j^0) <= (0 + nodecount^0)), par{j^0 -> (1 + j^0)}>
121.62/121.83	<l18, l14, ((0 + nodecount^0) <= (0 + j^0)), par{destflag^0 -> 1, j^0 -> 0}>
121.62/121.83	<l18, l18, ((1 + j^0) <= (0 + nodecount^0)), par{j^0 -> (1 + j^0)}>
121.62/121.83	<l18, l18, ((1 + j^0) <= (0 + nodecount^0)), par{j^0 -> (1 + j^0), sourceflag^0 -> 1}>
121.62/121.83	<l18, l18, ((1 + j^0) <= (0 + nodecount^0)), par{j^0 -> (1 + j^0)}>
121.62/121.83	<l23, l18, ((0 + edgecount^0) <= (0 + h^0)), par{j^0 -> 0, sourceflag^0 -> 0}>
121.62/121.83	<l23, l23, ((1 + h^0) <= (0 + edgecount^0)), par{h^0 -> (1 + h^0)}>
121.62/121.83	<l23, l23, ((1 + h^0) <= (0 + edgecount^0)), par{h^0 -> (1 + h^0)}>
121.62/121.83	
121.62/121.83	Fresh variables:
121.62/121.83	
121.62/121.83	Undef variables:
121.62/121.83	
121.62/121.83	Abstraction variables:
121.62/121.83	
121.62/121.83	Exit nodes:
121.62/121.83	
121.62/121.83	Accepting locations:
121.62/121.83	
121.62/121.83	Asserts:
121.62/121.83	
121.62/121.83	*************************************************************
121.62/121.83	*******************************************************************************************
121.62/121.83	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
121.62/121.83	*******************************************************************************************
121.62/121.83	
121.62/121.83	Init Location: 0
121.62/121.83	Graph 0:
121.62/121.83	Transitions:
121.62/121.83	Variables:
121.62/121.83	
121.62/121.83	Graph 1:
121.62/121.83	Transitions:
121.62/121.83	<l1, l1, 1 + i^0 <= nodecount^0, {i^0 -> 1 + i^0, rest remain the same}>
121.62/121.83	Variables:
121.62/121.83	i^0, nodecount^0
121.62/121.83	
121.62/121.83	Graph 2:
121.62/121.83	Transitions:
121.62/121.83	<l3, l3, 2 + i^0 <= nodecount^0, {i^0 -> 1 + i^0, rest remain the same}>
121.62/121.83	Variables:
121.62/121.83	i^0, nodecount^0
121.62/121.83	
121.62/121.83	Graph 3:
121.62/121.83	Transitions:
121.62/121.83	<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}>
121.62/121.83	<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}>
121.62/121.83	<l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>
121.62/121.83	<l11, l11, 1 + i^0 <= edgecount^0, {i^0 -> 1 + i^0, rest remain the same}>
121.62/121.83	<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}>
121.62/121.83	<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}>
121.62/121.83	<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}>
121.62/121.83	<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}>
121.62/121.83	<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}>
121.62/121.83	<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}>
121.62/121.83	<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}>
121.62/121.83	<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}>
121.62/121.83	<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}>
121.62/121.83	<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}>
121.62/121.83	<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}>
121.62/121.83	<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}>
121.62/121.83	<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}>
121.62/121.83	<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}>
121.62/121.83	<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}>
121.62/121.83	<l14, l14, 1 + j^0 <= nodecount^0, {j^0 -> 1 + j^0, rest remain the same}>
121.62/121.83	<l14, l14, 1 + j^0 <= nodecount^0, {destflag^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
121.62/121.83	<l14, l14, 1 + j^0 <= nodecount^0, {j^0 -> 1 + j^0, rest remain the same}>
121.62/121.83	<l18, l14, nodecount^0 <= j^0, {destflag^0 -> 1, j^0 -> 0, rest remain the same}>
121.62/121.83	<l18, l18, 1 + j^0 <= nodecount^0, {j^0 -> 1 + j^0, rest remain the same}>
121.62/121.83	<l18, l18, 1 + j^0 <= nodecount^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>
121.62/121.83	<l18, l18, 1 + j^0 <= nodecount^0, {j^0 -> 1 + j^0, rest remain the same}>
121.62/121.83	<l23, l18, edgecount^0 <= h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
121.62/121.83	<l23, l23, 1 + h^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
121.62/121.83	<l23, l23, 1 + h^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
121.62/121.83	Variables:
121.62/121.83	edgecount^0, i^0, k^0, nodecount^0, j^0, k_1^0, sourceflag^0, destflag^0, h^0
121.62/121.83	
121.62/121.83	Graph 4:
121.62/121.83	Transitions:
121.62/121.83	Variables:
121.62/121.83	
121.62/121.83	Precedence: 
121.62/121.83	Graph 0
121.62/121.83	
121.62/121.83	Graph 1
121.62/121.83	<l0, l1, i^0 = 1, {all remain the same}>
121.62/121.83	
121.62/121.83	Graph 2
121.62/121.83	<l1, l3, nodecount^0 <= i^0, {i^0 -> 0, rest remain the same}>
121.62/121.83	
121.62/121.83	Graph 3
121.62/121.83	<l3, l11, nodecount^0 <= 0 /\ nodecount^0 <= 1 + i^0, {i^0 -> 0, k^0 -> 0, rest remain the same}>
121.62/121.83	<l3, l11, nodecount^0 <= 1 + i^0 /\ 2 <= nodecount^0, {i^0 -> 0, k^0 -> 0, rest remain the same}>
121.62/121.83	
121.62/121.83	Graph 4
121.62/121.83	<l3, l27, nodecount^0 <= 1 + i^0 /\ nodecount^0 = 1, {k^0 -> 0, rest remain the same}>
121.62/121.83	<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}>
121.62/121.83	<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}>
121.62/121.83	<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}>
121.62/121.83	<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}>
121.62/121.83	<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}>
121.62/121.83	<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}>
121.62/121.83	
121.62/121.83	Map Locations to Subgraph:
121.62/121.83	( 0 , 0 )
121.62/121.83	( 1 , 1 )
121.62/121.83	( 3 , 2 )
121.62/121.83	( 11 , 3 )
121.62/121.83	( 14 , 3 )
121.62/121.83	( 18 , 3 )
121.62/121.83	( 23 , 3 )
121.62/121.83	( 27 , 4 )
121.62/121.83	
121.62/121.83	*******************************************************************************************
121.62/121.83	********************************    CHECKING ASSERTIONS    ********************************
121.62/121.83	*******************************************************************************************
121.62/121.83	
121.62/121.83	Proving termination of subgraph 0
121.62/121.83	Proving termination of subgraph 1
121.62/121.83	Checking unfeasibility...
121.62/121.83	Time used: 0.001937
121.62/121.83	
121.62/121.83	Checking conditional termination of SCC {l1}...
121.62/121.83	
121.62/121.83	LOG: CALL solveLinear
121.62/121.83	
121.62/121.83	LOG: RETURN solveLinear - Elapsed time: 0.001027s
121.62/121.83	Ranking function: -1 - i^0 + nodecount^0
121.62/121.83	New Graphs: 
121.62/121.83	Proving termination of subgraph 2
121.62/121.83	Checking unfeasibility...
121.62/121.83	Time used: 0.001736
121.62/121.83	
121.62/121.83	Checking conditional termination of SCC {l3}...
121.62/121.83	
121.62/121.83	LOG: CALL solveLinear
121.62/121.83	
121.62/121.83	LOG: RETURN solveLinear - Elapsed time: 0.000893s
121.62/121.83	Ranking function: -2 - i^0 + nodecount^0
121.62/121.83	New Graphs: 
121.62/121.83	Proving termination of subgraph 3
121.62/121.83	Checking unfeasibility...
121.62/121.83	Time used: 0.503345
121.62/121.83	Some transition disabled by a set of invariant(s):
121.62/121.83	Invariant at l11: 0 <= i^0
121.62/121.83	Invariant at l14: 0 <= destflag^0
121.62/121.83	Invariant at l18: 1 + k_1^0 <= h^0
121.62/121.83	Invariant at l23: 1 + k_1^0 <= edgecount^0
121.62/121.83	
121.62/121.83	Strengthening and disabling transitions...
121.62/121.83	> It's unfeasible. Removing transition: 
121.62/121.83	<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}>
121.62/121.83	
121.62/121.83	LOG: CALL solverLinear in Graph for feasibility
121.62/121.83	
121.62/121.83	LOG: RETURN solveLinear in Graph for feasibility
121.62/121.83	Strengthening transition (result): 
121.62/121.83	<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}>
121.62/121.83	
121.62/121.83	LOG: CALL solverLinear in Graph for feasibility
121.62/121.83	
121.62/121.83	LOG: RETURN solveLinear in Graph for feasibility
121.62/121.83	Strengthening transition (result): 
121.62/121.83	<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}>
121.62/121.83	
121.62/121.83	LOG: CALL solverLinear in Graph for feasibility
121.62/121.83	
121.62/121.83	LOG: RETURN solveLinear in Graph for feasibility
121.62/121.83	Strengthening transition (result): 
121.62/121.83	<l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0 /\ 0 <= i^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>
121.62/121.83	
121.62/121.83	LOG: CALL solverLinear in Graph for feasibility
121.62/121.83	
121.62/121.83	LOG: RETURN solveLinear in Graph for feasibility
121.62/121.83	Strengthening transition (result): 
121.62/121.83	<l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
121.62/121.83	
121.62/121.83	LOG: CALL solverLinear in Graph for feasibility
121.62/121.83	
121.62/121.83	LOG: RETURN solveLinear in Graph for feasibility
121.62/121.83	Strengthening transition (result): 
121.62/121.83	<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}>
121.62/121.83	
121.62/121.83	LOG: CALL solverLinear in Graph for feasibility
121.62/121.83	
121.62/121.83	LOG: RETURN solveLinear in Graph for feasibility
121.62/121.83	Strengthening transition (result): 
121.62/121.83	<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}>
121.62/121.83	
121.62/121.83	LOG: CALL solverLinear in Graph for feasibility
121.62/121.83	
121.62/121.83	LOG: RETURN solveLinear in Graph for feasibility
121.62/121.83	Strengthening transition (result): 
121.62/121.83	<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}>
121.62/121.83	
121.62/121.83	LOG: CALL solverLinear in Graph for feasibility
121.62/121.83	
121.62/121.83	LOG: RETURN solveLinear in Graph for feasibility
121.62/121.83	Strengthening transition (result): 
121.62/121.83	<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}>
121.62/121.83	
121.62/121.83	LOG: CALL solverLinear in Graph for feasibility
121.62/121.83	
121.62/121.83	LOG: RETURN solveLinear in Graph for feasibility
121.62/121.83	Strengthening transition (result): 
121.62/121.83	<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}>
121.62/121.83	
121.62/121.83	LOG: CALL solverLinear in Graph for feasibility
121.62/121.83	
121.62/121.83	LOG: RETURN solveLinear in Graph for feasibility
121.62/121.83	Strengthening transition (result): 
121.62/121.83	<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}>
121.62/121.83	
121.62/121.83	LOG: CALL solverLinear in Graph for feasibility
121.62/121.83	
121.62/121.83	LOG: RETURN solveLinear in Graph for feasibility
121.62/121.83	Strengthening transition (result): 
121.62/121.83	<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}>
121.62/121.83	
121.62/121.83	LOG: CALL solverLinear in Graph for feasibility
121.62/121.83	
121.62/121.83	LOG: RETURN solveLinear in Graph for feasibility
121.62/121.83	Strengthening transition (result): 
121.62/121.83	<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}>
121.62/121.83	
121.62/121.83	LOG: CALL solverLinear in Graph for feasibility
121.62/121.83	
121.62/121.83	LOG: RETURN solveLinear in Graph for feasibility
121.62/121.83	Strengthening transition (result): 
121.62/121.83	<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}>
121.62/121.83	
121.62/121.83	LOG: CALL solverLinear in Graph for feasibility
121.62/121.83	
121.62/121.83	LOG: RETURN solveLinear in Graph for feasibility
121.62/121.83	It's unfeasible. Removing transition: 
121.62/121.83	<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}>
121.62/121.83	
121.62/121.83	LOG: CALL solverLinear in Graph for feasibility
121.62/121.83	
121.62/121.83	LOG: RETURN solveLinear in Graph for feasibility
121.62/121.83	It's unfeasible. Removing transition: 
121.62/121.83	<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}>
121.62/121.83	
121.62/121.83	LOG: CALL solverLinear in Graph for feasibility
121.62/121.83	
121.62/121.83	LOG: RETURN solveLinear in Graph for feasibility
121.62/121.83	Strengthening transition (result): 
121.62/121.83	<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}>
121.62/121.83	
121.62/121.83	LOG: CALL solverLinear in Graph for feasibility
121.62/121.83	
121.62/121.83	LOG: RETURN solveLinear in Graph for feasibility
121.62/121.83	Strengthening transition (result): 
121.62/121.83	<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}>
121.62/121.83	
121.62/121.83	LOG: CALL solverLinear in Graph for feasibility
121.62/121.83	
121.62/121.83	LOG: RETURN solveLinear in Graph for feasibility
121.62/121.83	Strengthening transition (result): 
121.62/121.83	<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}>
121.62/121.83	
121.62/121.83	LOG: CALL solverLinear in Graph for feasibility
121.62/121.83	
121.62/121.83	LOG: RETURN solveLinear in Graph for feasibility
121.62/121.83	Strengthening transition (result): 
121.62/121.83	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0, {j^0 -> 1 + j^0, rest remain the same}>
121.62/121.83	
121.62/121.83	LOG: CALL solverLinear in Graph for feasibility
121.62/121.83	
121.62/121.83	LOG: RETURN solveLinear in Graph for feasibility
121.62/121.83	Strengthening transition (result): 
121.62/121.83	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0, {destflag^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
121.62/121.83	
121.62/121.83	LOG: CALL solverLinear in Graph for feasibility
121.62/121.83	
121.62/121.83	LOG: RETURN solveLinear in Graph for feasibility
121.62/121.83	Strengthening transition (result): 
121.62/121.83	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0, {j^0 -> 1 + j^0, rest remain the same}>
121.62/121.83	
121.62/121.83	LOG: CALL solverLinear in Graph for feasibility
121.62/121.83	
121.62/121.83	LOG: RETURN solveLinear in Graph for feasibility
121.62/121.83	Strengthening transition (result): 
121.62/121.83	<l18, l14, 1 + k_1^0 <= h^0 /\ nodecount^0 <= j^0, {destflag^0 -> 1, j^0 -> 0, rest remain the same}>
121.62/121.83	
121.62/121.83	LOG: CALL solverLinear in Graph for feasibility
121.62/121.83	
121.62/121.83	LOG: RETURN solveLinear in Graph for feasibility
121.62/121.83	Strengthening transition (result): 
121.62/121.83	<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0, {j^0 -> 1 + j^0, rest remain the same}>
121.62/121.84	
121.62/121.84	LOG: CALL solverLinear in Graph for feasibility
121.62/121.84	
121.62/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.62/121.84	Strengthening transition (result): 
121.62/121.84	<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}>
121.62/121.84	
121.62/121.84	LOG: CALL solverLinear in Graph for feasibility
121.62/121.84	
121.62/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.62/121.84	Strengthening transition (result): 
121.62/121.84	<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0, {j^0 -> 1 + j^0, rest remain the same}>
121.62/121.84	
121.62/121.84	LOG: CALL solverLinear in Graph for feasibility
121.62/121.84	
121.62/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.62/121.84	Strengthening transition (result): 
121.62/121.84	<l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
121.62/121.84	
121.62/121.84	LOG: CALL solverLinear in Graph for feasibility
121.62/121.84	
121.62/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.62/121.84	Strengthening transition (result): 
121.62/121.84	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
121.62/121.84	
121.62/121.84	LOG: CALL solverLinear in Graph for feasibility
121.62/121.84	
121.62/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.62/121.84	Strengthening transition (result): 
121.62/121.84	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
121.62/121.84	Checking unfeasibility...
121.62/121.84	Time used: 0.920056
121.62/121.84	Some transition disabled by a set of invariant(s):
121.62/121.84	Invariant at l14: 0 <= sourceflag^0
121.62/121.84	Invariant at l18: 0 <= sourceflag^0
121.62/121.84	
121.62/121.84	Strengthening and disabling transitions...
121.62/121.84	> It's unfeasible. Removing transition: 
121.62/121.84	<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}>
121.62/121.84	
121.62/121.84	LOG: CALL solverLinear in Graph for feasibility
121.62/121.84	
121.62/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.62/121.84	Strengthening transition (result): 
121.62/121.84	<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}>
121.62/121.84	
121.62/121.84	LOG: CALL solverLinear in Graph for feasibility
121.62/121.84	
121.62/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.62/121.84	Strengthening transition (result): 
121.62/121.84	<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}>
121.62/121.84	
121.62/121.84	LOG: CALL solverLinear in Graph for feasibility
121.62/121.84	
121.62/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.62/121.84	Strengthening transition (result): 
121.62/121.84	<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}>
121.62/121.84	
121.62/121.84	LOG: CALL solverLinear in Graph for feasibility
121.62/121.84	
121.62/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.62/121.84	It's unfeasible. Removing transition: 
121.62/121.84	<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}>
121.62/121.84	
121.62/121.84	LOG: CALL solverLinear in Graph for feasibility
121.62/121.84	
121.62/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.62/121.84	It's unfeasible. Removing transition: 
121.62/121.84	<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}>
121.62/121.84	
121.62/121.84	LOG: CALL solverLinear in Graph for feasibility
121.62/121.84	
121.62/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.62/121.84	Strengthening transition (result): 
121.62/121.84	<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}>
121.62/121.84	
121.62/121.84	LOG: CALL solverLinear in Graph for feasibility
121.62/121.84	
121.62/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.62/121.84	Strengthening transition (result): 
121.62/121.84	<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}>
121.62/121.84	
121.62/121.84	LOG: CALL solverLinear in Graph for feasibility
121.62/121.84	
121.62/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.62/121.84	Strengthening transition (result): 
121.72/121.84	<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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Checking unfeasibility...
121.72/121.84	Time used: 2.40474
121.72/121.84	
121.72/121.84	Checking conditional termination of SCC {l11, l14, l18, l23}...
121.72/121.84	
121.72/121.84	LOG: CALL solveLinear
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear - Elapsed time: 0.027805s
121.72/121.84	Ranking function: -5 - 10*edgecount^0 - 2*k^0 + 2*nodecount^0
121.72/121.84	New Graphs: 
121.72/121.84	Transitions:
121.72/121.84	<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}>
121.72/121.84	<l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0 /\ 0 <= i^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>
121.72/121.84	<l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
121.72/121.84	<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}>
121.72/121.84	<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}>
121.72/121.84	<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}>
121.72/121.84	<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}>
121.72/121.84	<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}>
121.72/121.84	<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}>
121.72/121.84	<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}>
121.72/121.84	<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}>
121.72/121.84	<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}>
121.72/121.84	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	<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}>
121.72/121.84	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	<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}>
121.72/121.84	<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}>
121.72/121.84	<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}>
121.72/121.84	<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}>
121.72/121.84	<l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
121.72/121.84	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
121.72/121.84	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
121.72/121.84	Variables:
121.72/121.84	destflag^0, edgecount^0, h^0, i^0, j^0, k^0, k_1^0, nodecount^0, sourceflag^0
121.72/121.84	Checking conditional termination of SCC {l11, l14, l18, l23}...
121.72/121.84	
121.72/121.84	LOG: CALL solveLinear
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear - Elapsed time: 0.019202s
121.72/121.84	Ranking function: -5 - 2*k^0 + 2*nodecount^0
121.72/121.84	New Graphs: 
121.72/121.84	Transitions:
121.72/121.84	<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}>
121.72/121.84	<l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0 /\ 0 <= i^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>
121.72/121.84	<l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
121.72/121.84	<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}>
121.72/121.84	<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}>
121.72/121.84	<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}>
121.72/121.84	<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}>
121.72/121.84	<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}>
121.72/121.84	<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}>
121.72/121.84	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	<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}>
121.72/121.84	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	<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}>
121.72/121.84	<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}>
121.72/121.84	<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}>
121.72/121.84	<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}>
121.72/121.84	<l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
121.72/121.84	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
121.72/121.84	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
121.72/121.84	Variables:
121.72/121.84	destflag^0, edgecount^0, h^0, i^0, j^0, k^0, k_1^0, nodecount^0, sourceflag^0
121.72/121.84	Checking conditional termination of SCC {l11, l14, l18, l23}...
121.72/121.84	
121.72/121.84	LOG: CALL solveLinear
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear - Elapsed time: 0.012292s
121.72/121.84	
121.72/121.84	LOG: CALL solveLinear
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear - Elapsed time: 0.251083s
121.72/121.84	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}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.200947s
121.72/121.84	Time used: 0.188722
121.72/121.84	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}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.174046s
121.72/121.84	Time used: 0.137508
121.72/121.84	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}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.080248s
121.72/121.84	Time used: 0.065255
121.72/121.84	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}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.083940s
121.72/121.84	Time used: 0.081719
121.72/121.84	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}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.101622s
121.72/121.84	Time used: 0.099296
121.72/121.84	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}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.110014s
121.72/121.84	Time used: 0.107651
121.72/121.84	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}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.076627s
121.72/121.84	Time used: 0.074245
121.72/121.84	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}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.171345s
121.72/121.84	Time used: 0.168684
121.72/121.84	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}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.165195s
121.72/121.84	Time used: 0.143897
121.72/121.84	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}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.127505s
121.72/121.84	Time used: 0.106171
121.72/121.84	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}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.581981s
121.72/121.84	Time used: 0.560639
121.72/121.84	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}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.147175s
121.72/121.84	Time used: 0.143443
121.72/121.84	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}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.925637s
121.72/121.84	Time used: 0.921994
121.72/121.84	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}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.156814s
121.72/121.84	Time used: 0.152861
121.72/121.84	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}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.877389s
121.72/121.84	Time used: 0.873515
121.72/121.84	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}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.190083s
121.72/121.84	Time used: 0.185871
121.72/121.84	Trying to remove transition: <l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.153785s
121.72/121.84	Time used: 0.148942
121.72/121.84	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}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.260247s
121.72/121.84	Time used: 0.250333
121.72/121.84	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}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.091304s
121.72/121.84	Time used: 0.070625
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002909s
121.72/121.84	Time used: 4.00002
121.72/121.84	Solving with 2 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.009257s
121.72/121.84	Time used: 4.00009
121.72/121.84	Solving with 3 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.079201s
121.72/121.84	Time used: 1.0414
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 3.061496s
121.72/121.84	Time used: 3.00634
121.72/121.84	Improving Solution with cost 1 ...
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetNextSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.999106s
121.72/121.84	Time used: 0.999033
121.72/121.84	
121.72/121.84	LOG: SAT solveNonLinear - Elapsed time: 4.060603s
121.72/121.84	Cost: 1; Total time: 4.00538
121.72/121.84	Termination implied by a set of invariant(s):
121.72/121.84	Invariant at l14: k_1^0 <= h^0 + j^0 + sourceflag^0
121.72/121.84	Invariant at l18: k_1^0 + sourceflag^0 <= h^0
121.72/121.84	Invariant at l23: k_1^0 <= edgecount^0
121.72/121.84	[ Invariant Graph ]
121.72/121.84	Strengthening and disabling transitions...
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
121.72/121.84	[ Termination Graph ]
121.72/121.84	Strengthening and disabling transitions...
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
121.72/121.84	Quasi-ranking function: 50000 - k^0
121.72/121.84	New Graphs: 
121.72/121.84	Transitions:
121.72/121.84	<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}>
121.72/121.84	<l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0 /\ 0 <= i^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>
121.72/121.84	<l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
121.72/121.84	<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}>
121.72/121.84	<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}>
121.72/121.84	<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}>
121.72/121.84	<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}>
121.72/121.84	<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}>
121.72/121.84	<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}>
121.72/121.84	<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}>
121.72/121.84	<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}>
121.72/121.84	<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}>
121.72/121.84	<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}>
121.72/121.84	<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}>
121.72/121.84	<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}>
121.72/121.84	<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}>
121.72/121.84	<l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
121.72/121.84	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
121.72/121.84	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
121.72/121.84	Variables:
121.72/121.84	destflag^0, edgecount^0, h^0, i^0, j^0, k^0, k_1^0, nodecount^0, sourceflag^0
121.72/121.84	Checking conditional termination of SCC {l11, l14, l18, l23}...
121.72/121.84	
121.72/121.84	LOG: CALL solveLinear
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear - Elapsed time: 0.019717s
121.72/121.84	
121.72/121.84	LOG: CALL solveLinear
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear - Elapsed time: 0.281373s
121.72/121.84	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}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.164975s
121.72/121.84	Time used: 0.14337
121.72/121.84	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}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.172184s
121.72/121.84	Time used: 0.152582
121.72/121.84	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}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.108199s
121.72/121.84	Time used: 0.088542
121.72/121.84	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}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.121190s
121.72/121.84	Time used: 0.11712
121.72/121.84	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}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.147110s
121.72/121.84	Time used: 0.142874
121.72/121.84	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}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.128121s
121.72/121.84	Time used: 0.123859
121.72/121.84	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}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.106344s
121.72/121.84	Time used: 0.102464
121.72/121.84	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}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.144406s
121.72/121.84	Time used: 0.140278
121.72/121.84	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}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.154136s
121.72/121.84	Time used: 0.149872
121.72/121.84	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}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.147319s
121.72/121.84	Time used: 0.143156
121.72/121.84	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}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.935128s
121.72/121.84	Time used: 0.931279
121.72/121.84	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}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.522050s
121.72/121.84	Time used: 0.51755
121.72/121.84	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}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.958726s
121.72/121.84	Time used: 0.953608
121.72/121.84	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}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.595070s
121.72/121.84	Time used: 0.590276
121.72/121.84	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}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.196960s
121.72/121.84	Time used: 1.19194
121.72/121.84	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}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.433871s
121.72/121.84	Time used: 0.429068
121.72/121.84	Trying to remove transition: <l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.186216s
121.72/121.84	Time used: 0.181264
121.72/121.84	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}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.291443s
121.72/121.84	Time used: 0.279034
121.72/121.84	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}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.124480s
121.72/121.84	Time used: 0.096066
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003297s
121.72/121.84	Time used: 4.00001
121.72/121.84	Solving with 2 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.009185s
121.72/121.84	Time used: 4.00001
121.72/121.84	Solving with 3 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.111511s
121.72/121.84	Time used: 1.07821
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.862236s
121.72/121.84	Time used: 2.80601
121.72/121.84	Improving Solution with cost 1 ...
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetNextSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.006618s
121.72/121.84	Time used: 1.00656
121.72/121.84	
121.72/121.84	LOG: SAT solveNonLinear - Elapsed time: 3.868854s
121.72/121.84	Cost: 1; Total time: 3.81258
121.72/121.84	Termination implied by a set of invariant(s):
121.72/121.84	Invariant at l11: 0 <= 1 + k^0
121.72/121.84	Invariant at l14: 0 <= 1 + k^0
121.72/121.84	Invariant at l18: 0 <= 1 + k^0
121.72/121.84	Invariant at l23: 0 <= 1 + k^0
121.72/121.84	[ Invariant Graph ]
121.72/121.84	Strengthening and disabling transitions...
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l11, l11, edgecount^0 <= 0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ 0 <= 1 + k^0 /\ nodecount^0 <= 1 + k^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l11, l11, edgecount^0 <= 0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ 0 <= 1 + k^0 /\ 3 + k^0 <= nodecount^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ 0 <= 1 + k^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= i^0 /\ 0 <= 1 + k^0, {i^0 -> 1 + i^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<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 /\ 0 <= 1 + k^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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<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 /\ 0 <= 1 + k^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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l23, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 0 <= 1 + k^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l11, 1 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 0 <= 1 + k^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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l11, 1 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 0 <= 1 + k^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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l23, 1 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l11, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 0 <= 1 + k^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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l11, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 0 <= 1 + k^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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l23, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {destflag^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l18, l14, 1 + k_1^0 <= h^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ nodecount^0 <= j^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {destflag^0 -> 1, j^0 -> 0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0 /\ 0 <= 1 + k^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 /\ 0 <= 1 + k^0, {h^0 -> 1 + h^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 /\ 0 <= 1 + k^0, {h^0 -> 1 + h^0, rest remain the same}>
121.72/121.84	[ Termination Graph ]
121.72/121.84	Strengthening and disabling transitions...
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ 0 <= 1 + k^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= i^0 /\ 0 <= 1 + k^0, {i^0 -> 1 + i^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l23, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 0 <= 1 + k^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l23, 1 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l23, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {destflag^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l18, l14, 1 + k_1^0 <= h^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ nodecount^0 <= j^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {destflag^0 -> 1, j^0 -> 0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0 /\ 0 <= 1 + k^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 /\ 0 <= 1 + k^0, {h^0 -> 1 + h^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 /\ 0 <= 1 + k^0, {h^0 -> 1 + h^0, rest remain the same}>
121.72/121.84	Quasi-ranking function: 50000 - k^0 + nodecount^0
121.72/121.84	New Graphs: 
121.72/121.84	Transitions:
121.72/121.84	<l11, l11, edgecount^0 <= 0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 0, rest remain the same}>
121.72/121.84	<l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ 0 <= 1 + k^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>
121.72/121.84	<l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= i^0 /\ 0 <= 1 + k^0, {i^0 -> 1 + i^0, rest remain the same}>
121.72/121.84	<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 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.72/121.84	<l14, l23, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 0 <= 1 + k^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.72/121.84	<l14, l11, 1 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.72/121.84	<l14, l23, 1 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 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}>
121.72/121.84	<l14, l11, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= 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}>
121.72/121.84	<l14, l23, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 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}>
121.72/121.84	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {destflag^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	<l18, l14, 1 + k_1^0 <= h^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ nodecount^0 <= j^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {destflag^0 -> 1, j^0 -> 0, rest remain the same}>
121.72/121.84	<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>
121.72/121.84	<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	<l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0 /\ 0 <= 1 + k^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
121.72/121.84	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 /\ 0 <= 1 + k^0, {h^0 -> 1 + h^0, rest remain the same}>
121.72/121.84	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 /\ 0 <= 1 + k^0, {h^0 -> 1 + h^0, rest remain the same}>
121.72/121.84	Variables:
121.72/121.84	destflag^0, edgecount^0, h^0, i^0, j^0, k^0, k_1^0, nodecount^0, sourceflag^0
121.72/121.84	Checking conditional termination of SCC {l11, l14, l18, l23}...
121.72/121.84	
121.72/121.84	LOG: CALL solveLinear
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear - Elapsed time: 0.023102s
121.72/121.84	
121.72/121.84	LOG: CALL solveLinear
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear - Elapsed time: 0.314816s
121.72/121.84	Trying to remove transition: <l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 /\ 0 <= 1 + k^0, {h^0 -> 1 + h^0, rest remain the same}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.292637s
121.72/121.84	Time used: 0.288208
121.72/121.84	Trying to remove transition: <l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 /\ 0 <= 1 + k^0, {h^0 -> 1 + h^0, rest remain the same}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.308999s
121.72/121.84	Time used: 0.275233
121.72/121.84	Trying to remove transition: <l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0 /\ 0 <= 1 + k^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.149561s
121.72/121.84	Time used: 0.115805
121.72/121.84	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 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.144768s
121.72/121.84	Time used: 0.140829
121.72/121.84	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 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.156562s
121.72/121.84	Time used: 0.152407
121.72/121.84	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 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.150932s
121.72/121.84	Time used: 0.146996
121.72/121.84	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 /\ 0 <= 1 + k^0, {destflag^0 -> 1, j^0 -> 0, rest remain the same}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.135196s
121.72/121.84	Time used: 0.13145
121.72/121.84	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 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.180508s
121.72/121.84	Time used: 0.176548
121.72/121.84	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 /\ 0 <= 1 + k^0, {destflag^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.162549s
121.72/121.84	Time used: 0.158347
121.72/121.84	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 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.215700s
121.72/121.84	Time used: 0.211628
121.72/121.84	Trying to remove transition: <l14, l23, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 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}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.301037s
121.72/121.84	Time used: 1.297
121.72/121.84	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 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= 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}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.485701s
121.72/121.84	Time used: 0.480848
121.72/121.84	Trying to remove transition: <l14, l23, 1 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 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}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.333379s
121.72/121.84	Time used: 1.32842
121.72/121.84	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 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.657863s
121.72/121.84	Time used: 0.652685
121.72/121.84	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 /\ 0 <= 1 + k^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.333824s
121.72/121.84	Time used: 1.32858
121.72/121.84	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 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.470931s
121.72/121.84	Time used: 0.465738
121.72/121.84	Trying to remove transition: <l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= i^0 /\ 0 <= 1 + k^0, {i^0 -> 1 + i^0, rest remain the same}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.297532s
121.72/121.84	Time used: 0.292381
121.72/121.84	Trying to remove transition: <l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ 0 <= 1 + k^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.186320s
121.72/121.84	Time used: 0.163333
121.72/121.84	Trying to remove transition: <l11, l11, edgecount^0 <= 0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 0, rest remain the same}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.205795s
121.72/121.84	Time used: 0.202132
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003591s
121.72/121.84	Time used: 4.00001
121.72/121.84	Solving with 2 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.009341s
121.72/121.84	Time used: 4.00002
121.72/121.84	Solving with 3 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.168870s
121.72/121.84	Time used: 1.13632
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 3.163275s
121.72/121.84	Time used: 3.10585
121.72/121.84	Improving Solution with cost 1 ...
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetNextSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.899922s
121.72/121.84	Time used: 0.899862
121.72/121.84	
121.72/121.84	LOG: SAT solveNonLinear - Elapsed time: 4.063197s
121.72/121.84	Cost: 1; Total time: 4.00571
121.72/121.84	Termination implied by a set of invariant(s):
121.72/121.84	Invariant at l11: 0 <= k^0
121.72/121.84	Invariant at l14: destflag^0 <= 1
121.72/121.84	Invariant at l18: 1 + k_1^0 <= edgecount^0
121.72/121.84	Invariant at l23: k_1^0 <= edgecount^0 + k^0
121.72/121.84	[ Invariant Graph ]
121.72/121.84	Strengthening and disabling transitions...
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l11, l11, edgecount^0 <= 0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ 0 <= k^0 /\ nodecount^0 <= 1 + k^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l11, l11, edgecount^0 <= 0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ 0 <= k^0 /\ 3 + k^0 <= nodecount^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ 0 <= k^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= i^0 /\ 0 <= k^0, {i^0 -> 1 + i^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l11, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ destflag^0 <= 1 /\ edgecount^0 <= 1 + k_1^0 /\ 0 <= 1 + k^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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l11, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ destflag^0 <= 1 /\ edgecount^0 <= 1 + k_1^0 /\ 0 <= 1 + k^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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l23, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l11, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 0 <= 1 + k^0 /\ nodecount^0 <= 1 + k^0 /\ sourceflag^0 = 0 /\ destflag^0 = 1, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l11, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 0 <= 1 + k^0 /\ 3 + k^0 <= nodecount^0 /\ sourceflag^0 = 0 /\ destflag^0 = 1, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l23, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 0 <= 1 + k^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0 /\ destflag^0 = 1, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l11, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 0 <= 1 + k^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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l11, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 0 <= 1 + k^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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l23, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0, {destflag^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l18, l14, 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ nodecount^0 <= j^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {destflag^0 -> 1, j^0 -> 0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l18, l18, 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l18, l18, 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l18, l18, 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0 /\ k_1^0 <= edgecount^0 + k^0 /\ 0 <= 1 + k^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 /\ k_1^0 <= edgecount^0 + k^0 /\ 0 <= 1 + k^0, {h^0 -> 1 + h^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 /\ k_1^0 <= edgecount^0 + k^0 /\ 0 <= 1 + k^0, {h^0 -> 1 + h^0, rest remain the same}>
121.72/121.84	[ Termination Graph ]
121.72/121.84	Strengthening and disabling transitions...
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l11, l11, edgecount^0 <= 0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ 0 <= k^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= i^0 /\ 0 <= k^0, {i^0 -> 1 + i^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l11, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ destflag^0 <= 1 /\ edgecount^0 <= 1 + k_1^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l23, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l11, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ sourceflag^0 = 0 /\ destflag^0 = 1, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l23, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 0 <= 1 + k^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0 /\ destflag^0 = 1, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l11, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= 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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l23, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0, {destflag^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l18, l14, 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ nodecount^0 <= j^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {destflag^0 -> 1, j^0 -> 0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l18, l18, 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l18, l18, 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l18, l18, 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0 /\ k_1^0 <= edgecount^0 + k^0 /\ 0 <= 1 + k^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 /\ k_1^0 <= edgecount^0 + k^0 /\ 0 <= 1 + k^0, {h^0 -> 1 + h^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 /\ k_1^0 <= edgecount^0 + k^0 /\ 0 <= 1 + k^0, {h^0 -> 1 + h^0, rest remain the same}>
121.72/121.84	Quasi-ranking function: 50000 - k^0 - nodecount^0
121.72/121.84	New Graphs: 
121.72/121.84	Transitions:
121.72/121.84	<l11, l11, edgecount^0 <= 0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 0, rest remain the same}>
121.72/121.84	<l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ 0 <= k^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>
121.72/121.84	<l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= i^0 /\ 0 <= k^0, {i^0 -> 1 + i^0, rest remain the same}>
121.72/121.84	<l14, l11, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ destflag^0 <= 1 /\ edgecount^0 <= 1 + k_1^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.72/121.84	<l14, l23, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.72/121.84	<l14, l11, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0 /\ sourceflag^0 = 0 /\ destflag^0 = 1, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.72/121.84	<l14, l23, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 0 <= 1 + k^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0 /\ destflag^0 = 1, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.72/121.84	<l14, l11, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= 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}>
121.72/121.84	<l14, l23, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 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}>
121.72/121.84	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0, {destflag^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	<l18, l14, 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ nodecount^0 <= j^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {destflag^0 -> 1, j^0 -> 0, rest remain the same}>
121.72/121.84	<l18, l18, 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	<l18, l18, 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>
121.72/121.84	<l18, l18, 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	<l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0 /\ k_1^0 <= edgecount^0 + k^0 /\ 0 <= 1 + k^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
121.72/121.84	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 /\ k_1^0 <= edgecount^0 + k^0 /\ 0 <= 1 + k^0, {h^0 -> 1 + h^0, rest remain the same}>
121.72/121.84	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 /\ k_1^0 <= edgecount^0 + k^0 /\ 0 <= 1 + k^0, {h^0 -> 1 + h^0, rest remain the same}>
121.72/121.84	Variables:
121.72/121.84	destflag^0, edgecount^0, h^0, i^0, j^0, k^0, k_1^0, nodecount^0, sourceflag^0
121.72/121.84	Checking conditional termination of SCC {l11, l14, l18, l23}...
121.72/121.84	
121.72/121.84	LOG: CALL solveLinear
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear - Elapsed time: 0.026350s
121.72/121.84	
121.72/121.84	LOG: CALL solveLinear
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear - Elapsed time: 0.468937s
121.72/121.84	Trying to remove transition: <l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 /\ k_1^0 <= edgecount^0 + k^0 /\ 0 <= 1 + k^0, {h^0 -> 1 + h^0, rest remain the same}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.185160s
121.72/121.84	Time used: 0.180223
121.72/121.84	Trying to remove transition: <l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 /\ k_1^0 <= edgecount^0 + k^0 /\ 0 <= 1 + k^0, {h^0 -> 1 + h^0, rest remain the same}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.168794s
121.72/121.84	Time used: 0.164928
121.72/121.84	Trying to remove transition: <l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0 /\ k_1^0 <= edgecount^0 + k^0 /\ 0 <= 1 + k^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.139038s
121.72/121.84	Time used: 0.135008
121.72/121.84	Trying to remove transition: <l18, l18, 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.176778s
121.72/121.84	Time used: 0.172615
121.72/121.84	Trying to remove transition: <l18, l18, 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.202091s
121.72/121.84	Time used: 0.197525
121.72/121.84	Trying to remove transition: <l18, l18, 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.178915s
121.72/121.84	Time used: 0.174622
121.72/121.84	Trying to remove transition: <l18, l14, 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ nodecount^0 <= j^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {destflag^0 -> 1, j^0 -> 0, rest remain the same}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.168856s
121.72/121.84	Time used: 0.164714
121.72/121.84	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 <= 1 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.193431s
121.72/121.84	Time used: 0.189216
121.72/121.84	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 <= 1 /\ 0 <= 1 + k^0, {destflag^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.220600s
121.72/121.84	Time used: 0.216685
121.72/121.84	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 <= 1 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.199013s
121.72/121.84	Time used: 0.195073
121.72/121.84	Trying to remove transition: <l14, l23, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 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}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.138196s
121.72/121.84	Time used: 1.13434
121.72/121.84	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 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= 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}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.711674s
121.72/121.84	Time used: 0.70688
121.72/121.84	Trying to remove transition: <l14, l23, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 0 <= 1 + k^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0 /\ destflag^0 = 1, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.188869s
121.72/121.84	Time used: 2.18367
121.72/121.84	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 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0 /\ sourceflag^0 = 0 /\ destflag^0 = 1, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.641108s
121.72/121.84	Time used: 0.635287
121.72/121.84	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 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.536402s
121.72/121.84	Time used: 1.53086
121.72/121.84	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 /\ destflag^0 <= 1 /\ edgecount^0 <= 1 + k_1^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.639762s
121.72/121.84	Time used: 0.634362
121.72/121.84	Trying to remove transition: <l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= i^0 /\ 0 <= k^0, {i^0 -> 1 + i^0, rest remain the same}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.392719s
121.72/121.84	Time used: 0.387323
121.72/121.84	Trying to remove transition: <l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ 0 <= k^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.335192s
121.72/121.84	Time used: 0.306467
121.72/121.84	Trying to remove transition: <l11, l11, edgecount^0 <= 0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 0, rest remain the same}>
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.138550s
121.72/121.84	Time used: 0.134728
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003663s
121.72/121.84	Time used: 4.00017
121.72/121.84	Solving with 2 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.009661s
121.72/121.84	Time used: 4.00006
121.72/121.84	Solving with 3 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.233731s
121.72/121.84	Time used: 1.20219
121.72/121.84	Solving with 1 template(s).
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 3.814919s
121.72/121.84	Time used: 3.75792
121.72/121.84	Improving Solution with cost 1 ...
121.72/121.84	
121.72/121.84	LOG: CALL solveNonLinearGetNextSolution
121.72/121.84	
121.72/121.84	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.277814s
121.72/121.84	Time used: 0.277779
121.72/121.84	
121.72/121.84	LOG: SAT solveNonLinear - Elapsed time: 4.092732s
121.72/121.84	Cost: 1; Total time: 4.03569
121.72/121.84	Termination implied by a set of invariant(s):
121.72/121.84	Invariant at l14: 1 + k_1^0 <= h^0 + sourceflag^0
121.72/121.84	Invariant at l18: 0 <= h^0 + j^0
121.72/121.84	Invariant at l23: 0 <= h^0
121.72/121.84	[ Invariant Graph ]
121.72/121.84	Strengthening and disabling transitions...
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l11, 1 + k_1^0 <= h^0 + sourceflag^0 /\ 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ destflag^0 <= 1 /\ edgecount^0 <= 1 + k_1^0 /\ 0 <= 1 + k^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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l11, 1 + k_1^0 <= h^0 + sourceflag^0 /\ 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ destflag^0 <= 1 /\ edgecount^0 <= 1 + k_1^0 /\ 0 <= 1 + k^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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l23, 1 + k_1^0 <= h^0 + sourceflag^0 /\ 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l11, 1 + k_1^0 <= h^0 + sourceflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 0 <= 1 + k^0 /\ nodecount^0 <= 1 + k^0 /\ sourceflag^0 = 0 /\ destflag^0 = 1, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l11, 1 + k_1^0 <= h^0 + sourceflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 0 <= 1 + k^0 /\ 3 + k^0 <= nodecount^0 /\ sourceflag^0 = 0 /\ destflag^0 = 1, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l23, 1 + k_1^0 <= h^0 + sourceflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 0 <= 1 + k^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0 /\ destflag^0 = 1, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l11, 1 + k_1^0 <= h^0 + sourceflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 0 <= 1 + k^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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l11, 1 + k_1^0 <= h^0 + sourceflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 0 <= 1 + k^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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l23, 1 + k_1^0 <= h^0 + sourceflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l14, 1 + k_1^0 <= h^0 + sourceflag^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l14, 1 + k_1^0 <= h^0 + sourceflag^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0, {destflag^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l14, 1 + k_1^0 <= h^0 + sourceflag^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l18, l14, 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ 0 <= h^0 + j^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ nodecount^0 <= j^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {destflag^0 -> 1, j^0 -> 0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l18, l18, 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= h^0 + j^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l18, l18, 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= h^0 + j^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l18, l18, 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= h^0 + j^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0 /\ k_1^0 <= edgecount^0 + k^0 /\ 0 <= h^0 /\ 0 <= 1 + k^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 /\ k_1^0 <= edgecount^0 + k^0 /\ 0 <= h^0 /\ 0 <= 1 + k^0, {h^0 -> 1 + h^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 /\ k_1^0 <= edgecount^0 + k^0 /\ 0 <= h^0 /\ 0 <= 1 + k^0, {h^0 -> 1 + h^0, rest remain the same}>
121.72/121.84	[ Termination Graph ]
121.72/121.84	Strengthening and disabling transitions...
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l11, 1 + k_1^0 <= h^0 + sourceflag^0 /\ 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ destflag^0 <= 1 /\ edgecount^0 <= 1 + k_1^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l23, 1 + k_1^0 <= h^0 + sourceflag^0 /\ 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l11, 1 + k_1^0 <= h^0 + sourceflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0 /\ sourceflag^0 = 0 /\ destflag^0 = 1, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l23, 1 + k_1^0 <= h^0 + sourceflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 0 <= 1 + k^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0 /\ destflag^0 = 1, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l11, 1 + k_1^0 <= h^0 + sourceflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= 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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l23, 1 + k_1^0 <= h^0 + sourceflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 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}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l14, 1 + k_1^0 <= h^0 + sourceflag^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l14, 1 + k_1^0 <= h^0 + sourceflag^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0, {destflag^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l14, l14, 1 + k_1^0 <= h^0 + sourceflag^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l18, l14, 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ 0 <= h^0 + j^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ nodecount^0 <= j^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {destflag^0 -> 1, j^0 -> 0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l18, l18, 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= h^0 + j^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l18, l18, 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= h^0 + j^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l18, l18, 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= h^0 + j^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.84	
121.72/121.84	LOG: CALL solverLinear in Graph for feasibility
121.72/121.84	
121.72/121.84	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.84	Strengthening transition (result): 
121.72/121.84	<l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0 /\ k_1^0 <= edgecount^0 + k^0 /\ 0 <= h^0 /\ 0 <= 1 + k^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
121.72/121.85	
121.72/121.85	LOG: CALL solverLinear in Graph for feasibility
121.72/121.85	
121.72/121.85	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.85	Strengthening transition (result): 
121.72/121.85	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 /\ k_1^0 <= edgecount^0 + k^0 /\ 0 <= h^0 /\ 0 <= 1 + k^0, {h^0 -> 1 + h^0, rest remain the same}>
121.72/121.85	
121.72/121.85	LOG: CALL solverLinear in Graph for feasibility
121.72/121.85	
121.72/121.85	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.85	Strengthening transition (result): 
121.72/121.85	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 /\ k_1^0 <= edgecount^0 + k^0 /\ 0 <= h^0 /\ 0 <= 1 + k^0, {h^0 -> 1 + h^0, rest remain the same}>
121.72/121.85	Quasi-ranking function: 50000 + edgecount^0 - k^0 + nodecount^0
121.72/121.85	New Graphs: 
121.72/121.85	Transitions:
121.72/121.85	<l11, l11, edgecount^0 <= 0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ 50001 + edgecount^0 + nodecount^0 <= k^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 0, rest remain the same}>
121.72/121.85	<l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ 0 <= k^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>
121.72/121.85	<l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= i^0 /\ 0 <= k^0, {i^0 -> 1 + i^0, rest remain the same}>
121.72/121.85	<l14, l11, 1 + k_1^0 <= h^0 + sourceflag^0 /\ 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ destflag^0 <= 1 /\ edgecount^0 <= 1 + k_1^0 /\ 50001 + edgecount^0 + nodecount^0 <= k^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.72/121.85	<l14, l23, 1 + k_1^0 <= h^0 + sourceflag^0 /\ 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.72/121.85	<l14, l11, 1 + k_1^0 <= h^0 + sourceflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 50001 + edgecount^0 + nodecount^0 <= k^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0 /\ sourceflag^0 = 0 /\ destflag^0 = 1, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.72/121.85	<l14, l23, 1 + k_1^0 <= h^0 + sourceflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 0 <= 1 + k^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0 /\ destflag^0 = 1, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.72/121.85	<l14, l11, 1 + k_1^0 <= h^0 + sourceflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 50001 + edgecount^0 + nodecount^0 <= k^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= 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}>
121.72/121.85	<l14, l23, 1 + k_1^0 <= h^0 + sourceflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 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}>
121.72/121.85	<l14, l14, 1 + k_1^0 <= h^0 + sourceflag^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.85	<l14, l14, 1 + k_1^0 <= h^0 + sourceflag^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0, {destflag^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
121.72/121.85	<l14, l14, 1 + k_1^0 <= h^0 + sourceflag^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.85	<l18, l14, 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ 0 <= h^0 + j^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ nodecount^0 <= j^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {destflag^0 -> 1, j^0 -> 0, rest remain the same}>
121.72/121.85	<l18, l18, 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= h^0 + j^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.85	<l18, l18, 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= h^0 + j^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>
121.72/121.85	<l18, l18, 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= h^0 + j^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.85	<l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0 /\ k_1^0 <= edgecount^0 + k^0 /\ 0 <= h^0 /\ 0 <= 1 + k^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
121.72/121.85	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 /\ k_1^0 <= edgecount^0 + k^0 /\ 0 <= h^0 /\ 0 <= 1 + k^0, {h^0 -> 1 + h^0, rest remain the same}>
121.72/121.85	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 /\ k_1^0 <= edgecount^0 + k^0 /\ 0 <= h^0 /\ 0 <= 1 + k^0, {h^0 -> 1 + h^0, rest remain the same}>
121.72/121.85	Variables:
121.72/121.85	destflag^0, edgecount^0, h^0, i^0, j^0, k^0, k_1^0, nodecount^0, sourceflag^0
121.72/121.85	Checking conditional termination of SCC {l11, l14, l18, l23}...
121.72/121.85	
121.72/121.85	LOG: CALL solveLinear
121.72/121.85	
121.72/121.85	LOG: RETURN solveLinear - Elapsed time: 0.030948s
121.72/121.85	
121.72/121.85	LOG: CALL solveLinear
121.72/121.85	
121.72/121.85	LOG: RETURN solveLinear - Elapsed time: 0.704339s
121.72/121.85	Trying to remove transition: <l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 /\ k_1^0 <= edgecount^0 + k^0 /\ 0 <= h^0 /\ 0 <= 1 + k^0, {h^0 -> 1 + h^0, rest remain the same}>
121.72/121.85	Solving with 1 template(s).
121.72/121.85	
121.72/121.85	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.85	
121.72/121.85	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.248060s
121.72/121.85	Time used: 0.242683
121.72/121.85	Trying to remove transition: <l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 /\ k_1^0 <= edgecount^0 + k^0 /\ 0 <= h^0 /\ 0 <= 1 + k^0, {h^0 -> 1 + h^0, rest remain the same}>
121.72/121.85	Solving with 1 template(s).
121.72/121.85	
121.72/121.85	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.85	
121.72/121.85	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.265244s
121.72/121.85	Time used: 0.260969
121.72/121.85	Trying to remove transition: <l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0 /\ k_1^0 <= edgecount^0 + k^0 /\ 0 <= h^0 /\ 0 <= 1 + k^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
121.72/121.85	Solving with 1 template(s).
121.72/121.85	
121.72/121.85	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.85	
121.72/121.85	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.157698s
121.72/121.85	Time used: 0.15338
121.72/121.85	Trying to remove transition: <l18, l18, 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= h^0 + j^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.85	Solving with 1 template(s).
121.72/121.85	
121.72/121.85	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.85	
121.72/121.85	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.239819s
121.72/121.85	Time used: 0.235518
121.72/121.85	Trying to remove transition: <l18, l18, 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= h^0 + j^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>
121.72/121.85	Solving with 1 template(s).
121.72/121.85	
121.72/121.85	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.85	
121.72/121.85	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.247234s
121.72/121.85	Time used: 0.242574
121.72/121.85	Trying to remove transition: <l18, l18, 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= h^0 + j^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.85	Solving with 1 template(s).
121.72/121.85	
121.72/121.85	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.85	
121.72/121.85	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.223077s
121.72/121.85	Time used: 0.218453
121.72/121.85	Trying to remove transition: <l18, l14, 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ 0 <= h^0 + j^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ nodecount^0 <= j^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {destflag^0 -> 1, j^0 -> 0, rest remain the same}>
121.72/121.85	Solving with 1 template(s).
121.72/121.85	
121.72/121.85	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.85	
121.72/121.85	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.213026s
121.72/121.85	Time used: 0.208789
121.72/121.85	Trying to remove transition: <l14, l14, 1 + k_1^0 <= h^0 + sourceflag^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.85	Solving with 1 template(s).
121.72/121.85	
121.72/121.85	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.85	
121.72/121.85	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.242812s
121.72/121.85	Time used: 0.238346
121.72/121.85	Trying to remove transition: <l14, l14, 1 + k_1^0 <= h^0 + sourceflag^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0, {destflag^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
121.72/121.85	Solving with 1 template(s).
121.72/121.85	
121.72/121.85	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.85	
121.72/121.85	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.338998s
121.72/121.85	Time used: 0.334852
121.72/121.85	Trying to remove transition: <l14, l14, 1 + k_1^0 <= h^0 + sourceflag^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.85	Solving with 1 template(s).
121.72/121.85	
121.72/121.85	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.85	
121.72/121.85	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.232858s
121.72/121.85	Time used: 0.228659
121.72/121.85	Trying to remove transition: <l14, l23, 1 + k_1^0 <= h^0 + sourceflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 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}>
121.72/121.85	Solving with 1 template(s).
121.72/121.85	
121.72/121.85	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.85	
121.72/121.85	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.527760s
121.72/121.85	Time used: 1.51954
121.72/121.85	Trying to remove transition: <l14, l11, 1 + k_1^0 <= h^0 + sourceflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 50001 + edgecount^0 + nodecount^0 <= k^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= 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}>
121.72/121.85	Solving with 1 template(s).
121.72/121.85	
121.72/121.85	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.85	
121.72/121.85	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.498673s
121.72/121.85	Time used: 0.493682
121.72/121.85	Trying to remove transition: <l14, l23, 1 + k_1^0 <= h^0 + sourceflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 0 <= 1 + k^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0 /\ destflag^0 = 1, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.72/121.85	Solving with 1 template(s).
121.72/121.85	
121.72/121.85	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.85	
121.72/121.85	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.341308s
121.72/121.85	Time used: 2.3361
121.72/121.85	Trying to remove transition: <l14, l11, 1 + k_1^0 <= h^0 + sourceflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 50001 + edgecount^0 + nodecount^0 <= k^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0 /\ sourceflag^0 = 0 /\ destflag^0 = 1, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.72/121.85	Solving with 1 template(s).
121.72/121.85	
121.72/121.85	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.85	
121.72/121.85	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.483702s
121.72/121.85	Time used: 0.4779
121.72/121.85	Trying to remove transition: <l14, l23, 1 + k_1^0 <= h^0 + sourceflag^0 /\ 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.72/121.85	Solving with 1 template(s).
121.72/121.85	
121.72/121.85	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.85	
121.72/121.85	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.436243s
121.72/121.85	Time used: 1.43047
121.72/121.85	Trying to remove transition: <l14, l11, 1 + k_1^0 <= h^0 + sourceflag^0 /\ 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ destflag^0 <= 1 /\ edgecount^0 <= 1 + k_1^0 /\ 50001 + edgecount^0 + nodecount^0 <= k^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.72/121.85	Solving with 1 template(s).
121.72/121.85	
121.72/121.85	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.85	
121.72/121.85	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.665467s
121.72/121.85	Time used: 0.660029
121.72/121.85	Trying to remove transition: <l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= i^0 /\ 0 <= k^0, {i^0 -> 1 + i^0, rest remain the same}>
121.72/121.85	Solving with 1 template(s).
121.72/121.85	
121.72/121.85	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.85	
121.72/121.85	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.384261s
121.72/121.85	Time used: 0.378806
121.72/121.85	Trying to remove transition: <l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ 0 <= k^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>
121.72/121.85	Solving with 1 template(s).
121.72/121.85	
121.72/121.85	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.85	
121.72/121.85	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.236919s
121.72/121.85	Time used: 0.205591
121.72/121.85	Trying to remove transition: <l11, l11, edgecount^0 <= 0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ 50001 + edgecount^0 + nodecount^0 <= k^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 0, rest remain the same}>
121.72/121.85	Solving with 1 template(s).
121.72/121.85	
121.72/121.85	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.85	
121.72/121.85	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.161886s
121.72/121.85	Time used: 0.157929
121.72/121.85	Solving with 1 template(s).
121.72/121.85	
121.72/121.85	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.85	
121.72/121.85	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005072s
121.72/121.85	Time used: 4.00002
121.72/121.85	Solving with 2 template(s).
121.72/121.85	
121.72/121.85	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.85	
121.72/121.85	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.010219s
121.72/121.85	Time used: 4.00066
121.72/121.85	Solving with 3 template(s).
121.72/121.85	
121.72/121.85	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.85	
121.72/121.85	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.247755s
121.72/121.85	Time used: 1.21548
121.72/121.85	Solving with 1 template(s).
121.72/121.85	
121.72/121.85	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.85	
121.72/121.85	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.056535s
121.72/121.85	Time used: 4.00002
121.72/121.85	Termination failed. Trying to show unreachability...
121.72/121.85	Proving unreachability of entry: <l3, l11, nodecount^0 <= 0 /\ nodecount^0 <= 1 + i^0, {i^0 -> 0, k^0 -> 0, rest remain the same}>
121.72/121.85	
121.72/121.85	LOG: CALL check - Post:1 <= 0 - Process 1
121.72/121.85	* Exit transition: <l3, l11, nodecount^0 <= 0 /\ nodecount^0 <= 1 + i^0, {i^0 -> 0, k^0 -> 0, rest remain the same}>
121.72/121.85	* Postcondition  : 1 <= 0
121.72/121.85	Postcodition moved up: 1 <= 0
121.72/121.85	
121.72/121.85	LOG: Try proving POST
121.72/121.85	Postcondition: 1 <= 0
121.72/121.85	
121.72/121.85	LOG: CALL check - Post:1 <= 0 - Process 2
121.72/121.85	* Exit transition: <l1, l3, nodecount^0 <= i^0 /\ nodecount^0 <= 0, {i^0 -> 0, rest remain the same}>
121.72/121.85	* Postcondition  : 1 <= 0
121.72/121.85	Postcodition moved up: 1 <= 0
121.72/121.85	
121.72/121.85	LOG: Try proving POST
121.72/121.85	Postcondition: 1 <= 0
121.72/121.85	
121.72/121.85	LOG: CALL check - Post:1 <= 0 - Process 3
121.72/121.85	* Exit transition: <l0, l1, i^0 = 1, {all remain the same}>
121.72/121.85	* Postcondition  : 1 <= 0
121.72/121.85	
121.72/121.85	LOG: CALL solveLinear
121.72/121.85	
121.72/121.85	LOG: RETURN solveLinear - Elapsed time: 0.015719s
121.72/121.85	> Postcondition is not implied!
121.72/121.85	
121.72/121.85	LOG: RETURN check - Elapsed time: 0.015853s
121.72/121.85	
121.72/121.85	LOG: NarrowEntry size 1
121.72/121.85	Narrowing transition: 
121.72/121.85	<l1, l1, 1 + i^0 <= nodecount^0, {i^0 -> 1 + i^0, rest remain the same}>
121.72/121.85	
121.72/121.85	LOG: Narrow transition size 1
121.72/121.85	ENTRIES:
121.72/121.85	<l0, l1, 0 <= 0 /\ i^0 = 1, {all remain the same}>
121.72/121.85	END ENTRIES:
121.72/121.85	GRAPH:
121.72/121.85	<l1, l1, 1 + i^0 <= nodecount^0 /\ 0 <= 0, {i^0 -> 1 + i^0, rest remain the same}>
121.72/121.85	END GRAPH:
121.72/121.85	EXIT: <l1, l3, nodecount^0 <= i^0 /\ nodecount^0 <= 0, {i^0 -> 0, rest remain the same}>
121.72/121.85	POST: 1 <= 0
121.72/121.85	
121.72/121.85	
121.72/121.85	LOG: Try proving POST
121.72/121.85	Solving with 1 template(s).
121.72/121.85	
121.72/121.85	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.85	
121.72/121.85	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.087242s
121.72/121.85	Time used: 0.086939
121.72/121.85	Improving Solution with cost 1 ...
121.72/121.85	
121.72/121.85	LOG: CALL solveNonLinearGetNextSolution
121.72/121.85	
121.72/121.85	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.037620s
121.72/121.85	Time used: 0.037485
121.72/121.85	
121.72/121.85	LOG: SAT solveNonLinear - Elapsed time: 0.124862s
121.72/121.85	Cost: 1; Total time: 0.124424
121.72/121.85	Failed at location 1: 1 <= nodecount^0
121.72/121.85	Before Improving: 
121.72/121.85	Quasi-invariant at l1: 1 <= nodecount^0
121.72/121.85	Optimizing invariants...
121.72/121.85	
121.72/121.85	LOG: CALL solveLinear
121.72/121.85	
121.72/121.85	LOG: RETURN solveLinear - Elapsed time: 0.004304s
121.72/121.85	Remaining time after improvement: 0.99683
121.72/121.85	Postcondition implied by a set of quasi-invariant(s):
121.72/121.85	Quasi-invariant at l1: 1 <= nodecount^0
121.72/121.85	Postcondition: 1 <= nodecount^0
121.72/121.85	
121.72/121.85	LOG: CALL check - Post:1 <= nodecount^0 - Process 4
121.72/121.85	* Exit transition: <l0, l1, 0 <= 0 /\ i^0 = 1, {all remain the same}>
121.72/121.85	* Postcondition  : 1 <= nodecount^0
121.72/121.85	
121.72/121.85	LOG: CALL solveLinear
121.72/121.85	
121.72/121.85	LOG: RETURN solveLinear - Elapsed time: 0.016866s
121.72/121.85	> Postcondition is not implied!
121.72/121.85	
121.72/121.85	LOG: RETURN check - Elapsed time: 0.017033s
121.72/121.85	
121.72/121.85	LOG: NarrowEntry size 1
121.72/121.85	INVARIANTS: 
121.72/121.85	1: 
121.72/121.85	Quasi-INVARIANTS to narrow Graph: 
121.72/121.85	1: 1 <= nodecount^0 , 
121.72/121.85	Narrowing transition: 
121.72/121.85	<l1, l1, 1 + i^0 <= nodecount^0 /\ 0 <= 0, {i^0 -> 1 + i^0, rest remain the same}>
121.72/121.85	
121.72/121.85	LOG: Narrow transition size 1
121.72/121.85	ENTRIES:
121.72/121.85	<l0, l1, 0 <= 0 /\ nodecount^0 <= 0 /\ i^0 = 1, {all remain the same}>
121.72/121.85	END ENTRIES:
121.72/121.85	GRAPH:
121.72/121.85	<l1, l1, 1 + i^0 <= nodecount^0 /\ 0 <= 0 /\ nodecount^0 <= 0, {i^0 -> 1 + i^0, rest remain the same}>
121.72/121.85	END GRAPH:
121.72/121.85	EXIT: <l1, l3, nodecount^0 <= i^0 /\ nodecount^0 <= 0, {i^0 -> 0, rest remain the same}>
121.72/121.85	POST: 1 <= 0
121.72/121.85	
121.72/121.85	
121.72/121.85	LOG: Try proving POST
121.72/121.85	Solving with 1 template(s).
121.72/121.85	
121.72/121.85	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.85	
121.72/121.85	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.087994s
121.72/121.85	Time used: 0.087705
121.72/121.85	Improving Solution with cost 50 ...
121.72/121.85	
121.72/121.85	LOG: CALL solveNonLinearGetNextSolution
121.72/121.85	
121.72/121.85	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.040155s
121.72/121.85	Time used: 0.04014
121.72/121.85	
121.72/121.85	LOG: SAT solveNonLinear - Elapsed time: 0.128149s
121.72/121.85	Cost: 50; Total time: 0.127845
121.72/121.85	Some transition disabled by a set of invariant(s):
121.72/121.85	Invariant at l1: 1 + nodecount^0 <= i^0
121.72/121.85	Strengthening and disabling transitions...
121.72/121.85	> It's unfeasible. Removing transition: 
121.72/121.85	<l1, l1, 1 + i^0 <= nodecount^0 /\ 0 <= 0 /\ nodecount^0 <= 0, {i^0 -> 1 + i^0, rest remain the same}>
121.72/121.85	Solving with 1 template(s).
121.72/121.85	
121.72/121.85	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.85	
121.72/121.85	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005417s
121.72/121.85	Time used: 0.003231
121.72/121.85	Solving with 2 template(s).
121.72/121.85	
121.72/121.85	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.85	
121.72/121.85	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.071082s
121.72/121.85	Time used: 0.070969
121.72/121.85	Solving with 3 template(s).
121.72/121.85	
121.72/121.85	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.85	
121.72/121.85	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.013888s
121.72/121.85	Time used: 1.0136
121.72/121.85	
121.72/121.85	LOG: Postcondition is not implied - no solution
121.72/121.85	> Postcondition is not implied!
121.72/121.85	
121.72/121.85	LOG: RETURN check - Elapsed time: 1.527491s
121.72/121.85	
121.72/121.85	LOG: NarrowEntry size 1
121.72/121.85	Narrowing transition: 
121.72/121.85	<l3, l3, 2 + i^0 <= nodecount^0, {i^0 -> 1 + i^0, rest remain the same}>
121.72/121.85	
121.72/121.85	LOG: Narrow transition size 1
121.72/121.85	ENTRIES:
121.72/121.85	<l1, l3, 0 <= 0 /\ nodecount^0 <= i^0 /\ nodecount^0 <= 0, {i^0 -> 0, rest remain the same}>
121.72/121.85	END ENTRIES:
121.72/121.85	GRAPH:
121.72/121.85	<l3, l3, 0 <= 0 /\ nodecount^0 <= 0 /\ 2 + i^0 <= nodecount^0, {i^0 -> 1 + i^0, rest remain the same}>
121.72/121.85	END GRAPH:
121.72/121.85	EXIT: <l3, l11, nodecount^0 <= 0 /\ nodecount^0 <= 1 + i^0, {i^0 -> 0, k^0 -> 0, rest remain the same}>
121.72/121.85	POST: 1 <= 0
121.72/121.85	
121.72/121.85	
121.72/121.85	LOG: Try proving POST
121.72/121.85	Solving with 1 template(s).
121.72/121.85	
121.72/121.85	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.85	
121.72/121.85	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.088122s
121.72/121.85	Time used: 0.087834
121.72/121.85	Improving Solution with cost 50 ...
121.72/121.85	
121.72/121.85	LOG: CALL solveNonLinearGetNextSolution
121.72/121.85	
121.72/121.85	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.036833s
121.72/121.85	Time used: 0.036811
121.72/121.85	
121.72/121.85	LOG: SAT solveNonLinear - Elapsed time: 0.124955s
121.72/121.85	Cost: 50; Total time: 0.124645
121.72/121.85	Some transition disabled by a set of invariant(s):
121.72/121.85	Invariant at l3: nodecount^0 <= 1 + i^0
121.72/121.85	Strengthening and disabling transitions...
121.72/121.85	> It's unfeasible. Removing transition: 
121.72/121.85	<l3, l3, 0 <= 0 /\ nodecount^0 <= 0 /\ 2 + i^0 <= nodecount^0, {i^0 -> 1 + i^0, rest remain the same}>
121.72/121.85	Solving with 1 template(s).
121.72/121.85	
121.72/121.85	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.85	
121.72/121.85	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005525s
121.72/121.85	Time used: 0.003275
121.72/121.85	Solving with 2 template(s).
121.72/121.85	
121.72/121.85	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.85	
121.72/121.85	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.069715s
121.72/121.85	Time used: 0.069603
121.72/121.85	Solving with 3 template(s).
121.72/121.85	
121.72/121.85	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.85	
121.72/121.85	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.043147s
121.72/121.85	Time used: 1.04289
121.72/121.85	
121.72/121.85	LOG: Postcondition is not implied - no solution
121.72/121.85	> Postcondition is not implied!
121.72/121.85	
121.72/121.85	LOG: RETURN check - Elapsed time: 2.901689s
121.72/121.85	Cannot prove unreachability
121.72/121.85	
121.72/121.85	Proving non-termination of subgraph 3
121.72/121.85	Transitions:
121.72/121.85	<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}>
121.72/121.85	<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}>
121.72/121.85	<l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0 /\ 0 <= i^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>
121.72/121.85	<l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
121.72/121.85	<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}>
121.72/121.85	<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}>
121.72/121.85	<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}>
121.72/121.85	<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}>
121.72/121.85	<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}>
121.72/121.85	<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}>
121.72/121.85	<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}>
121.72/121.85	<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}>
121.72/121.85	<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}>
121.72/121.85	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.85	<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}>
121.72/121.85	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
121.72/121.85	<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}>
121.72/121.85	<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}>
121.72/121.85	<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}>
121.72/121.85	<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}>
121.72/121.85	<l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
121.72/121.85	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
121.72/121.85	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
121.72/121.85	Variables:
121.72/121.85	edgecount^0, i^0, k^0, nodecount^0, j^0, k_1^0, sourceflag^0, destflag^0, h^0
121.72/121.85	
121.72/121.85	Checking conditional non-termination of SCC {l11, l14, l18, l23}...
121.72/121.85	EXIT TRANSITIONS:
121.72/121.85	<l11, end, edgecount^0 <= 0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ 2 + k^0 = nodecount^0, {all remain the same}>
121.72/121.85	<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}>
121.72/121.85	<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}>
121.72/121.85	<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}>
121.72/121.85	<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}>
121.72/121.85	
121.72/121.85	Solving with 1 template(s).
121.72/121.85	
121.72/121.85	LOG: CALL solveNonLinearGetFirstSolution
121.72/121.85	
121.72/121.85	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.531026s
121.72/121.85	Time used: 0.529122
121.72/121.85	Improving Solution with cost 1 ...
121.72/121.85	
121.72/121.85	LOG: CALL solveNonLinearGetNextSolution
121.72/121.85	
121.72/121.85	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.114139s
121.72/121.85	Time used: 0.114125
121.72/121.85	
121.72/121.85	LOG: SAT solveNonLinear - Elapsed time: 0.645165s
121.72/121.85	Cost: 1; Total time: 0.643247
121.72/121.85	Failed at location 11: nodecount^0 <= k^0
121.72/121.85	Before Improving: 
121.72/121.85	Quasi-invariant at l11: nodecount^0 <= k^0
121.72/121.85	Quasi-invariant at l14: nodecount^0 <= 1 + k^0
121.72/121.85	Quasi-invariant at l18: nodecount^0 <= 1 + k^0
121.72/121.85	Quasi-invariant at l23: nodecount^0 <= 1 + k^0
121.72/121.85	Optimizing invariants...
121.72/121.85	
121.72/121.85	LOG: CALL solveLinear
121.72/121.85	
121.72/121.85	LOG: RETURN solveLinear - Elapsed time: 0.021334s
121.72/121.85	Remaining time after improvement: 0.985072
121.72/121.85	Non-termination implied by a set of quasi-invariant(s):
121.72/121.85	Quasi-invariant at l11: nodecount^0 <= k^0
121.72/121.85	Quasi-invariant at l14: nodecount^0 <= 1 + k^0
121.72/121.85	Quasi-invariant at l18: nodecount^0 <= 1 + k^0
121.72/121.85	Quasi-invariant at l23: nodecount^0 <= 1 + k^0
121.72/121.85	
121.72/121.85	Strengthening and disabling EXIT transitions...
121.72/121.85	Closed exits from l11: 1
121.72/121.85	Closed exits from l14: 4
121.72/121.85	
121.72/121.85	Strengthening and disabling transitions...
121.72/121.85	
121.72/121.85	LOG: CALL solverLinear in Graph for feasibility
121.72/121.85	
121.72/121.85	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.85	Strengthening transition (result): 
121.72/121.85	<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}>
121.72/121.85	
121.72/121.85	LOG: CALL solverLinear in Graph for feasibility
121.72/121.85	
121.72/121.85	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.85	It's unfeasible. Removing transition: 
121.72/121.85	<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}>
121.72/121.85	
121.72/121.85	LOG: CALL solverLinear in Graph for feasibility
121.72/121.85	
121.72/121.85	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.85	Strengthening transition (result): 
121.72/121.85	<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}>
121.72/121.85	
121.72/121.85	LOG: CALL solverLinear in Graph for feasibility
121.72/121.85	
121.72/121.85	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.85	Strengthening transition (result): 
121.72/121.85	<l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= i^0 /\ nodecount^0 <= k^0, {i^0 -> 1 + i^0, rest remain the same}>
121.72/121.85	
121.72/121.85	LOG: CALL solverLinear in Graph for feasibility
121.72/121.85	
121.72/121.85	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.85	Strengthening transition (result): 
121.72/121.85	<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}>
121.72/121.85	
121.72/121.85	LOG: CALL solverLinear in Graph for feasibility
121.72/121.85	
121.72/121.85	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.85	It's unfeasible. Removing transition: 
121.72/121.85	<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}>
121.72/121.85	
121.72/121.85	LOG: CALL solverLinear in Graph for feasibility
121.72/121.85	
121.72/121.85	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.85	Strengthening transition (result): 
121.72/121.85	<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}>
121.72/121.85	
121.72/121.85	LOG: CALL solverLinear in Graph for feasibility
121.72/121.85	
121.72/121.85	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.85	Strengthening transition (result): 
121.72/121.85	<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}>
121.72/121.85	
121.72/121.85	LOG: CALL solverLinear in Graph for feasibility
121.72/121.85	
121.72/121.85	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.85	It's unfeasible. Removing transition: 
121.72/121.85	<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}>
121.72/121.85	
121.72/121.85	LOG: CALL solverLinear in Graph for feasibility
121.72/121.85	
121.72/121.85	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.85	Strengthening transition (result): 
121.72/121.85	<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}>
121.72/121.85	
121.72/121.85	LOG: CALL solverLinear in Graph for feasibility
121.72/121.85	
121.72/121.85	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.85	Strengthening transition (result): 
121.72/121.85	<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}>
121.72/121.85	
121.72/121.85	LOG: CALL solverLinear in Graph for feasibility
121.72/121.85	
121.72/121.85	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.85	It's unfeasible. Removing transition: 
121.72/121.85	<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}>
121.72/121.85	
121.72/121.85	LOG: CALL solverLinear in Graph for feasibility
121.72/121.85	
121.72/121.85	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.85	Strengthening transition (result): 
121.72/121.85	<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}>
121.72/121.85	
121.72/121.85	LOG: CALL solverLinear in Graph for feasibility
121.72/121.85	
121.72/121.85	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.85	Strengthening transition (result): 
121.72/121.85	<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}>
121.72/121.85	
121.72/121.85	LOG: CALL solverLinear in Graph for feasibility
121.72/121.85	
121.72/121.85	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.85	Strengthening transition (result): 
121.72/121.85	<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}>
121.72/121.85	
121.72/121.85	LOG: CALL solverLinear in Graph for feasibility
121.72/121.85	
121.72/121.85	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.85	Strengthening transition (result): 
121.72/121.85	<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}>
121.72/121.85	
121.72/121.85	LOG: CALL solverLinear in Graph for feasibility
121.72/121.85	
121.72/121.85	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.85	Strengthening transition (result): 
121.72/121.85	<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}>
121.72/121.85	
121.72/121.85	LOG: CALL solverLinear in Graph for feasibility
121.72/121.85	
121.72/121.85	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.85	Strengthening transition (result): 
121.72/121.85	<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}>
121.72/121.85	
121.72/121.85	LOG: CALL solverLinear in Graph for feasibility
121.72/121.85	
121.72/121.85	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.85	Strengthening transition (result): 
121.72/121.85	<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}>
121.72/121.85	
121.72/121.85	LOG: CALL solverLinear in Graph for feasibility
121.72/121.85	
121.72/121.85	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.85	Strengthening transition (result): 
121.72/121.85	<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}>
121.72/121.85	
121.72/121.85	LOG: CALL solverLinear in Graph for feasibility
121.72/121.85	
121.72/121.85	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.85	Strengthening transition (result): 
121.72/121.85	<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}>
121.72/121.85	
121.72/121.85	LOG: CALL solverLinear in Graph for feasibility
121.72/121.85	
121.72/121.85	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.85	Strengthening transition (result): 
121.72/121.85	<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}>
121.72/121.85	
121.72/121.85	LOG: CALL solverLinear in Graph for feasibility
121.72/121.85	
121.72/121.85	LOG: RETURN solveLinear in Graph for feasibility
121.72/121.85	Strengthening transition (result): 
121.72/121.85	<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}>
121.72/121.85	
121.72/121.85	Calling reachability with...
121.72/121.85	Transition: <l11, end, true, {all remain the same}>
121.72/121.85	Conditions: nodecount^0 <= k^0, 
121.72/121.85	Transition: <l11, end, true, {all remain the same}>
121.72/121.85	Conditions: nodecount^0 <= k^0, 
121.72/121.85	OPEN EXITS: 
121.72/121.85	<l11, end, nodecount^0 <= k^0, {all remain the same}>
121.72/121.85	<l11, end, nodecount^0 <= k^0, {all remain the same}>
121.72/121.85	
121.72/121.85	--- Reachability graph ---
121.72/121.85	> Graph without transitions.
121.72/121.85	
121.72/121.85	Calling reachability with...
121.72/121.85	Transition: <l3, l11, nodecount^0 <= 0 /\ nodecount^0 <= 1 + i^0, {i^0 -> 0, k^0 -> 0, rest remain the same}>
121.72/121.85	Conditions: nodecount^0 <= k^0, 
121.72/121.85	Transition: <l3, l11, nodecount^0 <= 1 + i^0 /\ 2 <= nodecount^0, {i^0 -> 0, k^0 -> 0, rest remain the same}>
121.72/121.85	Conditions: nodecount^0 <= k^0, 
121.72/121.85	Transition: <l3, l11, nodecount^0 <= 0 /\ nodecount^0 <= 1 + i^0, {i^0 -> 0, k^0 -> 0, rest remain the same}>
121.72/121.85	Conditions: nodecount^0 <= k^0, 
121.72/121.85	Transition: <l3, l11, nodecount^0 <= 1 + i^0 /\ 2 <= nodecount^0, {i^0 -> 0, k^0 -> 0, rest remain the same}>
121.72/121.85	Conditions: nodecount^0 <= k^0, 
121.72/121.85	OPEN EXITS: 
121.72/121.85	<l3, l11, nodecount^0 <= 1 + i^0, {i^0 -> 0, k^0 -> 0, rest remain the same}> (condsUp: nodecount^0 <= 0, nodecount^0 <= 0)
121.72/121.85	<l3, l11, nodecount^0 <= 1 + i^0, {i^0 -> 0, k^0 -> 0, rest remain the same}> (condsUp: nodecount^0 <= 0, nodecount^0 <= 0)
121.72/121.85	
121.72/121.85	--- Reachability graph ---
121.72/121.85	> Graph without transitions.
121.72/121.85	
121.72/121.85	Calling reachability with...
121.72/121.85	Transition: <l1, l3, nodecount^0 <= i^0, {i^0 -> 0, rest remain the same}>
121.72/121.85	Conditions: nodecount^0 <= 1 + i^0, nodecount^0 <= 0, nodecount^0 <= 0, 
121.72/121.85	Transition: <l1, l3, nodecount^0 <= i^0, {i^0 -> 0, rest remain the same}>
121.72/121.85	Conditions: nodecount^0 <= 1 + i^0, nodecount^0 <= 0, nodecount^0 <= 0, 
121.72/121.85	OPEN EXITS: 
121.72/121.85	<l1, l3, nodecount^0 <= i^0, {i^0 -> 0, rest remain the same}> (condsUp: nodecount^0 <= 1, nodecount^0 <= 0, nodecount^0 <= 0)
121.72/121.85	<l1, l3, nodecount^0 <= i^0, {i^0 -> 0, rest remain the same}> (condsUp: nodecount^0 <= 1, nodecount^0 <= 0, nodecount^0 <= 0)
121.72/121.85	
121.72/121.85	--- Reachability graph ---
121.72/121.85	> Graph without transitions.
121.72/121.85	
121.72/121.85	Calling reachability with...
121.72/121.85	Transition: <l0, l1, i^0 = 1, {all remain the same}>
121.72/121.85	Conditions: nodecount^0 <= i^0, nodecount^0 <= 1, nodecount^0 <= 0, nodecount^0 <= 0, 
121.72/121.85	Transition: <l0, l1, i^0 = 1, {all remain the same}>
121.72/121.85	Conditions: nodecount^0 <= i^0, nodecount^0 <= 1, nodecount^0 <= 0, nodecount^0 <= 0, 
121.72/121.85	OPEN EXITS: 
121.72/121.85	<l0, l1, nodecount^0 <= i^0 /\ nodecount^0 <= 0 /\ i^0 = 1, {all remain the same}>
121.72/121.85	<l0, l1, nodecount^0 <= i^0 /\ nodecount^0 <= 0 /\ i^0 = 1, {all remain the same}>
121.72/121.85	
121.72/121.85	> Conditions are reachable!
121.72/121.85	
121.72/121.85	Program does NOT terminate
121.72/121.85	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
121.72/121.85	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
121.72/121.85	EOF