0.00/0.32	YES
0.00/0.32	
0.00/0.33	Solver Timeout: 4
0.00/0.33	Global Timeout: 300
0.00/0.33	No parsing errors!
0.00/0.33	Init Location: 0
0.00/0.33	Transitions:
0.00/0.33	<l0, l27, true>
0.00/0.33	<l1, l2, true>
0.00/0.33	<l3, l1, true, par{tmp___4^0 -> 0}>
0.00/0.33	<l4, l1, ((0 + bSorted^0) <= 0) /\ (0 <= (0 + bSorted^0)), par{tmp___4^0 -> 1}>
0.00/0.33	<l4, l3, (1 <= (0 + bSorted^0))>
0.00/0.33	<l4, l3, ((1 + bSorted^0) <= 0)>
0.00/0.33	<l5, l1, ((0 + bDomain^0) <= 0) /\ (0 <= (0 + bDomain^0)), par{tmp___4^0 -> 1}>
0.00/0.33	<l5, l4, (1 <= (0 + bDomain^0))>
0.00/0.33	<l5, l4, ((1 + bDomain^0) <= 0)>
0.00/0.33	<l6, l7, true, par{bSorted^0 -> (0 + tmp___3^0), ni^0 -> (1 + ni^0)}>
0.00/0.33	<l8, l6, true, par{tmp___3^0 -> 1}>
0.00/0.33	<l8, l6, true, par{tmp___3^0 -> 0}>
0.00/0.33	<l9, l6, ((0 + bSorted^0) <= 0) /\ (0 <= (0 + bSorted^0)), par{tmp___3^0 -> 0}>
0.00/0.33	<l9, l8, (1 <= (0 + bSorted^0))>
0.00/0.33	<l9, l8, ((1 + bSorted^0) <= 0)>
0.00/0.33	<l10, l5, ((~(1) + nDim^0) <= (0 + ni^0))>
0.00/0.33	<l10, l9, ((1 + ni^0) <= (~(1) + nDim^0))>
0.00/0.33	<l11, l12, true>
0.00/0.33	<l13, l14, true, par{bDomain^0 -> (0 + tmp___2^0), ni^0 -> (1 + ni^0)}>
0.00/0.33	<l15, l13, true, par{tmp___2^0 -> 1}>
0.00/0.33	<l16, l13, ((0 + bExists^0) <= 0) /\ (0 <= (0 + bExists^0)), par{tmp___2^0 -> 0}>
0.00/0.33	<l16, l15, (1 <= (0 + bExists^0))>
0.00/0.33	<l16, l15, ((1 + bExists^0) <= 0)>
0.00/0.33	<l17, l13, ((0 + bDomain^0) <= 0) /\ (0 <= (0 + bDomain^0)), par{tmp___2^0 -> 0}>
0.00/0.33	<l17, l16, (1 <= (0 + bDomain^0))>
0.00/0.33	<l17, l16, ((1 + bDomain^0) <= 0)>
0.00/0.33	<l18, l19, true, par{tmp___1^0 -> 0}>
0.00/0.33	<l14, l20, true>
0.00/0.33	<l21, l18, true>
0.00/0.33	<l21, l19, true, par{tmp___1^0 -> 1}>
0.00/0.33	<l21, l18, true>
0.00/0.33	<l19, l22, true, par{bExists^0 -> (0 + tmp___1^0), nj^0 -> (1 + nj^0)}>
0.00/0.33	<l23, l19, true, par{tmp___1^0 -> 1}>
0.00/0.33	<l24, l21, ((0 + bExists^0) <= 0) /\ (0 <= (0 + bExists^0))>
0.00/0.33	<l24, l23, (1 <= (0 + bExists^0))>
0.00/0.33	<l24, l23, ((1 + bExists^0) <= 0)>
0.00/0.33	<l25, l17, ((0 + nDim^0) <= (0 + nj^0))>
0.00/0.33	<l25, l24, ((1 + nj^0) <= (0 + nDim^0))>
0.00/0.33	<l22, l25, true>
0.00/0.33	<l20, l7, ((0 + nDim^0) <= (0 + ni^0)), par{ni^0 -> 0}>
0.00/0.33	<l20, l22, ((1 + ni^0) <= (0 + nDim^0)), par{bExists^0 -> 0, nj^0 -> 0}>
0.00/0.33	<l12, l14, ((0 + nDim^0) <= (0 + ni^0)), par{ni^0 -> 0}>
0.00/0.33	<l12, l11, ((1 + ni^0) <= (0 + nDim^0)), par{ni^0 -> (1 + ni^0)}>
0.00/0.33	<l7, l10, true>
0.00/0.33	<l26, l11, (undef523 = undef523) /\ (undef524 = undef524), par{bDomain^0 -> 1, bSorted^0 -> 1, nDim^0 -> 10, ni^0 -> 0, tmp^0 -> undef523, tmp___0^0 -> undef524}>
0.00/0.33	<l27, l26, true>
0.00/0.33	
0.00/0.33	Fresh variables:
0.00/0.33	undef523, undef524, 
0.00/0.33	
0.00/0.33	Undef variables:
0.00/0.33	undef523, undef524, 
0.00/0.33	
0.00/0.33	Abstraction variables:
0.00/0.33	
0.00/0.33	Exit nodes:
0.00/0.33	
0.00/0.33	Accepting locations:
0.00/0.33	
0.00/0.33	Asserts:
0.00/0.33	
0.00/0.33	Preprocessed LLVMGraph
0.00/0.33	Init Location: 0
0.00/0.33	Transitions:
0.00/0.33	<l0, l11, (bDomain^0 = 1) /\ (bSorted^0 = 1) /\ (10 = 10) /\ (ni^0 = 0) /\ (undef523 = undef523) /\ (undef524 = undef524)>
0.00/0.33	<l7, l2, ((~(1) + 10) <= (0 + ni^0)) /\ ((0 + bDomain^0) <= 0) /\ (0 <= (0 + bDomain^0))>
0.00/0.33	<l7, l2, ((~(1) + 10) <= (0 + ni^0)) /\ (1 <= (0 + bDomain^0)) /\ ((0 + bSorted^0) <= 0) /\ (0 <= (0 + bSorted^0))>
0.00/0.33	<l7, l2, ((~(1) + 10) <= (0 + ni^0)) /\ (1 <= (0 + bDomain^0)) /\ (1 <= (0 + bSorted^0))>
0.00/0.33	<l7, l2, ((~(1) + 10) <= (0 + ni^0)) /\ (1 <= (0 + bDomain^0)) /\ ((1 + bSorted^0) <= 0)>
0.00/0.33	<l7, l2, ((~(1) + 10) <= (0 + ni^0)) /\ ((1 + bDomain^0) <= 0) /\ ((0 + bSorted^0) <= 0) /\ (0 <= (0 + bSorted^0))>
0.00/0.33	<l7, l2, ((~(1) + 10) <= (0 + ni^0)) /\ ((1 + bDomain^0) <= 0) /\ (1 <= (0 + bSorted^0))>
0.00/0.33	<l7, l2, ((~(1) + 10) <= (0 + ni^0)) /\ ((1 + bDomain^0) <= 0) /\ ((1 + bSorted^0) <= 0)>
0.00/0.33	<l7, l7, ((1 + ni^0) <= (~(1) + 10)) /\ ((0 + bSorted^0) <= 0) /\ (0 <= (0 + bSorted^0)), par{bSorted^0 -> (0 + 0), ni^0 -> (1 + ni^0)}>
0.00/0.33	<l7, l7, ((1 + ni^0) <= (~(1) + 10)) /\ (1 <= (0 + bSorted^0)), par{bSorted^0 -> (0 + 1), ni^0 -> (1 + ni^0)}>
0.00/0.33	<l7, l7, ((1 + ni^0) <= (~(1) + 10)) /\ (1 <= (0 + bSorted^0)), par{bSorted^0 -> (0 + 0), ni^0 -> (1 + ni^0)}>
0.00/0.33	<l7, l7, ((1 + ni^0) <= (~(1) + 10)) /\ ((1 + bSorted^0) <= 0), par{bSorted^0 -> (0 + 1), ni^0 -> (1 + ni^0)}>
0.00/0.33	<l7, l7, ((1 + ni^0) <= (~(1) + 10)) /\ ((1 + bSorted^0) <= 0), par{bSorted^0 -> (0 + 0), ni^0 -> (1 + ni^0)}>
0.00/0.33	<l11, l22, ((0 + 10) <= (0 + ni^0)) /\ ((1 + 0) <= (0 + 10)), par{bExists^0 -> 0, ni^0 -> 0, nj^0 -> 0}>
0.00/0.33	<l11, l11, ((1 + ni^0) <= (0 + 10)), par{ni^0 -> (1 + ni^0)}>
0.00/0.33	<l22, l7, ((0 + 10) <= (0 + nj^0)) /\ ((0 + bDomain^0) <= 0) /\ (0 <= (0 + bDomain^0)) /\ ((0 + 10) <= (0 + (1 + ni^0))), par{bDomain^0 -> (0 + 0), ni^0 -> 0}>
0.00/0.33	<l22, l22, ((0 + 10) <= (0 + nj^0)) /\ ((0 + bDomain^0) <= 0) /\ (0 <= (0 + bDomain^0)) /\ ((1 + (1 + ni^0)) <= (0 + 10)), par{bDomain^0 -> (0 + 0), bExists^0 -> 0, ni^0 -> (1 + ni^0), nj^0 -> 0}>
0.00/0.33	<l22, l7, ((0 + 10) <= (0 + nj^0)) /\ (1 <= (0 + bDomain^0)) /\ ((0 + bExists^0) <= 0) /\ (0 <= (0 + bExists^0)) /\ ((0 + 10) <= (0 + (1 + ni^0))), par{bDomain^0 -> (0 + 0), ni^0 -> 0}>
0.00/0.33	<l22, l22, ((0 + 10) <= (0 + nj^0)) /\ (1 <= (0 + bDomain^0)) /\ ((0 + bExists^0) <= 0) /\ (0 <= (0 + bExists^0)) /\ ((1 + (1 + ni^0)) <= (0 + 10)), par{bDomain^0 -> (0 + 0), bExists^0 -> 0, ni^0 -> (1 + ni^0), nj^0 -> 0}>
0.00/0.33	<l22, l7, ((0 + 10) <= (0 + nj^0)) /\ (1 <= (0 + bDomain^0)) /\ (1 <= (0 + bExists^0)) /\ ((0 + 10) <= (0 + (1 + ni^0))), par{bDomain^0 -> (0 + 1), ni^0 -> 0}>
0.00/0.33	<l22, l22, ((0 + 10) <= (0 + nj^0)) /\ (1 <= (0 + bDomain^0)) /\ (1 <= (0 + bExists^0)) /\ ((1 + (1 + ni^0)) <= (0 + 10)), par{bDomain^0 -> (0 + 1), bExists^0 -> 0, ni^0 -> (1 + ni^0), nj^0 -> 0}>
0.00/0.33	<l22, l7, ((0 + 10) <= (0 + nj^0)) /\ (1 <= (0 + bDomain^0)) /\ ((1 + bExists^0) <= 0) /\ ((0 + 10) <= (0 + (1 + ni^0))), par{bDomain^0 -> (0 + 1), ni^0 -> 0}>
0.00/0.33	<l22, l22, ((0 + 10) <= (0 + nj^0)) /\ (1 <= (0 + bDomain^0)) /\ ((1 + bExists^0) <= 0) /\ ((1 + (1 + ni^0)) <= (0 + 10)), par{bDomain^0 -> (0 + 1), bExists^0 -> 0, ni^0 -> (1 + ni^0), nj^0 -> 0}>
0.00/0.33	<l22, l7, ((0 + 10) <= (0 + nj^0)) /\ ((1 + bDomain^0) <= 0) /\ ((0 + bExists^0) <= 0) /\ (0 <= (0 + bExists^0)) /\ ((0 + 10) <= (0 + (1 + ni^0))), par{bDomain^0 -> (0 + 0), ni^0 -> 0}>
0.00/0.33	<l22, l22, ((0 + 10) <= (0 + nj^0)) /\ ((1 + bDomain^0) <= 0) /\ ((0 + bExists^0) <= 0) /\ (0 <= (0 + bExists^0)) /\ ((1 + (1 + ni^0)) <= (0 + 10)), par{bDomain^0 -> (0 + 0), bExists^0 -> 0, ni^0 -> (1 + ni^0), nj^0 -> 0}>
0.00/0.33	<l22, l7, ((0 + 10) <= (0 + nj^0)) /\ ((1 + bDomain^0) <= 0) /\ (1 <= (0 + bExists^0)) /\ ((0 + 10) <= (0 + (1 + ni^0))), par{bDomain^0 -> (0 + 1), ni^0 -> 0}>
0.00/0.33	<l22, l22, ((0 + 10) <= (0 + nj^0)) /\ ((1 + bDomain^0) <= 0) /\ (1 <= (0 + bExists^0)) /\ ((1 + (1 + ni^0)) <= (0 + 10)), par{bDomain^0 -> (0 + 1), bExists^0 -> 0, ni^0 -> (1 + ni^0), nj^0 -> 0}>
0.00/0.33	<l22, l7, ((0 + 10) <= (0 + nj^0)) /\ ((1 + bDomain^0) <= 0) /\ ((1 + bExists^0) <= 0) /\ ((0 + 10) <= (0 + (1 + ni^0))), par{bDomain^0 -> (0 + 1), ni^0 -> 0}>
0.00/0.33	<l22, l22, ((0 + 10) <= (0 + nj^0)) /\ ((1 + bDomain^0) <= 0) /\ ((1 + bExists^0) <= 0) /\ ((1 + (1 + ni^0)) <= (0 + 10)), par{bDomain^0 -> (0 + 1), bExists^0 -> 0, ni^0 -> (1 + ni^0), nj^0 -> 0}>
0.00/0.33	<l22, l22, ((1 + nj^0) <= (0 + 10)) /\ ((0 + bExists^0) <= 0) /\ (0 <= (0 + bExists^0)), par{bExists^0 -> (0 + 0), nj^0 -> (1 + nj^0)}>
0.00/0.33	<l22, l22, ((1 + nj^0) <= (0 + 10)) /\ ((0 + bExists^0) <= 0) /\ (0 <= (0 + bExists^0)), par{bExists^0 -> (0 + 1), nj^0 -> (1 + nj^0)}>
0.00/0.33	<l22, l22, ((1 + nj^0) <= (0 + 10)) /\ ((0 + bExists^0) <= 0) /\ (0 <= (0 + bExists^0)), par{bExists^0 -> (0 + 0), nj^0 -> (1 + nj^0)}>
0.00/0.33	<l22, l22, ((1 + nj^0) <= (0 + 10)) /\ (1 <= (0 + bExists^0)), par{bExists^0 -> (0 + 1), nj^0 -> (1 + nj^0)}>
0.00/0.33	<l22, l22, ((1 + nj^0) <= (0 + 10)) /\ ((1 + bExists^0) <= 0), par{bExists^0 -> (0 + 1), nj^0 -> (1 + nj^0)}>
0.00/0.33	
0.00/0.33	Fresh variables:
0.00/0.33	undef523, undef524, 
0.00/0.33	
0.00/0.33	Undef variables:
0.00/0.33	undef523, undef524, 
0.00/0.33	
0.00/0.33	Abstraction variables:
0.00/0.33	
0.00/0.33	Exit nodes:
0.00/0.33	
0.00/0.33	Accepting locations:
0.00/0.33	
0.00/0.33	Asserts:
0.00/0.33	
0.00/0.33	*************************************************************
0.00/0.33	*******************************************************************************************
0.00/0.33	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.33	*******************************************************************************************
0.00/0.33	
0.00/0.33	Init Location: 0
0.00/0.33	Graph 0:
0.00/0.33	Transitions:
0.00/0.33	Variables:
0.00/0.33	
0.00/0.33	Graph 1:
0.00/0.33	Transitions:
0.00/0.33	<l11, l11, ni^0 <= 9, {ni^0 -> 1 + ni^0, rest remain the same}>
0.00/0.33	Variables:
0.00/0.33	ni^0
0.00/0.33	
0.00/0.33	Graph 2:
0.00/0.33	Transitions:
0.00/0.33	<l22, l22, 10 <= nj^0 /\ ni^0 <= 8 /\ bDomain^0 = 0, {bDomain^0 -> 0, bExists^0 -> 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}>
0.00/0.33	<l22, l22, 1 <= bDomain^0 /\ 10 <= nj^0 /\ ni^0 <= 8 /\ bExists^0 = 0, {bDomain^0 -> 0, bExists^0 -> 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}>
0.00/0.33	<l22, l22, 1 <= bDomain^0 /\ 1 <= bExists^0 /\ 10 <= nj^0 /\ ni^0 <= 8, {bDomain^0 -> 1, bExists^0 -> 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}>
0.00/0.33	<l22, l22, 1 <= bDomain^0 /\ 1 + bExists^0 <= 0 /\ 10 <= nj^0 /\ ni^0 <= 8, {bDomain^0 -> 1, bExists^0 -> 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}>
0.00/0.33	<l22, l22, 1 + bDomain^0 <= 0 /\ 10 <= nj^0 /\ ni^0 <= 8 /\ bExists^0 = 0, {bDomain^0 -> 0, bExists^0 -> 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}>
0.00/0.33	<l22, l22, 1 + bDomain^0 <= 0 /\ 1 <= bExists^0 /\ 10 <= nj^0 /\ ni^0 <= 8, {bDomain^0 -> 1, bExists^0 -> 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}>
0.00/0.33	<l22, l22, 1 + bDomain^0 <= 0 /\ 1 + bExists^0 <= 0 /\ 10 <= nj^0 /\ ni^0 <= 8, {bDomain^0 -> 1, bExists^0 -> 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}>
0.00/0.33	<l22, l22, nj^0 <= 9 /\ bExists^0 = 0, {bExists^0 -> 0, nj^0 -> 1 + nj^0, rest remain the same}>
0.00/0.33	<l22, l22, nj^0 <= 9 /\ bExists^0 = 0, {bExists^0 -> 1, nj^0 -> 1 + nj^0, rest remain the same}>
0.00/0.33	<l22, l22, nj^0 <= 9 /\ bExists^0 = 0, {bExists^0 -> 0, nj^0 -> 1 + nj^0, rest remain the same}>
0.00/0.33	<l22, l22, 1 <= bExists^0 /\ nj^0 <= 9, {bExists^0 -> 1, nj^0 -> 1 + nj^0, rest remain the same}>
0.00/0.33	<l22, l22, 1 + bExists^0 <= 0 /\ nj^0 <= 9, {bExists^0 -> 1, nj^0 -> 1 + nj^0, rest remain the same}>
0.00/0.33	Variables:
0.00/0.33	bDomain^0, ni^0, nj^0, bExists^0
0.00/0.33	
0.00/0.33	Graph 3:
0.00/0.33	Transitions:
0.00/0.33	<l7, l7, ni^0 <= 8 /\ bSorted^0 = 0, {bSorted^0 -> 0, ni^0 -> 1 + ni^0, rest remain the same}>
0.00/0.33	<l7, l7, 1 <= bSorted^0 /\ ni^0 <= 8, {bSorted^0 -> 1, ni^0 -> 1 + ni^0, rest remain the same}>
0.00/0.33	<l7, l7, 1 <= bSorted^0 /\ ni^0 <= 8, {bSorted^0 -> 0, ni^0 -> 1 + ni^0, rest remain the same}>
0.00/0.33	<l7, l7, 1 + bSorted^0 <= 0 /\ ni^0 <= 8, {bSorted^0 -> 1, ni^0 -> 1 + ni^0, rest remain the same}>
0.00/0.33	<l7, l7, 1 + bSorted^0 <= 0 /\ ni^0 <= 8, {bSorted^0 -> 0, ni^0 -> 1 + ni^0, rest remain the same}>
0.00/0.33	Variables:
0.00/0.33	bSorted^0, ni^0
0.00/0.33	
0.00/0.33	Graph 4:
0.00/0.33	Transitions:
0.00/0.33	Variables:
0.00/0.33	
0.00/0.33	Precedence: 
0.00/0.33	Graph 0
0.00/0.33	
0.00/0.33	Graph 1
0.00/0.33	<l0, l11, ni^0 = 0 /\ bDomain^0 = 1 /\ bSorted^0 = 1, {all remain the same}>
0.00/0.33	
0.00/0.33	Graph 2
0.00/0.33	<l11, l22, 10 <= ni^0, {bExists^0 -> 0, ni^0 -> 0, nj^0 -> 0, rest remain the same}>
0.00/0.33	
0.00/0.33	Graph 3
0.00/0.33	<l22, l7, 10 <= nj^0 /\ 9 <= ni^0 /\ bDomain^0 = 0, {bDomain^0 -> 0, ni^0 -> 0, rest remain the same}>
0.00/0.33	<l22, l7, 1 <= bDomain^0 /\ 10 <= nj^0 /\ 9 <= ni^0 /\ bExists^0 = 0, {bDomain^0 -> 0, ni^0 -> 0, rest remain the same}>
0.00/0.33	<l22, l7, 1 <= bDomain^0 /\ 1 <= bExists^0 /\ 10 <= nj^0 /\ 9 <= ni^0, {bDomain^0 -> 1, ni^0 -> 0, rest remain the same}>
0.00/0.33	<l22, l7, 1 <= bDomain^0 /\ 1 + bExists^0 <= 0 /\ 10 <= nj^0 /\ 9 <= ni^0, {bDomain^0 -> 1, ni^0 -> 0, rest remain the same}>
0.00/0.33	<l22, l7, 1 + bDomain^0 <= 0 /\ 10 <= nj^0 /\ 9 <= ni^0 /\ bExists^0 = 0, {bDomain^0 -> 0, ni^0 -> 0, rest remain the same}>
0.00/0.33	<l22, l7, 1 + bDomain^0 <= 0 /\ 1 <= bExists^0 /\ 10 <= nj^0 /\ 9 <= ni^0, {bDomain^0 -> 1, ni^0 -> 0, rest remain the same}>
0.00/0.33	<l22, l7, 1 + bDomain^0 <= 0 /\ 1 + bExists^0 <= 0 /\ 10 <= nj^0 /\ 9 <= ni^0, {bDomain^0 -> 1, ni^0 -> 0, rest remain the same}>
0.00/0.33	
0.00/0.33	Graph 4
0.00/0.33	<l7, l2, 9 <= ni^0 /\ bDomain^0 = 0, {all remain the same}>
0.00/0.33	<l7, l2, 1 <= bDomain^0 /\ 9 <= ni^0 /\ bSorted^0 = 0, {all remain the same}>
0.00/0.33	<l7, l2, 1 <= bDomain^0 /\ 1 <= bSorted^0 /\ 9 <= ni^0, {all remain the same}>
0.00/0.33	<l7, l2, 1 <= bDomain^0 /\ 1 + bSorted^0 <= 0 /\ 9 <= ni^0, {all remain the same}>
0.00/0.33	<l7, l2, 1 + bDomain^0 <= 0 /\ 9 <= ni^0 /\ bSorted^0 = 0, {all remain the same}>
0.00/0.33	<l7, l2, 1 + bDomain^0 <= 0 /\ 1 <= bSorted^0 /\ 9 <= ni^0, {all remain the same}>
0.00/0.33	<l7, l2, 1 + bDomain^0 <= 0 /\ 1 + bSorted^0 <= 0 /\ 9 <= ni^0, {all remain the same}>
0.00/0.33	
0.00/0.33	Map Locations to Subgraph:
0.00/0.33	( 0 , 0 )
0.00/0.33	( 2 , 4 )
0.00/0.33	( 7 , 3 )
0.00/0.33	( 11 , 1 )
0.00/0.33	( 22 , 2 )
0.00/0.33	
0.00/0.33	*******************************************************************************************
0.00/0.33	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.33	*******************************************************************************************
0.00/0.33	
0.00/0.33	Proving termination of subgraph 0
0.00/0.33	Proving termination of subgraph 1
0.00/0.33	Checking unfeasibility...
0.00/0.33	Time used: 0.001459
0.00/0.33	
0.00/0.33	Checking conditional termination of SCC {l11}...
0.00/0.33	
0.00/0.33	LOG: CALL solveLinear
0.00/0.33	
0.00/0.33	LOG: RETURN solveLinear - Elapsed time: 0.000841s
0.00/0.33	Ranking function: 9 - ni^0
0.00/0.33	New Graphs: 
0.00/0.33	Proving termination of subgraph 2
0.00/0.33	Checking unfeasibility...
0.00/0.33	Time used: 0.095289
0.00/0.33	Some transition disabled by a set of invariant(s):
0.00/0.33	Invariant at l22: 0 <= bExists^0
0.00/0.33	
0.00/0.33	Strengthening and disabling transitions...
0.00/0.33	> It's unfeasible. Removing transition: 
0.00/0.33	<l22, l22, 1 + bDomain^0 <= 0 /\ 1 + bExists^0 <= 0 /\ 10 <= nj^0 /\ ni^0 <= 8, {bDomain^0 -> 1, bExists^0 -> 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}>
0.00/0.33	
0.00/0.33	LOG: CALL solverLinear in Graph for feasibility
0.00/0.33	
0.00/0.33	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.33	Strengthening transition (result): 
0.00/0.33	<l22, l22, 0 <= bExists^0 /\ 10 <= nj^0 /\ ni^0 <= 8 /\ bDomain^0 = 0, {bDomain^0 -> 0, bExists^0 -> 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}>
0.00/0.33	
0.00/0.33	LOG: CALL solverLinear in Graph for feasibility
0.00/0.33	
0.00/0.33	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.33	Strengthening transition (result): 
0.00/0.33	<l22, l22, 1 <= bDomain^0 /\ 10 <= nj^0 /\ ni^0 <= 8 /\ bExists^0 = 0, {bDomain^0 -> 0, bExists^0 -> 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}>
0.00/0.33	
0.00/0.33	LOG: CALL solverLinear in Graph for feasibility
0.00/0.33	
0.00/0.33	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.33	Strengthening transition (result): 
0.00/0.33	<l22, l22, 1 <= bDomain^0 /\ 1 <= bExists^0 /\ 10 <= nj^0 /\ ni^0 <= 8, {bDomain^0 -> 1, bExists^0 -> 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}>
0.00/0.33	
0.00/0.33	LOG: CALL solverLinear in Graph for feasibility
0.00/0.33	
0.00/0.33	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.33	It's unfeasible. Removing transition: 
0.00/0.33	<l22, l22, 1 <= bDomain^0 /\ 1 + bExists^0 <= 0 /\ 10 <= nj^0 /\ ni^0 <= 8, {bDomain^0 -> 1, bExists^0 -> 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}>
0.00/0.33	
0.00/0.33	LOG: CALL solverLinear in Graph for feasibility
0.00/0.33	
0.00/0.33	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.33	Strengthening transition (result): 
0.00/0.33	<l22, l22, 1 + bDomain^0 <= 0 /\ 10 <= nj^0 /\ ni^0 <= 8 /\ bExists^0 = 0, {bDomain^0 -> 0, bExists^0 -> 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}>
0.00/0.33	
0.00/0.33	LOG: CALL solverLinear in Graph for feasibility
0.00/0.33	
0.00/0.33	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.33	Strengthening transition (result): 
0.00/0.33	<l22, l22, 1 + bDomain^0 <= 0 /\ 1 <= bExists^0 /\ 10 <= nj^0 /\ ni^0 <= 8, {bDomain^0 -> 1, bExists^0 -> 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}>
0.00/0.33	
0.00/0.33	LOG: CALL solverLinear in Graph for feasibility
0.00/0.33	
0.00/0.33	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.33	Strengthening transition (result): 
0.00/0.33	<l22, l22, nj^0 <= 9 /\ bExists^0 = 0, {bExists^0 -> 0, nj^0 -> 1 + nj^0, rest remain the same}>
0.00/0.33	
0.00/0.33	LOG: CALL solverLinear in Graph for feasibility
0.00/0.33	
0.00/0.33	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.33	Strengthening transition (result): 
0.00/0.33	<l22, l22, nj^0 <= 9 /\ bExists^0 = 0, {bExists^0 -> 1, nj^0 -> 1 + nj^0, rest remain the same}>
0.00/0.33	
0.00/0.33	LOG: CALL solverLinear in Graph for feasibility
0.00/0.33	
0.00/0.33	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.33	Strengthening transition (result): 
0.00/0.33	<l22, l22, nj^0 <= 9 /\ bExists^0 = 0, {bExists^0 -> 0, nj^0 -> 1 + nj^0, rest remain the same}>
0.00/0.33	
0.00/0.33	LOG: CALL solverLinear in Graph for feasibility
0.00/0.33	
0.00/0.33	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.33	Strengthening transition (result): 
0.00/0.33	<l22, l22, 1 <= bExists^0 /\ nj^0 <= 9, {bExists^0 -> 1, nj^0 -> 1 + nj^0, rest remain the same}>
0.00/0.33	
0.00/0.33	LOG: CALL solverLinear in Graph for feasibility
0.00/0.33	
0.00/0.33	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.33	It's unfeasible. Removing transition: 
0.00/0.33	<l22, l22, 1 + bExists^0 <= 0 /\ nj^0 <= 9, {bExists^0 -> 1, nj^0 -> 1 + nj^0, rest remain the same}>
0.00/0.33	Checking unfeasibility...
0.00/0.33	Time used: 0.094474
0.00/0.33	
0.00/0.33	Checking conditional termination of SCC {l22}...
0.00/0.33	
0.00/0.33	LOG: CALL solveLinear
0.00/0.33	
0.00/0.33	LOG: RETURN solveLinear - Elapsed time: 0.011346s
0.00/0.33	Ranking function: 8 - ni^0
0.00/0.33	New Graphs: 
0.00/0.33	Transitions:
0.00/0.33	<l22, l22, nj^0 <= 9 /\ bExists^0 = 0, {bExists^0 -> 0, nj^0 -> 1 + nj^0, rest remain the same}>
0.00/0.33	<l22, l22, nj^0 <= 9 /\ bExists^0 = 0, {bExists^0 -> 1, nj^0 -> 1 + nj^0, rest remain the same}>
0.00/0.33	<l22, l22, nj^0 <= 9 /\ bExists^0 = 0, {bExists^0 -> 0, nj^0 -> 1 + nj^0, rest remain the same}>
0.00/0.33	<l22, l22, 1 <= bExists^0 /\ nj^0 <= 9, {bExists^0 -> 1, nj^0 -> 1 + nj^0, rest remain the same}>
0.00/0.33	Variables:
0.00/0.33	bExists^0, nj^0
0.00/0.33	Checking conditional termination of SCC {l22}...
0.00/0.33	
0.00/0.33	LOG: CALL solveLinear
0.00/0.33	
0.00/0.33	LOG: RETURN solveLinear - Elapsed time: 0.001958s
0.00/0.33	Ranking function: 9 - nj^0
0.00/0.33	New Graphs: 
0.00/0.33	Proving termination of subgraph 3
0.00/0.33	Checking unfeasibility...
0.00/0.33	Time used: 0.010763
0.00/0.33	
0.00/0.33	Checking conditional termination of SCC {l7}...
0.00/0.33	
0.00/0.33	LOG: CALL solveLinear
0.00/0.33	
0.00/0.33	LOG: RETURN solveLinear - Elapsed time: 0.002877s
0.00/0.33	Ranking function: 8 - ni^0
0.00/0.33	New Graphs: 
0.00/0.33	Proving termination of subgraph 4
0.00/0.33	Analyzing SCC {l2}...
0.00/0.33	No cycles found.
0.00/0.33	
0.00/0.33	Program Terminates
0.00/0.33	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.00/0.33	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.00/0.33	EOF