4.48/4.50	YES
4.48/4.50	
4.48/4.51	Solver Timeout: 4
4.48/4.51	Global Timeout: 300
4.48/4.51	No parsing errors!
4.48/4.51	Init Location: 0
4.48/4.51	Transitions:
4.48/4.51	<l0, l30, true>
4.48/4.51	<l1, l2, true>
4.48/4.51	<l3, l4, ((1 + n8^0) <= (0 + j10^0)), par{i9^0 -> (~(1) + i9^0)}>
4.48/4.51	<l3, l5, ((0 + j10^0) <= (0 + n8^0)) /\ (undef44 = undef44), par{j10^0 -> (1 + j10^0), w12^0 -> undef44}>
4.48/4.51	<l6, l7, ((1 + i9^0) <= 0) /\ (undef58 = 0), par{chkerr^0 -> (0 + undef58), ret_ludcmp14^0 -> undef58}>
4.48/4.51	<l6, l5, (0 <= (0 + i9^0)) /\ (undef74 = undef74), par{j10^0 -> (1 + i9^0), w12^0 -> undef74}>
4.48/4.51	<l8, l9, true>
4.48/4.51	<l10, l11, ((0 + i9^0) <= (0 + j10^0)), par{i9^0 -> (1 + i9^0)}>
4.48/4.51	<l10, l12, ((1 + j10^0) <= (0 + i9^0)) /\ (undef119 = undef119), par{j10^0 -> (1 + j10^0), w12^0 -> undef119}>
4.48/4.51	<l13, l14, true>
4.48/4.51	<l15, l4, ((1 + n8^0) <= (0 + i9^0)), par{i9^0 -> (~(1) + n8^0)}>
4.48/4.51	<l15, l12, ((0 + i9^0) <= (0 + n8^0)) /\ (undef164 = undef164), par{j10^0 -> 0, w12^0 -> undef164}>
4.48/4.51	<l16, l17, true>
4.48/4.51	<l17, l13, ((1 + i9^0) <= (0 + k11^0)), par{j10^0 -> (1 + j10^0)}>
4.48/4.51	<l17, l16, ((0 + k11^0) <= (0 + i9^0)) /\ (undef209 = undef209), par{k11^0 -> (1 + k11^0), w12^0 -> undef209}>
4.48/4.51	<l14, l18, ((1 + n8^0) <= (0 + j10^0)), par{i9^0 -> (1 + i9^0)}>
4.48/4.51	<l14, l16, ((0 + j10^0) <= (0 + n8^0)) /\ (undef239 = undef239), par{k11^0 -> 0, w12^0 -> undef239}>
4.48/4.51	<l11, l15, true>
4.48/4.51	<l19, l1, true, par{j10^0 -> (1 + j10^0)}>
4.48/4.51	<l9, l19, ((0 + i9^0) <= (0 + k11^0))>
4.48/4.51	<l9, l8, ((1 + k11^0) <= (0 + i9^0)) /\ (undef299 = undef299), par{k11^0 -> (1 + k11^0), w12^0 -> undef299}>
4.48/4.51	<l20, l8, true, par{k11^0 -> 0}>
4.48/4.51	<l12, l10, true>
4.48/4.51	<l21, l19, ((0 + i9^0) <= 0) /\ (0 <= (0 + i9^0))>
4.48/4.51	<l21, l20, (1 <= (0 + i9^0))>
4.48/4.51	<l21, l20, ((1 + i9^0) <= 0)>
4.48/4.51	<l2, l13, ((1 + n8^0) <= (0 + j10^0)), par{j10^0 -> (1 + i9^0)}>
4.48/4.51	<l2, l21, ((0 + j10^0) <= (0 + n8^0)) /\ (undef404 = undef404), par{w12^0 -> undef404}>
4.48/4.51	<l22, l11, ((0 + n8^0) <= (0 + i9^0)), par{i9^0 -> 1}>
4.48/4.51	<l22, l1, ((1 + i9^0) <= (0 + n8^0)), par{j10^0 -> (1 + i9^0)}>
4.48/4.51	<l4, l6, true>
4.48/4.51	<l23, l24, (undef465 = undef465), par{j^0 -> (1 + j^0), w^0 -> undef465}>
4.48/4.51	<l25, l23, ((1 + j^0) <= (0 + i^0))>
4.48/4.51	<l25, l23, ((1 + i^0) <= (0 + j^0))>
4.48/4.51	<l25, l23, ((0 + i^0) <= (0 + j^0)) /\ ((0 + j^0) <= (0 + i^0))>
4.48/4.51	<l5, l3, true>
4.48/4.51	<l26, l27, ((1 + n^0) <= (0 + j^0)), par{i^0 -> (1 + i^0)}>
4.48/4.51	<l26, l25, ((0 + j^0) <= (0 + n^0))>
4.48/4.51	<l28, l18, ((1 + n^0) <= (0 + i^0)), par{i9^0 -> 0, n8^0 -> (0 + n^0), nmax7^0 -> (0 + nmax^0)}>
4.48/4.51	<l28, l24, ((0 + i^0) <= (0 + n^0)), par{j^0 -> 0, w^0 -> 0}>
4.48/4.51	<l27, l28, true>
4.48/4.51	<l24, l26, true>
4.48/4.51	<l18, l22, true>
4.48/4.51	<l29, l27, true, par{i^0 -> 0, n^0 -> (0 + __const_5^0), nmax^0 -> (0 + __const_50^0)}>
4.48/4.51	<l30, l29, true>
4.48/4.51	
4.48/4.51	Fresh variables:
4.48/4.51	undef44, undef58, undef74, undef119, undef164, undef209, undef239, undef299, undef404, undef465, 
4.48/4.51	
4.48/4.51	Undef variables:
4.48/4.51	undef44, undef58, undef74, undef119, undef164, undef209, undef239, undef299, undef404, undef465, 
4.48/4.51	
4.48/4.51	Abstraction variables:
4.48/4.51	
4.48/4.51	Exit nodes:
4.48/4.51	
4.48/4.51	Accepting locations:
4.48/4.51	
4.48/4.51	Asserts:
4.48/4.51	
4.48/4.51	Preprocessed LLVMGraph
4.48/4.51	Init Location: 0
4.48/4.51	Transitions:
4.48/4.51	<l0, l7, (i^0 = 0) /\ (n^0 = (0 + n^0)) /\ (nmax^0 = (0 + nmax^0)) /\ ((1 + (0 + n^0)) <= (0 + 0)) /\ ((0 + (0 + (0 + n^0))) <= (0 + 0)) /\ ((1 + (0 + (0 + n^0))) <= (0 + 1)) /\ ((1 + (~(1) + (0 + (0 + n^0)))) <= 0) /\ (undef58 = 0), par{i9^0 -> (~(1) + (0 + (0 + n^0))), n8^0 -> (0 + (0 + n^0))}>
4.48/4.51	<l0, l24, (i^0 = 0) /\ (n^0 = (0 + n^0)) /\ (nmax^0 = (0 + nmax^0)) /\ ((0 + 0) <= (0 + (0 + n^0))), par{j^0 -> 0}>
4.48/4.51	<l1, l7, ((1 + n8^0) <= (0 + j10^0)) /\ ((1 + n8^0) <= (0 + (1 + i9^0))) /\ ((0 + n8^0) <= (0 + (1 + i9^0))) /\ ((1 + n8^0) <= (0 + 1)) /\ ((1 + (~(1) + n8^0)) <= 0) /\ (undef58 = 0), par{i9^0 -> (~(1) + n8^0), j10^0 -> (1 + i9^0)}>
4.48/4.51	<l1, l12, ((1 + n8^0) <= (0 + j10^0)) /\ ((1 + n8^0) <= (0 + (1 + i9^0))) /\ ((0 + n8^0) <= (0 + (1 + i9^0))) /\ ((0 + 1) <= (0 + n8^0)) /\ (undef164 = undef164), par{i9^0 -> 1, j10^0 -> 0}>
4.48/4.51	<l1, l16, ((1 + n8^0) <= (0 + j10^0)) /\ ((0 + (1 + i9^0)) <= (0 + n8^0)) /\ (undef239 = undef239), par{j10^0 -> (1 + i9^0), k11^0 -> 0}>
4.48/4.51	<l1, l1, ((0 + j10^0) <= (0 + n8^0)) /\ (undef404 = undef404) /\ ((0 + i9^0) <= 0) /\ (0 <= (0 + i9^0)), par{j10^0 -> (1 + j10^0)}>
4.48/4.51	<l1, l8, ((0 + j10^0) <= (0 + n8^0)) /\ (undef404 = undef404) /\ (1 <= (0 + i9^0)), par{k11^0 -> 0}>
4.48/4.51	<l1, l8, ((0 + j10^0) <= (0 + n8^0)) /\ (undef404 = undef404) /\ ((1 + i9^0) <= 0), par{k11^0 -> 0}>
4.48/4.51	<l5, l7, ((1 + n8^0) <= (0 + j10^0)) /\ ((1 + (~(1) + i9^0)) <= 0) /\ (undef58 = 0), par{i9^0 -> (~(1) + i9^0)}>
4.48/4.51	<l5, l5, ((1 + n8^0) <= (0 + j10^0)) /\ (0 <= (0 + (~(1) + i9^0))) /\ (undef74 = undef74), par{i9^0 -> (~(1) + i9^0), j10^0 -> (1 + (~(1) + i9^0))}>
4.48/4.51	<l5, l5, ((0 + j10^0) <= (0 + n8^0)) /\ (undef44 = undef44), par{j10^0 -> (1 + j10^0)}>
4.48/4.51	<l8, l1, ((0 + i9^0) <= (0 + k11^0)), par{j10^0 -> (1 + j10^0)}>
4.48/4.51	<l8, l8, ((1 + k11^0) <= (0 + i9^0)) /\ (undef299 = undef299), par{k11^0 -> (1 + k11^0)}>
4.48/4.51	<l12, l7, ((0 + i9^0) <= (0 + j10^0)) /\ ((1 + n8^0) <= (0 + (1 + i9^0))) /\ ((1 + (~(1) + n8^0)) <= 0) /\ (undef58 = 0), par{i9^0 -> (~(1) + n8^0)}>
4.48/4.51	<l12, l5, ((0 + i9^0) <= (0 + j10^0)) /\ ((1 + n8^0) <= (0 + (1 + i9^0))) /\ (0 <= (0 + (~(1) + n8^0))) /\ (undef74 = undef74), par{i9^0 -> (~(1) + n8^0), j10^0 -> (1 + (~(1) + n8^0))}>
4.48/4.51	<l12, l12, ((0 + i9^0) <= (0 + j10^0)) /\ ((0 + (1 + i9^0)) <= (0 + n8^0)) /\ (undef164 = undef164), par{i9^0 -> (1 + i9^0), j10^0 -> 0}>
4.48/4.51	<l12, l12, ((1 + j10^0) <= (0 + i9^0)) /\ (undef119 = undef119), par{j10^0 -> (1 + j10^0)}>
4.48/4.51	<l16, l7, ((1 + i9^0) <= (0 + k11^0)) /\ ((1 + n8^0) <= (0 + (1 + j10^0))) /\ ((0 + n8^0) <= (0 + (1 + i9^0))) /\ ((1 + n8^0) <= (0 + 1)) /\ ((1 + (~(1) + n8^0)) <= 0) /\ (undef58 = 0), par{i9^0 -> (~(1) + n8^0), j10^0 -> (1 + j10^0)}>
4.48/4.51	<l16, l12, ((1 + i9^0) <= (0 + k11^0)) /\ ((1 + n8^0) <= (0 + (1 + j10^0))) /\ ((0 + n8^0) <= (0 + (1 + i9^0))) /\ ((0 + 1) <= (0 + n8^0)) /\ (undef164 = undef164), par{i9^0 -> 1, j10^0 -> 0}>
4.48/4.51	<l16, l1, ((1 + i9^0) <= (0 + k11^0)) /\ ((1 + n8^0) <= (0 + (1 + j10^0))) /\ ((1 + (1 + i9^0)) <= (0 + n8^0)), par{i9^0 -> (1 + i9^0), j10^0 -> (1 + (1 + i9^0))}>
4.48/4.51	<l16, l16, ((1 + i9^0) <= (0 + k11^0)) /\ ((0 + (1 + j10^0)) <= (0 + n8^0)) /\ (undef239 = undef239), par{j10^0 -> (1 + j10^0), k11^0 -> 0}>
4.48/4.51	<l16, l16, ((0 + k11^0) <= (0 + i9^0)) /\ (undef209 = undef209), par{k11^0 -> (1 + k11^0)}>
4.48/4.51	<l24, l7, ((1 + n^0) <= (0 + j^0)) /\ ((1 + n^0) <= (0 + (1 + i^0))) /\ ((0 + (0 + n^0)) <= (0 + 0)) /\ ((1 + (0 + n^0)) <= (0 + 1)) /\ ((1 + (~(1) + (0 + n^0))) <= 0) /\ (undef58 = 0), par{i9^0 -> (~(1) + (0 + n^0)), i^0 -> (1 + i^0), n8^0 -> (0 + n^0)}>
4.48/4.51	<l24, l1, ((1 + n^0) <= (0 + j^0)) /\ ((1 + n^0) <= (0 + (1 + i^0))) /\ ((1 + 0) <= (0 + (0 + n^0))), par{i9^0 -> 0, i^0 -> (1 + i^0), j10^0 -> (1 + 0), n8^0 -> (0 + n^0)}>
4.48/4.51	<l24, l24, ((1 + n^0) <= (0 + j^0)) /\ ((0 + (1 + i^0)) <= (0 + n^0)), par{i^0 -> (1 + i^0), j^0 -> 0}>
4.48/4.51	<l24, l24, ((0 + j^0) <= (0 + n^0)) /\ ((1 + j^0) <= (0 + i^0)) /\ (undef465 = undef465), par{j^0 -> (1 + j^0)}>
4.48/4.51	<l24, l24, ((0 + j^0) <= (0 + n^0)) /\ ((1 + i^0) <= (0 + j^0)) /\ (undef465 = undef465), par{j^0 -> (1 + j^0)}>
4.48/4.51	<l24, l24, ((0 + j^0) <= (0 + n^0)) /\ ((0 + i^0) <= (0 + j^0)) /\ ((0 + j^0) <= (0 + i^0)) /\ (undef465 = undef465), par{j^0 -> (1 + j^0)}>
4.48/4.51	
4.48/4.51	Fresh variables:
4.48/4.51	undef44, undef58, undef74, undef119, undef164, undef209, undef239, undef299, undef404, undef465, 
4.48/4.51	
4.48/4.51	Undef variables:
4.48/4.51	undef44, undef58, undef74, undef119, undef164, undef209, undef239, undef299, undef404, undef465, 
4.48/4.51	
4.48/4.51	Abstraction variables:
4.48/4.51	
4.48/4.51	Exit nodes:
4.48/4.51	
4.48/4.51	Accepting locations:
4.48/4.51	
4.48/4.51	Asserts:
4.48/4.51	
4.48/4.51	*************************************************************
4.48/4.51	*******************************************************************************************
4.48/4.51	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
4.48/4.51	*******************************************************************************************
4.48/4.51	
4.48/4.51	Init Location: 0
4.48/4.51	Graph 0:
4.48/4.51	Transitions:
4.48/4.51	Variables:
4.48/4.51	
4.48/4.51	Graph 1:
4.48/4.51	Transitions:
4.48/4.51	<l24, l24, 1 + i^0 <= n^0 /\ 1 + n^0 <= j^0, {i^0 -> 1 + i^0, j^0 -> 0, rest remain the same}>
4.48/4.51	<l24, l24, 1 + j^0 <= i^0 /\ j^0 <= n^0, {j^0 -> 1 + j^0, rest remain the same}>
4.48/4.51	<l24, l24, 1 + i^0 <= j^0 /\ j^0 <= n^0, {j^0 -> 1 + j^0, rest remain the same}>
4.48/4.51	<l24, l24, j^0 <= n^0 /\ i^0 = j^0, {j^0 -> 1 + j^0, rest remain the same}>
4.48/4.51	Variables:
4.48/4.51	i^0, j^0, n^0
4.48/4.51	
4.48/4.51	Graph 2:
4.48/4.51	Transitions:
4.48/4.51	<l1, l16, 1 + i9^0 <= n8^0 /\ 1 + n8^0 <= j10^0, {j10^0 -> 1 + i9^0, k11^0 -> 0, rest remain the same}>
4.48/4.51	<l1, l1, j10^0 <= n8^0 /\ i9^0 = 0, {j10^0 -> 1 + j10^0, rest remain the same}>
4.48/4.51	<l1, l8, 1 <= i9^0 /\ j10^0 <= n8^0, {k11^0 -> 0, rest remain the same}>
4.48/4.51	<l1, l8, 1 + i9^0 <= 0 /\ j10^0 <= n8^0, {k11^0 -> 0, rest remain the same}>
4.48/4.51	<l8, l1, i9^0 <= k11^0, {j10^0 -> 1 + j10^0, rest remain the same}>
4.48/4.51	<l8, l8, 1 + k11^0 <= i9^0, {k11^0 -> 1 + k11^0, rest remain the same}>
4.48/4.51	<l16, l1, 1 + i9^0 <= k11^0 /\ n8^0 <= j10^0 /\ 2 + i9^0 <= n8^0, {i9^0 -> 1 + i9^0, j10^0 -> 2 + i9^0, rest remain the same}>
4.48/4.51	<l16, l16, 1 + i9^0 <= k11^0 /\ 1 + j10^0 <= n8^0, {j10^0 -> 1 + j10^0, k11^0 -> 0, rest remain the same}>
4.48/4.51	<l16, l16, k11^0 <= i9^0, {k11^0 -> 1 + k11^0, rest remain the same}>
4.48/4.51	Variables:
4.48/4.51	i9^0, j10^0, n8^0, k11^0
4.48/4.51	
4.48/4.51	Graph 3:
4.48/4.51	Transitions:
4.48/4.51	<l12, l12, 1 + i9^0 <= n8^0 /\ i9^0 <= j10^0, {i9^0 -> 1 + i9^0, j10^0 -> 0, rest remain the same}>
4.48/4.51	<l12, l12, 1 + j10^0 <= i9^0, {j10^0 -> 1 + j10^0, rest remain the same}>
4.48/4.51	Variables:
4.48/4.51	i9^0, j10^0, n8^0
4.48/4.51	
4.48/4.51	Graph 4:
4.48/4.51	Transitions:
4.48/4.51	<l5, l5, 1 <= i9^0 /\ 1 + n8^0 <= j10^0, {i9^0 -> -1 + i9^0, j10^0 -> i9^0, rest remain the same}>
4.48/4.51	<l5, l5, j10^0 <= n8^0, {j10^0 -> 1 + j10^0, rest remain the same}>
4.48/4.51	Variables:
4.48/4.51	i9^0, j10^0, n8^0
4.48/4.51	
4.48/4.51	Graph 5:
4.48/4.51	Transitions:
4.48/4.51	Variables:
4.48/4.51	
4.48/4.51	Precedence: 
4.48/4.51	Graph 0
4.48/4.51	
4.48/4.51	Graph 1
4.48/4.51	<l0, l24, 0 <= n^0 /\ i^0 = 0, {j^0 -> 0, rest remain the same}>
4.48/4.51	
4.48/4.51	Graph 2
4.48/4.51	<l24, l1, 1 + n^0 <= j^0 /\ 1 <= n^0 /\ n^0 <= i^0, {i9^0 -> 0, i^0 -> 1 + i^0, j10^0 -> 1, n8^0 -> n^0, rest remain the same}>
4.48/4.51	
4.48/4.51	Graph 3
4.48/4.51	<l1, l12, 1 + n8^0 <= j10^0 /\ 1 <= n8^0 /\ n8^0 <= i9^0, {i9^0 -> 1, j10^0 -> 0, rest remain the same}>
4.48/4.51	<l16, l12, 1 + i9^0 <= k11^0 /\ 1 <= n8^0 /\ n8^0 <= j10^0 /\ n8^0 <= 1 + i9^0, {i9^0 -> 1, j10^0 -> 0, rest remain the same}>
4.48/4.51	
4.48/4.51	Graph 4
4.48/4.51	<l12, l5, 1 <= n8^0 /\ i9^0 <= j10^0 /\ n8^0 <= i9^0, {i9^0 -> -1 + n8^0, j10^0 -> n8^0, rest remain the same}>
4.48/4.51	
4.48/4.51	Graph 5
4.48/4.51	<l0, l7, 1 + n^0 <= 0 /\ i^0 = 0 /\ undef58 = 0, {i9^0 -> -1 + n^0, n8^0 -> n^0, rest remain the same}>
4.48/4.51	<l1, l7, 1 + n8^0 <= j10^0 /\ n8^0 <= i9^0 /\ n8^0 <= 0 /\ undef58 = 0, {i9^0 -> -1 + n8^0, j10^0 -> 1 + i9^0, rest remain the same}>
4.48/4.51	<l5, l7, 1 + n8^0 <= j10^0 /\ i9^0 <= 0 /\ undef58 = 0, {i9^0 -> -1 + i9^0, rest remain the same}>
4.48/4.51	<l12, l7, i9^0 <= j10^0 /\ n8^0 <= i9^0 /\ n8^0 <= 0 /\ undef58 = 0, {i9^0 -> -1 + n8^0, rest remain the same}>
4.48/4.51	<l16, l7, 1 + i9^0 <= k11^0 /\ n8^0 <= j10^0 /\ n8^0 <= 0 /\ n8^0 <= 1 + i9^0 /\ undef58 = 0, {i9^0 -> -1 + n8^0, j10^0 -> 1 + j10^0, rest remain the same}>
4.48/4.51	<l24, l7, 1 + n^0 <= j^0 /\ n^0 <= i^0 /\ n^0 <= 0 /\ undef58 = 0, {i9^0 -> -1 + n^0, i^0 -> 1 + i^0, n8^0 -> n^0, rest remain the same}>
4.48/4.51	
4.48/4.51	Map Locations to Subgraph:
4.48/4.51	( 0 , 0 )
4.48/4.51	( 1 , 2 )
4.48/4.51	( 5 , 4 )
4.48/4.51	( 7 , 5 )
4.48/4.51	( 8 , 2 )
4.48/4.51	( 12 , 3 )
4.48/4.51	( 16 , 2 )
4.48/4.51	( 24 , 1 )
4.48/4.51	
4.48/4.51	*******************************************************************************************
4.48/4.51	********************************    CHECKING ASSERTIONS    ********************************
4.48/4.51	*******************************************************************************************
4.48/4.51	
4.48/4.51	Proving termination of subgraph 0
4.48/4.51	Proving termination of subgraph 1
4.48/4.51	Checking unfeasibility...
4.48/4.51	Time used: 0.011932
4.48/4.51	
4.48/4.51	Checking conditional termination of SCC {l24}...
4.48/4.51	
4.48/4.51	LOG: CALL solveLinear
4.48/4.51	
4.48/4.51	LOG: RETURN solveLinear - Elapsed time: 0.002729s
4.48/4.51	Ranking function: -1 - 2*i^0 + 2*n^0
4.48/4.51	New Graphs: 
4.48/4.51	Transitions:
4.48/4.51	<l24, l24, 1 + j^0 <= i^0 /\ j^0 <= n^0, {j^0 -> 1 + j^0, rest remain the same}>
4.48/4.51	<l24, l24, 1 + i^0 <= j^0 /\ j^0 <= n^0, {j^0 -> 1 + j^0, rest remain the same}>
4.48/4.51	<l24, l24, j^0 <= n^0 /\ i^0 = j^0, {j^0 -> 1 + j^0, rest remain the same}>
4.48/4.51	Variables:
4.48/4.51	i^0, j^0, n^0
4.48/4.51	Checking conditional termination of SCC {l24}...
4.48/4.51	
4.48/4.51	LOG: CALL solveLinear
4.48/4.51	
4.48/4.51	LOG: RETURN solveLinear - Elapsed time: 0.001923s
4.48/4.51	Ranking function: -1 - i^0 - j^0 + 2*n^0
4.48/4.51	New Graphs: 
4.48/4.51	Transitions:
4.48/4.51	<l24, l24, 1 + j^0 <= i^0 /\ j^0 <= n^0, {j^0 -> 1 + j^0, rest remain the same}>
4.48/4.51	<l24, l24, j^0 <= n^0 /\ i^0 = j^0, {j^0 -> 1 + j^0, rest remain the same}>
4.48/4.51	Variables:
4.48/4.51	i^0, j^0, n^0
4.48/4.51	Checking conditional termination of SCC {l24}...
4.48/4.51	
4.48/4.51	LOG: CALL solveLinear
4.48/4.51	
4.48/4.51	LOG: RETURN solveLinear - Elapsed time: 0.001532s
4.48/4.51	Ranking function: -1 + i^0 - j^0
4.48/4.51	New Graphs: 
4.48/4.51	Transitions:
4.48/4.51	<l24, l24, j^0 <= n^0 /\ i^0 = j^0, {j^0 -> 1 + j^0, rest remain the same}>
4.48/4.51	Variables:
4.48/4.51	i^0, j^0, n^0
4.48/4.51	Checking conditional termination of SCC {l24}...
4.48/4.51	
4.48/4.51	LOG: CALL solveLinear
4.48/4.51	
4.48/4.51	LOG: RETURN solveLinear - Elapsed time: 0.001217s
4.48/4.51	Ranking function: i^0 - j^0
4.48/4.51	New Graphs: 
4.48/4.51	Proving termination of subgraph 2
4.48/4.51	Checking unfeasibility...
4.48/4.51	Time used: 0.119255
4.48/4.51	Some transition disabled by a set of invariant(s):
4.48/4.51	Invariant at l1: 0 <= i9^0
4.48/4.51	Invariant at l8: 1 <= i9^0
4.48/4.51	Invariant at l16: 0 <= i9^0
4.48/4.51	
4.48/4.51	Strengthening and disabling transitions...
4.48/4.51	> It's unfeasible. Removing transition: 
4.48/4.51	<l1, l8, 1 + i9^0 <= 0 /\ j10^0 <= n8^0, {k11^0 -> 0, rest remain the same}>
4.48/4.51	
4.48/4.51	LOG: CALL solverLinear in Graph for feasibility
4.48/4.51	
4.48/4.51	LOG: RETURN solveLinear in Graph for feasibility
4.48/4.51	Strengthening transition (result): 
4.48/4.51	<l1, l16, 1 + i9^0 <= n8^0 /\ 1 + n8^0 <= j10^0 /\ 0 <= i9^0, {j10^0 -> 1 + i9^0, k11^0 -> 0, rest remain the same}>
4.48/4.51	
4.48/4.51	LOG: CALL solverLinear in Graph for feasibility
4.48/4.51	
4.48/4.51	LOG: RETURN solveLinear in Graph for feasibility
4.48/4.51	Strengthening transition (result): 
4.48/4.51	<l1, l1, j10^0 <= n8^0 /\ i9^0 = 0, {j10^0 -> 1 + j10^0, rest remain the same}>
4.48/4.51	
4.48/4.51	LOG: CALL solverLinear in Graph for feasibility
4.48/4.51	
4.48/4.51	LOG: RETURN solveLinear in Graph for feasibility
4.48/4.51	Strengthening transition (result): 
4.48/4.51	<l1, l8, 1 <= i9^0 /\ j10^0 <= n8^0, {k11^0 -> 0, rest remain the same}>
4.48/4.51	
4.48/4.51	LOG: CALL solverLinear in Graph for feasibility
4.48/4.51	
4.48/4.51	LOG: RETURN solveLinear in Graph for feasibility
4.48/4.51	Strengthening transition (result): 
4.48/4.51	<l8, l1, 1 <= i9^0 /\ i9^0 <= k11^0, {j10^0 -> 1 + j10^0, rest remain the same}>
4.48/4.51	
4.48/4.51	LOG: CALL solverLinear in Graph for feasibility
4.48/4.51	
4.48/4.51	LOG: RETURN solveLinear in Graph for feasibility
4.48/4.51	Strengthening transition (result): 
4.48/4.51	<l8, l8, 1 <= i9^0 /\ 1 + k11^0 <= i9^0, {k11^0 -> 1 + k11^0, rest remain the same}>
4.48/4.51	
4.48/4.51	LOG: CALL solverLinear in Graph for feasibility
4.48/4.51	
4.48/4.51	LOG: RETURN solveLinear in Graph for feasibility
4.48/4.51	Strengthening transition (result): 
4.48/4.51	<l16, l1, 1 + i9^0 <= k11^0 /\ 0 <= i9^0 /\ n8^0 <= j10^0 /\ 2 + i9^0 <= n8^0, {i9^0 -> 1 + i9^0, j10^0 -> 2 + i9^0, rest remain the same}>
4.48/4.51	
4.48/4.51	LOG: CALL solverLinear in Graph for feasibility
4.48/4.51	
4.48/4.51	LOG: RETURN solveLinear in Graph for feasibility
4.48/4.51	Strengthening transition (result): 
4.48/4.51	<l16, l16, 1 + i9^0 <= k11^0 /\ 1 + j10^0 <= n8^0 /\ 0 <= i9^0, {j10^0 -> 1 + j10^0, k11^0 -> 0, rest remain the same}>
4.48/4.51	
4.48/4.51	LOG: CALL solverLinear in Graph for feasibility
4.48/4.51	
4.48/4.51	LOG: RETURN solveLinear in Graph for feasibility
4.48/4.51	Strengthening transition (result): 
4.48/4.51	<l16, l16, 0 <= i9^0 /\ k11^0 <= i9^0, {k11^0 -> 1 + k11^0, rest remain the same}>
4.48/4.51	Checking unfeasibility...
4.48/4.51	Time used: 3.89757
4.48/4.51	
4.48/4.51	Checking conditional termination of SCC {l1, l8, l16}...
4.48/4.51	
4.48/4.51	LOG: CALL solveLinear
4.48/4.51	
4.48/4.51	LOG: RETURN solveLinear - Elapsed time: 0.013067s
4.48/4.51	Ranking function: -6 - 3*i9^0 + 3*n8^0
4.48/4.51	New Graphs: 
4.48/4.51	Transitions:
4.48/4.51	<l1, l1, j10^0 <= n8^0 /\ i9^0 = 0, {j10^0 -> 1 + j10^0, rest remain the same}>
4.48/4.51	<l1, l8, 1 <= i9^0 /\ j10^0 <= n8^0, {k11^0 -> 0, rest remain the same}>
4.48/4.51	<l8, l1, 1 <= i9^0 /\ i9^0 <= k11^0, {j10^0 -> 1 + j10^0, rest remain the same}>
4.48/4.51	<l8, l8, 1 <= i9^0 /\ 1 + k11^0 <= i9^0, {k11^0 -> 1 + k11^0, rest remain the same}>
4.48/4.51	Variables:
4.48/4.51	i9^0, j10^0, k11^0, n8^0
4.48/4.51	Transitions:
4.48/4.51	<l16, l16, 1 + i9^0 <= k11^0 /\ 1 + j10^0 <= n8^0 /\ 0 <= i9^0, {j10^0 -> 1 + j10^0, k11^0 -> 0, rest remain the same}>
4.48/4.51	<l16, l16, 0 <= i9^0 /\ k11^0 <= i9^0, {k11^0 -> 1 + k11^0, rest remain the same}>
4.48/4.51	Variables:
4.48/4.51	i9^0, j10^0, k11^0, n8^0
4.48/4.51	Checking conditional termination of SCC {l1, l8}...
4.48/4.51	
4.48/4.51	LOG: CALL solveLinear
4.48/4.51	
4.48/4.51	LOG: RETURN solveLinear - Elapsed time: 0.003347s
4.48/4.51	Ranking function: -3*i9^0 - j10^0 + n8^0
4.48/4.51	New Graphs: 
4.48/4.51	Transitions:
4.48/4.51	<l16, l16, 1 + i9^0 <= k11^0 /\ 1 + j10^0 <= n8^0 /\ 0 <= i9^0, {j10^0 -> 1 + j10^0, k11^0 -> 0, rest remain the same}>
4.48/4.51	<l16, l16, 0 <= i9^0 /\ k11^0 <= i9^0, {k11^0 -> 1 + k11^0, rest remain the same}>
4.48/4.51	Variables:
4.48/4.51	i9^0, j10^0, k11^0, n8^0
4.48/4.51	Transitions:
4.48/4.51	<l1, l8, 1 <= i9^0 /\ j10^0 <= n8^0, {k11^0 -> 0, rest remain the same}>
4.48/4.51	<l8, l1, 1 <= i9^0 /\ i9^0 <= k11^0, {j10^0 -> 1 + j10^0, rest remain the same}>
4.48/4.51	<l8, l8, 1 <= i9^0 /\ 1 + k11^0 <= i9^0, {k11^0 -> 1 + k11^0, rest remain the same}>
4.48/4.51	Variables:
4.48/4.51	i9^0, j10^0, k11^0, n8^0
4.48/4.51	Checking conditional termination of SCC {l16}...
4.48/4.51	
4.48/4.51	LOG: CALL solveLinear
4.48/4.51	
4.48/4.51	LOG: RETURN solveLinear - Elapsed time: 0.001780s
4.48/4.51	Ranking function: -j10^0 + n8^0
4.48/4.51	New Graphs: 
4.48/4.51	Transitions:
4.48/4.51	<l1, l8, 1 <= i9^0 /\ j10^0 <= n8^0, {k11^0 -> 0, rest remain the same}>
4.48/4.51	<l8, l1, 1 <= i9^0 /\ i9^0 <= k11^0, {j10^0 -> 1 + j10^0, rest remain the same}>
4.48/4.51	<l8, l8, 1 <= i9^0 /\ 1 + k11^0 <= i9^0, {k11^0 -> 1 + k11^0, rest remain the same}>
4.48/4.51	Variables:
4.48/4.51	i9^0, j10^0, k11^0, n8^0
4.48/4.51	Transitions:
4.48/4.51	<l16, l16, 0 <= i9^0 /\ k11^0 <= i9^0, {k11^0 -> 1 + k11^0, rest remain the same}>
4.48/4.51	Variables:
4.48/4.51	i9^0, k11^0
4.48/4.51	Checking conditional termination of SCC {l1, l8}...
4.48/4.51	
4.48/4.51	LOG: CALL solveLinear
4.48/4.51	
4.48/4.51	LOG: RETURN solveLinear - Elapsed time: 0.001929s
4.48/4.51	
4.48/4.51	LOG: CALL solveLinear
4.48/4.51	
4.48/4.51	LOG: RETURN solveLinear - Elapsed time: 0.007600s
4.48/4.51	Trying to remove transition: <l8, l8, 1 <= i9^0 /\ 1 + k11^0 <= i9^0, {k11^0 -> 1 + k11^0, rest remain the same}>
4.48/4.51	Solving with 1 template(s).
4.48/4.51	
4.48/4.51	LOG: CALL solveNonLinearGetFirstSolution
4.48/4.51	
4.48/4.51	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.017585s
4.48/4.51	Time used: 0.017159
4.48/4.51	Trying to remove transition: <l8, l1, 1 <= i9^0 /\ i9^0 <= k11^0, {j10^0 -> 1 + j10^0, rest remain the same}>
4.48/4.51	Solving with 1 template(s).
4.48/4.51	
4.48/4.51	LOG: CALL solveNonLinearGetFirstSolution
4.48/4.51	
4.48/4.51	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015029s
4.48/4.51	Time used: 0.014276
4.48/4.51	Trying to remove transition: <l1, l8, 1 <= i9^0 /\ j10^0 <= n8^0, {k11^0 -> 0, rest remain the same}>
4.48/4.51	Solving with 1 template(s).
4.48/4.51	
4.48/4.51	LOG: CALL solveNonLinearGetFirstSolution
4.48/4.51	
4.48/4.51	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015270s
4.48/4.51	Time used: 0.014252
4.48/4.51	Solving with 1 template(s).
4.48/4.51	
4.48/4.51	LOG: CALL solveNonLinearGetFirstSolution
4.48/4.51	
4.48/4.51	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.189269s
4.48/4.51	Time used: 0.18769
4.48/4.51	
4.48/4.51	LOG: SAT solveNonLinear - Elapsed time: 0.189269s
4.48/4.51	Cost: 0; Total time: 0.18769
4.48/4.51	Termination implied by a set of invariant(s):
4.48/4.51	Invariant at l1: j10^0 <= 1 + n8^0
4.48/4.51	Invariant at l8: j10^0 <= n8^0
4.48/4.51	Invariant at l16: 0 <= 1 + j10^0
4.48/4.51	[ Invariant Graph ]
4.48/4.51	Strengthening and disabling transitions...
4.48/4.51	
4.48/4.51	LOG: CALL solverLinear in Graph for feasibility
4.48/4.51	
4.48/4.51	LOG: RETURN solveLinear in Graph for feasibility
4.48/4.51	Strengthening transition (result): 
4.48/4.51	<l1, l16, 1 + i9^0 <= n8^0 /\ 0 <= i9^0 /\ j10^0 = 1 + n8^0, {j10^0 -> 1 + i9^0, k11^0 -> 0, rest remain the same}>
4.48/4.51	
4.48/4.51	LOG: CALL solverLinear in Graph for feasibility
4.48/4.51	
4.48/4.51	LOG: RETURN solveLinear in Graph for feasibility
4.48/4.51	Strengthening transition (result): 
4.48/4.51	<l1, l1, j10^0 <= n8^0 /\ i9^0 = 0, {j10^0 -> 1 + j10^0, rest remain the same}>
4.48/4.51	
4.48/4.51	LOG: CALL solverLinear in Graph for feasibility
4.48/4.51	
4.48/4.51	LOG: RETURN solveLinear in Graph for feasibility
4.48/4.51	Strengthening transition (result): 
4.48/4.51	<l1, l8, 1 <= i9^0 /\ j10^0 <= n8^0, {k11^0 -> 0, rest remain the same}>
4.48/4.51	
4.48/4.51	LOG: CALL solverLinear in Graph for feasibility
4.48/4.51	
4.48/4.51	LOG: RETURN solveLinear in Graph for feasibility
4.48/4.51	Strengthening transition (result): 
4.48/4.51	<l8, l1, 1 <= i9^0 /\ i9^0 <= k11^0 /\ j10^0 <= n8^0, {j10^0 -> 1 + j10^0, rest remain the same}>
4.48/4.51	
4.48/4.51	LOG: CALL solverLinear in Graph for feasibility
4.48/4.51	
4.48/4.51	LOG: RETURN solveLinear in Graph for feasibility
4.48/4.51	Strengthening transition (result): 
4.48/4.51	<l8, l8, 1 <= i9^0 /\ 1 + k11^0 <= i9^0 /\ j10^0 <= n8^0, {k11^0 -> 1 + k11^0, rest remain the same}>
4.48/4.51	
4.48/4.51	LOG: CALL solverLinear in Graph for feasibility
4.48/4.51	
4.48/4.51	LOG: RETURN solveLinear in Graph for feasibility
4.48/4.51	Strengthening transition (result): 
4.48/4.51	<l16, l1, 1 + i9^0 <= k11^0 /\ 0 <= i9^0 /\ n8^0 <= j10^0 /\ 0 <= 1 + j10^0 /\ 2 + i9^0 <= n8^0, {i9^0 -> 1 + i9^0, j10^0 -> 2 + i9^0, rest remain the same}>
4.48/4.51	
4.48/4.51	LOG: CALL solverLinear in Graph for feasibility
4.48/4.51	
4.48/4.51	LOG: RETURN solveLinear in Graph for feasibility
4.48/4.51	Strengthening transition (result): 
4.48/4.51	<l16, l16, 1 + i9^0 <= k11^0 /\ 1 + j10^0 <= n8^0 /\ 0 <= i9^0 /\ 0 <= 1 + j10^0, {j10^0 -> 1 + j10^0, k11^0 -> 0, rest remain the same}>
4.48/4.51	
4.48/4.51	LOG: CALL solverLinear in Graph for feasibility
4.48/4.51	
4.48/4.51	LOG: RETURN solveLinear in Graph for feasibility
4.48/4.51	Strengthening transition (result): 
4.48/4.51	<l16, l16, 0 <= i9^0 /\ k11^0 <= i9^0 /\ 0 <= 1 + j10^0, {k11^0 -> 1 + k11^0, rest remain the same}>
4.48/4.51	[ Termination Graph ]
4.48/4.51	Strengthening and disabling transitions...
4.48/4.51	
4.48/4.51	LOG: CALL solverLinear in Graph for feasibility
4.48/4.51	
4.48/4.51	LOG: RETURN solveLinear in Graph for feasibility
4.48/4.51	Strengthening transition (result): 
4.48/4.51	<l1, l8, 1 <= i9^0 /\ j10^0 <= n8^0, {k11^0 -> 0, rest remain the same}>
4.48/4.51	
4.48/4.51	LOG: CALL solverLinear in Graph for feasibility
4.48/4.51	
4.48/4.51	LOG: RETURN solveLinear in Graph for feasibility
4.48/4.51	Strengthening transition (result): 
4.48/4.51	<l8, l1, 1 <= i9^0 /\ i9^0 <= k11^0 /\ j10^0 <= n8^0, {j10^0 -> 1 + j10^0, rest remain the same}>
4.48/4.51	
4.48/4.51	LOG: CALL solverLinear in Graph for feasibility
4.48/4.51	
4.48/4.51	LOG: RETURN solveLinear in Graph for feasibility
4.48/4.51	Strengthening transition (result): 
4.48/4.51	<l8, l8, 1 <= i9^0 /\ 1 + k11^0 <= i9^0 /\ j10^0 <= n8^0, {k11^0 -> 1 + k11^0, rest remain the same}>
4.48/4.51	Ranking function: -j10^0 + n8^0
4.48/4.51	New Graphs: 
4.48/4.51	Transitions:
4.48/4.51	<l16, l16, 0 <= i9^0 /\ k11^0 <= i9^0, {k11^0 -> 1 + k11^0, rest remain the same}>
4.48/4.51	Variables:
4.48/4.51	i9^0, k11^0
4.48/4.51	Transitions:
4.48/4.51	<l8, l8, 1 <= i9^0 /\ 1 + k11^0 <= i9^0 /\ j10^0 <= n8^0, {k11^0 -> 1 + k11^0, rest remain the same}>
4.48/4.51	Variables:
4.48/4.51	i9^0, j10^0, k11^0, n8^0
4.48/4.51	Checking conditional termination of SCC {l16}...
4.48/4.51	
4.48/4.51	LOG: CALL solveLinear
4.48/4.51	
4.48/4.51	LOG: RETURN solveLinear - Elapsed time: 0.001250s
4.48/4.51	Ranking function: i9^0 - k11^0
4.48/4.51	New Graphs: 
4.48/4.51	Transitions:
4.48/4.51	<l8, l8, 1 <= i9^0 /\ 1 + k11^0 <= i9^0 /\ j10^0 <= n8^0, {k11^0 -> 1 + k11^0, rest remain the same}>
4.48/4.51	Variables:
4.48/4.51	i9^0, j10^0, k11^0, n8^0
4.48/4.51	Checking conditional termination of SCC {l8}...
4.48/4.51	
4.48/4.51	LOG: CALL solveLinear
4.48/4.51	
4.48/4.51	LOG: RETURN solveLinear - Elapsed time: 0.001410s
4.48/4.51	Ranking function: -1 + i9^0 - k11^0
4.48/4.51	New Graphs: 
4.48/4.51	INVARIANTS: 
4.48/4.51	1: j10^0 <= 1 + n8^0 , 
4.48/4.51	8: j10^0 <= n8^0 , 
4.48/4.51	16: 0 <= 1 + j10^0 , 
4.48/4.51	Quasi-INVARIANTS to narrow Graph: 
4.48/4.51	1: 
4.48/4.51	8: 
4.48/4.51	16: 
4.48/4.51	Proving termination of subgraph 3
4.48/4.51	Checking unfeasibility...
4.48/4.51	Time used: 0.005901
4.48/4.51	
4.48/4.51	Checking conditional termination of SCC {l12}...
4.48/4.51	
4.48/4.51	LOG: CALL solveLinear
4.48/4.51	
4.48/4.51	LOG: RETURN solveLinear - Elapsed time: 0.002040s
4.48/4.51	Ranking function: -2*i9^0 + 2*n8^0
4.48/4.51	New Graphs: 
4.48/4.51	Transitions:
4.48/4.51	<l12, l12, 1 + j10^0 <= i9^0, {j10^0 -> 1 + j10^0, rest remain the same}>
4.48/4.51	Variables:
4.48/4.51	i9^0, j10^0
4.48/4.51	Checking conditional termination of SCC {l12}...
4.48/4.51	
4.48/4.51	LOG: CALL solveLinear
4.48/4.51	
4.48/4.51	LOG: RETURN solveLinear - Elapsed time: 0.001409s
4.48/4.51	Ranking function: -1 + i9^0 - j10^0
4.48/4.51	New Graphs: 
4.48/4.51	Proving termination of subgraph 4
4.48/4.51	Checking unfeasibility...
4.48/4.51	Time used: 0.006778
4.48/4.51	
4.48/4.51	Checking conditional termination of SCC {l5}...
4.48/4.51	
4.48/4.51	LOG: CALL solveLinear
4.48/4.51	
4.48/4.51	LOG: RETURN solveLinear - Elapsed time: 0.002140s
4.48/4.51	Ranking function: -1 + i9^0
4.48/4.51	New Graphs: 
4.48/4.51	Transitions:
4.48/4.51	<l5, l5, j10^0 <= n8^0, {j10^0 -> 1 + j10^0, rest remain the same}>
4.48/4.51	Variables:
4.48/4.51	j10^0, n8^0
4.48/4.51	Checking conditional termination of SCC {l5}...
4.48/4.51	
4.48/4.51	LOG: CALL solveLinear
4.48/4.51	
4.48/4.51	LOG: RETURN solveLinear - Elapsed time: 0.001401s
4.48/4.51	Ranking function: -j10^0 + n8^0
4.48/4.51	New Graphs: 
4.48/4.51	Proving termination of subgraph 5
4.48/4.51	Analyzing SCC {l7}...
4.48/4.51	No cycles found.
4.48/4.51	
4.48/4.51	Program Terminates
4.48/4.51	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
4.48/4.51	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
4.48/4.51	EOF